OJ Board

Thank you ,Wei-Ming Chen!!!
I've misunderstood the problem.
Now I have accepted.
Thank you very much!!!!

Best regards,

I have tried all the possible input and all are right.
But I still got WA.
Can someone tell me what is wrong??
Thanks!!!

//acm484
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int main()
{
char *p,in[100000];
int find,c,n,t=0,times[100000][2];
for(n=0;n<100000;n++) times[n][1]=1 ...

I've changed many ways to do this problem......but still WA.
What is wrong? Can someone tell me....

Now I have accepted.
Thank you very much, misof and SRX!!
Best wishes,

Thank you for your help, misof!!

But I still got WA after increasing the array size.

Could someone tell me where is wrong??

My method is to find the order that makes the number combination bigger (the function compare)
,and then use bubble sort.

I've tried all the inputs listed before but still can't find where is wrong.
I am very confused .
Can someone help me?
Thanks a lot!!!!

My method is to find the order that makes the number combination bigger (the function compare)
,and then use bubble sort.

I'm sorry that I mis-interpreted the input.
Thank you!!!
Now I know why I can't accept!!

If you consider the largest prime only, you will fail with N=9, M=48.
My output is 11 ,is it wrong??

9's largest prime factor is 3
48/3=16
16/3=5
5/3=1
16+5+1=22
then 9=3^2
22/2=11

Another way

In 1~48 3's multiples:

3 6 9 12 15 18 21 24 27 30 33 36 39 42 45 48
1 1 2 .1 .1 ...2 .1 ...1 .3 ...1 ...

The way I used is to find the largest prime factor in M (the largest prime factor is K)
then find the largest power of M that divides N:
if K^a divides N!,
then I'll find the largest 'b' that k^b divides M.
At last, I'll output a/b (if it's 0 , output "Impossible to divide").

example:
if N=11,M=8 ...

I tried all the input posted in former topics and all he output is right.
BUT I still got WA!!!!!Why?
Can someone tell me what's wrong in my code?
Thanks!!!!!!

To artem:
Thank you!!!
I have accepted!!!!

To artem:
Your code really works!!

But I still got TLE...........Why???
Is my method to find the pair of prime too slow?
I tried to modify my method to find the pair, but it seems no use.....

Can anyone tell me what's wrong in my code?

I got tle but I don't know how to make it faster!!
Can someone help me?
thanks!!!!

Here is my code: