amanjain110893's blog

By amanjain110893, 8 years ago, In English

Why test cases and source codes are not visible after gym contests?

Read more »

 
 
 
 
  • Vote: I like it
  • -31
  • Vote: I do not like it

By amanjain110893, 8 years ago, In English

Can someone explain how to go through this problem http://www.codechef.com/problems/A6. I have found this solution but i can't understand its precomputation part. http://www.codechef.com/viewplaintext/2279326

Read more »

 
 
 
 
  • Vote: I like it
  • -7
  • Vote: I do not like it

By amanjain110893, 8 years ago, In English

http://www.spoj.com/problems/CALCULAT I have been trying solving this problem, I have first tried to calculate first k digits of factorial using stirling approximation but due to precision my code don't give perfect ans for all factorials and I cant figure out how to find last l digits of factorial. Can someone tell me how to crack this problem. Thnks.

Read more »

 
 
 
 
  • Vote: I like it
  • -1
  • Vote: I do not like it

By amanjain110893, 8 years ago, In English

where I can solve icpc 2013 world finals problems?

Read more »

 
 
 
 
  • Vote: I like it
  • -16
  • Vote: I do not like it

By amanjain110893, 9 years ago, In English

Can someone provide me some resource or code for fast hashing that can be used in topcoder SRM's/Codeforces rounds. OR I have to use set/map for hashing purposes.

Suggestion Welcome For: In what kind of problems hashing to be used.

Read more »

 
 
 
 
  • Vote: I like it
  • -6
  • Vote: I do not like it

By amanjain110893, 9 years ago, In English
 
 
 
 
  • Vote: I like it
  • -17
  • Vote: I do not like it

By amanjain110893, 9 years ago, In English

how to set problem as favorite and access after? So that left problem can be tried later like, in spoj when some problem we attempted is not yet submiteed it goes under TODO problem.

Read more »

 
 
 
 
  • Vote: I like it
  • +3
  • Vote: I do not like it