Pagini recente » Cod sursa (job #1161033) | Cod sursa (job #1629402) | Cod sursa (job #1418190) | Cod sursa (job #87018) | Cod sursa (job #845120)
Cod sursa(job #845120)
#include <fstream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main()
{
ifstream fin("lacate.in");
ofstream fout("lacate.out");
int m[300][300], i, j, n, k;
//Read
fin>>n;
//Compute
k = 0;
for(i=1; i<=n; i++)
for(j=i; j<n; j++)
{
k++;
m[i][j] = k;
m[j+1][i] = k;
}
//Print
fout<<n*(n-1)/2<<" "<<n-1<<'\n';
for(i=1; i<=n; i++)
{
for(j=1; j<n; j++)
fout<<m[i][j]<<" ";
fout<<'\n';
}
}