11415 - Count the Factorials

[rajib_sust]

I am continuous getting TLE!!
any one can give me good algo i can not found a faster algo
my algo
1. generate prime factor
2. linear search and count

if any good idea?

thanks

nikson

[rajib_sust]

i am strange no one can give me any idea.

but i get now ACC.

thanks

[shakil]

Why WA???

Code: Select all

Cut after AC

[Abednego]

What is the answer for n = 10000000? My WA program prints 3203899.

[helloneo]

What is the answer for n = 10000000? My WA program prints 3203899.

My AC code gives

Code: Select all

2703663

[Abednego]

Thanks, helloneo.
I'm confused though. Does anyone understand what the problem statement means by "1 is a prime". When do we count 1? How many times do we count 1?

Edit: Nevermind. I'm dumb. Fixed.

[lazyboy]

I am getting TLE in this problem. please anybody help me...
here is my code :

Code: Select all

removed....

Thanks in advance.

[MRH]

your sieve & process funtion take more time
think modified sive

[lazyboy]

Thanks for ur reply MRH.
i am just modifying the sieve. but how can i make the process function more fast. please give me a little hints.

Thanks in advance.

[MRH]

HI "lazyboy"
modified sive means your process funtion no need
this task can possible with sive

I hope now u can get ACC
it is enough hints
thanks in advance

[lazyboy]

Thanks MRH.

[Ahmad]

Hi,
to solve this problem u need a clever way to generate the number of factors of factorial -( solve the problem 884)-
for each number in the range 1 -> 10 000 000 ... maybe the Algorithm used in the problem 884 isn't enough for this problem.... but it will help you to of course.
then it's easy to find a way to pre-compute the desired results using dp. (Searching for each input will give TLE).
Ahmad