## 11960 - Divisor Game

Moderator: Board moderators

plamplam
Experienced poster
Posts: 150
Joined: Fri May 06, 2011 11:37 am

### Re: 11960 Divisor Game Getting WA!!

Sure thing I don't mind sharing but I thought you got AC (from the above posts). Why bother with this problem? If you still want to know what my solution is then PM me with your email.
You tried your best and you failed miserably. The lesson is 'never try'. -Homer Simpson

Learning poster
Posts: 87
Joined: Thu Dec 15, 2011 3:08 pm

### Getting TLE!!!

hy I think prime factorization needs more time so i try this .....
But get TLE.....Any one plz help me...........plz

Code: Select all

``````#include<stdio.h>
#include<math.h>
long Number[1000009]={0,1};

void Cal()
{
long I,K,N;
for(I=2;I<1000001;I++)
{
for(K=(double)sqrt(I);K>1;K--)
{
if(I%K==0)
{
N=I/K;
if(N==K) ++Number[I];
else Number[I]+=2;
}
}
Number[I]+=2;
}
}

int main()
{
long I,K,L,M,N,Test;
Cal();

scanf("%ld",&Test);
for(;Test>0;Test--)
{
L=1;M=1;
scanf("%ld",&N);
for(I=N;I>1;I--)
if(Number[I]>M)
{
M=Number[I];
L=I;
}
printf("%ld\n",L);

}
return 0;
}``````
[/color]
we r surrounded by happiness
need eyes to feel it!

brianfry713
Guru
Posts: 5947
Joined: Thu Sep 01, 2011 9:09 am
Location: San Jose, CA, USA

### Re: 11960 Divisor Game Getting WA!!

First precompute the primes.
Check input and AC output for thousands of problems on uDebug!

Faithkeeper_Rangwan
New poster
Posts: 12
Joined: Sun Jul 07, 2013 7:32 pm

### Re: 11960 Divisor Game Getting WA!!

I don't think this problem even need to use prime factorization.