Обсуждение @ 1333. Джинн-бомбардировки 2 @ Timus Online Judge

How to solve this problem?

Послано HybridTheory 24 окт 2004 19:32

Could anybody tell me the detail?

Just check about 10^6 points from there square. (-)

Послано Victor Barinov (TNU) 24 окт 2004 22:14

Re: How to solve this problem?

Послано Roman Lipovsky 24 окт 2004 22:49

Simplest solution: O(1000^2) works 0.39 seconds.

It also works at O(100^2)

Послано Victor Barinov (TNU) 24 окт 2004 23:38

Re: Just check about 10^6 points from there square. (-)

Послано HybridTheory 25 окт 2004 07:36

Yeah,but how to present a circle?

Re: Just check about 10^6 points from there square. (-)

Послано Roman Lipovsky 25 окт 2004 10:59

My program:

count = 0;
for X from 0.000 to 1.000
for Y from 0.000 to 1.000
if Point(X,Y) within some cirle then
count := count+1

write(count/1000000*100);

Re: Just check about 10^6 points from there square. (-)

Послано HybridTheory 25 окт 2004 13:41

Thank you.

Re: How to solve this problem?

Послано Aydarkanov Tair OKTL 8 янв 2006 10:26

No subject

Послано Aydarkanov Tair OKTL 8 янв 2006 10:26

Hello!

Послано Aydarkanov Tair OKTL 8 янв 2006 10:27

Hello!

Послано Aydarkanov Tair OKTL 8 янв 2006 10:33

Why your name is Hybrid Theory?
It's one of Linkin Park's albums(2000)
Do you like Linkin Park?
If you like it, then write me:
\\tair_a@mail.ru
\\fred007@mail.ru

Обсуждение задачи 1333. Джинн-бомбардировки 2