Problem 1248 disappeared from my list of solved problems, but didn't appear in the list of unsolved problems.

vector<set<int> >


and if WA 5 then test this:
9
1 2 3 4 5 6 7 8

and

10
1 2 3 4 5 6 7 8 9

Hi, could you please tell me what was the response of my program to the first test since it gives me a "Wrong Answer"?

Any1 could give me details about it? No idea wheres my mistake

answer of 9*9 is 88.87005769. Is it right?

Edited by author 30.10.2008 07:13

Можно как-нибудь исправить эту ошибку?

I always Wa on test#11.But does there anyone know why?

Edited by author 31.12.2009 14:07

how do i find the number of N/2 digit combinations in which sum of digits equals to default M?
ps: M starts from 1 to (N/2)*9; every time i need to calculate the current previously number of combinations

Program ff;
Var a,b:integer;
Begin
Readln(a);
Readln(b);
if (b-a) mod 2=0
then Writeln((b-a)/2)
else Writeln((b-a) div 2+1);
end.

Why WA#8?

I got WA at test18, can somebody give some test or hint, please?

It could be proven that for n != 4 there is always 'NO' answer.
Is it right for each test?

i've got memory limit on test #3 what can i do???
i use array of int64[1..200000]

Edited by author 11.04.2010 19:24

Edited by author 11.04.2010 19:41

When I wrote my first version, I had TLE#13.
I optimize it - Crash#13.
Help me with tests or hints. Please.
Thanks.

Edited by author 10.05.2006 20:37

what's wrong?
program t1688;
var
  h:array [1..3000] of int64;
  a,p:int64;
  n,m:int64;
  b,i,j:longint;
begin
  readln(a,b);
  for i:=1 to b do
    readln(h[i]);
  for i:=1 to b-1 do
    for j:=b downto i+1 do
    begin
      if h[i]>h[j] then
      begin
        p:=h[i];
        h[i]:=h[j];
        h[j]:=p;
      end;
    end;

  for i:=1 to b do
  begin
    m:=m+h[i];
    if a*3<m then inc(n);
  end;
  if n=0 then writeln('Team.GOV!')
  else writeln('Free after ',b-n,' times.');
end.



Edited by author 16.04.2010 11:37

Any help?

problem solved
Edited by author 13.04.2010 14:37

Edited by author 13.04.2010 14:37

I got WA6 in this case:
if (inc1 == inc2) {
    cout << labs(cr2x - cr1x) + labs(cr2y - cr1y);
    return;
}
cout << max(labs(cr2x - cr1x), labs(cr2y - cr1y));

but I got AC in this case:
if (inc1 == inc2) {
    cout << (cr2x - cr1x) + labs(cr2y - cr1y);
    return;
}
cout << max(labs(cr2x - cr1x), labs(cr2y - cr1y));

and in this case:
if (inc1 == inc2) {
    cout << labs(cr2x - cr1x) + (cr2y - cr1y);
    return;
}
cout << max(labs(cr2x - cr1x), labs(cr2y - cr1y));

and in this:
if (inc1 == inc2) {
    cout << (cr2x - cr1x) + (cr2y - cr1y);
    return;
}
cout << max(labs(cr2x - cr1x), labs(cr2y - cr1y));

p.s. cr1x, cr1y, cr2x, cr2y is long long, (cr2x - cr1x)>=0 and (cr2y - cr1y)>=0 always, but why in this case does not labs() work correctly ?

0.001 142 КБ

let a[i] stand for the member of party i;
sort it to make a[1]<a[2]<...<a[n]
for i:=1 to (k+1) div 2 do inc(answer,(a[i]+1) div 2);
the answer is sure to be the best one.