I use java BigInteger and get WA#7
I use formula f(n,k)=f(n-1,k)+f(n-1,k-1)+...+f(n-1,k-9)
if you see it is wrong,please help

Edited by author 25.01.2009 13:43

Как их считать? пробую
for i:=1 to n do begin
for i:=1 to о do
read(a[i,j]);
readln;
end; - зацикливается, пробую:
for i:=1 to n do begin
for i:=1 to о do
read(a[i,j]);
writeln;
end; - не проходит 1 тест (из-за лишних переводов строки в исходных данных) =((

Please ask anybody? why can be wrong answer on the first test?

Почему не даются исходные данные данные хотя бы для 5 тестов??? Для самопроверки.

a vse cifri daljni bit nepovtorimimi ili mojno povtarit???

#include <cstdlib>
#include <iostream>


using namespace std;
struct xxx{
       char x[30];
       }A[100];

int main()
{int n,i,j,k=0;
   cin>>n;
   fflush(stdin);
   for (i=0;i<n;i++)
   cin.getline(A[i].x,30);

   for(i=0;i<(n-1);i++)
   if (strcmp(A[i].x,"")){
   for(j=i+1;j<n;j++)
   if (!strcmp(A[i].x,A[j].x)) {if(k==0){cout<<A[i].x;k++;} else cout<<endl<<A[i].x; for(j;j<n;j++) if(!strcmp(A[i].x,A[j].x)) strcpy(A[j].x,""); } }

   return 0;

}

I always think about this.

My code:

Program t1116;

Const MaxN=15000;

Type Kusok=record A,B,Y :integer end;

Var F1,F2,F      :array[1..MaxN]of Kusok;
    n1,n2,i,j,n  :integer;
    j1,j2,i2     :integer;

begin
read(n1);for i:=1 to n1 do read(f1[i].a,f1[i].b,f1[i].y);
read(n2);for i:=1 to n2 do read(f2[i].a,f2[i].b,f2[i].y);
n:=0;
j1:=1;
j2:=1;
for j1:=1 to n1 do begin
 for i2:=j2 to n2 do begin
  if f1[j1].b<f2[i2].a then break;
  if (f1[j1].a<f2[i2].a)and(f1[j1].b>f2[i2].b) then begin
    n:=n+1;
    f[n].a:=f1[j1].a;
    f[n].b:=f2[i2].a;
    f[n].y:=f1[j1].y;
    f1[j1].b:=f2[i2].b;
   end else
  if (f1[j1].a<f2[i2].a)and(f1[j1].b<f2[i2].b) then begin
    n:=n+1;
    f[n].a:=f1[j1].a;
    f[n].b:=f2[i2].a;
    f[n].y:=f1[j1].y;
    f1[j1].a:=f1[j1].b;
    break;
   end else
  if (f1[j1].a>f2[i2].a)and(f1[j1].b<f2[i2].b) then begin
    f1[j1].a:=f1[j1].b;
    break;
   end else
  if (f1[j1].a>f2[i2].a)and(f1[j1].b>f2[i2].b) then begin
   f1[j1].a:=f2[i2].b;
  end;
 end;
 j2:=i2;
 if f1[j1].a<>f1[j1].b then begin
  n:=n+1;
  f[n]:=f1[j1];
 end;
end;
write(n,' ');
for i:=1 to n do write(f[i].a,' ',f[i].b,' ',f[i].y,' ');
writeln;
end.

They added new tests and...
[SPbSU ITMO] WiNGeR aced in Java...
But I think it's unfair to be too strict with such a NPC problem

Edited by author 16.10.2009 11:39

check http://www.timustests.lx.ro/ for many tests!

Edited by author 16.10.2009 05:03

it's very important for understanding the condition!

Edited by author 29.10.2008 10:05

Edited by author 17.10.2009 01:44

Why do i get WA #13?
Help me!
Thanks!

Edited by author 24.08.2007 18:48

[code deleted]

My program give right answers on all tests in this forum, but I have WA on test #2 :) Why ? :)

Edited by moderator 22.02.2006 22:12