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

    Can you give me a hint about TEST#27?I have been checked my program for 2 days.And I can't find what's wrong with my program.I'm crazy!
  Here is my program:
  program puzzle;
const
  maxn=410;
var
  d,f:array [0..maxn,0..maxn] of longint;
  b,e,s,a:array [0..maxn] of longint;
  t,vis:array [0..maxn] of boolean;
  ch:array [0..maxn] of char;
  i,j,p,k,l,m,n:longint;
procedure init;
  begin
    read(n,m);
    for i:=1 to m do read(a[i]);readln;
    for i:=1 to n do
      begin
        repeat
         read(ch[i]);
        until ch[i] in ['?','X','.'];
      end;
    readln;
  end;
procedure solve;
  begin
    for i:=1 to n do
      begin
        s[i]:=s[i-1];
        if ch[i]='X' then inc(s[i]);
      end;
    fillchar(d,sizeof(d),-$3f);
    d[n+1,m+1]:=0;
    k:=n;
    for i:=n downto 1 do
      begin
        for j:=m+1 downto 1 do
          begin
            d[i,j]:=d[i+1,j];
            if (j=m+1) or (i+a[j]-1>n) or (ch[i]='.') then continue;
            if i+a[j]+1>n then l:=n+1 else l:=i+a[j]+1;
            if (i+a[j]-1<=k) and (d[l,j+1]>=0) and (d[l,j+1]+s[i+a[j]-1]-s[i-1]>d[i,j])
              then d[i,j]:=d[l,j+1]+s[i+a[j]-1]-s[i-1];
          end;
        if ch[i]='.' then k:=i-1;
      end;
    if d[1,1]<>s[n] then begin writeln('Impossible');exit; end;
    fillchar(f,sizeof(f),-$3f);
    f[0,0]:=0;
    k:=1;
    for i:=1 to n do
      begin
        for j:=0 to m do
          begin
            f[i,j]:=f[i-1,j];
            if (j=0) or (i<a[j]) or (ch[i]='.') then continue;
            if i-a[j]-1<1 then l:=0 else l:=i-a[j]-1;
            if (i-a[j]+1>=k) and (f[l,j-1]>=0) and (f[l,j-1]+s[i]-s[i-a[j]]>f[i,j])
              then f[i,j]:=f[l,j-1]+s[i]-s[i-a[j]];
          end;
        if ch[i]='.' then k:=i+1;
      end;
    fillchar(vis,sizeof(vis),false);
    fillchar(t,sizeof(t),false);
    fillchar(b,sizeof(b),255);
    p:=0;
    for i:=1 to n do
      begin
        if ch[i]='.' then begin p:=i;continue; end;
        for j:=1 to m do
          begin
            if i-a[j]+1<=p then continue;
            if i+2<=n then k:=d[i+2,j+1] else begin if j<m then continue;k:=0; end;
            if i-a[j]-1>0 then inc(k,f[i-a[j]-1,j-1]) else begin if j>1 then continue; end;
            if s[i]-s[i-a[j]]+k=s[n]
              then begin
                     for l:=i-a[j]+1 to i do t[l]:=true;
                     if b[j]=-1
                       then begin
                              b[j]:=i-a[j]+1;e[j]:=i;
                              continue;
                            end;
                     if e[j]<i-a[j]+1
                       then begin
                              b[j]:=i-a[j]+1;e[j]:=i;
                              vis[j]:=true;
                            end;
                     if vis[j] then continue;
                     b[j]:=i-a[j]+1;
                   end;
          end;
      end;
    for i:=1 to n do if not t[i] and (ch[i]='?') then ch[i]:='.';
    for i:=1 to m do
      begin
        if vis[i] then continue;
        for j:=b[i] to e[i] do ch[j]:='X';
      end;
    for i:=1 to n do write(ch[i]);writeln;
  end;
begin
  assign(input,'puzzle.in');reset(input);
  assign(output,'puzzle.out');rewrite(output);
  init;
  solve;
  close(input);close(output);
end.

At last.Sorry for my poor English.

I used greed, is the result of the test data right ?

7
2 3 0
3 1 0
1 2 4 5 0
3 0
3 0
7 0
6 0


4
1 2 3 7

if the result is wrong , please give some hint.....  thanks

who give AC, please, give me right answers for this tests :
1) 1 200 245
2) 0 13 131
3) 37 39 41
4) 29 41 97
5) 0 64 129
6) 81 27 243
7) 240 241 242

thanx

Edited by author 14.08.2008 21:51

Any Hint?

Tell me, please, what is the Output for
1) N=4
2) N=10
3) N=3^m (For example, N=27)

Please, help...
Thanks a lot.

Can somebody say me, what is in test 10? I don't know, why i got WA...

Hi,

My answer to the problem 1002 was having "time limit exceeded" problem and sent for test#5.

Can I get the test cases on which you are judging our answers
so that I can check if my program is working fine with these
cases or what error is coming ???