fork(2) download
copy 
  1. #include <iostream>
  2. #include <cstdio>
  3. #include <algorithm>
  4. #include <climits>
  5. using namespace std;
  6.  
  7. int main() {
  8. 	int a[100005]={0};
  9. 	a[0]=a[1]=1;
  10. 	for(int i=2; i<=317; i++) {
  11. 		if(a[i]==1) continue;
  12. 		for(int j=i*i; j<=100005; j+=i) if(a[j]==0) a[j]=1;
  13. 	}
  14. 	int n, m, arr[505][505], tmp, cnt=0, miR=INT_MAX, miC=INT_MAX, mi=INT_MAX;
  15. 	scanf("%d%d", &n, &m);
  16. 	for(int i=0; i<n; i++) for(int j=0; j<m; j++) {
  17. 		scanf("%d", &tmp);
  18. 		while(a[tmp]==1) cnt++, tmp++;
  19. 		arr[i][j]=cnt, cnt=0;
  20. 	}
  21. 	for(int i=0; i<n; i++) {
  22. 		for(int j=0; j<m; j++) {
  23. 			cnt+=arr[i][j];
  24. 		}
  25. 		miR=min(miR, cnt);
  26. 		cnt=0;
  27. 	}
  28. 	for(int j=0; j<m; j++) {
  29. 		for(int i=0; i<n; i++) {
  30. 			cnt+=arr[i][j];
  31. 		}
  32. 		miC=min(miC, cnt);
  33. 		cnt=0;
  34. 	}
  35. 	mi=min(miR, miC);
  36. 	printf("%d", mi);
  37. 	return 0;
  38. }
Success #stdin #stdout 0s 4612KB
comments (?)
stdin
copy 
2 2
1 3
4 2
stdout
copy 
Standard output is empty
https://ideone.com/kAyfyz
language:
C++ (gcc 8.3)
created:
11 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!