Advertisement
Guest User

Untitled

a guest
Feb 24th, 2020
123
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.40 KB | None | 0 0
  1. /// se det mai intai nr de patrate concentrice din matrice.
  2. /// det minimul dintre linii si col si stab care (linii,col) ne da acest minim
  3. ///(daca min este impar acei 2 marcatori(l,c)ne vor ajuta sa stab daca in inetiorul ultimelor patrate concetrice se afla o linie sau o col)
  4. ///nr de pp concetrice este min/2
  5. #include <iostream>
  6. using namespace std;
  7. int main()
  8. {
  9. int a[100][100],n,m,i,j,k,l,c,r,minn;
  10. cout<<"m=";
  11. cin>>m;
  12. cout<<"n=";
  13. cin>>n;
  14. for(i=1;i<=m;i++)
  15. for(j=1;j<=n;j++)
  16. {
  17. cout<<"a["<<i<<"]["<<j<<"]=";
  18. cin>>a[i][j];
  19. }
  20. for(i=1;i<=m;i++)
  21. {
  22. cout<<endl;
  23. for(j=1;j<=n;j++)
  24. cout<<a[i][j]<<' ';
  25. }
  26. cout<<endl<<endl;
  27. if(m<n)
  28. {
  29. minn=m;
  30. l=1;
  31. }
  32. else
  33. if(n<m)
  34. {
  35. minn=n;
  36. c=1;
  37. }
  38. r=minn/2;
  39. for(k=1;k<=r;k++)
  40. {
  41. for(j=k;j<=n-k+1;j++)
  42. cout<<a[k][j]<<" ";
  43. for(i=k+1;i<=m-k+1;i++)
  44. cout<<a[i][n+1-k]<<" ";
  45. for(j=n-k;j>=k;j--)
  46. cout<<a[m+1-k][j]<<" ";
  47. for(i=m-k;i>=k+1;i--)
  48. cout<<a[i][k]<<" ";
  49. }
  50. if(minn%2!=0)
  51. {
  52. if(c==1)
  53. for(i=r+1;i<=m-r;i++)
  54. cout<<a[(m+1)/2][j];
  55. if(l==1)
  56. for(j=r+1;j<=n-r;j++)
  57. cout<<a[(m+1)/2][j]<<" ";
  58. }
  59. return 0;
  60. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement