Merge pull request #436 from siddhantmohanty2001/master

created 6 solutions in siddhantmohanty2001 folder

Author: KejariwalAyush

c_plus_plus/siddhantmohanty2001/siddhantmohanty2001_bitStrings.cpp

@@ -0,0 +1,13 @@
+#include <iostream>
+ 
+using namespace std;
+ 
+int main()
+{
+    long long int n,i=1,ans=1,M=1000000007;
+    cin>>n;
+    for(i=1;i<=n;i++)
+        ans=(ans*2)%M;
+    cout<<ans%M;
+    return 0;
+}

c_plus_plus/siddhantmohanty2001/siddhantmohanty2001_coinPiles.cpp

@@ -0,0 +1,23 @@
+#include <iostream>
+ 
+using namespace std;
+ 
+int main()
+{
+    long long int t;
+    cin>>t;
+    while(t--)
+    {
+        long long int a,b,mini,maxi;
+        cin>>a>>b;
+        mini=min(a,b);
+        maxi=max(a,b);
+        if(a==0&&b==0)
+            cout<<"YES"<<endl;
+        else if(maxi<=2*mini&&(a+b)%3==0&&a>=1&&b>=1)
+            cout<<"YES"<<endl;
+        else
+            cout<<"NO"<<endl;
+    }
+    return 0;
+}

c_plus_plus/siddhantmohanty2001/siddhantmohanty2001_palindromeReorder.cpp

@@ -0,0 +1,61 @@
+#include <iostream>
+ 
+using namespace std;
+char alpha(long long int n)
+{
+    char a='A';
+    long long int i=0;
+    while(i<n)
+    {
+        i++;
+        a++;
+    }
+    return a;
+}
+int main()
+{
+    string s;
+    cin>>s;
+    long long int i,n=s.length(),c[26],flag=0,k,x=0;
+    for(i=0;i<26;i++)
+        c[i]=0;
+    for(i=0;i<n;i++)
+    {
+        c[s[i]-65]++;
+    }
+    for(i=0;i<26;i++)
+    {
+        if(c[i]%2!=0)
+        {
+            flag++;
+            x=i;
+        }
+    }
+ 
+    if(n%2==0&&flag!=0)
+        cout<<"NO SOLUTION";
+    else if(n%2!=0&&flag!=1)
+        cout<<"NO SOLUTION";
+    else
+    {
+        for(i=0;i<26;i++)
+        {
+            if(i!=x)
+            {
+            k=c[i]/2;
+            while(k--)
+                cout<<alpha(i);
+            }
+        }
+        while(c[x]--)
+            cout<<alpha(x);
+        for(i=25;i>=0;i--)
+        {
+            k=c[i]/2;
+            while(k--)
+            cout<<alpha(i);
+ 
+        }
+    }
+    return 0;
+}

c_plus_plus/siddhantmohanty2001/siddhantmohanty2001_trailingZeroes.cpp

@@ -0,0 +1,15 @@
+#include <iostream>
+ 
+using namespace std;
+ 
+int main()
+{
+    long long int n,i=5,ans=0;
+    cin>>n;
+    for(i=5;i<=n;i*=5)
+    {
+        ans=ans+n/i;
+    }
+    cout<<ans;
+    return 0;
+}

c_plus_plus/siddhantmohanty2001/siddhantmohanty2001_twoKnights.cpp

@@ -0,0 +1,17 @@
+#include <iostream>
+ 
+using namespace std;
+ 
+int main()
+{
+    long long int n,i,s,k;
+    cin>>n;
+    cout<<0<<endl;
+    for(i=2;i<=n;i++)
+    {
+        k=i*i;
+        s=(k*(k-1))/2-4*(i-1)*(i-2);
+        cout<<s<<endl;
+    }
+    return 0;
+}

c_plus_plus/siddhantmohanty2001/siddhantmohanty2001_twoSets.cpp

@@ -0,0 +1,46 @@
+#include <iostream>
+#include<vector>
+using namespace std;
+int main()
+{
+   long long int n,s=0,q,r,i;
+   cin>>n;
+   s=(n*(n+1))/2;
+   if(s%2==0)
+   {
+    cout<<"YES"<<endl;
+    s=s/2;
+    q=s/(n+1);
+    r=s%(n+1);
+    if(r==0)
+        cout<<2*q<<endl;
+    else
+    cout<<2*q+1<<endl;
+    for(i=1;i<=q;i++)
+    {
+        cout<<i<<" "<<n-i+1<<" ";
+    }
+    if(r>0)
+        cout<<n-q;
+        cout<<endl;
+    if(r==0)
+        cout<<n-2*q<<endl;
+    else
+        cout<<n-2*q-1<<endl;
+    if(r==0)
+    {
+        for(i=q+1;i<=n-q;i++)
+            cout<<i<<" ";
+ 
+    }
+    else
+    {
+        for(i=q+1;i<n-q;i++)
+            cout<<i<<" ";
+    }
+    cout<<endl;
+     }
+   else
+  cout<<"NO";
+    return 0;
+}