Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- int prost(int n)
- {
- int k;
- k=2;
- while(k*k<=n)
- {
- if(n%k==0) return 0;
- k++;
- }
- return 1;
- }
- int main()
- {
- int a[100][100], n, m, i, j, max=0;
- scanf("%d %d",&n,&m);
- for(i=0;i<n;i++)
- {
- for(j=0;j<m;j++)
- scanf("%d",&a[i][j]);
- }
- for(i=0;i<n;i++)
- {
- for(j=0;j<m;j++)
- {
- if(a[i][j]>max)
- max=a[i][j];
- }
- }
- for(i=0;i<n;i++)
- {
- for(j=0;j<m;j++)
- {
- if(prost(a[i][j])==1) printf("1 ");
- else
- printf("0 ");
- }
- printf("\n");
- }
- printf("%d",max);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement