Нельзя ли эти ссылки перенести наверх? http://ipicture.ru/uploads/100725/iV1omvzDm4.jpg
Ну ужас как неудобно каждый раз прокручивать страницу вниз. Тем более, если хочешь скрыть все задачи и сортировать по авторам.

Спасибо.

English.
Is it possible to move these link up?
Its very uncomfortable to scroll problems page every time you want to sort by authors and hide already solved tasks.
Thanks!

Edited by author 25.07.2010 12:41

Edited by author 26.07.2010 02:54

I use Gauss
But wa at #9
i tried to mod a bigprime but it doesn't work
Help!
and i want someone AC's code
Please
caocao9926@163.com
Thanks

Who can give me some test to debug WA#2?
I can't found, where is mistake?

Edited by author 23.07.2010 22:46

cannot i use strtoint or inttostr???:(

1. Minimize sum of squares of differences, not sum of absolute values of differences.

2. It is important, that constant AMP (amplitude) is the same for all bits.

3. There is no test with negative amplitude.

type pver=^tver;
     pe=^te;
     te=record
      e:pe;
      ver:pver;
     end;
     tver=record
      s:string;
      e:pe;
     end;
type trec=record
      s:string;
      ver:pver;
     end;
var i,n:word;
    s:string;
    pb,ver:pver;
    fir:boolean;
procedure add(s:string;ver:pver);
var e:pe;
    vt:pver;
begin
 if s='' then exit;
 e:=ver^.e;
 while e<>nil do begin
  if copy(s,1,pos('\',s)-1)=e^.ver^.s then begin
   delete(s,1,pos('\',s));
   add(s,e^.ver);
   exit;
  end;
  e:=e^.e;
 end;
 new(vt);
 vt^.e:=nil;
 if pos('\',s)>0 then vt^.s:=copy(s,1,pos('\',s)-1) else
 vt^.s:=s;
 new(e);
 e^.ver:=vt;
 e^.e:=ver^.e;
 ver^.e:=e;
 if pos('\',s)>0 then begin
  delete(s,1,pos('\',s));
  add(s,vt);
 end;
end;
procedure writ(ver:pver;ur:word);
var a:array [1..600] of trec;
    t:trec;
    kol,u,i:word;
    e:pe;
begin
 kol:=0;
 e:=ver^.e;
 while e<>nil do begin
  inc(kol);
  a[kol].s:=e^.ver^.s;
  a[kol].ver:=e^.ver;
  e:=e^.e;
 end;
 if kol=0 then exit;
 for u:=1 to kol-1 do
 for i:=1 to kol-u do if a[i].s>a[i+1].s then begin
  t:=a[i];
  a[i]:=a[i+1];
  a[i+1]:=t;
 end;
 for i:=1 to kol do begin
{  if not fir then writeln;
  fir:=false;}
  for u:=1 to ur do write(' ');
  writeln(a[i].s);
  writ(a[i].ver,ur+1);
 end;
end;
begin
 new(pb);
 pb^.e:=nil;
 readln(n);
 for i:=1 to n do begin
  readln(s);
  add(s,pb);
 end;
 fir:=true;
 writ(pb,0);
end.

Any ideas?

Double post.
Wrong!
please delete this post.

Edited by author 23.07.2010 02:19

Edited by author 23.07.2010 02:19

Try this:
2 1 2 2 2 3 3
0

Right answer:
2 1 2 2 2 3 3

I had WA, and now I have AC!

Edited by author 01.10.2007 20:17

Edited by author 01.10.2007 20:17

Please, help me with test 2. Can you say me, how much my answer differs from correct answer?

Who can tell me?
I have WA1.
Thanks a lot.

Edited by author 03.05.2009 09:55

Edited by author 03.05.2009 09:56

Edited by moderator 13.05.2009 01:51

with such a large ML?

Edited by author 25.04.2012 19:42

You can consider that the cost of the tunnel is 1, and the bridge is 24000. Then it becomes a MST problem.

use         while (getchar()!='\n');
don't use        scanf("\n");
scanf("\n") not just wait for \n ,it will skip all blank char

Edited by author 11.05.2009 10:57

sort + BigInteger

this algo with O(n*log(n))
but i don't know why WA on Test21, please help me!

[code deleted]

Edited by moderator 24.11.2019 13:39