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

Can anybody expalain me this problem? I think that in both samples answer is YES, because all vertices are next to refuge or to museum.

Edited by author 06.11.2011 01:51

Give test for 3 and 14 please(

please, tell me what input in test 4?

New tests were added, memory limit was increased to 2 MB.
Some people got AC, WA or Crash after MLE, some WA and Crash after AC, some Crash after AC, etc.

When I make my algo work for not connected graphs, i got AC.
(I changed
   dfs(0)
 to
   for(int i=0;i<n;++i)if(!lev[i])dfs(i);
)

Here my solution. In c[x] I store how much I have elements with key x in set. So it is in this range M ≤ N ≤ 25000. But when I set size of c to 25000 I have got Crash on 4 test. What is wrong in my solution?
#include <stdio.h>
#include <vector>
#include <set>
#include <stdlib.h>
#include <algorithm>


int main(){
    /*freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);*/
    int m,b,c[200000],l,r,d;
    std::vector <int> a;
    std::set <int> set;
    std::set <int>::iterator it;
    memset(c,0,sizeof(c));
    scanf("%d",&m);
    scanf("%d",&b);
    while (b!=-1){
        a.push_back(b);
        scanf("%d",&b);
    }
    d=a.size();
    for (int i=0; i<std::min(m,d); i++){
        set.insert(a[i]);
        c[a[i]]++;
    }
    if (m-1<d && m!=0){
        l=0; r=m-1;
        while (r<d-1){
            it=set.end();
            it--;
            printf("%d\n",*it);
            r++;
            c[a[r]]++;
            set.insert(a[r]);
            c[a[l]]--;
            if (c[a[l]]==0) set.erase(a[l]);
            l++;
        }
    }
    if (set.size()>0){
        it=set.end();
        it--;
        printf("%d\n",*it);
    }else{printf("0");}
//    fclose(stdin); fclose(stdout);
}

Please, could you shortly tell me an algo of a introspective
program? In any language:-)

My PIBAS-program consists of 219 letters. Please, if you have shorter, share your program with me!

If you have WA1 on C++, it means that you are doing input not right. In that case I recommend you to decide this problem on Pascal - I haven't problems with input such I have in C++.