Cod sursa(job #1990616)
Utilizator | Data | 12 iunie 2017 19:38:02 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
using namespace std;
int n,m,i,j,s,nr,y,x,i1,j1,maxim,a[251][251],v[5],k,dif;
int main()
{
cin>>n>>m;;k=-1;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
k+=2;
a[i][j]=k*k;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
return 0;
}