First set of 300 problems added

Author: zee-bit

01 Game.cpp

@@ -0,0 +1,54 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+// Easy Solution (Inspired by tmwilliamlin)
+void solve() {
+	string s;
+	cin >> s;
+	int c[] = {0, 0};
+	for (char d : s)
+		c[d - '0']++;
+	cout << ((min(c[0], c[1]) & 1) ? "DA\n" : "NET\n");
+}
+
+// Complex Solution
+void solve2() {
+	string s;
+	cin >> s;
+	char f = s[0];
+	int ctr = 0;
+	stack<char> st;
+	st.push(s[0]);
+	for (int i = 1; i < int(s.length()); i++) {
+		if (s[i] == f)
+			st.push(s[i]);
+		else {
+			if (!st.empty()) {
+				st.pop();
+				ctr++;
+			}
+			else {
+				f = s[i];
+				st.push(s[i]);
+			}
+		}
+	}
+	if (ctr % 2 == 0)
+		cout << "NET\n";
+	else
+		cout << "DA\n";
+}
+
+int main() {
+	ios::sync_with_stdio(0);
+	cin.tie(0);
+#ifndef ONLINE_JUDGE
+	freopen("input.txt", "r", stdin);
+	freopen("output.txt", "w", stdout);
+#endif
+	int t;
+	cin >> t;
+	while (t--)
+		solve();
+	return 0;
+}

A cookie for You.cpp

@@ -0,0 +1,36 @@
+#include <bits/stdc++.h>
+using namespace std;
+using namespace std::chrono;
+typedef long long ll;
+
+// unhackable custom hash for unordered_map
+// Credits : neil
+struct custom_hash {
+	size_t operator()(uint64_t x) const {
+		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
+		return x + FIXED_RANDOM;
+	}
+};
+
+void solve() {
+	ll a, b, n, m;
+	cin >> a >> b >> n >> m;
+	if (a + b >= m + n && m <= min(a, b))
+		cout << "Yes\n";
+	else
+		cout << "No\n";
+}
+
+int main() {
+	ios::sync_with_stdio(0);
+	cin.tie(0);
+#ifndef ONLINE_JUDGE
+	freopen("input.txt", "r", stdin);
+	freopen("output.txt", "w", stdout);
+#endif
+	int t;
+	cin >> t;
+	while (t--)
+		solve();
+	return 0;
+}

ADASHOP2.cpp

@@ -0,0 +1,39 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+
+int main() {
+	ios::sync_with_stdio(0);
+	cin.tie(0);
+	int t, r, c;
+	cin>>t;
+	while(t--) {
+		cin>>r>>c;
+		vector<int> set_of_moves[18]={
+				{8, 8},{7,7},{8, 6},{3,1},
+				{4,2},{5,1},{8,4},{7,3},{8,2},
+				{7,1},{1,7},{2,8},{3,7},{4,8},
+				{1,5},{2,4},{1,3},{6,8}
+		};
+		if(r!=1 || c!=1) {
+			if(r==c) {
+				cout<<"19\n";
+				cout<<"1 1\n";
+			}
+			else {
+				cout<<"20\n";
+				cout<<(r+c)/2<<" "<<(r+c)/2<<"\n";
+				cout<<"1 1\n";
+			}
+		}
+		else 
+			cout<<"18\n";
+		for(int i=0;i<18;i++) {
+			for(int j=0; j<2; j++) {
+				cout<<set_of_moves[i][j]<<" ";
+			}
+			cout<<"\n";
+		}
+	}
+	return 0;
+}

ADTRI.cpp

@@ -0,0 +1,46 @@
+#include <bits/stdc++.h>
+using namespace std;
+typedef long ll;
+
+const ll N=5000002;
+
+bool isPrime[N], isHyp[N];
+vector<ll> prime;
+
+void ansfunc() {
+	for(ll i=0;i<N;i++) {
+		isHyp[i]=false;
+		isPrime[i]=true;
+	}
+	//Sieve of Eratosthenes
+	isPrime[0] = isPrime[1] =false;
+	for(ll i=2; i<N; i++) {
+		if(isPrime[i])
+			for(ll j=i*2;j<N;j+=i)
+				isPrime[j]=false;
+	}
+	for(ll i=2;i<N;i++) {
+		if(isPrime[i] == true && i%4==1) 
+			prime.push_back(i);
+	}
+	for(ll i=0;i<prime.size();i++) {
+		for(ll j=prime[i]; j<N; j+=prime[i])
+			isHyp[j]=true;
+	}
+}
+int main() {
+	ios::sync_with_stdio(0);
+	cin.tie(0);
+	ansfunc();
+	ll t;
+	cin>>t;
+	while(t--) {
+		ll n;
+		cin>>n;
+		if(isHyp[n])
+			cout<<"YES\n";
+		else
+			cout<<"NO\n";
+	}
+	return 0;
+}

