Common Board @ Timus Online Judge

pera-zdera stupid but works :) [3] // Problem 1084. Goat in the Garden 27 Sep 2005 13:44

#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <cstdlib>
#include <math.h>
#define PI 3.141592653589793238462643383279502884197169399375
using namespace std;
int main(int argc, char** argv){
    double a, l, angle = 0.0;
    cin >> a >> l;
    if (l <= (a/2.0))
        printf("%0.3f", (l*l*PI));
    else if (l >= (a*sqrt(2.0)/2.0))
        printf("%0.3f", (a*a));
    else {
        while (l*cos(angle) > (a/2.0)) angle += 0.0000001;
        printf("%0.3f", 4.0*((a/2.0)*l*sin(angle)+(l*l*(PI/4.0-angle))));
    }
}

Cyclops Re: stupid but works :) [2] // Problem 1084. Goat in the Garden 2 Dec 2008 00:04

please explain :

else {
while (l*cos(angle) > (a/2.0)) angle += 0.0000001;
printf("%0.3f", 4.0*((a/2.0)*l*sin(angle)+(l*l*(PI/4.0-angle))));
}

i don't understand with your way of thinking to get that calculation..
please explain to me..

Imran Yusubov to Cyclops [1] // Problem 1084. Goat in the Garden 7 Aug 2009 12:19

His solution is not stupid instead it is great I tried with mathematic way to find l to the point where the circle crosess the rect but every time i got WA.

