Pagini recente » Cod sursa (job #2007261) | Cod sursa (job #1752644) | Cod sursa (job #1013053) | Monitorul de evaluare | Cod sursa (job #1308540)
#include<fstream>
using namespace std;
ifstream in("lacate.in");
ofstream out("lacate.out");
const int nmax = 262;
int a[nmax][nmax], n, k;
int main(){
int player_unu=0;
in>>n;
for(int i = 1; i<=n; i++)
{
for(int j = i + 1; j<=n; j++)
{
a[i][j - 1] = ++k;
a[j][i] = k;
}
}
out<<k<<' '<<n - 1<<'\n';
for(int i = 1; i<=n; i++)
{
for(int j = 1; j<n; j++)
out<<a[i][j]<<' ';
out<<'\n';
}
return player_unu;
}