OJ Board

I don't know whether I am right or wrong but I think the judge test case has a mistake. as example consider the following test case:

1
10
3 0
2 1
-2 1
-1 0
-2 -1
-1 -3
-2 -4
2 -4
3 -3
2 -1

according to problem description I think this case should output "No". But probably in judge test case this ...

@ashugoyal::: It's about 3 years since you posted :( . I think you dont need this help anymore. :) I just solved the problem right now. But I m posting it in case if
anyone need it(hopefully not :wink: ).

1. At first you have to find the smallest grid to have the map. So certainly you have to ...

I just can't understand what can be the reason of WA here.
Its a simple code but WA. :-(
anybody can help me??
Here is my code

#include <iostream>
#include <cstring>
using namespace std;

int c;

char* calculate(int n)
{
int i = 0,j;
c = 0;
char bin[50];

if(n%2) c++;
bin[i++] = (n%2)+48;
n ...