Updated the readme file

README.md

@@ -1,2 +1,2 @@
 # Competitive-Coding
-Solutions to competitive programming problems.
+Solutions to competitive programming problems and making them easy to understand.

codechef/ADASTAIR.cpp

@@ -0,0 +1,40 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+#define fast_io() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
+#define debug(x) do { std::cerr << #x << ": " << x << std::endl; } while (0)
+#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
+
+#define ll long long
+
+ll n,t,k;
+int a[130];
+
+int32_t main()
+{
+	cin>>t;
+	while(t--)
+	{
+		cin>>n>>k;
+		ll count=0;
+		a[0]=0;
+		for(int i=1;i<=n;i++)
+		{
+			cin>>a[i];	
+		}
+
+		for(int i=0;i<n;i++)
+		{
+			if(a[i+1]-a[i]>k)
+			{
+				if((a[i+1]-a[i])%k==0)
+					count+=((a[i+1]-a[i])/k)-1;
+				else
+					count+=(a[i+1]-a[i])/k;
+			}
+
+		}	
+
+		printf("%lld\n", count);
+	}
+}

codechef/ARRGRAPH.cpp

@@ -0,0 +1,98 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+#define fast_io() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
+#define all(x) x.begin(), x.end()
+#define debug(x) cout << "debug: " << #x " = " << x << endl
+#define ll long long
+
+int n,t;
+int a[51];
+// int vis[51];
+int32_t main()
+{
+	// fast_io();
+
+	scanf("%d",&t);
+	while(t--)
+	{
+		scanf("%d",&n);
+		// memset(vis,0,sizeof(vis));
+		// memset(a,0,sizeof(a));
+		for (int i = 1; i <= n; i++)
+		{
+			scanf("%d",&a[i]);
+		}
+
+		if(n==1)
+		{
+			// cout<<0<<endl;
+			printf("0\n");
+			// cout<<a[1]<<endl;
+			printf("%d\n",a[1]);
+			continue;
+		}	
+
+		int connected=1;
+		int flag=0;
+		// int sum=0;
+		for(int i=1;i<=n;i++)
+		{
+			flag=0;
+			for(int j=1;j<=n;j++)
+			{
+				if(__gcd(a[i],a[j])==1)
+				{
+					flag=1;
+					break;
+				}	
+			}
+			if(flag==1)
+			{
+				continue;
+			}	
+			else
+			{
+				connected=0;
+				break;
+			}
+		}
+
+		/*for(int i=2;i<=50;i++)
+		{
+			if(vis[i]) sum+=1;
+		}
+	*/
+		if(connected)
+		{
+			printf("0\n");
+			for(int i=1;i<=n;i++)
+			{
+				// cout<<a[i]<<" ";
+				printf("%d ",a[i]);	
+			}
+			// cout<<endl;
+			printf("\n");
+		}
+		else
+		{
+			// cout<<1<<endl;
+			printf("1\n");
+			if(a[1]==47)
+			{
+				a[1]=43;
+			}
+			else
+			{
+				a[1]=47;
+			}
+			for(int i=1;i<=n;i++)
+			{
+				printf("%d ",a[i]);	
+			}
+			// cout<<endl;
+			printf("\n");
+		}
+	}
+	return 0;
+}	

codechef/ATM_MACHINE.cpp

@@ -0,0 +1,34 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long 
+
+ll a[105];
+
+int main()
+{
+	int t;
+	scanf("%d", &t);
+
+	while(t--)
+	{
+		int n;
+		ll k,sum=0;
+		scanf("%d %lld", &n, &k);
+
+		for(int i=1;i<=n;i++)
+		{
+			scanf("%lld", &a[i]);
+			sum+=a[i];
+			if(sum>k)
+			{
+				printf("0");
+				sum-=a[i];
+			}
+			else
+			{
+				printf("1");
+			}
+		}
+		printf("\n");
+	}
+}

codechef/BINIM2.cpp

