OJ Board

thanks a lot, arsalan_mousavian

i did not code this problem during the contest because of its poor description. i thought in the worst case i will be given 1 million(2^20) numbers, each of them can be as large as 2^31. i knew what i have to do to solve it, but could not fit that limit neither in memory nor in time. i wondered that...

thanks a lot sclo, doing it in your way gave me Accepted. then i wondered what was my problem, and found this spoil in my code 3 0 0 0 i was printing 000 where it will be 0 because i was using an array and i forgot to put: if(sum==0) { printf("0\n"); continue; } but i should have done it in your way...

seriously, this is not my day. i dont know why i am getting WA i wrote a brute force code using next_permutation() to test whether my calculated value is correct or not. using random function i made 120 data and test, all matched the column values, now i have to add them to make it in base 10. i m n...

7 is the greatest prime factor of base 14 , so whenever a 7 is introduced, an extra zero will be added so from 0! to 6! there is no 7 and so, we dont have any trailing zero, then from 7! to 13! each has 1 seven so, we have a trailing zero for each of them, so , for 7,8,9 and 10 we have 1 trailing ze...

Here is some I/O from my AC programe. BTW, these are auto generated. INPUT: 41 18.467000 6.334000 26.500000 19.169000 15.724000 11.478000 29.358000 26.962000 24.464000 5.705000 28.145000 23.281000 16.827000 9.961000 0.491000 2.995000 11.942000 4.827000 5.436000 32.391000 14.604000 3.902000 0.153000 ...

Hi, your code has some problem. consider the case: 49 49 , surely it is reachable. 1+3+5+7+9+11+13 =49 the fact is that, there can be 2 nodes in the same level of your bfs tree, but you don't have any information of that, u just consider them as they are in different level. Input: 1000000 999999 100...

hi, thanks to all of you for pointing to my mistake. i just did it in the hard way. made 2 polygons with the 2 curves. by increasing infinitly in the opposite sides. and then took the intersection of the 2 polygons. as you can understand how complicated this algorithm can be. though my code will wor...

Hi, just got Accpeted in this problem. :) by the way. is there a way to solve this problem without clipping? my code took 0.3 sec but thats not what i m sorry about rather i am sorry because it is huge ( 1000+ lines ). i have difficulty of understanding the available algorithms, because they were po...

thanks a lot for your quick reply.

yes, i should have calculated atleast the 2nd input by hand. i added some of them before posting. but i will check whats wrong.
thanks again.

Hi, as far as i understand this problem is about concave polygon intersection ( or may be i should say, polygon clipping) or atleast i am trying to do so. i managed to code it up according to some algorithm available. bad luck! i got wrong answer. the algorithm i am using gives approximate answer wh...

Hi, well my exam is not over yet. but as you r really in trouble with 10142, so i decided to give you some hand. well it didn't take long to give you something here. i tested your code with my I/O file ( i even posted that in the board, you told that u have tested all the I/O in the board, have you ...

Hi, i am also getting WA. i have checked the other posts and have checked my code with the tricky cases but still no luck. i can't find any bug in my code, neither i can get any wrong output for my test cases. but what i m missing might be seen by others. so here is the test cases and the output my ...

Hi martin, thanks for the reply. ya, that is wrong. as i was confused by the previous posts and was getting lot of wa's , so i tried many thing. and i guess i have completed half century of WA for this problem. now i want to put it away. may be i am missing something small and sily, but looks like i...

Hi A1, remember me?