Question

M am blocat la jumătatea problemei..

Answer 1

#include <iostream>using namespace std;int main(){int n, a[20][20],i,jcin>>n;for (i=1;i<=n;i=i+2) for (j=1;j<=n;j++) a[i][j]=i+j;for (i=2;i<=n;i=1+2) for (j=1;j<=n;j++) {if (a[i-1][1]>a[i-1][2]) a[i][1]=a[i-1][2]; else a[i][1]=a[i-1][1]; if (a[i-1][n]>a[i-1][n-1]) a[i][n]=a[i-1][n-1]; else a[i][n]=a[i-1][n]; if (j!=1 && j!=n) if (a[i-1][j]<a[i-1][j+1] && a[i-1][j]<a[i-1][j-1]) a[i][j]=a[i-1][j]; else if (a[i-1][j-1]<a[i-1][j+1] && a[i-1][j-1]<a[i-1][j]) a[i][j]=a[i-1][j-1]; else a[i][j]=a[i-1][j+1];};for (i=1;i<=n;i++) {for (j=1;j<=n;j++) cout<<a[i][j]<<" "; cout<<endl;};return 0;}