Advertisement
Saleh127

CF 271B

Oct 11th, 2020
131
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.20 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define ll long long
  4. #define test int t; cin>>t; for(int cs=1;cs<=t;cs++)
  5. #define maX 100008
  6. bool marked[maX];
  7. void sieve()
  8. {
  9. marked[0]=1;
  10. marked[1]=1;
  11. for(ll i=4;i<=maX;i+=2)
  12. {
  13. marked[i]=1;
  14. }
  15. for(ll i=3;i<=maX;i+=2)
  16. {
  17. if(marked[i]==0)
  18. {
  19. for(ll j=i*i; j<=maX; j+=i+i)
  20. {
  21. marked[j]=1;
  22. }
  23. }
  24. }
  25. }
  26. int main()
  27. {
  28. ios_base::sync_with_stdio(0);
  29. cin.tie(0);cout.tie(0);
  30. sieve();
  31.  
  32. ll a[505][505],c,d,e,f,i,j,k,l,r;
  33. cin>>r>>c;
  34. for(i=1;i<=r;i++)
  35. {
  36. for(j=1;j<=c;j++)
  37. {
  38. cin>>a[i][j];
  39. }
  40. }
  41. k=100000000000000;
  42. for(i=1;i<=r;i++)
  43. {
  44. l=0;
  45. for(j=1;j<=c;j++)
  46. {
  47. f=a[i][j];
  48. while(marked[f]==1)
  49. {
  50. l++,f++;
  51. }
  52. }
  53. k=min(k,l);
  54. }
  55. for(i=1;i<=c;i++)
  56. {
  57. l=0;
  58. for(j=1;j<=r;j++)
  59. {
  60. f=a[j][i];
  61. while(marked[f]==1)
  62. {
  63. l++,f++;
  64. }
  65. }
  66. k=min(k,l);
  67. }
  68. cout<<k<<endl;
  69. return 0;
  70. }
  71.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement