UVA11859

#include <stdio.h>
#include <string.h>

const int N = 10005;
int t, n, m,  cnt
, vis
, prime
, pn = 0;

int main(){
for(int i=2;i<=N;i++){
if(vis[i])continue;
vis[i]=1;
prime[pn++]=i;
for(int j=2*i;j<=N;j+=i){
vis[j]=1;
}
}
for(int i=2;i<=N;i++){
int num=i;
for(int j=0;j<pn&&i>=prime[j];j++){
while(num%prime[j]==0){
num/=prime[j];
cnt[i]++;//iµÄÒò×ÓÊý
}
}
}
int cas=0;
scanf("%d",&t);
while(t--){
scanf("%d%d",&n,&m);
int ans=0,temp,sum=0;
for(int i=0;i<n;i++){
sum=0;
for(int j=0;j<m;j++){
scanf("%d",&temp);
sum+=cnt[temp];
}
ans^=sum;
}
printf("Case #%d: %s\n",++cas,ans?"YES":"NO");
}
return 0;
}