Search found 4 matches
- Wed Mar 03, 2004 7:18 am
- Forum: Volume 1 (100-199)
- Topic: 107 - The Cat in the Hat
- Replies: 278
- Views: 55239
- Wed Mar 03, 2004 6:27 am
- Forum: Volume 1 (100-199)
- Topic: 107 - The Cat in the Hat
- Replies: 278
- Views: 55239
107 TL in CATS
Help! Need a LITTLE help. I have got TL in problem 107 (about cats and hats). Maybe my algorithm is really slow?
I present height of initional cat as prime numbers degrees. After than finding all possible n's
[pascal]
program zzz;
var i,j,k,m,s,min,gcd : longint;
h,num,l,sum,r,n,t : int64;
p,x ...
I present height of initional cat as prime numbers degrees. After than finding all possible n's
[pascal]
program zzz;
var i,j,k,m,s,min,gcd : longint;
h,num,l,sum,r,n,t : int64;
p,x ...
- Mon Mar 01, 2004 3:30 pm
- Forum: Volume 1 (100-199)
- Topic: 109 - SCUD Busters
- Replies: 96
- Views: 36980
- Mon Mar 01, 2004 12:32 pm
- Forum: Volume 1 (100-199)
- Topic: 109 - SCUD Busters
- Replies: 96
- Views: 36980
109 scud BUSTERS. Bad problem
Please, help me. I always get WA in this problem. My algorithm:
1. Make convex hull with Graham scanning for each kingdom
2. For each kingdom count it's square
3. For each missle enable kingdom (or no kingdom)
4. For all enabled kingdoms sum their square.
May be, that sms wrong with:
1. When missle ...
1. Make convex hull with Graham scanning for each kingdom
2. For each kingdom count it's square
3. For each missle enable kingdom (or no kingdom)
4. For all enabled kingdoms sum their square.
May be, that sms wrong with:
1. When missle ...