Day 7

Author: ayan2809

CodeChef/DecemberLong/experiment.cpp

@@ -0,0 +1,49 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+	int d1=0,v1=0,d2=0,v2=0,day=0;
+	cin>>d1>>v1>>d2>>v2>>day;
+	if(d1==d2)
+	{
+		int a=d1-1;
+		double b=(double)day/(v1+v2);
+		cout<<ceil(b)+a<<endl;
+	}
+	else if(d1<d2)
+	{
+	    int a=d1-1;
+	    int d=d2-d1;
+	    double k=(double)day/v1;
+	    int c=ceil(k);
+	    if(c>d)
+	    {
+	        day=day-d*v1;
+	        double g= (double)day/(v1+v2);
+	        cout<<ceil(g)+d+a<<endl;
+	    }
+	    else
+	    {
+	        cout<<c+a<<endl;
+	    }
+	}
+	else
+	{
+		int a=d2-1;
+	    int d=d1-d2;
+	    double k=(double)day/v2;
+	    int c=ceil(k);
+	    if(c>d)
+	    {
+	        day=day-d*v2;
+	        double g= (double)day/(v1+v2);
+	        cout<<ceil(g)+d+a<<endl;
+	    }
+	    else
+	    {
+	        cout<<c+a<<endl;
+	    }
+	}
+	return 0;
+	//cout<<d1<<" ";
+}

CodeChef/DecemberLong/experiment.exe

@@ -0,0 +1,87 @@
+// C++ code to print all possible 
+// subsequences for given array using 
+// recursion 
+#include <bits/stdc++.h> 
+using namespace std; 
+
+//void printArray(vector<int> arr, int n) 
+//{ 
+//	for (int i = 0; i < n; i++) 
+//		cout << arr[i] << " "; 
+//	cout << endl; 
+//} 
+
+ 
+void printSubsequences(int arr,
+					vector<int> subarr,int k,int m,vector <vector<int> > & vect) 
+{ 
+	
+	if (arr == k+1) 
+	{ 
+		int l = subarr.size(); 
+
+		// Condition to avoid printing 
+		// empty subsequence 
+		if (l != 0 && m==0) 
+			{
+			vect.push_back(subarr);
+			//printArray(subarr, l);
+			return;	
+			} 
+	} 
+	else
+	{ 
+	
+		int out1=arr;
+		int out2=-arr;
+		arr=arr+1;
+		
+		vector <int> subarr1=subarr;
+		vector <int> subarr2=subarr;
+		subarr1.push_back(out1); 
+ 		subarr2.push_back(out2);
+ 		
+		printSubsequences(arr, subarr1,k,m-1,vect); 
+		printSubsequences(arr, subarr2,k,m,vect); 
+		
+		
+	} 
+	return; 
+} 
+
+// Driver Code 
+int main() 
+{ 
+	int t=0;
+	cin>>t;
+	while(t--)
+	{
+		int n=0,k=0;
+		cin>>n>>k;
+		if(n==k)
+		{
+			for(int i=1;i<=n;i++)
+			cout<<i<<" ";
+		}
+		else
+		{
+			int sum=0;
+			vector <int> output;
+			  vector<vector<int> > vect;
+			printSubsequences(1, output,n,k,vect); 
+			for(int j=0;j<vect[0].size();j++)
+			{
+				cout<<vect[0][j]<<" ";
+			}
+			cout<<endl;
+		}
+		
+	}
+
+	//printSubsequences(1, b,3); 
+
+	return 0; 
+} 
+
+
+

CodeChef/DecemberLong/experiment2.cpp

@@ -13,7 +13,7 @@ def solve(d1,d2,v1, v2, day, count):
 
 
 
-d1, v1,d2,v2,p = input().split(" ")
+d1,v1,d2,v2,p = input().split(" ")
 
 d1 = int(d1) 
 v1 = int(v1)
@@ -23,22 +23,22 @@ def solve(d1,d2,v1, v2, day, count):
 
 
 
-if(lst[0]==d2):
+if(d1==d2):
     print(math.ceil(p/(v1+v2))+d1-1)
-else:
-    mini=min(d1,d2)
-    total=0
-    maxi= max(d1,d2)
-    a=0
-    b=0
-    if(mini==d1):
-        a=v1
-        b=v2
-    else:
-        b=v1
-        a=v2
+#else:
+  #  mini=min(d1,d2)
+ #   total=0
+  #  maxi= max(d1,d2)
+  #  a=0
+  #  b=0
+  #  if(mini==d1):
+  #      a=v1
+   #     b=v2
+  #  else:
+   #     b=v1
+    #    a=v2
 
-    print(solve(mini,maxi,a,b,p,mini-1))
+   # print(solve(mini,maxi,a,b,p,mini-1))
 
 
 

CodeChef/DecemberLong/experiment2.exe

@@ -1,29 +1,6 @@
 #include<bits/stdc++.h>
 using namespace std;
-void solve(int input,int x, int output,int k,int sum)
-{
-	if(input==x)
-	{
-//		for(int i=0;i<x;i++)
-//		{
-//			cout<<output[i]<<" ";
-//		}
-//		cout<<endl;
-		return;
-	}
-	//cout<<input<<endl;
-	int out1=input;
-	int out2=-input;
-	input++;
-	//output.push_back(out1);
-	cout<<out1<<" ";
-	solve(input,x,out1,k--,sum+out1);
-	///output.push_back(out2);
-	solve(input,x,out2,k,sum+out2);
-	return;
-	
-	
-}
+
 int main()
 {
 	int t=0;
@@ -39,13 +16,93 @@ int main()
 		}
 		else
 		{
-			int sum=0;
-			vector <int> output;
-			solve(1,n,output,k,0);	
-//			for(int i=0;i<output.size();i++)
-//			{
-//				cout<<output[i]<<" ";
-//				}	
+			vector <int> a;
+			int count=0;
+			if(n%2==0)
+			{
+				for(int i=1;i<n+1;i++)
+				{
+					if(i%2==0)
+					{
+						count++;
+					a.push_back(i);	
+					}
+					else
+					a.push_back(-i);
+				}
+			}
+			else
+			{
+				for(int i=1;i<n+1;i++)
+				{
+					if(i%2!=0)
+					{
+						count++;
+						a.push_back(i);
+					}
+					else
+					{
+						//count++;
+						a.push_back(-i);
+					}
+				}
+			}
+			int sum=0,m=1;
+			//cout<<count<<endl;
+			for(int i=0;i<n;i++)
+			{
+				sum+=a[i];
+				if(sum>0)
+				{
+					if(count<k)
+					{
+						int diff=k-count;
+						int g=n-1;
+						while(g!=0)
+						{
+							if(a[g]<0)
+							{
+								count=count+1;
+								a[g]=abs(a[g]);
+								diff--;
+							}
+							if(diff==0)
+							break;
+							g--;
+							
+						}
+					}
+				
+				if(count>k)
+					{
+						int diff=count-k;
+						int g=n-1;
+						while(g!=0)
+						{
+							if(a[g]>0)
+							{
+								count=count-1;
+								a[g]=-(a[g]);
+								diff--;
+							}
+							if(diff==0)
+							break;
+							g--;
+							
+						}
+					}
+				if(count==k)
+				{
+					break;
+				}
+				}
+			}
+			//cout<<count<<" "<<k<<endl;
+			for(int i=0;i<n;i++)
+			{
+				cout<<a[i]<<" ";
+			}
+					
 		}
 		cout<<endl;
 	}