145 reputation
6
bio website codeit.codeplex.com
location India
age 20
visits member for 2 years, 2 months
seen Dec 26 '12 at 15:08

I am currently pursuing my B.Tech in IT from IIIT Allahabad...

I ♥ working on my own projects !! Also I love making scripts to make life easier.

Comfortable with Java, C, C++, SQL, PHP

Here is the list of projects which I have released.. (Many of them are still to be documented and released (procrastinating) )

  1. CodeIt! Online Compiler for 65+ programming languages

Oct
28
accepted Modifying Euler Totient Function
Oct
28
comment Modifying Euler Totient Function
Thanks for the information !! :)
Oct
27
comment Modifying Euler Totient Function
@AndréNicolas Thanks for your reply. Can't we use phi(n) to calculate the final answer in a easier manner for (x < n) just like as we do when (x > n) ??
Oct
27
asked Modifying Euler Totient Function
Sep
4
awarded  Commentator
Sep
4
comment Number of divisors
I want to calculate total number of divisors of n which are also divisible by k without calculating prime factorization twice.
Sep
4
comment Number of divisors
Your code is WRONG. I think you have given me the code of total number of divisors of a number !!!
Sep
4
awarded  Supporter
Sep
4
comment Number of divisors
Sieve of Eratosthenes
Sep
4
asked Number of divisors
Jun
4
awarded  Autobiographer
May
31
awarded  Scholar
May
31
accepted Help with a textbook probability problem
May
30
comment Help with a textbook probability problem
Sorry for the trouble again but sir, it's still very slow!!!
May
30
revised Help with a textbook probability problem
added 747 characters in body
May
30
comment Help with a textbook probability problem
Suppose r = 300 (as in case a.) ,b = 120 (20 overs), w = 10 then it will require 360000 multiplications and 90 * 300 * 120 additions !!!
May
30
comment Help with a textbook probability problem
@joriki Sorry for the trouble. The post has been edited. Can you please tell your method of solving?
May
30
comment Help with a textbook probability problem
Thanks for your answer but it's too slow to run!! Can you optimize it ??
May
29
awarded  Student
May
29
awarded  Editor