The Next Palindrome_SOLVED

/* CODECHEF PROBLEM CODE : PALIN */ #include <stdio.h> #include <stdlib.h> #include <string.h> char K[1000002]; int flag; int main()  { int t,i; scanf("%d\n",&t); for(i=0; i<t; i++)  {  gets(K);  int len,i,tmp,t,tmp1;  len = strlen(K);  flag = 1;  for(i=0;...

Read More

Poker_SOLVED

/* CODECHEF PROBLEM CODE : POKER  */ #include<stdio.h> int main() { int cases; int i,j; int temp; int rank[5]; char suit[5],space,ch;  scanf("%d%c",&cases,&space); while(cases--)  { for(i=0;i<5;i++)  { scanf("%c%c%c",&ch,&suit[i],&space); ...

Read More

Random decreasing function_SOLVED

/* CODECHEF PROBLEM CODE : RDF */ #include <stdio.h> inline int getn()  {   int n=0, c=getchar_unlocked();   while(c < '0' || c > '9')        c = getchar_unlocked();   while(c >= '0' && c <= '9')       n = (n<<3) + (n<<1) + c -...

Read More

Chef Teams_solved

/* CODECHEF PROBLEM CODE : CTEAMS */  #include <stdio.h> #include <math.h> #define tausch(a,b) b=a+b, a=b-a, b=b-a int X[100100][5]; void f3(int i) { int l=2*i, r=2*i+1, z=i; z=(l<=X[2][4]&&X[X[l][2]][0]>X[X[i][2]][0])?l:z; z=(r<=X[2][4]&&X[X[r][2]][0]>X[X[z][2]][0])?r:z; if(z!=i) { ...

Read More