Edited by author 29.12.2011 01:34

Why are these(n div k)*n+(n div k)*(n mod k), n*n div k not right?

Show me my mistake.

Thanks a lot.

What is test? or can you give me test, that make wrong answer?
http://codepad.org/3aSMvLzG

Edited by author 08.11.2011 04:55

Has anybody had wa24? I have no idea, what it can be...

I have another problem...
What If the cemetery is m*n
and coffin is k*l...
What is the correct formula?
The 1255 Problem I've done,
but this I cann't do...
Help me, I need it...

Hi, i'm trying to solve the A+B problem, and it works on my computer. But the compiler of this site doesn't accept my solution. It says "Compilation error" :

"11e2cd04-2636-421c-9639-3a45ac221379
11e2cd04-2636-421c-9639-3a45ac221379(4) : error C4430: missing type specifier - int assumed. Note: C++ does not support default-int"

here is my program:

#include <iostream>
using namespace std;

main () {
     long a,b;
     cin >> a;
     cin >> b;
     cout << a+b;
 };
 Where did I do mistakes?
Thank you for attention.

1075 with same algorithm have got AC.
Can somebody help me? I need some tests or hints...

Is this test correct?

1000 0 0 0 0 0 0 0
-1000 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0
999

answer:
3138.51

#include<stdio.h>
void main()
{int Ai,i=0;
do{
scanf("%d",&Ai);
i++;
for(; ;i--)
printf("%d\n",Ai);
}while(Ai>=0&&Ai<=10^18);
}
i think it's right

Edited by author 07.11.2011 11:10

Edited by author 07.11.2011 11:10

Edited by author 07.11.2011 11:12
but it keeps running

Edited by author 07.11.2011 11:13

New tricky test was added, and all AC submissions were rejudged. 96 authors lost AC.

I used eps=0, eps=1e-10,1e-9,1e-8,1e-7, but #45 is wrong with each eps((

Edited by author 06.11.2011 20:58

Somebody, give me the test4, please!

1.find out the equtaion, to get next location of new character after rotation each time.
2.sort the locations on basis of height.
3. print the characters on those locations.

All the best.

Regards
Anupam

Edited by author 06.11.2011 04:53

It's my program:

{$N+}
Program p1111;

Type
  TPoint=Record
           x,y:Double;
         End;

Var
  Point:Array[1..100,1..2] Of TPoint;
  Len:Array[1..100] Of Double;
  num:Array[1..100] Of Integer;
  n:Integer;
  po:TPoint;

  Procedure Other(p1,p2:TPoint;Var p3,p4:TPoint);
  Var m,n:Double;
      po:TPoint;
  Begin
    po.x:=(p1.x+p2.x)/2;
    po.y:=(p1.y+p2.y)/2;
    n:=p1.x-po.x;m:=p1.y-po.y;
    p3.x:=m;p3.y:=-n;
    p4.x:=-p3.x;p4.y:=n;
    p3.x:=p3.x+po.x;p3.y:=p3.y+po.y;
    p4.x:=p4.x+po.x;p4.y:=p4.y+po.y;
  End;

  Procedure Init;
  Var
    i:Integer;
  Begin
    {$IFNDEF ONLINE_JUDGE}
    Assign(Input,'1111.Txt');
    Reset(Input);
    {$ENDIF}
    Readln(n);
    For i:=1 To n Do
      Readln(Point[i,1].x,Point[i,1].y,
             Point[i,2].x,Point[i,2].y);
    Readln(po.x,po.y);
  End;

  Procedure Main;
  Var
    i,j,k:Integer;
    p:Array[1..5] Of TPoint;
    u,A,B,C,L1,L2,L3,q1,q2,S:Double;
  Begin
    For i:=1 To n Do
    Begin
      num[i]:=i;
      p[1]:=Point[i,1];
      p[3]:=Point[i,2];
      Other(p[1],p[3],p[2],p[4]);
      p[5]:=p[1];
      L1:=sqr(p[1].x-p[2].x)+sqr(p[1].y-p[2].y);
      If Abs(L1)<1e-14
      Then Begin
             Len[i]:=sqr(po.x-p[1].x)+sqr(po.y-p[1].y);
             Continue;
           End;
      S:=0;
      For j:=1 To 4 Do
      Begin
        q1:=sqrt(sqr(po.x-p[j].x)+sqr(po.y-p[j].y));
        q2:=sqrt(sqr(po.x-p[j+1].x)+sqr(po.y-p[j+1].y));
        u:=(q1+q2+sqrt(L1))/2;
        S:=S+sqrt(u*(u-q1)*(u-q2)*(u-sqrt(L1)));
      End;
      If Abs(S-L1)<1e-14
      Then Begin
             Len[i]:=0;
             Continue;
           End;
      S:=1e300;
      For j:=1 To 4 Do
      Begin
        A:=p[j+1].y-p[j].y;
        B:=p[j].x-p[j+1].x;
        C:=-A*p[j].x-B*p[j].y;
        L2:=sqr(p[j].x-po.x)+sqr(p[j].y-po.y);
        L3:=sqr(p[j+1].x-po.x)+sqr(p[j+1].y-po.y);
        If not((L1+L3-L2<0)or(L1+L2-L3<0))
        Then Begin
               u:=Sqr(A*po.x+B*po.y+C)/(A*A+B*B);
               If u<S
               Then S:=u;
             End;
      End;
      For j:=1 To 4 Do
      Begin
        u:=Sqr(po.x-p[j].x)+Sqr(po.y-p[j].y);
        If u<S
        Then S:=u;
      End;
      Len[i]:=S;
    End;
    For i:=1 To n-1 Do
      For j:=i+1 To n Do
      If Len[i]>Len[j]
      Then Begin
             S:=Len[i];
             Len[i]:=Len[j];
             Len[j]:=s;
             k:=num[i];
             num[i]:=num[j];
             num[j]:=k;
           End;
    For i:=1 To n-1 Do
      Write(num[i],' ');
    Writeln(num[n]);
  End;

Begin
  Init;
  Main;
End.

I've solved this task twice, first under "OZone", then under "OZone2" account. (I've lost their passwords).
Now I am using the same solution (as far as I remember) and get WA #6.
Could anybody give me an idea what aspect of a problem does the test #6 examine?
Or is there is a way to get accounts back without emailing, because both e-mails are dead.

Edited by author 01.07.2009 19:09

Try this test (16th of "9"):
9999999999999999

you should get
99999999,9999

in C++
cout and printf got 100000000.0000

uses
  SysUtils;

procedure RSqrt(k: Integer);
var
  n: real;
  output: real;
begin
    k:=k+1;
    Read(n);
    if n = -1 then exit;
    output:=Sqrt(n);
    if k > 0 then RSqrt(k-1);
    Writeln(output:0:4);
end;

begin
  while not SeekEof do
    RSqrt(0);
end.
//------------------------------------------

Well, can anybody tell me why it doesn't work? Perhaps, because of this

                         if n = -1 then exit;

Please, don't tell me smth like "go on reading FAQ" or "use your 'while not seekeof do'." Can you just explain my mistake in this code? You know, technically, my program is working right!

var
 n,i,j:byte;
 s:array[1..100]of string[31];
begin
readln(n);
for i:=1 to n do
begin
readln(s[i]);
for j:=1 to i-1 do
if s[i]=s[j] then writeln(s[i]);
end;
end.


______________________________
HELP PLZ