10852 - Less Prime

[Martin Macko]

I can't understand what the question is trying. Can anybody please explain it ?
How can 101 output is 53 ?

You are looking for a prime number x≤n, such that n%x is maximum. (and 101%53=48, the most you can get)

[Martin Macko]

That the input for p10852 contains n < 100 is incorrect. Shouldn't it be fixed ?

I think, it should be fixed... At least in the problem statement...
Possibly, we could ask problemsetter to fix it...

[ibrahim]

Thanks, AC

[alecliu]

How can it be solved in 0.000sec?
Please give me some hit, thank you!

[Neli]

I just checked the condition:
while(prime[j]*2<=n)
j++;
I thought that was enough.But got wrong answer.
Plz help.

[mmonish]

>>Neli
Ur solution is ok. so u should check the other parts of the code specially the prime generating part.
If u don't get any coz of getting WA then i think the best idea to recode it.

[sazzadcsedu]

input can be less than 100.
for input 1 & 2
just output -1;
others r according to ur (correct)algorithm.

[sayed]

input and output is correct bt why wrong answer??

Code: Select all

#include<stdio.h>

int main()
{
   int i,b,flag,a,c,test,g,p;

   scanf("%d",&test);

   while(test--)
   {
      scanf("%d",&c);

      a=2;
      g=0;
      p=(c/2)+1;
      for(b=p;b<=c;b++)
      {
         flag=0;
         for(i=2;i<=(b/2);i++)
            if((b%i)==0)
            {
               flag=1;
               break;
            }

         if(flag==0)
         {
            printf("%d\t",b);
            g++;
         }
         if(g==1)
            break;
      }
      printf("\n");
   }
return 0;
}