Sie sind auf Seite 1von 2

//sume pe directii paralele cu diag

sec
//in toata matricea
#include<iostream.h>
int main()
{
int a[20][20],n,i,j,k,s;
cin>>n;
for (i=0;i<=n-1;i++)
for (j=0;j<=n-1;j++)
cin>>a[i][j];
for (i=0;i<=n-1;i++)
{
for (j=0;j<=n-1;j++)
cout<<a[i][j]<<" ";
cout<<endl;}
k=-n-1;
do
{
s=0;
k++;
for(i=0;i<=n-1;i++)
for (j=0;j<=n-1;j++)
if (i+j==n+k)
s=s+a[i][j];
cout<<"suma= "<<s<<endl; }
while (k<n-2);
return 0;
}
//sume directii paralele
//sub diag secundara
#include<iostream.h>
int main()
{
int a[20][20],n,i,j,k,s;
cin>>n;
for (i=0;i<=n-1;i++)
for (j=0;j<=n-1;j++)
cin>>a[i][j];
for (i=0;i<=n-1;i++)
{
for (j=0;j<=n-1;j++)
cout<<a[i][j]<<" ";
cout<<endl;}
k=-1;
do
{
s=0;
k++;
for(i=0;i<=n-1;i++)
for (j=0;j<=n-1;j++)
if (i+j==n+k)

s=s+a[i][j];
cout<<"suma= "<<s<<endl; }
while (k<n-2);
return 0;
}
//parcurgere in spirala coltul dreapta
sus
//spre stanga
#include <iostream.h>
void spirala(int a[20][20],int n)
{
int lc =0 ,cc =0,i;
while(n >= 0)
{
for(i = n-1; i >= cc; i--)
cout<<a[lc][i]<<" ";
for(i = lc + 1; i < n; i++)
cout<<a[i][lc]<<" ";
for(i = cc+1; i <= n-1; i++)
cout<<a[n-1][i]<<" ";
for(i = n - 2; i >= lc + 1; i--)
cout<<a[i][n-1]<<" ";
n--;
lc++;
cc++;
}
}
void main()
{int n,a[20][20],k,p;
cin>>n;
for (k=0;k<=n-1;k++)
for (p=0;p<=n-1;p++)
cin>>a[k][p];
for (k=0;k<=n-1;k++)
{
for (p=0;p<=n-1;p++)
cout<<a[k][p]<<" ";
cout<<endl;}
spirala(a,n);
}
// parcurgere spre dreapta
//coltul stanga sus
#include <iostream.h>
void spirala(int a[20][20],int n)
{
int lc = 0,cc = 0,i;
while(n >= 0)
{
for(i = cc; i < n; i++)
cout<<a[lc][i]<<" ";
for(i = lc + 1; i < n; i++)

cout<<a[i][n-1]<<" ";
for(i = n - 2; i >= cc; i--)
cout<<a[n-1][i]<<" ";
for(i = n - 2; i >= lc + 1; i--)
cout<<a[i][cc]<<" ";
n--;
lc++;
cc++;
}
}

void main()
{int n,a[20][20],k,p;
cin>>n;
for (k=0;k<=n-1;k++)
for (p=0;p<=n-1;p++)
cin>>a[k][p];
spirala(a,n);
}

Das könnte Ihnen auch gefallen