#include<cstdio> #include<string.h> using namespace std; char board[8][9]; int check(int wi, int wj,int bi, int bj) { int i,j; i=wi; j=wj; while (--j>=0) { if (board[i][j]=='.') continue; if (board[i][j]=='q' || board[i][j]=='r') return 1; else break; } j=wj; while (++j<8) { if (board[i][j]=='.') continue; if (board[i][j]=='q' || board[i][j]=='r') return 1; else break; } j=wj; while (--i>=0) { if (board[i][j]=='.') continue; if (board[i][j]=='q' || board[i][j]=='r') return 1; else break; } i=wi; while (++i<8) { if (board[i][j]=='.') continue; if (board[i][j]=='q' || board[i][j]=='r') return 1; else break; } i=wi; while (--j>=0 && --i>=0) { if (board[i][j]=='.') continue; if (board[i][j]=='q' || board[i][j]=='b') return 1; else break; } i=wi; j=wj; while (--j>=0 && ++i<8) { if (board[i][j]=='.') continue; if (board[i][j]=='q' || board[i][j]=='b') return 1; else break; } i=wi; j=wj; while (++j<8 && --i>=0) { if (board[i][j]=='.') continue; if (board[i][j]=='q' || board[i][j]=='b') return 1; else break; } i=wi; j=wj; while (++j<8 && ++i<8) { if (board[i][j]=='.') continue; if (board[i][j]=='q' || board[i][j]=='b') return 1; else break; } i=wi-1; j=wj; if (i>=0) { if (j-1>=0 && board[i][j-1]=='p') return 1; if (j+1<8 && board[i][j+1]=='p') return 1; } i++; if (i-2>=0) { if (j-1>=0 && board[i-2][j-1]=='n') return 1; if (j+1<8 && board[i-2][j+1]=='n') return 1; } if (i+2<8) { if (j-1>=0 && board[i+2][j-1]=='n') return 1; if (j+1<8 && board[i+2][j+1]=='n') return 1; } if (j-2>=0) { if (i-1>=0 && board[i-1][j-2]=='n') return 1; if (i+1<8 && board[i+1][j-2]=='n') return 1; } if (j+2<8) { if (i-1>=0 && board[i-1][j+2]=='n') return 1; if (i+1<8 && board[i+1][j+2]=='n') return 1; } // black king check checking i=bi; j=bj; while (--j>=0) { if (board[i][j]=='.') continue; if (board[i][j]=='Q' || board[i][j]=='R') return 2; else break; } j=bj; while (++j<8) { if (board[i][j]=='.') continue; if (board[i][j]=='Q' || board[i][j]=='R') return 2; else break; } j=bj; while (--i>=0) { if (board[i][j]=='.') continue; if (board[i][j]=='Q' || board[i][j]=='R') return 2; else break; } i=bi; while (++i<8) { if (board[i][j]=='.') continue; if (board[i][j]=='Q' || board[i][j]=='R') return 2; else break; } i=bi; while (--j>=0 && --i>=0) { if (board[i][j]=='.') continue; if (board[i][j]=='Q' || board[i][j]=='B') return 2; else break; } i=bi; j=bj; while (--j>=0 && ++i<8) { if (board[i][j]=='.') continue; if (board[i][j]=='Q' || board[i][j]=='B') return 2; else break; } i=bi; j=bj; while (++j<8 && --i>=0) { if (board[i][j]=='.') continue; if (board[i][j]=='Q' || board[i][j]=='B') return 2; else break; } i=bi; j=bj; while (++j<8 && ++i<8) { if (board[i][j]=='.') continue; if (board[i][j]=='Q' || board[i][j]=='B') return 2; else break; } i=bi+1; j=bj; if (i<8) { if (j-1>=0 && board[i][j-1]=='P') return 2; if (j+1<8 && board[i][j+1]=='P') return 2; } i--; if (i-2>=0) { if (j-1>=0 && board[i-2][j-1]=='N') return 2; if (j+1<8 && board[i-2][j+1]=='N') return 2; } if (i+2<8) { if (j-1>=0 && board[i+2][j-1]=='N') return 2; if (j+1<8 && board[i+2][j+1]=='N') return 2; } if (j-2>=0) { if (i-1>=0 && board[i-1][j-2]=='N') return 2; if (i+1<8 && board[i+1][j-2]=='N') return 2; } if (j+2<8) { if (i-1>=0 && board[i-1][j+2]=='N') return 2; if (i+1<8 && board[i+1][j+2]=='N') return 2; } return 0; } int main() { int test=1; while (1) { for (int i=0;i<8;i++) scanf("%s",board[i]); int wi,wj,bi,bj,blank=0; for (int i=0;i<8;i++) for (int j=0;j<8;j++) { if (board[i][j]=='.') blank++; else if (board[i][j]=='K') { wi=i; wj=j; } else if (board[i][j]=='k') { bi=i; bj=j; } } if (blank==64) break; int c=check(wi,wj,bi,bj); if (c==1) printf("Game #%d: white king is in check.\n",test++); else if (c==2) printf("Game #%d: black king is in check.\n",test++); else printf("Game #%d: no king is in check.\n",test++); } return 0; }
Friday, May 13, 2016
Published May 13, 2016 by Sourav Chowdhury with 0 comment
Tuesday, May 3, 2016
Published May 03, 2016 by Sourav Chowdhury with 0 comment
#include<cstdio> #include<string.h> using namespace std; int main() { char s[100000]; int t,a[95]; memset(a,0,sizeof(a)); scanf("%d",&t); getchar(); while (t--) { gets(s); int l=strlen(s); for (int i=0;i<l;i++) { if (s[i]>64 && s[i]<91) a[s[i]]++; else if (s[i]>96 &&s[i]<123) a[s[i]-32]++; } } for (int i=0;i<26;i++) { int max=0; for (int j=65;j<91;j++) if (max<a[j]) max=a[j]; if (max==0) break; for (int j=65;j<91;j++) { if (max==a[j]) { printf("%c %d\n",j,max); a[j]=0; } } } return 0; }
Monday, May 2, 2016
Published May 02, 2016 by Sourav Chowdhury with 1 comment
#include<cstdio> #include<string.h> using namespace std; int main() { char s[100000]; int a[125]; while (gets(s)) { memset(a,0,sizeof(a)); int l=strlen(s); for (int i=0;i<l;i++) { if ((s[i]>64 && s[i]<91) || (s[i]>96 &&s[i]<123)) a[s[i]]++; } int max=0; for (int i=65;i<123;i++) if (max<a[i]) max=a[i]; for (int i=65;i<123;i++) if (a[i]==max) printf("%c",i); printf(" %d\n",max); } return 0; }
Published May 02, 2016 by Sourav Chowdhury with 0 comment
#include<cstdio> using namespace std; int ones(int n) { int cnt=0; while (n) { if (n%2==1) cnt++; n/=2; } return cnt; } int hex_to_dec(int n) { int temp=0,t=1; while (n) { temp+=(n%10)*t; t*=16; n/=10; } return temp; } int main() { int t,n,b1,b2; scanf("%d",&t); while (t--) { scanf("%d",&n); b1=ones(n); n=hex_to_dec(n); b2=ones(n); printf("%d %d\n",b1,b2); } return 0; }
Published May 02, 2016 by Sourav Chowdhury with 0 comment
#include<cstdio> #include<vector> using namespace std; #define MX 1000005 int main() { int size, query,b; while (scanf("%d%d",&size,&query)!=EOF) { vector <int> arr[MX]; for (int i=1;i<=size;i++) { scanf("%d",&b); arr[b].push_back(i); } while (query--) { int occur,value; scanf("%d%d",&occur,&value); if (occur>arr[value].size()) printf("0\n"); else printf("%d\n",arr[value][occur-1]); } } return 0; }
Sunday, May 1, 2016
Published May 01, 2016 by Sourav Chowdhury with 0 comment
#include<cstdio> using namespace std; int main() { int x1,x2,y1,y2; while (scanf("%d%d%d%d",&x1,&y1,&x2,&y2)==4) { if (!x1 && !x2 && !y1 && !y2) break; int delx=x1-x2; int dely=y1-y2; if (delx<0) delx*=-1; if (dely<0) dely*=-1; if (x1==x2 && y1==y2) printf("0\n"); else if (delx==dely || x1==x2||y1==y2 ) printf("1\n"); else printf("2\n"); } return 0; }
Published May 01, 2016 by Sourav Chowdhury with 0 comment
#include<stdio.h> #include<math.h> #define pi acos(-1) int main() { double a; while (scanf("%lf",&a)!=EOF) { double x,y,z,a2; a2=a*a; z=(a2*(12-2*pi-3*sqrt(3)))/3.0; y=(a2*(pi+6*sqrt(3)-12))/3.0; x=a2-y-z; printf("%.3lf %.3lf %.3lf\n",x,y,z); } return 0; }
Subscribe to:
Posts (Atom)
