3 UVA 10852 Less Prime

First Sieve Prime,

Then enumerate the prime numbers in the topic range, the answer is to find the smallest ans=n-n/i*i, where I is the prime number of the enumeration

#include <cstdio> #include <algorithm> #include <cstring>using namespace Std;bool pri[10010];void Init () {    int i,j;    memset (pri,1,sizeof pri);    pri[0]=pri[1]=0;    for (i=2;i<=10005;i++)    {        if (!pri[i]) continue;        for (j=i+i;j<=10005;j+=i)            pri[j]=0;    }} int main () {    init ();    int t,i,n,ans,x;    scanf ("%d", &t);    while (t--)    {        scanf ("%d", &n);        Ans=0,x=n;        for (i=2;i<=n;i++)        {            if (Pri[i])            {                if (ans<n-n/i*i) ans=n-n/i*i,x=i;            }        }        printf ("%d\n", x);    }    return 0;}

3 UVA 10852 Less Prime