Pagini recente » Cod sursa (job #3285701) | Cod sursa (job #792243) | Cod sursa (job #1826180) | Cod sursa (job #3273782) | Cod sursa (job #523294)
Cod sursa(job #523294)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f ("submultimi.in");
ofstream g ("submultimi.out");
int x[100], n;
/*void afisare (int k)
{
for (int i=1; i<=k; ++i)
g << x[i] << " ";
g << "\n";
}
int valid (int k)
{
for (int i=1; i<k; ++i)
for (int j=i+1; j<=k; ++j)
if (x[i]==x[j])
return 0;
return 1;
}
void back (int k)
{
for (int i = 1; i <= n; ++i)
{
x[k] = i;
if (valid (k))
if (k <= n)
afisare (k);
else back (k+1);
}
}*/
int main ()
{
f >> n;
//back(1);
for (int i = 1; i <= n; ++i)
for (int j = i; j <= n; ++j)
{
x[i]=j;
cout<<x[i]<<" ";
}
return 0;
}