added B a2oj

Author: kothariji

A2OJ/B/Queue at the School.cpp renamed to A2OJ/B/001. Queue at the School.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{
+	int n , m,data, pd = 1;
+	cin>>n>>m;
+	lli ans = 0;
+	while(m--)
+	{
+		cin>>data;
+		if(data >= pd)
+			ans += (data-pd);
+		else
+			ans += n - abs(data-pd);
+		pd = data;
+	}
+	cout<<ans;
+	return 0;
+}

A2OJ/B/002. Xenia and Ringroad.cpp

@@ -0,0 +1,18 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{
+	int n, m , k, ans(0);
+	cin>>n>>m>>k;
+	vector <int> v1(m+1);
+	for(int i =0; i<m+1; i++)
+		cin>>v1[i];
+	for(int i =0; i<m; i++)
+		if(__builtin_popcount((v1[i]^v1[m])) <= k)
+			ans++;
+		cout<<ans;
+	return 0;
+}

A2OJ/B/003. Fedor and New Game.cpp

@@ -0,0 +1,18 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{
+	int n, m , k, ans(0);
+	cin>>n>>m>>k;
+	vector <int> v1(m+1);
+	for(int i =0; i<m+1; i++)
+		cin>>v1[i];
+	for(int i =0; i<m; i++)
+		if(__builtin_popcount((v1[i]^v1[m])) <= k)
+			ans++;
+		cout<<ans;
+	return 0;
+}