a2oj added

Author: kothariji

A2OJ/A/061. Yaroslav and Permutations.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{
+
+	int n,data;
+	cin>>n;
+	int a[n];
+	map <int , int >mp1;
+	for(int i=0; i<n; i++)
+	{
+		cin>>data;
+		if(mp1.find(data) == mp1.end())
+			mp1[data] = 1;
+		else
+			mp1[data]++;
+
+	}
+	int limit;
+	if(n%2)
+		limit = (n+1)/2;
+	else
+		limit = n/2;
+
+	for(auto c: mp1)
+		if(limit < c.second)
+		{
+			cout<<"NO";
+			return 0;
+		}
+	cout<<"YES";	
+
+
+	return 0;
+}

A2OJ/A/062. Collecting Beats is Fun.cpp

@@ -0,0 +1,37 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{
+
+	int n;
+	cin>>n;
+	string s[4];
+	map <char , int >mp1;
+	for(int i=0; i<4; i++)
+	{
+		cin>>s[i];
+		for(int j=0; j<4; j++)
+			if(s[i][j] != '.')
+			{
+				if(mp1.find(s[i][j]) == mp1.end())
+					mp1[s[i][j]] = 1;
+				else
+					mp1[s[i][j]]++;
+			}
+	}
+	int limit = 2*n;
+
+	for(auto c: mp1)
+		if(limit < c.second)
+		{
+			cout<<"NO";
+			return 0;
+		}
+	cout<<"YES";	
+
+
+	return 0;
+}

A2OJ/A/063. Levko and Table.cpp

@@ -0,0 +1,21 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{
+
+	int n,k;
+	cin>>n>>k;
+	for(int i=0; i<n; i++)
+	{
+		for(int j=0; j<n; j++)
+			if(i == j)
+				cout<<k<<" ";
+			else
+				cout<<0<<" ";
+		cout<<endl;	
+	}
+	return 0;
+}

A2OJ/A/064. Vasya and Digital Root.cpp

@@ -0,0 +1,21 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{
+
+	int k,d;
+	cin>>k>>d;
+	if((d == 0) and (k != 1))
+	{
+		cout<<"No solution";
+		return 0;
+	}
+	cout<<d;
+	for(int i=0; i<k-1; i++)
+		cout<<0;
+	
+	return 0;
+}

A2OJ/A/065. Two Bags of Potatoes.cpp

@@ -0,0 +1,21 @@
+#include <bits/stdc++.h>
+#define lli long long int
+#define endl "\n"
+using namespace std;
+ 
+int main()
+{
+ 
+	lli y, k, n,s,flag = 0;
+	cin>>y>>k>>n;
+	s = k - (y%k);
+	
+	for(lli i=s; i<= (n-y); i +=k)
+	{
+		cout<<i<<" ";	
+		flag = 1;
+	}
+	if(flag == 0)
+		cout<<-1;
+	return 0;
+}