@@ -0,0 +1,97 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+#define fast_io() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
+#define debug(x) do { std::cerr << #x << ": " << x << std::endl; } while (0)
+#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
+
+#define ll long long
+
+ll n,t;
+string s,x;
+// vector<string> v;
+// multiset<int, greater<int> > one,zero;
+int32_t main()
+{
+	cin>>t;
+	while(t--)
+	{
+		cin>>n;
+		cin>>s;
+
+		int sum00=0, sum01=0, sum10=0,sum11=0,sumdee=0, sumdum=0;
+		// int sum1=0;
+		while(n--)
+		{
+			cin>>x;
+			// v.push_back(x);
+			// reverse(x.begin(), x.end());
+
+			if(x[0]=='1' && x[x.length()-1]=='1')
+			{
+				sum11++;
+				/*int count0=0;
+				for(auto ch : x)
+				{
+					if(ch=='0')
+						count0++;
+				}
+				// debug(count0);
+				sum1+=x.length()-x.find_last_of('0')-1;
+				zero.insert(count0);*/
+			}
+			else if(x[0]=='1' && x[x.length()-1]=='0')
+			{
+				sum10++;
+				/*int count1=0;
+				for(auto ch : x)
+				{
+					if(ch=='1')
+						count1++;
+				}
+				// debug(count1);
+
+				sum0+=x.length()-x.find_last_of('1')-1;
+				one.insert(count1);*/
+			}
+			else if(x[0]=='0' && x[x.length()-1]=='1')
+			{
+				sum01++;
+			}
+			else
+			{
+				sum00++;
+			}
+		}
+
+		sumdee=sum10+sum01+sum00;
+		sumdum=sum11+sum01+sum10;
+		/*for(auto k1 : zero)
+		{
+			// debug(k1);
+			sum0+=k1;
+		}
+
+		for(auto k2 : one)
+		{
+			// debug(k2);
+			sum1+=k2;
+		}
+*/
+		// debug(sum1);
+		// debug(sum0);
+
+		if(sumdee>sumdum)
+		{
+			cout<<"Dum"<<endl;
+		}
+		else if(sumdum>sumdee)
+		{
+			cout<<"Dee"<<endl;
+		}
+		else
+		{
+			cout<<s<<endl;
+		}
+	}
+}

codechef/BITOBYT.cpp

@@ -0,0 +1,35 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long 
+
+ll n;
+
+int main()
+{
+	int t;
+	scanf("%d", &t);
+	while(t--)
+	{
+		ll bit=0,nibble=0,byte=0;
+		scanf("%lld", &n);
+		ll rem=n%26;
+		ll cycle=n/26;
+		if(rem>=1 && rem<=2)
+		{
+			bit=pow(2,cycle);
+		}
+		else if(rem>=3 && rem<=10)
+		{
+			nibble=pow(2,cycle);
+		}
+		else if(rem>=11 && rem<=25)
+		{
+			byte=pow(2,cycle);
+		}
+		else
+		{
+			byte=pow(2,cycle-1);
+		}
+		printf("%lld %lld %lld\n",bit,nibble,byte);
+	}
+}

codechef/BUDDYNIM.cpp

@@ -0,0 +1,72 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+#define fast_io() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
+#define all(x) x.begin(), x.end()
+#ifndef ONLINE_JUDGE
+#include "prettyprint.hpp"
+#define debug(...) cout << "debug: " << #__VA_ARGS__ " = " << make_tuple(__VA_ARGS__) << endl
+#else
+#define debug(...) 0
+#endif
+typedef long long int ll;
+#define int ll
+typedef vector<int> vi;
+typedef pair<int, int> pii;
+
+int t;
+int a[105];
+int b[105];
+
+int32_t main()
+{
+	fast_io();
+	cin>>t;
+	while(t--)
+	{
+		int n,m,suma=0, sumb=0;
+		cin>>n>>m;
+		for(int i=1;i<=n;i++)
+		{
+			cin>>a[i];
+			suma+=a[i];
+		}
+
+		for(int i=1;i<=m;i++)
+		{
+			cin>>b[i];
+			sumb+=b[i];
+		}
+
+		sort(a+1,a+1+n, greater <int>());
+		sort(b+1, b+1+m, greater <int>());
+
+		while(a[n]==0 &&  n>0) n--;
+		while(b[m]==0 && m>0) m--;
+
+		int flag = 0;
+
+		if(suma==sumb)
+		{
+			for(int i=1;i<=n && i<=m ;i++)
+			{
+				if(a[i]!=b[i])
+				{
+					cout<<"Alice"<<endl;
+					flag=1;
+					break;
+				}
+			}
+
+			if(flag==0)
+			{
+				cout<<"Bob"<<endl;
+			}
+		}
+		else
+		{
+			cout<<"Alice"<<endl;
+		}
+	}
+	return 0;
+}