Pagini recente » Cod sursa (job #2972969) | Istoria paginii runda/p1-66/clasament | Cod sursa (job #2708071) | Cod sursa (job #1435546) | Cod sursa (job #1755009)
#include<fstream>
using namespace std;
ifstream f("lacate.in");
ofstream g("lacate.out");
int n, i, j, k, a[257][257];
int main()
{
f>>n;
g<<n*(n-1)/2<<" "<<n-1<<'\n';
for(i=1; i<=n; i++)
{
for(j=1;j<=n-1;j++)
{
if(!a[i][j]) { ++k; a[i][j] = a[j+1][i] = k;}
}
}
for (i=1;i<=n;i++)
{
for (j=1;j<=n-1;j++)
{
g<<a[i][j]<<" ";
}
g<<'\n';
}
return 0;
}