Search found 193 matches

by turuthok
Fri Jun 27, 2003 12:37 am
Forum: Volume 2 (200-299)
Topic: 291 - The House Of Santa Claus
Replies: 19
Views: 6951

For this, I think you should ignore the sample output ... even the length of each output there is not right ...

-turuthok-
by turuthok
Thu Jun 26, 2003 1:37 am
Forum: Volume 105 (10500-10599)
Topic: 10518 - How Many Calls?
Replies: 19
Views: 13643

Two things I noticed ... 1. If base = 1, there's no way you can get a 1 back on your subsequent calculations (unless m wraps-around) ... Wouldn't you get a TLE instead ??? 2. I tried on approach like yours on scanf("%llu", ...) ... it didn't work for me for large numbers ... so I changed it to scanf...
by turuthok
Thu Jun 19, 2003 11:00 am
Forum: Volume 105 (10500-10599)
Topic: 10504 - Hidden squares
Replies: 14
Views: 6258

- - B -
B - - -
- - - B
- B - -
-turuthok-
by turuthok
Tue Jun 17, 2003 10:12 am
Forum: Volume 104 (10400-10499)
Topic: 10499 - The Land of Justice
Replies: 51
Views: 19558

My AC-ed solution didn't use that formula ... and I had to make one special case for one input.

-turuthok-
by turuthok
Sat Jun 07, 2003 9:21 pm
Forum: Volume 104 (10400-10499)
Topic: 10487 - Closest Sums
Replies: 89
Views: 30291

Output for above input should be 4.

-turuthok-
by turuthok
Sat Jun 07, 2003 2:51 am
Forum: Other words
Topic: does @begin_of_source work
Replies: 1
Views: 847

As far as I know, ... the keyword is:

@begin_of_source_code instead of just @begin_of_source ... And if you're quite annoyed with that, ... try to use Submit O'matic. Using this, you don't need to specify those ....

acm.uva.es/problemset/submit.php

-turuthok-
by turuthok
Thu Jun 05, 2003 11:06 am
Forum: Volume 101 (10100-10199)
Topic: 10139 - Factovisors
Replies: 80
Views: 27054

Hello, ... try the following input:

Code: Select all

1 0
0 1
-turuthok-
by turuthok
Wed Jun 04, 2003 7:07 am
Forum: Volume 101 (10100-10199)
Topic: 10139 - Factovisors
Replies: 80
Views: 27054

Hello, ... I think you need to be more careful on spelling ... It should say "divides" instead of "devides". Moreover, you have a very huge potential of getting Time-Limit-Exceeded ... You need to implement better algorithm on the prime() function ... If you know a prime-number that is close to 2^31...
by turuthok
Tue Jun 03, 2003 7:47 am
Forum: Volume 100 (10000-10099)
Topic: 10070 - Leap Year or Not Leap Year and ...
Replies: 233
Views: 54120

Sorry, I should check for previous posts before making comments ...

Yes, this problem involves big-integer ...

-turuthok-
by turuthok
Tue Jun 03, 2003 7:45 am
Forum: Volume 100 (10000-10099)
Topic: 10070 - Leap Year or Not Leap Year and ...
Replies: 233
Views: 54120

Awik, probably this problem gives us a number with very-long digits. Can somebody confirm this statement ???

-turuthok-
by turuthok
Sat May 31, 2003 5:59 am
Forum: Volume 103 (10300-10399)
Topic: 10302 - Summation of Polynomials
Replies: 29
Views: 15242

Your formula looks great and you might want to try x = 50,000 and check your result using calculator. Most likely it is an overflow or precision problem.

-turuthok-
by turuthok
Wed May 28, 2003 7:40 pm
Forum: Volume 100 (10000-10099)
Topic: 10036 - Divisibility
Replies: 37
Views: 10998

Dynamic Programming, tid ... Start from the leftmost. Perform both addition and subtraction with the next integer and get the modulus ... The result will be between 0 -> k-1. Create a flag-array to mark that this position is valid. In the next iteration, use that flag-array and for every valid posit...
by turuthok
Wed May 28, 2003 7:28 pm
Forum: Volume 104 (10400-10499)
Topic: 10497 - Sweet Child Makes Trouble
Replies: 19
Views: 9524

When I'm doing the coding, I realized that for N=800, I have to be able to compute 400! as part of the solution ... Gosh, that's why I need to have my big-integer stuff first ...

-turuthok-
by turuthok
Wed May 28, 2003 7:26 pm
Forum: Volume 104 (10400-10499)
Topic: 10497 - Sweet Child Makes Trouble
Replies: 19
Views: 9524

Larry, ... I didn't use your formula. But probably it would yield the same result. Here's what went thru my mind ... it's incomplete. I tried to formulate it in a simpler-fashion with no success. There are 2 terms I used here in my solution. - Free, that means this element can be placed anywhere in ...
by turuthok
Wed May 28, 2003 10:36 am
Forum: Volume 104 (10400-10499)
Topic: 10497 - Sweet Child Makes Trouble
Replies: 19
Views: 9524

This is pretty straightforward dynamic-programming problem. The recurrence formula is actually very interesting ... But it sure looks like it needs big-integer operation. I know I need one. Looks like in this most recent contest, whoever has the big-integer library would have the advantage. I know I...

Go to advanced search