acm素数的距离问题

#include<stdio.h>

int isPrime(int n)//判断素数

{

int i;

if(n<2)

           return 0;

for(i=2;i*i<=n;i++)

           if(n%i==0)

                    return 0;

           return 1;

}

int main()

{

int T,len,m;

scanf("%d",&T);

while(T--)//由m向两边扩散查找最小距离的素数

{       

    scanf("%d",&m);

           len=0;

           while(1)

           {

                    if(m-len>1&&isPrime(m-len))//优先查找左边的,要保证左边大于1

                    {

                    printf("%d %d\n",m-len,len);

                    break;

                    }

                    else if(isPrime(m+len))

                    {

                    printf("%d %d\n",m+len,len);

                    break;

                    }

                    len++;

           }

}

return 0;

}