Pagini recente » Cod sursa (job #1422881) | Cod sursa (job #417270) | Cod sursa (job #2328911) | Cod sursa (job #2312473) | Cod sursa (job #1308108)
#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;
}