I searched squares starting from each corner. This got me AC.
Here is a test for which my program fails:

5
1 1 4
1 1 2
1 4 2
4 1 2
4 4 2

You will notice that if you try to reconstruct the squares
starting from the corner images (the way my implementation
does), you will find the small squares of width 2 but not
the larger one (whose corners have been completely hidden).
However, the edges of the larger square will have remained
uncovered by that solution.

You might want to consider adding a similar test
to the test data.

I tested my code with many test cases and it always worked (even with N=1 - answer is 0).
But when I submit the solution I always get WA on first test case. And I don't know why.

Can I get the first test case so I can find out why my code doesn't work?

I used Dev-C++ environment and C language (not C++).

Edited by author 05.04.2009 16:46

All printable nonspace & non-letter characters?

Why in sample output last line has only 0's???

Why on the 1 test the corect answer is not 2 2 3

Could someone give some useful tests for this problem? My code seems to give good output for all tests posted here, but i still get WA #3.

Give me some test, please. I thought out many tests, but my program always gives right answers. I need test for WRONG ANSWER!!!

Edited by author 18.01.2009 15:26

I have Wrong Answer 14.
I am testing my program nearly 2 hours and I can't find mistake.
who had WA14 please tell me what kind of test is it?
please help









huh I got AC. very silly mistake :((


Edited by author 24.02.2007 01:11

var
 a:array[1..10000]of integer;
 m,n,k,i,j:integer;

begin
 fillchar(a,sizeof(a),0);
 readln(m,n,k);
 for i:=k+1 to 10000 do
  begin
   for j:=1 to trunc(sqrt(i)) do
    if i mod j=0 then a[i]:=a[i]+1;
   if (a[i]=n)and(a[i-k]=m) then begin writeln(i);halt;end;
  end;
end.

Why I have WA #8? I think my program isn't wrong. Some test data can you give me?
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#include<string>
using namespace std;
string sub(string a,string b)
{
int c=max(a.length(),b.length());
string s1(c-a.length(),'0'),s2(c-b.length(),'0');
s1+=a;s2+=b;
int naum=0;string s3;for(int i=c-1;i>=0;i--)
{
s3+=(s1[i]+s2[i]-96+naum)%10+'0';
naum=(s1[i]+s2[i]-96+naum)/10;
}
if(naum)s3+=naum+'0';
reverse(s3.begin(),s3.end());
return s3;
}
string umn(string a,int b)
{
int naum=0;
string c;
for(int i=a.length()-1;i>=0;i--)
        {
        c+=((a[i]-'0')*b+naum)%10+'0';
        naum=((a[i]-'0')*b+naum)/10;
        }
if(naum)c+=naum+'0';
reverse(c.begin(),c.end());
return c;
}
string umn1(string a,string b)
{
string c="0";
for(int i=0;i<b.length();i++)
        {
        string e(b.length()-i-1,'0');
        c=sub(c,umn(a,b[i]-'0')+e);
        }
return c;
}
string razl(string a,string b)
{
int c=max(a.length(),b.length());
string s1(c-a.length(),'0'),s2(c-b.length(),'0');s1+=a;s2+=b;
int naum=0;
string s3;
for(int i=s1.length()-1;i>=0;i--)
{
int a=s1[i]-s2[i];
if(naum){a--;naum=0;}
if(a<0){naum=1;a+=10;}
s3+=a+'0';
}
reverse(s3.begin(),s3.end());
while(s3[0]=='0'&&s3.length()>1)s3.erase(0,1);
return s3;
}
string int_to_str(int n)
{
       string s;
       while(n){s+=n%10+'0';n/=10;}
       reverse(s.begin(),s.end());
       return s;
}
int cmp(string a,string b){
if(a==b||a.length()<b.length()||(a.length()==b.length()&&a<b))return 1;
return 0;
}
int main()
{
/*
cout<<sub("112","33")<<endl;
cout<<razl("112","33")<<endl;
cout<<umn1("112","33")<<endl;
*/
string s;
cin>>s;
if(s=="0"){cout<<0<<endl;return 0;}
s=umn(s,2);
string res;
vector<string>a;
int j=0;
if(s.length()%2==1)
{
j=1;
string m;m+=s[0];
a.push_back(m);
}
for(int i=j;i<s.length();i+=2)
a.push_back(s.substr(i,2));
int x;
if(a[0].size()==1)x=a[0][0]-'0';else x=a[0][0]*10+a[0][1]-528;
double m=sqrt((double)(x));
int n=(int)(m);
res=int_to_str(n);
int q=x-n*n;
string f;
f=int_to_str(q);
for(int k=1;k<a.size();k++)
{
string y=res;
int l;
y=umn(y,2);
f+=a[k];
//cout<<f<<endl;
string j[20];
if(f[0]=='0'){res+="0";continue;}
char c='0';
j[0]=umn(y+c,c-'0');
//cout<<j[0]<<endl;
c='1';
j[1]=umn(y+c,c-'0');
//cout<<j[1]<<endl;
if(cmp(j[0],f)==1&&cmp(j[1],f)==0)
{res+="0";l=0;}
for(int i=2;i<=9;i++)
{
c=i+'0';
j[i]=umn(y+c,i);
//cout<<j[i]<<endl;
if(cmp(j[i-1],f)==1&&cmp(j[i],f)==0){res+=i-1+'0';l=i-1;break;}
}
if(res.length()!=k+1){res+="9";l=9;}
f=razl(f,j[l]);
}
cout<<res<<endl;
system("pause");return 0;
}

    I got WA#29 so many times.
    I can't find the mistakes from my program.
    By the way,is that something wrong with my "reading" part?
    Here is my reaing part:
    procedure init;
  begin
    readln(m);
    for i:=1 to m do
      begin
        read(ch);
        a[i]:=ord(ch);
      end;
    readln;
  end;

#include <iostream>
using namespace std;
int n,i, j=0,s=0; int*x,*y,*a;
int main()
{
cin>>n;
x=new int[n]; y=new int[n]; a=new int[n];
for(i=0; i<n; i++) a[i]=0;
for(i=0; i<n; i++) cin>>x[i]>>y[i];
while(j<n) { s=0;
 for(i=0; i<j; i++) { if(x[i]<=x[j]) s++; }
a[s]++; j++; }
for(i=0; i<n; i++) cout<<a[i]<<endl;
delete []x;  delete []y; delete []a;
return 0; }
tl#13

Before sending solution, just test it on this examples.
1) 23.42 01.14
   08.10 17.51
Answer: 4
2) 01.01 10.59
   04.23 04.22
