Cod sursa(job #2462815)
| Utilizator | Data | 27 septembrie 2019 20:39:42 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
int n, k = 1;
int main()
{
f >> n;
int poz[n+1];
poz[1] = 0;
while(k > 0) {
poz[k]++;
if(poz[k] <= n) {
for(int i = 1; i <= k; i++)
g << poz[i] << ' ';
g << '\n';
if(k < n && poz[k] != n) {
k++;
poz[k] = poz[k-1];
}
} else {
k--;
}
}
return 0;
}