l*cos(angle) -that means the length to the point where the circle crosses the rect-s side.At the begining it is equals to r but as we increase angel the cos(angel) decreases the value and we find the exact length.
and here ("%0.3f", 4.0*((a/2.0)*l*sin(angle) we find the are of triangles and add the are of sectors +(l*l*(PI/4.0-angle))...that is all ..if you don't understand again contact me with the problem name.. imran_yusubov@yahoo.com

Cyclops wrote 2 December 2008 00:04

please explain :

else {
while (l*cos(angle) > (a/2.0)) angle += 0.0000001;
printf("%0.3f", 4.0*((a/2.0)*l*sin(angle)+(l*l*(PI/4.0-angle))));
}

i don't understand with your way of thinking to get that calculation..
please explain to me..

Edited by author 07.08.2009 12:19

Edited by author 07.08.2009 12:20

lightstone Re: to Cyclops // Problem 1084. Goat in the Garden 17 May 2013 03:34

Why woudn`t you just use acos(a/(l*2)) to get an angle? ( its arc cos in the triangle we get there)

|\
| \
| \
|   \ l
|    \
|a/2 \
|      \
|_______\

ranc_dm asdasdasd // Problem 1319. Hotel 16 May 2013 22:06

hliu20 maybe a cornor case to help. // Problem 1029. Ministry 16 May 2013 14:18

AShelyugov What about input/output format? // Problem 1676. Mortal Kombat 16 May 2013 04:59

NUUZ_1 What is the answer if L is odd? [6] // Problem 1920. Titan Ruins: the Infinite Power of Magic 22 Oct 2012 13:31

吕蒙子明 How can I download all my accepted solution?.. [1] 12 May 2013 13:54

Vedernikoff 'Goryinyich' Sergey (HSE: АОП) One test to think about for those who wants to solve it [1] // Problem 1919. Titan Ruins: Transformation of Cylinders 21 Dec 2012 04:36

MOPDOBOPOT Tests [6] // Problem 1493. One Step from Happiness 18 Jan 2009 22:15

Please, give me some tests, i don't know, what wrong in my program(

strider Re: Tests [5] // Problem 1493. One Step from Happiness 19 Jan 2009 06:14

725049 No
725870 No
727870 Yes

MOPDOBOPOT Tests [1] // Problem 1493. One Step from Happiness 16 Feb 2009 19:38

My solution:
***
program lam;
var st,s1,s2,ins: string; e1,e2,k,n2,n1,e,z,q,i: integer;
begin
readln(st);
z:=0;
if st[1]='0' then begin
q:=1;
for i:=2 to 5 do begin
if st[i]='0' then inc(q);
if st[i]<>'0' then break;
end;
end;
val(st,e,k);
n1:=e+1; n2:=e-1;
str(n1,s1); str(n2,s2);
if q=1 then begin
ins:='0'; insert(ins,s1,1);
end;
if q=2 then begin
ins:='00'; insert(ins,s1,1);
end;
if q=3 then begin
ins:='000'; insert(ins,s1,1);
end;
if q=4 then begin
ins:='0000'; insert(ins,s1,1);
end;
if q=5 then begin
ins:='00000'; insert(ins,s1,1);
end;
if q=1 then begin
ins:='0'; insert(ins,s2,1);
end;
if q=2 then begin
ins:='00'; insert(ins,s2,1);
end;
if q=3 then begin
ins:='000'; insert(ins,s2,1);
end;
if q=4 then begin
ins:='0000'; insert(ins,s2,1);
end;
if q=5 then begin
ins:='00000'; insert(ins,s2,1);
end;
val(copy(s1,1,3),e1,k);
val(copy(s1,4,3),e2,k);
if (e1 mod 10)+((e1 mod 100) div 10)+(e1 div 100)=(e2 mod 10)+((e2 mod 100) div 10)+(e2 div 100) then
z:=1;
val(copy(s2,1,3),e1,k);
val(copy(s2,4,3),e2,k);
if (e1 mod 10)+((e1 mod 100) div 10)+(e1 div 100)=(e2 mod 10)+((e2 mod 100) div 10)+(e2 div 100) then
z:=1;
if z=1 then writeln('YES') else writeln('NO');
end.
***

Rudnev Vladimir Re: Tests // Problem 1493. One Step from Happiness 1 Mar 2010 22:04

очень большое и глупое решение, гораздо проще вот так:

function prov(n:longint):integer;
var a1,a2,a3,b1,b2,b3:integer;
begin
a1:=n div 100000;
a2:=n div 10000 mod 10;
a3:=n div 1000 mod 10;
b1:=n div 100 mod 10;
b2:=n div 10 mod 10;
b3:=n mod 10;
if b1+b2+b3=a1+a2+a3 then prov:=1 else prov:=2;
end;
var n,n1,n2:longint;
begin
read(n);
n1:=n+1;
n2:=n-1;
if (prov(n1)=1)or(prov(n2)=1) then writeln('Yes') else writeln('No');
end.
sorry for russian.
P.S. Time 0.031 Memory 118

HaiyangZheng Re: Tests [2] // Problem 1493. One Step from Happiness 3 Oct 2012 20:42

725870 why No??

NiF Re: Tests [1] // Problem 1493. One Step from Happiness 28 Oct 2012 02:38

725870 + 1 = 725871 (14 != 16)
725870 - 1 = 725869 (14 != 23)

Muzaffardjan Karaev Re: Tests // Problem 1493. One Step from Happiness 15 May 2013 17:31

Why 727870 "yes"

Shilov Dmitriy(Vologda SPU#1) H!. help me please ihave WA in the test # 8, give me test [4] // Problem 1408. Polynomial Multiplication 1 Oct 2007 13:33

H!. help me please ihave WA in the test # 8, give me test

[SPbSU ITMO] Kazakov Sergey (CK.) Re: H!. help me please ihave WA in the test # 8, give me test [3] // Problem 1408. Polynomial Multiplication 15 Feb 2008 20:22

This test helped me:
a+a^2+a^3+a^4+a^5+a^6+a^7+a^8+a^9+a^10+a^11+a^12+a^13+a^15+a^14+a^16+a^17+a^18+a^19+a^20+a^21+a^22
b+b^2+b^3+b^4+b^5+b^6+b^7+b^8+b^9+b^10+b^11+b^12+b^13+b^15+b^14+b^16+b^17+b^18+b^19+b^20+b^21+b^22
Answer:
a^22*b^22 + a^22*b^21 + a^21*b^22 + a^22*b^20 + a^21*b^21 + a^20*b^22 + a^22*b^19 + a^21*b^20 + a^20*b^21 + a^19*b^22 + a^22*b^18 + a^21*b^19 + a^20*b^20 + a^19*b^21 + a^18*b^22 + a^22*b^17 + a^21*b^18 + a^20*b^19 + a^19*b^20 + a^18*b^21 + a^17*b^22 + a^22*b^16 + a^21*b^17 + a^20*b^18 + a^19*b^19 + a^18*b^20 + a^17*b^21 + a^16*b^22 + a^22*b^15 + a^21*b^16 + a^20*b^17 + a^19*b^18 + a^18*b^19 + a^17*b^20 + a^16*b^21 + a^15*b^22 + a^22*b^14 + a^21*b^15 + a^20*b^16 + a^19*b^17 + a^18*b^18 + a^17*b^19 + a^16*b^20 + a^15*b^21 + a^14*b^22 + a^22*b^13 + a^21*b^14 + a^20*b^15 + a^19*b^16 + a^18*b^17 + a^17*b^18 + a^16*b^19 + a^15*b^20 + a^14*b^21 + a^13*b^22 + a^22*b^12 + a^21*b^13 + a^20*b^14 + a^19*b^15 + a^18*b^16 + a^17*b^17 + a^16*b^18 + a^15*b^19 + a^14*b^20 + a^13*b^21 + a^12*b^22 + a^22*b^11 + a^21*b^12 + a^20*b^13 + a^19*b^14 + a^18*b^15 + a^17*b^16 + a^16*b^17 + a^15*b^18 + a^14*b^19 + a^13*b^20 + a^12*b^21 + a^11*b^22 + a^22*b^10 + a^21*b^11 + a^20*b^12 + a^19*b^13 + a^18*b^14 + a^17*b^15 + a^16*b^16 + a^15*b^17 + a^14*b^18 + a^13*b^19 + a^12*b^20 + a^11*b^21 + a^10*b^22 + a^22*b^9 + a^21*b^10 + a^20*b^11 + a^19*b^12 + a^18*b^13 + a^17*b^14 + a^16*b^15 + a^15*b^16 + a^14*b^17 + a^13*b^18 + a^12*b^19 + a^11*b^20 + a^10*b^21 + a^9*b^22 + a^22*b^8 + a^21*b^9 + a^20*b^10 + a^19*b^11 + a^18*b^12 + a^17*b^13 + a^16*b^14 + a^15*b^15 + a^14*b^16 + a^13*b^17 + a^12*b^18 + a^11*b^19 + a^10*b^20 + a^9*b^21 + a^8*b^22 + a^22*b^7 + a^21*b^8 + a^20*b^9 + a^19*b^10 + a^18*b^11 + a^17*b^12 + a^16*b^13 + a^15*b^14 + a^14*b^15 + a^13*b^16 + a^12*b^17 + a^11*b^18 + a^10*b^19 + a^9*b^20 + a^8*b^21 + a^7*b^22 + a^22*b^6 + a^21*b^7 + a^20*b^8 + a^19*b^9 + a^18*b^10 + a^17*b^11 + a^16*b^12 + a^15*b^13 + a^14*b^14 + a^13*b^15 + a^12*b^16 + a^11*b^17 + a^10*b^18 + a^9*b^19 + a^8*b^20 + a^7*b^21 + a^6*b^22 + a^22*b^5 + a^21*b^6 + a^20*b^7 + a^19*b^8 + a^18*b^9 + a^17*b^10 + a^16*b^11 + a^15*b^12 + a^14*b^13 + a^13*b^14 + a^12*b^15 + a^11*b^16 + a^10*b^17 + a^9*b^18 + a^8*b^19 + a^7*b^20 + a^6*b^21 + a^5*b^22 + a^22*b^4 + a^21*b^5 + a^20*b^6 + a^19*b^7 + a^18*b^8 + a^17*b^9 + a^16*b^10 + a^15*b^11 + a^14*b^12 + a^13*b^13 + a^12*b^14 + a^11*b^15 + a^10*b^16 + a^9*b^17 + a^8*b^18 + a^7*b^19 + a^6*b^20 + a^5*b^21 + a^4*b^22 + a^22*b^3 + a^21*b^4 + a^20*b^5 + a^19*b^6 + a^18*b^7 + a^17*b^8 + a^16*b^9 + a^15*b^10 + a^14*b^11 + a^13*b^12 + a^12*b^13 + a^11*b^14 + a^10*b^15 + a^9*b^16 + a^8*b^17 + a^7*b^18 + a^6*b^19 + a^5*b^20 + a^4*b^21 + a^3*b^22 + a^22*b^2 + a^21*b^3 + a^20*b^4 + a^19*b^5 + a^18*b^6 + a^17*b^7 + a^16*b^8 + a^15*b^9 + a^14*b^10 + a^13*b^11 + a^12*b^12 + a^11*b^13 + a^10*b^14 + a^9*b^15 + a^8*b^16 + a^7*b^17 + a^6*b^18 + a^5*b^19 + a^4*b^20 + a^3*b^21 + a^2*b^22 + a^22*b + a^21*b^2 + a^20*b^3 + a^19*b^4 + a^18*b^5 + a^17*b^6 + a^16*b^7 + a^15*b^8 + a^14*b^9 + a^13*b^10 + a^12*b^11 + a^11*b^12 + a^10*b^13 + a^9*b^14 + a^8*b^15 + a^7*b^16 + a^6*b^17 + a^5*b^18 + a^4*b^19 + a^3*b^20 + a^2*b^21 + a*b^22 + a^21*b + a^20*b^2 + a^19*b^3 + a^18*b^4 + a^17*b^5 + a^16*b^6 + a^15*b^7 + a^14*b^8 + a^13*b^9 + a^12*b^10 + a^11*b^11 + a^10*b^12 + a^9*b^13 + a^8*b^14 + a^7*b^15 + a^6*b^16 + a^5*b^17 + a^4*b^18 + a^3*b^19 + a^2*b^20 + a*b^21 + a^20*b + a^19*b^2 + a^18*b^3 + a^17*b^4 + a^16*b^5 + a^15*b^6 + a^14*b^7 + a^13*b^8 + a^12*b^9 + a^11*b^10 + a^10*b^11 + a^9*b^12 + a^8*b^13 + a^7*b^14 + a^6*b^15 + a^5*b^16 + a^4*b^17 + a^3*b^18 + a^2*b^19 + a*b^20 + a^19*b + a^18*b^2 + a^17*b^3 + a^16*b^4 + a^15*b^5 + a^14*b^6 + a^13*b^7 + a^12*b^8 + a^11*b^9 + a^10*b^10 + a^9*b^11 + a^8*b^12 + a^7*b^13 + a^6*b^14 + a^5*b^15 + a^4*b^16 + a^3*b^17 + a^2*b^18 + a*b^19 + a^18*b + a^17*b^2 + a^16*b^3 + a^15*b^4 + a^14*b^5 + a^13*b^6 + a^12*b^7 + a^11*b^8 + a^10*b^9 + a^9*b^10 + a^8*b^11 + a^7*b^12 + a^6*b^13 + a^5*b^14 + a^4*b^15 + a^3*b^16 + a^2*b^17 + a*b^18 + a^17*b + a^16*b^2 + a^15*b^3 + a^14*b^4 + a^13*b^5 + a^12*b^6 + a^11*b^7 + a^10*b^8 + a^9*b^9 + a^8*b^10 + a^7*b^11 + a^6*b^12 + a^5*b^13 + a^4*b^14 + a^3*b^15 + a^2*b^16 + a*b^17 + a^16*b + a^15*b^2 + a^14*b^3 + a^13*b^4 + a^12*b^5 + a^11*b^6 + a^10*b^7 + a^9*b^8 + a^8*b^9 + a^7*b^10 + a^6*b^11 + a^5*b^12 + a^4*b^13 + a^3*b^14 + a^2*b^15 + a*b^16 + a^15*b + a^14*b^2 + a^13*b^3 + a^12*b^4 + a^11*b^5 + a^10*b^6 + a^9*b^7 + a^8*b^8 + a^7*b^9 + a^6*b^10 + a^5*b^11 + a^4*b^12 + a^3*b^13 + a^2*b^14 + a*b^15 + a^14*b + a^13*b^2 + a^12*b^3 + a^11*b^4 + a^10*b^5 + a^9*b^6 + a^8*b^7 + a^7*b^8 + a^6*b^9 + a^5*b^10 + a^4*b^11 + a^3*b^12 + a^2*b^13 + a*b^14 + a^13*b + a^12*b^2 + a^11*b^3 + a^10*b^4 + a^9*b^5 + a^8*b^6 + a^7*b^7 + a^6*b^8 + a^5*b^9 + a^4*b^10 + a^3*b^11 + a^2*b^12 + a*b^13 + a^12*b + a^11*b^2 + a^10*b^3 + a^9*b^4 + a^8*b^5 + a^7*b^6 + a^6*b^7 + a^5*b^8 + a^4*b^9 + a^3*b^10 + a^2*b^11 + a*b^12 + a^11*b + a^10*b^2 + a^9*b^3 + a^8*b^4 + a^7*b^5 + a^6*b^6 + a^5*b^7 + a^4*b^8 + a^3*b^9 + a^2*b^10 + a*b^11 + a^10*b + a^9*b^2 + a^8*b^3 + a^7*b^4 + a^6*b^5 + a^5*b^6 + a^4*b^7 + a^3*b^8 + a^2*b^9 + a*b^10 + a^9*b + a^8*b^2 + a^7*b^3 + a^6*b^4 + a^5*b^5 + a^4*b^6 + a^3*b^7 + a^2*b^8 + a*b^9 + a^8*b + a^7*b^2 + a^6*b^3 + a^5*b^4 + a^4*b^5 + a^3*b^6 + a^2*b^7 + a*b^8 + a^7*b + a^6*b^2 + a^5*b^3 + a^4*b^4 + a^3*b^5 + a^2*b^6 + a*b^7 + a^6*b + a^5*b^2 + a^4*b^3 + a^3*b^4 + a^2*b^5 + a*b^6 + a^5*b + a^4*b^2 + a^3*b^3 + a^2*b^4 + a*b^5 + a^4*b + a^3*b^2 + a^2*b^3 + a*b^4 + a^3*b + a^2*b^2 + a*b^3 + a^2*b + a*b^2 + a*b

Alexander (201 - P TNU) Re: H!. help me please ihave WA in the test # 8, give me test // Problem 1408. Polynomial Multiplication 16 Feb 2008 21:37

:)

Alex Tolstov (Vologda STU) Re: H!. help me please ihave WA in the test # 8, give me test // Problem 1408. Polynomial Multiplication 9 Jul 2009 00:06

LOL)))

staelth_03rus Re: H!. help me please ihave WA in the test # 8, give me test // Problem 1408. Polynomial Multiplication 15 May 2013 16:30

Yes, I had wa8, this test has helped me, the mistake was sorted degrees

borislav #WA6 // Problem 1510. Order 14 May 2013 20:57

BILL No subject // Problem 1112. Cover 14 May 2013 01:31

fotol Не могу пройти 1 тест, помогите // Problem 1581. Teamwork 12 May 2013 19:51

daria 8 Time limit [1] // Problem 1196. History Exam 10 May 2013 02:07

XueMao I wonder why somebody passed it only used less than 0.1 sec ! [4] // Problem 1167. Bicolored Horses 9 Apr 2003 17:19

Sandro (USU) Problem was rejudged. Read the site news (-) // Problem 1400. Cellular Characters 11 May 2013 19:14

l@mho Accepted 0.39s :D [1] // Problem 1362. Classmates 2 6 Oct 2007 04:50

Sergey Miroshnichenko Can someone explain why it works on msvs but g++ and gcc-11?!! // Problem 1001. Reverse Root 11 May 2013 14:20

sfersox need tests! // Problem 1914. Titan Ruins: Serial Control 10 May 2013 20:06

dtchau data test 2 // Problem 1072. Routing 10 May 2013 18:40

198808xc If you got WA @ 5 // Problem 1948. The Robot on the Line 10 May 2013 17:16