Pagini recente » Cod sursa (job #2730711) | Cod sursa (job #743605) | Cod sursa (job #933497) | Cod sursa (job #619555) | Cod sursa (job #863537)
Cod sursa(job #863537)
#include <fstream>
using namespace std;
ifstream in("lacate.in");
ofstream out("lacate.out");
int n;
int m[260][260];
int lo[260];
int lin;
int L,C;
void show()
{
int i,j;
for(i=1;i<=n;++i)
{
for(j = 1 ; j <= C ; ++ j)
out << m[i][j] << " ";
out << "\n";
}
}
void solve()
{
int i;
int c = 1;
lin = 2;
for(i = 1 ; i <= L ; ++ i)
{
m[c][++lo[c]] = i;
if(lo[c] == C)
++c;
m[lin][++lo[lin]] = i;
++lin;
if(lin == n+1)
lin = c+1;
}
}
int main()
{
int i,j;
in >> n;
C = (n-1);
L = C * n;
L >>= 1;
out << L << " " << C << "\n";
solve();
show();
}