Merge pull request manishbisht#60 from iamdeepanshutaneja/master

Added Codeforces problems

Author: manishbisht

Practice/Codeforces/Alternating Subsequence-1343C.cpp

@@ -0,0 +1,51 @@
+//Problem Link : https://codeforces.com/problemset/problem/1343/C
+
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+bool oppositesigns(ll x,ll y)
+{
+	return ((x^y)<0);
+}
+bool large(ll x,ll y)
+{
+	if(x>y)
+	return 1;
+	return 0;
+}
+int main()
+{
+	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
+    ll t,n,p,i;
+    cin>>t;
+    while(t--)
+    {
+    	cin>>n;
+    	ll a[n];
+    	vector <ll> b;
+    	for(i=0;i<n;i++)
+    	cin>>a[i];
+    	p=a[0];
+    	for(i=0;i<n;i++)
+		{
+			if(oppositesigns(p,a[i])==0)
+			{
+				if(large(a[i],p)==1)
+				p=a[i];
+			}
+			else
+			{
+				b.push_back(p);
+				p=a[i];
+			}
+		}
+		b.push_back(p);
+		ll sum=0;
+		for(i=0;i<b.size();i++)
+		{
+		    sum=sum+b[i];
+	    }
+	    cout<<sum<<endl;
+	}
+	return 0;
+}

Practice/Codeforces/Beautiful Divisors-893B

@@ -0,0 +1,35 @@
+//Problem Link : https://codeforces.com/problemset/problem/893/B
+
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+int main()
+{
+	ll n,i=1,j,num;
+	vector <ll> bn;
+	cin>>n;
+	for(i=1;i<18;i+=2)
+	{
+		num=0;
+		for(j=i;j>i/2;j--)
+		{
+			num+=pow(2,j-1);
+		}
+		bn.push_back(num);
+	}
+	i=1;
+	while(i<=n)
+	{
+		if(n%i==0)
+		{
+		ll g = n/i;
+		if(find( bn.begin(), bn.end(), g) != bn.end())
+		{
+			cout<<n/i<<endl;
+			break;
+		}
+	}
+		i++;
+	}
+	return 0;
+}

Practice/Codeforces/DZY Loves Strings-447B

@@ -0,0 +1,24 @@
+//Problem Link : https://codeforces.com/problemset/problem/447/B
+
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+int main()
+{
+	string s;
+	cin>>s;
+	ll k,i,c=0;
+	cin>>k;
+	ll w[26];
+	for(i=0;i<26;i++)
+	cin>>w[i];
+	for(i=0;i<s.size();i++)
+	{
+		c=c+(w[s[i]-'a']*(i+1));
+	}
+	sort(w,w+26);
+	for(i=s.size()+1;i<=s.size()+k;i++)
+	c=c+(i*w[25]);
+	cout<<c;
+    return 0;
+}

Practice/Codeforces/Increase and Copy-1426C.cpp

@@ -0,0 +1,22 @@
+//Problem Link : http://codeforces.com/problemset/problem/1426/C
+
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+int main()
+{
+	ll t;
+	cin>>t;
+	while(t--)
+	{
+		ll n,c=0;
+		cin>>n;
+		ll m = sqrt(n);
+		c=m-1;
+	    if(n%m==0)
+	    cout<<c+(n/m)-1<<endl;
+	    else
+	    cout<<c+(n/m)<<endl;
+}
+return 0;
+}

Practice/Codeforces/Minimum Triangulation-1140D.cpp

@@ -0,0 +1,14 @@
+//Problem Link : https://codeforces.com/problemset/problem/1140/D
+
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+int main()
+{
+	ll n,w=0,i;
+	cin>>n;
+	for(i=3;i<=n;i++)
+	w=w+(i*(i-1));
+	cout<<w;
+	return 0;
+}

Practice/Codeforces/Perfect Team-1221C.cpp

@@ -0,0 +1,29 @@
+//Problem Link : https://codeforces.com/problemset/problem/1221/C
+
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+int main()
+{
+    ll q;
+    cin>>q;
+    while(q--)
+    {
+    	ll c,m,x,d;
+    	cin>>c>>m>>x;
+    	if(c<=x||m<=x||c==0||m==0)
+    	{
+    		cout<<min(c,m)<<endl;
+		}
+		else
+		{
+			c=c-x;m=m-x;
+			if((c+m)/3>min(c,m))
+			x=x+min(c,m);
+			else
+			x=x+(c+m)/3;
+			cout<<x<<endl;
+		}
+	}
+	return 0;
+}

Practice/Codeforces/Proper Nutrition-898B.cpp

@@ -0,0 +1,21 @@
+//Problem Link : https://codeforces.com/problemset/problem/898/B
+
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+int main()
+{
+	ll n,a,b,i,y;
+	cin>>n>>a>>b; 
+	for(i=0;i<=n/a;i++)
+	{
+		y = (n-i*a)/b;
+		if(i*a+y*b==n)
+		{
+			cout<<"YES"<<endl<<i<<" "<<y;
+			return 0;
+		}
+	}
+	cout<<"NO";
+    return 0;
+}

Practice/Codeforces/Santa Claus and Candies-753A.cpp

@@ -0,0 +1,34 @@
+//Problem Link : https://codeforces.com/problemset/problem/753/A
+
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+int main()
+{
+	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
+    ll n,sum=0,i;
+    cin>>n;
+    vector <ll> b;
+    if(n==1)
+    {
+    	cout<<n<<endl<<n;
+    	return 0;
+	}
+    for(i=1;i<n;i++)
+    {
+    	if((n-sum-i)>i)
+    	{
+    		sum+=i;
+    		b.push_back(i);
+		}
+		else
+		{
+			b.push_back(n-sum);
+			break;
+		}
+	}
+	cout<<b.size()<<endl;
+	for(i=0;i<b.size();i++)
+	cout<<b[i]<<" ";
+	return 0;
+}

Practice/Codeforces/Symmetric Matrix-1426B.cpp

@@ -0,0 +1,37 @@
+//Problem Link : http://codeforces.com/problemset/problem/1426/B
+
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+int main()
+{
+	ll t;
+	cin>>t;
+	while(t--)
+	{
+		ll n,m,i,flag=0;
+		cin>>n>>m;
+		ll a[2*n][2];
+		for(i=0;i<2*n;i++)
+		cin>>a[i][0]>>a[i][1];
+		if(m%2!=0)
+		cout<<"NO"<<endl;
+		else
+		{
+			for(i=0;i<2*n;i+=2)
+			{
+				if(a[i][1]==a[i+1][0])
+				{
+					flag=1;
+					break;
+				}
+			}
+			if(flag==1)
+		cout<<"YES"<<endl;
+		else
+		cout<<"NO"<<endl;
+		}
+		
+	}
+return 0;
+}

Practice/Codeforces/XORinacci-1208A

@@ -0,0 +1,18 @@
+//Problem Link : https://codeforces.com/problemset/problem/1208/A
+
+#include<bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+int main()
+{
+	ll a,b,n,t;
+	cin>>t;
+	while(t--)
+	{
+		cin>>a>>b>>n;
+		ll x[3];
+		x[0]=a;x[1]=b;x[2]=(a^b);
+		cout<<x[n%3]<<endl;
+	}
+	return 0;
+}