sgu 113 Nearly prime numbers

#include <stdio.h>
#include <string.h>
#include <math.h>
using namespace std;
int n,c[11];
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        int i,j,k,m,t;
        for(i=0;i<n;i++)
        {
            scanf("%d",&m);
            t=0;
            for(j=2;j*j<=m;j++)
                if(m%j==0)
                    t++;
            if(t==1)
                printf("Yes\n");
            else
                printf("No\n");
        }

    }
    return 0;
}