Search found 57 matches

by I LIKE GN
Wed Jul 27, 2005 6:06 pm
Forum: Volume 102 (10200-10299)
Topic: 10290 - {Sum+=i++} to Reach N
Replies: 27
Views: 12759

what is floating point exception...
wht should i do???
i use seive3(bit wise seive function) and only one long double is used
help...
by I LIKE GN
Tue Jul 26, 2005 5:48 pm
Forum: Volume 5 (500-599)
Topic: 574 - Sum It Up
Replies: 46
Views: 14322

hello all...
please give me some I/O
i know it's stupid mistake!!!!
one thing
for t=0 i print
0
0+0
0+0+0
...
depending on number of zeros in X1 up to Xn
by I LIKE GN
Tue Jul 26, 2005 5:43 pm
Forum: Volume 100 (10000-10099)
Topic: 10036 - Divisibility
Replies: 37
Views: 11230

hello thx for reply i checked all ur i/o.. they are ok... one thing i made a random huge file with several test cases where the inputs were like 10000 41 10000 randomly generated numbers... 10000 93 ... ... the most suspectable matter is my program gives "Divisible" for ALL inputs... so perhaps i am...
by I LIKE GN
Tue Jul 26, 2005 5:43 pm
Forum: Volume 106 (10600-10699)
Topic: 10637 - Coprimes
Replies: 16
Views: 6573

i fix a previous mistake
now still get WA

Code: Select all

removed
by I LIKE GN
Tue Jul 19, 2005 1:02 pm
Forum: Volume 100 (10000-10099)
Topic: 10036 - Divisibility
Replies: 37
Views: 11230

IO needed

i amm getting WA
Need some IO...
please help
by I LIKE GN
Tue Jul 19, 2005 1:00 pm
Forum: Volume 106 (10600-10699)
Topic: 10637 - Coprimes
Replies: 16
Views: 6573

WAAAAAAA!!!!!!!

I amm getting WA... i made the following assumptions... 1. when both S and t are even, there is no scope of even numbers in that solution set i.e. 40 6 as appears in Sample I/0, there is no even number. 2. i search up to n/2 numbers starting from 1, where n is the number at that level of search. 3. ...
by I LIKE GN
Fri Apr 29, 2005 5:13 pm
Forum: Volume 7 (700-799)
Topic: 704 - Colour Hash
Replies: 23
Views: 13618

Hello

i know this is really a very hard (at least to me) problem :roll:
so if any one posts here some problem numbers of (nearly) this type yet relatively
easier, would be greatly appriciated.

regards
Rss
by I LIKE GN
Sat Apr 16, 2005 3:34 pm
Forum: Volume 1 (100-199)
Topic: 155 - All Squares
Replies: 11
Views: 1977

Hello all I have just got a WA any body please give me some I/O one thing... i use the corner coordinates as ( where cx and cy initially set to (1024, 1024) and k is as in the description ) /* upper left corner */ ux = (cx-k), uy = (cy-k); /* upper right corner */ x = (cx+k), y = (cy-k); /* lower le...
by I LIKE GN
Fri Apr 01, 2005 2:20 pm
Forum: Volume 1 (100-199)
Topic: 112 - Tree Summing
Replies: 137
Views: 14674

Hello all I just get Acc :P on the problem with a 12-line recursion code... but i also wander why my previous soln. got wa. the code was very large and the aproach was DIVIDE AND CONQUER with link list tree handling... So those who are trying to get acc... please look at the format (INTEGER()()) The...
by I LIKE GN
Fri Apr 01, 2005 2:17 pm
Forum: Volume 1 (100-199)
Topic: 112 - Tree Summing
Replies: 137
Views: 14674

i tred with all inputs in the board
all are Correct :-?
but Judge gives wa

Code: Select all

-50 ( -25
   )
   )
  ( -25(
)
(  )    
        )
)
"yes"
by I LIKE GN
Fri Mar 18, 2005 5:24 pm
Forum: Volume 102 (10200-10299)
Topic: 10212 - The Last Non-zero Digit.
Replies: 63
Views: 31331

We must factorize n! into this form: 2^i * 3^j * 5^k * 7^l, and find the corresponding i, j, k, and l. eg, n=10. 10! = 1.2.3.4.5.6.7.8.9.10 = 2^7.3^4.5^2.7^1 and we also know the lastdigit of 2^k, 3^k, 5^k, and 7^k; 0<=k<=p. If you still confuse how to factorize it, I will gratefull to tell you mor...
by I LIKE GN
Sat Mar 12, 2005 2:57 pm
Forum: Volume 6 (600-699)
Topic: 640 - Self Numbers
Replies: 47
Views: 18380

Faster I/O please

How can I generate FASTER I/O :oops:
Mine is 0:00.391

Go to advanced search