## Search found 131 matches

- Tue Oct 14, 2003 2:08 pm
- Forum: Volume 1 (100-199)
- Topic: 127 - "Accordian" Patience
- Replies:
**83** - Views:
**9272**

### 127 Accordian Patience - help

Hello. I need help to understand moves. AC 2C 3C 4C 5C 6C 7C 8C 9C TC JC QC KC AD 2D 3D 4D 5D 6D 7D 8D TD 9D JD QD KD AH 2H 3H 4H 5H 6H 7H 8H 9H KH 6S QH TH AS 2S 3S 4S 5S JH 7S 8S 9S TS JS QS KS # How we can get from here 1 pile remaining: 52 Can you show me how to play first and what to do then? I...

- Tue Oct 14, 2003 2:05 pm
- Forum: Volume 1 (100-199)
- Topic: 138 - Street Numbers
- Replies:
**93** - Views:
**7043**

Here is a part of my AC code:
That is all. I thought if you talk about formulas or something like, here is my formula. Hope it helps to get that works.

Code: Select all

```
begin
x:=x*6-a[i-2];
a[i]:=x;
s:=s+a[i-1];
writeln(x:10,x+2*s:10);
end;
```

- Sun Oct 12, 2003 9:30 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10573 - Geometry Paradox
- Replies:
**33** - Views:
**11910**

r1^2+2*r1*r2+r2^2=r1^2-2*r1*r2+r2^2+t^2/4 2*r1*r2=t^2/8 2*pi*r1*r2=pi*t*t/8 = gray area This problem took me nearly 2 or 3 hours and I tried everything, even if t will be diameter of the largest circle and got same formula. But I could not get accepted. Of course problems were in my programs. And th...

- Sun Oct 12, 2003 6:20 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10573 - Geometry Paradox
- Replies:
**33** - Views:
**11910**

I cannot agree with people who agree with problemsetter of this problem or judge who thinks that he is correct. Picture 1: http://faridar.sayt.ws/circle1.gif Picture 2: http://faridar.sayt.ws/circle2.gif You see this two pictures. t is same in both of this pictures. And there are infinite circles th...

- Sun Oct 12, 2003 3:35 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10573 - Geometry Paradox
- Replies:
**33** - Views:
**11910**

Thank you very much. But there was nothing said about it in problem statement. If given only t then r1 and r2 can get any value. So I am not sure about that, and I don't agree with that. If we cannot say anything about the gray area, it means "Impossible.". You can say it only if there is something ...

- Sun Oct 12, 2003 12:43 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10573 - Geometry Paradox
- Replies:
**33** - Views:
**11910**

### 10573 - Geometry Paradox

Hi. I could not solve it at contest. I always got WA. There were 236 AC. I don't know what was wrong. I tried nearly everything. I submitted it 20 times. Algo is simple: If there are two numbers the the gray area is 2*Pi*r1*r2, if there is one number t then it is not possible to find gray are and I ...

- Sat Oct 11, 2003 11:50 am
- Forum: Volume 1 (100-199)
- Topic: 189 - Pascal Program Lengths
- Replies:
**12** - Views:
**2431**

Hi .. I haven't solved this problem yet. But I think you are counting wrong. 1 2 PROGRAM SAMPLEINPUT; 3 VAR 4 5 TEMP : RECORD 6 7 8 FIRST, SECOND : REAL; 9 END; 10 BEGIN {Ignore this } 11 12 13 14 TEMP.FIRST := 5.0E-2; 15 16 17 18 READLN ( TEMP.SECOND); 19 20 21 22 23 24 25 26 27 28 WRITELN ( 'THE A...

- Sat Oct 11, 2003 11:27 am
- Forum: Volume 1 (100-199)
- Topic: 114 - Simulation Wizardry
- Replies:
**80** - Views:
**7558**

### 114 Simulation Wizardry - need help

Hi. I simulate this game with sample inputs and can't get correct answers. I cannot understand the problem statement. Can anyone help to simulate this postion? 5|wwwww 4|w w 3|w b w 2|wb +w 1|wwwww ----- 12345 w - wall b - bumper + - ball lifetime of the ball is 10 and direction is 3 (down) Please s...

- Fri Oct 10, 2003 4:05 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10566 - Crossed Ladders
- Replies:
**39** - Views:
**11648**

- Thu Oct 09, 2003 8:54 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10566 - Crossed Ladders
- Replies:
**39** - Views:
**11648**

- Thu Oct 09, 2003 3:33 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10557 - XYZZY
- Replies:
**31** - Views:
**14705**

- Thu Oct 09, 2003 12:22 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10566 - Crossed Ladders
- Replies:
**39** - Views:
**11648**

- Sat Oct 04, 2003 5:30 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10557 - XYZZY
- Replies:
**31** - Views:
**14705**

gvcormac what do you mean? connected is initialized as, if there is a door from this room to other then connected[this room, other room]:=true; And it corresponds to the problem statement I think. What is not OK? Why I get WA? Isn't my algo right. Can anyone give example where I am wrong. Thanx in a...

- Sat Oct 04, 2003 1:03 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10557 - XYZZY
- Replies:
**31** - Views:
**14705**

Thank you for your help. I used it. I am sure about negatives. My floyd is: [pascal]for k:=1 to n do for i:=1 to n do for j:=1 to n do if connected[i,k] and connected[k,j] then begin if not connected[i,j] then begin d[i,j]:=d[i,k]+d[k,j]; connected[i,j]:=true; end else begin if d[i,j]<d[i,k]+d[k,j] ...

- Sat Oct 04, 2003 11:42 am
- Forum: Volume 105 (10500-10599)
- Topic: 10557 - XYZZY
- Replies:
**31** - Views:
**14705**

### 10557 - XYZZY

Hi people. I get WA. My algo is so: First I build graph where g[i,j] = energy[j] (energy of the second room) The I run Floyd algo and find maximal energy (weight) between all rooms. If there is cycle where energy>0 then we can always win: if g[i,i]>0; we can always win because we can continue cyclin...