## Search found 50 matches

Mon Jul 24, 2006 5:22 am
Forum: Volume 110 (11000-11099)
Topic: 11053 - Flavius Josephus Reloaded
Replies: 22
Views: 10481
i solved it by using a hash table. but it took 4 seconds. the time limit in the contest was 3 seconds. i am also eager to know how to solve it under 3 seconds.
Tue Dec 20, 2005 2:32 am
Forum: Off topic (General chit-chat)
Topic: A spam or something?
Replies: 13
Views: 4790
i received similar emails too. In last few weeks, two mails, both asking for the source codes of various UVA problems. Both mentioned that, they require the code for thei Class assignment. And I just received another mail asking for code: Hello! Your help is very necessary to me. Have set a problem ...
Fri Dec 02, 2005 5:20 pm
Forum: Off topic (General chit-chat)
Topic: CSE course
Replies: 10
Views: 3587
I started solving problems here from grade 10, but only easy ones. I learned algorithms during my 11 and 12 grades.
Sun Nov 20, 2005 8:38 pm
Forum: Volume 102 (10200-10299)
Topic: 10254 - The Priest Mathematician
Replies: 10
Views: 5450
output for 10000 is 374931278650296101567069263458900577819295745 some more inputs: input: 1 2 3 4 5 6 7 8 9 10 12 213 12 123 1000 129 10000 2138 2388 9982 2923 3789 1248 output: 1 3 5 9 13 17 25 33 41 49 81 23068673 81 557057 932385860354049 753665 374931278650296101567069263458900577819295745 2232...
Fri Sep 02, 2005 8:17 pm
Forum: Volume 100 (10000-10099)
Topic: 10008 - What's Cryptanalysis?
Replies: 55
Views: 16974
while debugging your code, i was faced with two problems. first, your program was having problem taking input as you have used both cin and getchar simultaneously. this might be a bug of visual c++. i dont know whether judge machine behaves the same or not. secondly, you overlooked that there is a t...
Sat Jul 16, 2005 3:11 pm
Forum: Volume 108 (10800-10899)
Topic: 10827 - Maximum sum on a torus
Replies: 52
Views: 26833
In the actual contest, I solved this problem with an O(n^3) approach. But before that, my team mate tried an O(n^4) approach, and got TLE. Later we found out that, other teams solved it in O(n^4). The only thing that were different from their code was that, my team mates code had higher constant fac...
Mon Jul 11, 2005 7:10 pm
Forum: Volume 107 (10700-10799)
Topic: 10772 - Rose windows
Replies: 8
Views: 2151
My AC code gives this output

Code: Select all

``````193.7897
576.5974
945.2074
1604.1015
2462.3319
129.0335
1878.1616
576.5974
214.7256
638.3196
1422.1929
2564.7697
638.3196
2165.0635
4330.1270
1358.7911
2928.9322
100.0000
200.0000
800.0000
4330.1270
1358.7911
``````
Sat Jul 02, 2005 4:35 pm
Forum: Volume 3 (300-399)
Topic: 313 - Intervals
Replies: 10
Views: 4761
I just solved this problem. I used trigonometric functions tan, atan2 and asin. At first I got WA. But, after that I just changed the printing part to: printf("%.2lf %.2lf\n",x1 - EPSILON,x2 - EPSILON); although printf("%.2lf %.2lf\n",x1 + EPSILON,x2 + EPSILON); produced WA. Can anyone please explai...
Sun Jun 26, 2005 6:55 pm
Forum: Volume 4 (400-499)
Topic: 453 - Intersecting Circles
Replies: 84
Views: 14478
I reember, there is a link to some test data for this problem. Try them.
Sat Jun 25, 2005 7:04 pm
Forum: Volume 4 (400-499)
Topic: 453 - Intersecting Circles
Replies: 84
Views: 14478
Sat Jun 18, 2005 6:13 am
Forum: Volume 3 (300-399)
Topic: 359 - Sex Assignments And Breeding Experiments
Replies: 12
Views: 4837
Thanx everybody. I got AC.
Sun Jun 12, 2005 3:08 pm
Forum: Volume 104 (10400-10499)
Topic: 10474 - Where is the Marble?
Replies: 50
Views: 19030
change the whole approach. the solution can be retrived in constant time.
Sun Jun 12, 2005 2:53 pm
Forum: Volume 100 (10000-10099)
Topic: 10045 - Echo
Replies: 11
Views: 2365
I solved this problem dfs maintaing the states in a stl set. It solved in 24 seconds. Can anyone please tell me, how to speed this up? I can see that the fastest solutions take only fraction of second.
Thu Jun 09, 2005 4:55 pm
Forum: ACM ICPC Archive Board
Topic: archive 3015 - Zeros and Ones
Replies: 2
Views: 1048
My AC code gives this output

Code: Select all

``````Case 1: 0
Case 2: 0
Case 3: 916312070471295267
Case 4: 0
Case 5: 0
Case 6: 18358397026615
Case 7: 637606458151
Case 8: 0
Case 9: 0
Case 10: 9308567063712721
Case 11: 1
Case 12: 3
Case 13: 6
Case 14: 1662453
Case 15: 465428353255261088
``````
Sun Apr 24, 2005 1:06 am
Forum: Volume 105 (10500-10599)
Topic: 10530 - Guessing Game
Replies: 57
Views: 27408
Your testTrue() is wrong. check this

Code: Select all

``````5
too low
5
right on
0
``````
the answer will be "Stan is dishonest"