123456789101112131415161718192021222324252627282930313233
void FindPrime(int o[5][5]){ int c[100];int I=0 ,count=0,p =0; int i,j,h; for(i =0;i<5;i++) { for(j =0;j<5;j++) { count =0; for(int k =2;k<o[i][j];k++) { if(o[i][j]% k == 0) { count++; } } if(count == 0) { c[I] = o[i][j]; I++; p++; } } } for(int I =0;I<p;I++) { h=c[I]; cout<<" "<< h <<" "; } cout<<"\n\n"; }
123456789
count =0; for (int k =2;k<o[i][j];k++) { if (o[i][j]% k == 0) { count++; } } if (count == 0) ...
12
count =0; if (count == 0) ...