AMMEAT.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+int main()
+{
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	cout.tie(NULL);
+	int t, n, m, i;
+	cin>>t;
+	while(t--)
+	{
+		cin>>n >>m;
+		long p[100];
+		for(i=0;i<n;i++)
+		{
+			cin>>p[i];
+		}
+		sort(p,p+n,greater<long>());
+		long totalMeatBall=0;
+		for(i=0;i<n;i++)
+		{
+			totalMeatBall+=p[i];
+			if(totalMeatBall >= m)
+			{
+				cout<<i+1<<"\n";
+				break;
+			}
+			else if(i==n-1)
+				cout<<"-1\n";
+		}
+	}
+	return 0;
+}

AMSGAME.cpp

@@ -0,0 +1,39 @@
+#include <iostream>
+using namespace std;
+
+int gcd(int a,int b)
+{
+	if(b==0)
+		return a;
+	else 
+		return(gcd(b,a%b));
+}
+int main()
+{
+	int t,i,n;
+	cin>>t;
+	while(t--)
+	{
+		cin>>n;
+		int a[n];
+		for(i=0;i<n;i++)
+		{
+			cin>>a[i];
+		}
+		if(n==1)
+			cout<<a[0]<<"\n";
+		else if(n==2)
+			cout<<gcd(a[0],a[1])<<"\n";
+		else
+		{
+			int g;
+			g=gcd(a[0],a[1]);
+			for(i=2;i<n;i++)
+			{
+				g=gcd(g,a[i]);
+			}
+			cout<<g<<"\n";
+		}
+	}
+	return 0;
+}

ANSLEAK.cpp

@@ -0,0 +1,37 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+
+int main() {
+	ios_base::sync_with_stdio(0);
+	cin.tie(0);
+	int t, n, m, k, x;
+	cin>>t;
+	while(t--) {
+		cin>>n>>m>>k;
+		vector<vector<int> > c(n);
+		for(int i=0; i<n; i++) {
+			for(int j=0; j<k; j++) { 
+				cin>>x;
+				c[i].push_back(x);
+			}
+		}
+		for(int i=0; i<n; i++) {
+			int ma,ctr=0,max_ctr=0;
+			for(int j=1; j<=m; j++) {
+				ctr=0;
+				for(int l=0; l<k; l++) {
+					if(c[i][l]==j)
+						ctr++;
+				}
+				if(ctr>=max_ctr) {
+					max_ctr=ctr;
+					ma=j;
+				}
+			}
+			cout<<ma<<" ";
+		}
+		cout<<"\n";
+	}
+	return 0;
+}

ANUBTG.cpp

@@ -0,0 +1,30 @@
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+int main()
+{
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	cout.tie(NULL);
+	long t,n,i,ans=0;
+	cin>>t;
+	while(t--)
+	{
+		cin>>n;
+		long a[1000];
+		for(i=0;i<n;i++)
+		{
+			cin>>a[i];
+		}
+		sort(a,a+n,greater<long>());
+		for(i=0;i<n;i++)
+		{
+			if(i%4<2)
+				ans+=a[i];
+		}
+		cout<<ans<<"\n";
+		ans=0;
+	}
+	return 0;
+}

ANUDTC.cpp

@@ -0,0 +1,25 @@
+#include <iostream>
+using namespace std;
+
+int main()
+{
+	int t,n,i;
+	cin>>t;
+	while(t--)
+	{
+		cin>>n;
+		if (360 % n == 0)
+			cout<<"y ";
+		else 
+			cout<<"n ";
+		if(n<=360)
+			cout<<"y ";
+		else 
+			cout<<"n ";
+		if (n*(n+1)/2 <=360)
+			cout<<"y ";
+		else 
+			cout<<"n ";
+		cout<<"\n";
+	}
+}

ANUWTA.cpp

@@ -0,0 +1,24 @@
+#include <iostream>
+using namespace std;
+
+int main()
+{
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	long t,n,s;
+	cin>>t;
+	while(t--)
+	{
+		cin>>n;
+		s=0;
+		if(n==0){
+			cout<<n<<"\n";
+			continue;
+		}
+		else{
+			s=n+((n*(n+1))/2);
+			cout<<s<<"\n";
+		}
+	}
+	return 0;
+}