Pagini recente » fmi-no-stress-9/solutii | Coding Cotest Byte: The Square Root Trick | Istoria paginii utilizator/1adriane4923tg4 | Rezultatele filtrării | Cod sursa (job #552894)
Cod sursa(job #552894)
#include<stdio.h>
#include<fstream.h>
int n,a[300][300],i,j,k=1;
int main()
{
ifstream f("lacate.in");
ofstream g("lacate.out");
f>>n;
g<<(n*(n-1))/2<<" "<<n-1<<"/n";
for(i=1;i<=n;i++)
for(j=i;j<=n-1;j++)
{
a[i][j]=a[j+1][i]=k;
k++;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n-1;j++)
g<<a[i][j];
g<<"/n";
}
return 0;
}