Cod sursa(job #1308108)
Utilizator | Data | 3 ianuarie 2015 16:19:48 | |
---|---|---|---|
Problema | Lacate | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
using namespace std;
const int NMAX= 256;
ifstream in( "lacate.in" );
ofstream out( "lacate.out" );
int m[NMAX+1][NMAX+1], K;
int main( )
{
int N;
in >> N;
for( int i= 1; i<=N; ++i )
{
for( int j= i+1; j<=N; ++j )
{
m[i][j-1]= ++K;
m[j][i]= K;
}
}
out << K << " " << N-1 << '\n';
for( int i= 1; i<=N; ++i )
{
for( int j= 1; j<N; ++j )
{
out << m[i][j] << " ";
}
out << '\n';
}
return 0;
}