Pagini recente » Istoria paginii runda/pregatire_oji_11-12_/clasament | Istoria paginii runda/cls_11_simulare_oji/clasament | Istoria paginii runda/alianta_001/clasament | Cod sursa (job #1755247) | Cod sursa (job #1442414)
#include <fstream>
using namespace std;
ifstream f("lacate.in");
ofstream g("lacate.out");
int N,Matrix[300][300];
int main()
{
f>>N;
g<<N*(N-1)/2<<" "<<N-1<<"\n";
int ind=0;
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N-1;j++)
if(Matrix[i][j]==0)
Matrix[i][j]=Matrix[j+1][i]=++ind;
}
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N-1;j++)
g<<Matrix[i][j]<<" ";
g<<"\n";
}
return 0;
}