Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- using namespace std;
- void cit(int &n, int &m, int a[11][11])
- {
- int i, j;
- cout<<"m = ";
- cin>>m;
- cout<<"n = ";
- cin>>n;
- for(i=1; i<=m; i++)
- {
- for(j=1; j<=n; j++)
- cin>>a[i][j];
- }
- }
- void afis(int n, int m, int a[11][11])
- {
- int i, j;
- for(i=1; i<=m; i++)
- {
- for(j=1; j<=n; j++)
- cout<<a[i][j]<<" ";
- cout<<endl;
- }
- }
- void sortare(int n, int m, int a[11][11], int y)
- {
- int i, k;
- for(i=1; i<=m-1; i++)
- for(k=i+1; k<=m; k++)
- if(a[i][y]<a[k][y])
- {
- a[i][y]=a[i][y]+a[k][y];
- a[k][y]=a[i][y]-a[k][y];
- a[i][y]=a[i][y]-a[k][y];
- }
- }
- int contur_pp(int n, int m, int a[11][11])
- {
- int i, j, k=0;
- for(j=1; j<=m; j++)
- {
- if(sqrt(a[1][j])==(int)sqrt(a[1][j]))
- k++;
- if(sqrt(a[n][j])==(int)sqrt(a[n][j]))
- k++;
- }
- for(i=2; i<=n-1; i++)
- {
- if(sqrt(a[i][1])==(int)sqrt(a[i][1]))
- k++;
- if(sqrt(a[i][m])==(int)sqrt(a[i][m]))
- k++;
- }
- return k;
- }
- int main()
- {
- int n, m, a[11][11];
- cit(n, m, a);
- cout<<endl;
- afis(n, m, a);
- cout<<endl;
- cout<<contur_pp(n, m, a);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement