Codeforces 339A Helpful Maths Solution in C

1. #include<stdio.h>
2. #include<string.h>
3. int main()
4. {
5. int i,a,b,c,x,z;
6. char n[200];
7. scanf("%s",&n);
8. x=strlen(n);
9. i=0;a=0;b=0;c=0;
10. while (i<x)
11. {
12. if (n[i]=='1') a++;
13. else if (n[i]=='2') b++;
14. else if (n[i]=='3') c++;
15. i+=2;
16. }
17. i=0;z=0;
18. while (i<a)
19. {
20. if (i==0) printf("1");
21. else printf("+1");
22. i++;
23. z++;
24. }
25. i=0;
26. while (i<b)
27. {
28. if (z==0) printf("2");
29. else printf("+2");
30. i++;
31. z++;
32. }
33. i=0;
34. while (i<c)
35. {
36. if (z==0) printf("3");
37. else printf("+3");
38. i++;
39. z++;
40. }
41. printf("\n");
42. return 0;
43. }

Codeforces 96A Football Solution in C

1. #include<stdio.h>
2. #include<string.h>
3. int main()
4. {
5. int i,o,p=0;
6. char n[700];
7. scanf("%s",&n);
8. o=strlen(n);
9. for (i=0;i<o-6;i++)
10. {
11. if (n[i]=='0' && n[i+1]=='0' && n[i+2]=='0' && n[i+3]=='0' && n[i+4]=='0' && n[i+5]=='0' && n[i+6]=='0')
12. {
13. p=7;
14. break;
15. }
16. if (n[i]=='1' && n[i+1]=='1' && n[i+2]=='1' && n[i+3]=='1' && n[i+4]=='1' && n[i+5]=='1' && n[i+6]=='1')
17. {
18. p=7;
19. break;
20. }
21. }
22. if (p==7) printf("YES\n");
23. else printf("NO\n");
24. return 0;
25. }

Codeforces 112A Petya and Strings Solution in C

1. #include<stdio.h>
2. #include<string.h>
3. int main()
4. {
5. int x, i,o,l;
6. x=0;
7. char a[200],b[200];
8. scanf("%s %s",&a,&b);
9. l=strlen(a);
10. for (i=0;i<l;i++)
11. {
12. o=a[i]-b[i];
13. if (o!=0 && o!=32 && o!=-32)
14. {
15. if (a[i]<='z' && b[i]<='z' && a[i]>='a' && b[i]>='a')
16. {
17. if (a[i]>b[i])
18. {
19. x=1;
20. break;
21. }
22. else
23. {
24. x=-1;
25. break;
26. }
27. }
28. if (a[i]<='Z' && b[i]<='Z' && a[i]>='A' && b[i]>='A')
29. {
30. if (a[i]>b[i])
31. {
32. x=1;
33. break;
34. }
35. else
36. {
37. x=-1;
38. break;
39. }
40. }
41. if (a[i]<='Z' && a[i]>='A' && b[i]<='z' && b[i]>='a')
42. {
43. if (a[i]+32>b[i])
44. {
45. x=1;
46. break;
47. }
48. else
49. {
50. x=-1;
51. break;
52. }
53. }
54. if (a[i]<='z' && a[i]>='a' && b[i]<='Z' && b[i]>='A')
55. {
56. if (a[i]-32>b[i])
57. {
58. x=1;
59. break;
60. }
61. else
62. {
63. x=-1;
64. break;
65. }
66. }
67. }
68. }
69. printf("%d\n",x);
70. return 0;
71. }

Codeforces 282A Bit++ Solution in C

1. #include<stdio.h>
2. #include<string.h>
3. int main()
4. {
5. int i,j,k,n,s;
6. char x[7];
7. scanf("%d",&n);
8. j=0;
9. k=0;
10. for (i=0;i<n;i++)
11. {
12. scanf("%s",&x);
13. if (x[0]=='+' || x[2]=='+')
14. {
15. j++;
16. }
17. else
18. {
19. k++;
20. }
21. }
22. s=j-k;
23. printf("%d\n",s);
24. return 0;
25. }

Codeforces 50A Domino piling Solution in C

1. #include<stdio.h>
2. int main()
3. {
4. int x,y,p,s,a=0,b=0;
5. scanf("%d%d",&x,&y);
6. if (x>=1 && x<=y && y<=16)
7. {
8. p=x*y;
9. while (p>a)
10. {
11. a=a+2;
12. if (a<=p) b++;
13. }
14. printf("%d\n",b);
15. }
16. return 0;
17. }

Codeforces Problem 231A Team Solution in C

1. #include<stdio.h>
2. int main()
3. {
4. int i,j,a,b,c,x,y=0;
5. scanf("%d",&i);
6. if (i>0 && i<=1000)
7. {
8. for (j=0; j<i; j++)
9. {
10. scanf("%d %d %d",&a,&b,&c);
11. if ((a==1 || a==0) && (b==1 || b==0) && (c==1 || c==0))
12. {
13. x=a+b+c;
14. if (x>=2) y++;
15. }
16. }
17. printf("%d\n",y);
18. }
19. return 0;
20. }

Codeforces 118A String Task in C

Hi! I'm Sujan Mridha, the solution of 118A String Task is given below:

1. #include<stdio.h>
2. int main()
3. {
4. int l,i;
5. char a[200];
6. scanf("%s",&a);
7. l=strlen(a);
8. for (i=0; i<l; i++)
9. {
10. if (a[i]>='A' && a[i]<='Z') a[i]=a[i]+32;
11. if (a[i]!='a' && a[i]!='A' && a[i]!='E' && a[i]!='e' && a[i]!='I' && a[i]!='i' && a[i]!='o' && a[i]!='O' && a[i]!='U' && a[i]!='u' && a[i]!='y' && a[i]!='Y') printf(".%c",a[i]);
12. }
13. printf("\n");
14. return 0;
15. }