Added 2 new codes

AGGCOWS.cpp

@@ -0,0 +1,58 @@
+#include<bits/stdc++.h>
+using namespace std;
+#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
+#define mod 1000000007
+#define MAX 105
+#define ll long long int
+#define pq priority_queue <ll,vector<ll>,greater<ll>>
+#define pqpii priority_queue <pair<ll,ll >,vector<pair<ll,ll > >,greater<pair<ll,ll > > >
+
+
+int noc(ll ar[],ll n,ll mind)
+{
+	int cows=1,left=0;
+
+	for(int i=1;i<n;i++)
+	{
+		if(ar[i]-ar[left] >= mind)
+		{
+			left=i;
+			cows++;
+		}
+	}
+
+	return cows;
+}
+
+int main()
+{
+	ll t;cin>>t;
+	while(t--)
+	{
+		ll n,c,maxi=INT_MIN;cin>>n>>c;
+		ll points[n];
+
+		for(int i=0;i<n;i++)
+		{
+			cin>>points[i];
+			maxi=max(maxi,points[i]);
+		}
+
+		sort(points,points+n);
+
+		ll l=1,r=maxi,ans=-1;
+		while(l<=r)
+		{
+			ll mid = l + (r-l)/2;
+
+			if(noc(points,n,mid) >= c)
+			{
+				ans=mid;
+				l=mid+1;
+			}
+			else r=mid-1;
+		}
+
+		cout<<ans<<endl;
+	}
+}

ARRANGE_Arranging_Amplifiers_SPOJ.cpp

@@ -0,0 +1,92 @@
+#include<bits/stdc++.h>
+using namespace std;
+#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
+#define mod 1000000007
+#define MAX 108
+#define ll long long int
+#define ull unsigned long long int
+#define pqp priority_queue < ll , vector<ll> , greater<ll> >
+#define pqpii priority_queue <pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>>
+#define pie 3.1415926536
+#define pb push_back
+#define M 998244353
+#define ff first
+#define ss second
+#define pi pair<int,int>
+#define pii pair< int, pair<int,int> >
+#define all(v) (v).begin(),(v).end()
+#define mem(a,b) memset(a,b,sizeof(a))
+
+//Greedy Approach ->
+
+/*
+1.sort in reverse to get answer 
+
+Edge cases ->
+1.If array consist of 2 element and they are 2 and 3 then in sorted increasing order will be answer
+2.if array consist of 1s then move them in front and the remaining array as reverse 
+  A)but if remaining are 2 elements as 2,3 then in increasing order
+*/
+
+int main()
+{
+	fast;
+	int t;cin>>t;
+	while(t--)
+	{
+		ll n;cin>>n;
+		ll ar[n];
+		map <int,int > mp;
+		for(ll i=0;i<n;i++)
+		{
+			cin>>ar[i];
+			mp[ar[i]]++;	
+		}
+
+		sort(ar,ar+n);
+
+		if(mp.size()==2 && mp[2]==1 && mp[3]==1)
+		{
+			for(int i=0;i<n;i++)
+			cout<<ar[i]<<" ";
+			cout<<endl;
+		}
+		else if(mp[1]!=0)
+		{
+				vector <int> v;
+				for(int i=0;i<n;i++)
+				{
+					if(ar[i]==1)continue;
+					else v.push_back(ar[i]);
+				}
+
+			for(int i=0;i<n && ar[i]==1;i++)
+				cout<<ar[i]<<" ";
+
+			if(n == mp[1]+2 && mp[2]==1 && mp[3]==1)
+			{	
+				sort(v.begin(),v.end());
+				for(int i=0;i<v.size();i++)
+				cout<<v[i]<<" ";
+				cout<<endl;
+			}
+			else
+			{
+				sort(v.begin(),v.end(),greater<ll>());
+				for(int i=0;i<v.size();i++)
+				cout<<v[i]<<" ";
+				cout<<endl;
+			}
+		}
+		else
+		{
+			sort(ar,ar+n,greater<ll>());
+			for(int i=0;i<n;i++)
+			cout<<ar[i]<<" ";
+			cout<<endl;
+		}
+
+		mp.clear();
+	}
+}
+

BoxOfChocolate.cpp

@@ -0,0 +1,31 @@
+#include<iostream>
+using namespace std;
+
+
+bool KthSetBit(int n,int k){
+    int i=-1;
+    if(k){
+        while(i!=k-1){
+            n=n>>1;
+            i++;
+        }
+    }
+    if(n&1==1)
+        return 1;
+    else
+        return 0;
+}
+
+int main()
+ {
+	int t;cin>>t;
+	while(t){
+	    int n,k;
+	    cin>>n>>k;
+	    if(KthSetBit(n,k))
+            cout<<"Yes"<<endl;
+	    else
+            cout<<"No"<<endl;
+	    --t;
+	}
+}

DEFKIN_Defense_of_a_Kingdom.cpp

