Category: ACM

02
Mar
2015

Codeforces 4A: Watermelon

It’s really easy problem..You will enjoy definitely #include<iostream> #include<cstdio> int main() { unsigned int weight,divide; while(scanf(“%u”,&weight)==1){ divide=weight%2;…

02
Mar
2015

To Carry or not to Carry

Dont forget to use format specifier for unsigned int %u #include<iostream> #include<cstdio> int main() { unsigned int a,b,output;…

26
Feb
2015

11559 – Event Planning

By thinking 24 hr++ I have solved this problem.I got guidance from my friend M.H Riyad also..He…

17
Feb
2015

Uva 11498 – Division of Nlogonia

Solution actually simple…You have to think simple here is the cartesian co ordinate link check here then…

17
Feb
2015

Some ICPC related programming techniques in c

Sometimes i feel i have to write those in somewhere so i am writing those techniques here…

16
Feb
2015

uva 11172 – Relational Operator

#include<stdio.h> int main() { int i,t,a,b; scanf(“%d”,&t); for(i=0;i<t;i++){ scanf(“%d %d”,&a,&b); if(a<b) printf(“<\n”); else if(a>b) printf(“>\n”); else printf(“=\n”);…