Pagini recente » Cod sursa (job #1984967) | Autentificare | Istoria paginii runda/7_martie_simulare_oji_2024_clasa_10/clasament | Istoria paginii runda/pregatire_oji_11-12_ | Cod sursa (job #346076)
Cod sursa(job #346076)
#include <stdio.h>
using namespace std;
int n,k,i,j,nr,o;
int main()
{ freopen("tablete.in","r",stdin);
freopen("tablete.out","w",stdout); scanf("%d %d",&n,&k); if (n%2==0 && k%2==0) { for (i=1;i<=n;++i) { for (j=1;j<=n;++j)
printf("%d ",(i-1)*n+j); printf("\n"); } } else if (n%2==1 && k%2==1) for (i=1;i<=n;++i) { for (j=1;j<=n;++j) if (i%2==1 &&
j==k && i!=n) { o=nr+1; nr+=2; printf("%d ",nr); } else if (i%2==0 && j==1) printf("%d ",o); else if (i==n-1 && j==n)
printf("%d ",n*n); else { ++nr; printf("%d ",nr); } printf("\n"); } else for (i=1;i<=n;++i) { nr=i-n; for (j=1;j<=n;++j) { if
(j==k-1) nr+=n-i+2*i-1; else if (j==k) ++nr; else if (j==k+1) nr+=(n-i)*2+i; else nr+=n; printf("%d ",nr); } printf("\n"); }
return 0; }