Advertisement
Guest User

Untitled

a guest
May 31st, 2016
58
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.72 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. int prost(int n)
  4. {
  5. int k;
  6. k=2;
  7. while(k*k<=n)
  8. {
  9. if(n%k==0) return 0;
  10. k++;
  11.  
  12. }
  13. return 1;
  14.  
  15. }
  16.  
  17. int main()
  18. {
  19. int a[100][100], n, m, i, j, max=0;
  20. scanf("%d %d",&n,&m);
  21. for(i=0;i<n;i++)
  22. {
  23. for(j=0;j<m;j++)
  24. scanf("%d",&a[i][j]);
  25.  
  26. }
  27.  
  28. for(i=0;i<n;i++)
  29. {
  30. for(j=0;j<m;j++)
  31. {
  32. if(a[i][j]>max)
  33. max=a[i][j];
  34.  
  35. }
  36.  
  37. }
  38. for(i=0;i<n;i++)
  39. {
  40. for(j=0;j<m;j++)
  41. {
  42.  
  43. if(prost(a[i][j])==1) printf("1 ");
  44. else
  45. printf("0 ");
  46.  
  47. }
  48. printf("\n");
  49. }
  50.  
  51. printf("%d",max);
  52. return 0;
  53.  
  54. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement