restructured codechef codes

Author: jatin69

code-snippets/undef.cpp

@@ -0,0 +1,23 @@
+#include<stdio.h>
+#include <iostream>
+using namespace std;
+/**
+Answer is (B) -- both can be used
+*/
+
+struct A{
+	char* name;
+	union
+	{
+		char* sval;
+	}u;
+}symtab[10];
+
+int main(void)
+{
+	int i=0;
+	//char* z = "hello";
+	//symtab[i].u.sval=new char[2];
+	*symtab[i].u.sval='z';
+	printf("%c",*symtab[i].u.sval);
+}

codechef/STACKS.cpp

@@ -0,0 +1,136 @@
+#include <iostream>
+#include <stdio.h>
+using namespace std;
+
+struct factor
+{
+    int powtwo;
+    int powfive;
+};
+
+int main()
+{
+    int t,n,m,type,L,R,sum,temp,powfive,powtwo,power,tom;
+    long long X,Y;
+    long long a[100000];
+    factor ob[100000];
+    scanf("%d",&t);
+    while(t--)
+    {
+        sum=0;
+        scanf("%d%d",&n,&m);
+        for(int i=0; i<n; ++i)
+        {
+            scanf("%d",&a[i]);
+            powfive=0;
+            powtwo=0;
+            temp=a[i];
+            while(temp>0 && temp%2==0)
+            {
+                powtwo++;
+                temp=temp/2;
+            }
+            while(temp>0 && temp%5==0)
+            {
+                powfive++;
+                temp/=5;
+            }
+            ob[i].powfive=powfive;
+            ob[i].powtwo=powtwo;
+        }
+        for(int i=1; i<=m; ++i)
+        {
+            cin>>type;
+            switch(type)
+            {
+            case 1:
+            {
+                scanf("%d%d%d",&L,&R,&X);
+                powfive=0;
+                powtwo=0;
+                temp=X;
+                while(temp>0 && temp%2==0)
+                {
+                    powtwo++;
+                    temp=temp/2;
+                }
+                while(temp>0 && temp%5==0)
+                {
+                    powfive++;
+                    temp/=5;
+                }
+                for(int i=L-1; i<R; ++i)
+                {
+                    ob[i].powfive+=powfive;
+                    ob[i].powtwo+=powtwo;
+                }
+            }
+            break;
+
+            case 2:
+            {
+                scanf("%d%d%d",&L,&R,&Y);
+                powfive=0;
+                powtwo=0;
+                temp=Y;
+                while(temp>0 && temp%2==0)
+                {
+                    powtwo++;
+                    temp=temp/2;
+                }
+                while(temp>0 && temp%5==0)
+                {
+                    powfive++;
+                    temp/=5;
+                }
+                factor Y;
+                Y.powfive=powfive;
+                Y.powtwo=powtwo;
+                for(int i=L-1; i<R; ++i)
+                {
+                    powfive=0;powtwo=0;
+                    temp=(i-(L-1)+1);
+                    while(temp>0 && temp%2==0)
+                    {
+                        powtwo++;
+                        temp=temp/2;
+                    }
+                    while(temp>0 && temp%5==0)
+                    {
+                        powfive++;
+                        temp/=5;
+                    }
+                    ob[i].powfive=Y.powfive+powfive;
+                    ob[i].powtwo=Y.powtwo+powtwo;
+                }
+            }
+            break;
+
+            case 3:
+            {
+                scanf("%d%d",&L,&R);
+                powtwo=0;
+                powfive=0;
+                for(int i=L-1; i<R; ++i)
+                {
+                    powtwo+=ob[i].powtwo;
+                    powfive+=ob[i].powfive;
+                }
+                if(powfive<=powtwo)
+                {
+                    power=powfive;
+                }
+                else
+                {
+                    power=powtwo;
+                }
+                sum+=power;
+            }
+            break;
+            }
+
+        }
+        printf("%d\n",sum);
+    }
+    return 0;
+}

codechef/codechef-2016/BGQRS/main.cpp

@@ -0,0 +1,17 @@
+#include <iostream>
+#include <iomanip>
+#include <stdio.h>
+using namespace std;
+
+int main() {
+	double s,v,ans;
+	int t;
+    cin>>t;
+    while(t--){
+        cin>>s>>v;
+        ans=(s*100)/v;
+         printf("%.g\n", ans);
+         }
+
+	return 0;
+}

codechef/codechef-2016/CHDOGS/main.cpp

@@ -0,0 +1,59 @@
+#include <iostream>
+
+using namespace std;
+
+int main()
+{
+    int t;
+    cin>>t;
+    long int a[4];
+    int flag;
+    while(t--)
+    {
+        flag=0;
+        for(int i=0; i<4; ++i)
+        {
+            cin>>a[i];
+            if(a[i]==0)
+            {
+                flag=1;
+            }
+        }
+        if(a[0]+a[1]==0)
+        {
+            flag=1;
+        }
+        else if(a[0]+a[2]==0)
+        {
+            flag=1;
+        }
+        else if(a[0]+a[3]==0)
+        {
+            flag=1;
+        }
+        else if(a[1]+a[2]==0)
+        {
+            flag=1;
+        }
+        else if(a[1]+a[3]==0)
+        {
+            flag=1;
+        }
+        else if(a[2]+a[3]==0)
+        {
+            flag=1;
+        }
+
+        if(flag==1)
+        {
+            cout<<"Yes\n";
+        }
+        else
+        {
+            cout<<"No\n";
+        }
+
+    }
+
+    return 0;
+}

codechef/codechef-2016/CHEFSETC/main.cpp

@@ -0,0 +1,42 @@
+#include <iostream>
+#include <cstring>
+using namespace std;
+
+int main()
+{
+    //ios_base::sync_with_stdio(false);
+    //cin.tie(NULL);
+    int t,min,max;
+    cin>>t;
+    string s1,s2;
+    while(t--)
+    {
+        cin>>s1>>s2;
+        min=0,max=0;
+        unsigned int i;
+        for(i=0; i<s1.length() && i<s2.length(); i++)
+        {
+            if(s1[i]=='?' || s2[i]=='?')
+            {
+                max++;
+            }
+            else if(s1[i]!='?' && s2[i]!='?' && s1[i]!=s2[i] )
+            {
+                max++;
+                min++;
+            }
+        }
+        while(i<s1.length())
+        {
+            max++;
+            i++;
+        }
+        while(i<s2.length())
+        {
+            max++;
+            i++;
+        }
+        cout<<min<<" "<<max<<"\n";
+    }
+    return 0;
+}

codechef/codechef-2016/CHEFSTLT/main.cpp

@@ -0,0 +1,36 @@
+#include <iostream>
+#include <math.h>
+using namespace std;
+int mypow(int base, int exponent) {
+    int n = 1;
+    for (int i = 0; i < exponent; i++) {
+        n *= base;
+    }
+    return n;
+}
+
+
+int main()
+{int a,b;
+    cin>>a>>b;
+    int digit=0;
+    int sum=0;
+    int result=a-b;
+    int power=-1;
+    while(result>0){
+        sum+=digit* mypow(10,power);
+        power++;
+        digit=result%10;
+        result=result/10;
+    }
+    if(digit==9){
+        digit=digit-1;
+    }
+    else{
+        digit++;
+    }
+    sum+= digit* pow(10,power);
+    cout<<sum;
+
+    return 0;
+}