## Search found 25 matches

Mon Jun 11, 2007 9:20 pm
Forum: Volume 112 (11200-11299)
Topic: 11226 - Reaching the fix-point.
Replies: 23
Views: 9992
Instead of factoring, just try to think the inverse problem... If you know sopf, can you calculate sopf[j] where j is a multiple of i?
Sun Jun 10, 2007 9:40 pm
Forum: Volume 112 (11200-11299)
Topic: 11224 - Let's swim!
Replies: 17
Views: 7763
Hi! Some critical I/O: Input: 5 9 3 2 00:10:99 1 00:11:00 4 00:10:99 5 00:10:99 6 00:10:99 7 00:10:99 8 00:10:99 9 00:10:99 10 3 2 00:10:00 1 00:10:00 4 00:10:00 5 00:10:00 6 00:10:00 7 00:10:00 8 00:10:00 9 00:11:00 10 00:11:00 10 1 2 00:10:00 3 00:10:00 4 00:10:00 5 00:10:00 6 00:10:00 7 00:10:00 ...
Mon Nov 07, 2005 10:37 pm
Forum: Volume 109 (10900-10999)
Topic: 10956 - Prime Suspect
Replies: 24
Views: 11622
Output from my AC program: There are 0 odd non-prime numbers between 3 and 3. There are no failures in base 3. There are 0 odd non-prime numbers between 89 and 89. There are no failures in base 3. There are 0 odd non-prime numbers between 89 and 89. There are no failures in base 2. There are 40408 o...
Tue Nov 01, 2005 2:19 pm
Forum: Volume 109 (10900-10999)
Topic: 10958 - How Many Solutions?
Replies: 17
Views: 5536
My AC program outputs:

Code: Select all

``````Case 1: 399
Case 2: 337
Case 3: 337
Case 4: 9
Case 5: 9
Case 6: 9
Case 7: 9
Case 8: 9``````
Good luck!
Mon Oct 31, 2005 8:18 pm
Forum: Volume 109 (10900-10999)
Topic: 10957 - So Doku Checker
Replies: 31
Views: 14721
I've also been trying the same icpc problem, and I only get TLE (lots of TLE's :cry: ). If sb find a fast algorithm please email me at txandi@gmail.com. What I'm doing now is: 1) Fill all "sure" blanks (the ones that can only be filled with a number) 2) Sort the blanks I have to fill. The first one ...
Sun Oct 23, 2005 9:18 pm
Forum: Volume 109 (10900-10999)
Topic: 10944 - Nuts for nuts..
Replies: 35
Views: 14826
Sat Oct 22, 2005 1:29 pm
Forum: Other words
Topic: Recommended Problems.
Replies: 3
Views: 1707
Sat Aug 27, 2005 10:52 pm
Forum: Volume 108 (10800-10899)
Topic: 10897 - Travelling Distance
Replies: 17
Views: 5674

Code: Select all

``````dist = acos( sin(rad1) * sin(rad3) +
``````
Tue Jun 28, 2005 3:12 pm
Forum: Volume 108 (10800-10899)
Topic: 10873 - Splat, Inc.
Replies: 7
Views: 2050
I forgot to drop the first one. AC now. Thanks!!!
Tue Jun 28, 2005 2:21 pm
Forum: Volume 108 (10800-10899)
Topic: 10873 - Splat, Inc.
Replies: 7
Views: 2050

### 10873 - Splat, Inc.

I can't understand the sample I/O. Perhaps I've misunderstood the problem. In the first case (5 5 1 50 50 4 0 2), for example I think the output should be 9 6 6 4 and not 8 7 6 4 because: X = paintball 00000 00000 00000 00000 00000 00000 00000 00000 0000X 00000 00000 00000 00000 00000 0000X 0000X 00...
Wed Mar 23, 2005 4:49 pm
Forum: Volume 108 (10800-10899)
Topic: 10832 - Yoyodyne
Replies: 6
Views: 2729
The next buoy to visit is determined by the closest buoy in the mission that has not yet been visited. In case of a tie, the buoy information that comes first in the input is given preference. It means that when you're in a place A, the next place B to visit must be the not already visited one that...
Mon Feb 28, 2005 10:26 pm
Forum: Volume 102 (10200-10299)
Topic: 10274 - Fans and Gems
Replies: 8
Views: 2602
I got AC now. The input above this is ok. My (silly) mistake: There is one line after each map, ignore them. I assumed this line was empty, but I was wrong, it was full of garbage... I shoud have thought about this before wasting a lot of time debugging a correct program... In my opinion these kind ...
Sun Feb 20, 2005 6:22 pm
Forum: Volume 102 (10200-10299)
Topic: 10274 - Fans and Gems
Replies: 8
Views: 2602

### 10274 - Fans and Gems (Need I/O verification)

Can anybody check this I/O??? I keep getting WA and I don't know why. 20 5 14 ############## #@ 1 3 1@# #@#2# # # #213 @13 @3# ############## 9 9 ######### # 3 # # 3 @ # #21 1@ # #3 3# # 2 # @# # # # ## 3 2 # ######### 11 13 ############# # 2 2@ # # #2 3@ 1 @@ 2# # 2 @2 # #3 2 @ # 3 # ## 2# 2# #3 1 ...
Wed Nov 17, 2004 10:21 pm
Forum: Volume 1 (100-199)
Topic: 104 - Arbitrage
Replies: 223
Views: 12361

### 104 - WA

Need Help!!! I've summited it lots of times, but still WA :cry: My algorithm is simple, I save in a table (table [j][k]) the best way to reach "j", starting from "i" with "k" iterations. What's wrong?? Is it precission?? My code [cpp]#include <iostream> #include <vector> #define EPS 0.0000001 using ...
Sun Nov 14, 2004 1:12 am
Forum: Volume 106 (10600-10699)
Topic: 10686 - SQF Problems
Replies: 21
Views: 11603
AC