sgu 113 求破

[Kylehz]

题目

Problem DescriptionNearly
prime number is an integer positive number for which it is possible to find such primes P1 and P2 that given number is equal to P1*P2. There is given a sequence on N integer positive numbers, you are to write a program that prints “Yes” if given number is nearly prime and “No” otherwise.


Input
Input file consists of N+1 numbers. First is positive integer N (1£N£10). Next N numbers followed by N. Each number is not greater than 109. All numbers separated by whitespace(s).


Output
Write a line in output file for each number of given sequence. Write “Yes” in it if given number is nearly prime and “No” in other case.


Sample Input
1 6


Sample Output
Yes

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
using namespace std;
int a[100],b[40000];
int main()
{
    int n,i,j,m;
    b[0]=1;
    b[1]=1;
    for(i=2;i<40000;i++)b[i]=0;
    for(i=2;i<40000;i++){
        for(j=i*2;j<40000;j+=i)b[j]=1;//0代表素数
    }

    while(scanf("%d",&n)!=EOF)
    {    
        for(i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
        }
        for(i=0;i<n;i++)
        {
            m=0;
            for(j=2;j<a[i]/2+1;j++)
            {



                if(a[i]%j==0&&b[j]==0&&b[a[i]/j]==0)
                {
                        m=1;
                        break;
                }    
            }
            if(m==1)printf("Yes\n");
            else printf("No\n");
        }
    }
    return 0;
}

提交后一直是Runtime Error 求破