Answer: 5
3) 12.00 15.00
   01.02 03.07
Answer: 0
4) 23.58 00.43
   22.27 03.10
Answer: 2
5) 12.00 15.00
   20.00 21.00
Answer: 1
6) 01.01 21.59
   04.23 11.22
Answer: 5

;)

My program Wa3
This is my program:
program Ural683;

var
  a,m,n:longint;
  k:array[0..50]of longint;

begin
  readln(n);
  m:=1;
  k[0]:=n;
  while k[m-1]<>0 do
    begin
      k[m]:=k[m-1]shr 1;
      inc(m);
    end;
  m:=0;
  a:=1;
  while a<n do
    begin
      inc(m);a:=a shl 1;
    end;
  writeln(m);
  for a:=1 to m do
    if k[a]=0 then write(1,' ')
    else write(k[a],' ');
end.
Who can help me?

Edited by author 02.04.2009 14:18

Can someone please help me with test case #3. I get WA on it, but my solution passes all test cases I made. :\

My program works on sample input and all inputs given in discussion forum. But I am getting WA3. Can anybody please give me direction or this test case?

Why does N == 0 in test 2
?
An input contains an integer N (2 ≤ N ≤ 200) ...

One blogger can mark another as his friend more than once. Of course, you should print his name in the list of friends only once.
Good luck!

I believe that after some simplifications can be obtained even faster code