@@ -0,0 +1,63 @@
+#include<bits/stdc++.h>
+using namespace std;
+#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
+#define mod 1000000007
+#define MAX 108
+#define ll long long int
+#define ull unsigned long long int
+#define pqp priority_queue < ll , vector<ll> , greater<ll> >
+#define pqpii priority_queue <pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>>
+#define pie 3.1415926536
+#define pb push_back
+#define M 998244353
+#define ff first
+#define ss second
+#define pi pair<int,int>
+#define pii pair< int, pair<int,int> >
+#define all(v) (v).begin(),(v).end()
+#define mem(a,b) memset(a,b,sizeof(a))
+
+//Greedy Approach --> for finding the max uncovered rectangle we have to find max diff between unintersected x and y coordinates of tower
+
+
+int main()
+{
+	fast;
+	int t;cin>>t;
+	while(t--)
+	{
+		ll xx,yy,n;cin>>xx>>yy>>n;
+
+		if(n==0)
+		{
+		cout<<xx*yy<<endl;
+		}
+		else{
+		vector <ll> x,y;
+
+		x.push_back(0);
+		y.push_back(yy+1);
+		x.push_back(xx+1);
+		y.push_back(0);
+
+		for(ll i=0;i<n;i++)
+		{
+			ll x1,y1;cin>>x1>>y1;
+			x.push_back(x1);
+			y.push_back(y1);
+		}
+
+		sort(x.begin(),x.end());
+		sort(y.begin(),y.end());
+
+		ll xmax=INT_MIN,ymax=INT_MIN;
+		for(int i=1;i<x.size();i++)
+		{
+			xmax=max(xmax,(x[i]-x[i-1]));
+			ymax=max(ymax,(y[i]-y[i-1]));
+		}
+	//	cout<<xmax-1<<" "<<ymax-1<<endl;
+		cout<<(xmax-1)*(ymax-1)<<endl;
+	}
+	}
+}

DIEHARD_SPOJ.cpp

@@ -0,0 +1,109 @@
+#include<bits/stdc++.h>
+using namespace std;
+#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
+#define mod 1000000007
+#define MAX 108
+#define ll long long int
+#define ull unsigned long long int
+#define pqp priority_queue < ll , vector<ll> , greater<ll> >
+#define pqpii priority_queue <pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>>
+#define pie 3.1415926536
+#define pb push_back
+#define M 998244353
+#define ff first
+#define ss second
+#define pi pair<int,int>
+#define pii pair< int, pair<int,int> >
+#define all(v) (v).begin(),(v).end()
+#define mem(a,b) memset(a,b,sizeof(a))
+
+ int dp[1005][1005][2][2][2] ;
+
+int solve(int h,int a,int air ,int water ,int fire)
+{
+	if(h<=0 || a<=0) return 0;
+
+
+	if(dp[h][a][air][water][fire]!=-1) return dp[h][a][air][water][fire];
+
+	if(air==0 && water==0 && fire==0)
+	{
+		return dp[h][a][air][water][fire] = max(solve(h+3,a+2,1,0,0),
+		max(solve(h-5,a-10,0,1,0),solve(h-20,a+5,0,0,1)));
+	}
+
+	if(air)
+	{
+		return dp[h][a][air][water][fire] =	max(solve(h-5,a-10,0,1,0),solve(h-20,a+5,0,0,1))+1;
+	}
+
+	if(water)
+	{
+		return dp[h][a][air][water][fire] = max(solve(h+3,a+2,1,0,0),solve(h-20,a+5,0,0,1))+1;
+	}
+
+	if(fire)
+	{
+		return dp[h][a][air][water][fire] = max(solve(h-5,a-10,0,1,0),solve(h+3,a+2,1,0,0))+1;
+	}
+}
+
+
+
+int main()
+{
+	fast;
+	int t;cin>>t;
+	while(t--)
+	{
+		int h,a;cin>>h>>a;
+
+		//----------------Dp Solution--------------------------//
+
+		memset(dp,-1,sizeof(dp));
+		cout<<solve(h,a,0,0,0)<<endl;
+
+
+
+
+		//-------------Greedy Solution-----------------------//
+
+	/*	Approach - As we see that if we are in air out armour and health both increase so we tend to move into this as much as possible so 
+
+		For the time we will survive we will move like --> air , (water/fire) , air , (water/fire) , air .......
+
+		Noted : Water and Fire moves have to be done if we satify the minimum criteria         */
+
+		ll time=0;
+
+		while(1)
+		{
+			if(time%2==0)
+			{
+				h+=3;
+				a+=2;
+			}
+			else
+			{
+				if((a>10 && h>5))
+				{
+					a-=10;
+					h-=5;
+				}
+				else if(h>20)
+				{
+					a+=5;
+					h-=20;
+				}
+				else break;
+			}
+
+			if(h<=0 || a<=0) break;
+
+			time++;
+		}
+
+		cout<<time<<endl;
+	}
+}
+