Add files via upload

Author: harshchan

Spoj/Practice/CPP/aggresive cows.cpp

@@ -0,0 +1,58 @@
+#include<iostream>
+#include<conio.h>
+#include<stdlib.h>
+#include<bits/stdc++.h>
+
+#define int             long long int
+#define pb              push_back
+#define ps(x,y)         fixed<<setprecision(y)<<x
+#define mod             1000000007
+#define w(x)            int x; cin>>x; while(x--)
+using namespace std;
+ 
+ 
+int32_t main() {
+ 
+    w(T)
+    {
+        int n,c,ans;
+        cin>>n>>c;
+        int arr[n];
+        for(int i=0;i<n;i++) cin>>arr[i];
+        
+        sort(arr,arr+n);
+        int low=arr[0],high=arr[n-1]-arr[0];
+		
+		while(low<=high)
+		{
+			int prev=arr[0],mid=(low+high)>>1;
+			int cow_count=1;
+			for(int i=1;i<n;i++)
+			{
+				if(arr[i]-prev >= mid)
+				{
+				cow_count++; prev=arr[i];
+				if(c==cow_count)break;
+				}
+			}
+			if(cow_count>=c)
+			{
+				low=mid+1;ans=mid;
+			}
+			else
+			{
+				high=mid-1;
+			}
+			
+		}
+		cout<<ans<<endl;
+		        
+    }
+ 
+ 
+    return 0;
+}
+ 
+ 
+ 
+

Spoj/Practice/CPP/eko_eko.cpp

@@ -0,0 +1,55 @@
+#include<iostream>
+#include<stdlib.h>
+#include<bits/stdc++.h>
+
+#define int             long long int
+#define pb              push_back
+#define ps(x,y)         fixed<<setprecision(y)<<x
+#define mod             1000000007
+#define w(x)            int x; cin>>x; while(x--)
+using namespace std;
+ 
+ int mid_wood(int arr[],int m,int mid,int n)
+ {int wood=0;
+ cout<<"Inside fn";
+ 	for(int i=0;i<n;i++)
+ 	{
+ 		if(arr[i]-mid>0)
+ 		{
+ 			wood=wood+arr[i]-mid;
+ 		}
+ 	}
+ 	return wood;
+ }
+ 
+int32_t main() {
+ 
+    w(T)
+    {
+        int n,m,ans;
+        cin>>n>>m;
+        int arr[n];
+        for(int i=0;i<n;i++) cin>>arr[i];
+        
+        sort(arr,arr+n);
+       int low=0,high=arr[n-1];
+       while(low<=high)
+       {cout<<"inside while";
+       	int mid=(low+high)/2;6
+       	if(m<=mid_wood(arr,m,mid,n))
+       	{
+       		ans=mid;low=mid+1;
+       	}
+       	else high=mid-1;
+       }
+		cout<<ans<<endl;
+		        
+    }
+ 
+ 
+    return 0;
+}
+ 
+ 
+ 
+

Spoj/Practice/CPP/prata-roti.cpp

@@ -0,0 +1,61 @@
+#include<iostream>
+#include<stdlib.h>
+#include<bits/stdc++.h>
+
+#define int             long long int
+#define pb              push_back
+#define ps(x,y)         fixed<<setprecision(y)<<x
+#define mod             1000000007
+#define w(x)            int x; cin>>x; while(x--)
+using namespace std;
+
+
+int findmax(int arr[100],int n)
+{
+	int maxi=arr[0];
+	for(int i=1;i<n;i++)
+	{
+		maxi=max(arr[i],maxi);
+	}
+	return maxi;
+}
+
+bool isParatha(int mid,int paratha,int arr[100],int n)
+{
+	int time,count=0;
+	for(int i=0;i<n;i++)
+	{
+		int r=arr[i];time=r;int j=2;
+		while(time<=mid)
+		{
+			count++;time=time+(arr[i]*j);
+			j++;
+		}
+	}
+	return paratha<=count;
+}
+int32_t main()
+{
+
+ w(t)
+ {
+ 	int n,chef,arr[100];
+ 	cin>>n>>chef;
+ 	for(int i=0;i<chef;i++)cin>>arr[i];
+ 	
+ 	int low=0,x=findmax(arr,chef),ans=0;
+ 	int high=(n/2)*((2*x)+(n-1)*x);
+ 	
+ 	while(low<=high)
+ 	{
+ 		int mid=(low+high)/2;
+ 		if(isParatha(mid,n,arr,chef))
+ 		{
+ 			ans=mid;high=mid-1;
+		}
+		else low=mid+1;
+	}
+ 	cout<<ans<<"\n"<<endl;
+ }
+}
+