Codeforces Round #379 (Div. 2), problem: (D) Anton and Chess Solution in C

By | 2017-04-07T22:11:50+00:00 November 16th, 2016|Categories: C/C++, Programming|Tags: , , , , , , , , |

Hey guys I just tried the Anton and Chess problem , hope you might like my solution feel free to comment better solution . #include #include typedef unsigned u; u F(u a,u b){return(b>=a)+(b>a);} char C[3][3],c[3];u D[3][3]; int main() { u q,x,y,a,b,dx,dy,dz,i,j; for(i=-1;++i

Codeforces Round #378 (Div. 2), problem: (D) Kostya the Sculptor Solution In C

By | 2017-04-07T22:11:50+00:00 November 1st, 2016|Categories: C/C++, Programming|Tags: , , , , , , , , , , , |

#include #include #define N 100000 #define M 1000000007 #define MIN(A, B) ((A) < (B) ? (A) : (B)) int i1, i2, k; double max; struct item { int i, a, b, c; struct item *next; } *ht[N]; int hash(int a, int b) { long [...]