Pagini recente » Cod sursa (job #2587382) | Cod sursa (job #2090369) | Cod sursa (job #863961) | Cod sursa (job #1573901) | Cod sursa (job #2494105)
Utilizator |
Eric Vilcu Eric |
Data |
17 noiembrie 2019 12:39:40 |
Problema |
Lacate |
Scor |
100 |
Compilator |
cpp-64 |
Status |
done |
Runda |
ad_hoc |
Marime |
0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("lacate.in");
ofstream g("lacate.out");
int n,m;
int a[257][256];
int main()
{
f>>n;
m=n*(n-1)/2;
for(int i=1,k=1;i<n;++i)for(int j=i+1;j<=n;++j,++k){a[i][++a[i][0]]=k;a[j][++a[j][0]]=k;}
g<<m<<' '<<n-1<<'\n';
for(int i=1;i<=n;++i){for(int j=1;j<n;++j)g<<a[i][j]<<' ';g<<'\n';}
}