Pagini recente » Cod sursa (job #2589285) | Cod sursa (job #1984517) | Cod sursa (job #3279814) | Cod sursa (job #3288386) | Cod sursa (job #937894)
Cod sursa(job #937894)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("lacate.in");
ofstream g("lacate.out");
int main() {
long a[256],n=0,i=0,j=0,k=0,m,l=0,p;
f>>n;
m=n-1;
p=n*(n-1)/2;
g<<p<<" "<<m;
for (i=0;i<m; i++)
a[i]=0;
for (i=1;i<=n; i++){
for (j=0; j<k-1; j++)
a[j]=a[j]+1;
for (j=k; j<m; j++){
l++;
a[j]=l;
}
for (j=0; j<m; j++)
g<<a[j]<<" ";
k++;
}
return 0;
}