Cod sursa(job #1474442)
| Utilizator | Data | 21 august 2015 23:25:42 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <iostream>
#include <fstream>
using namespace std;
int x[20],k,ok, n;
int main()
{
fstream f,g;
f.open("submultimi.in",ios::in);
g.open("submultimi.out",ios::out);
f>>n;
k = 1;
x[k] = 0;
while(k > 0)
{
ok = 0;
while (ok == 0 && x[k]<=n)
{
x[k]++;
if (x[k]<=n)
break;
}
if (ok == 0 && x[k]<=n)
{
for ( int i = 1 ; i <= k ; i++)
g<<x[i]<<" ";
g<<"\n";
if (k < n)
{
k++;
x[k] = x[k - 1];
}
}
if ( x[k] > n)
{
k--;
}
}
}
