Pagini recente » Cod sursa (job #415364) | Cod sursa (job #111179) | Cod sursa (job #238044) | Cod sursa (job #1210145) | Cod sursa (job #478841)
Cod sursa(job #478841)
#include<fstream>
using namespace std;
int n,l,nr,q,qq,a[270][270],pozi,pozj;
int main(){
ifstream f("lacate.in");
ofstream g("lacate.out");
f>>n;
g<<n*(n-1)/2<<" "<<n-1<<"\n";
int i,j;
pozi=0;
pozj=0;
do
{
pozi++;
pozj++;
qq=q;
for(j=pozj;j<=n-1;j++)
a[pozi][j]=++qq;
for(i=pozi+1;i<=n;i++)
a[i][pozj]=++q;
}
while(pozj<n-1);
for(i=1;i<=n;i++)
{
for(j=1;j<n;j++){
g<<a[i][j]<<" ";
}
g<<"\n";
}
return 0;
}