Cod sursa(job #1181325)
Utilizator | Data | 2 mai 2014 15:02:41 | |
---|---|---|---|
Problema | Submultimi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
int p, st, dr, mid;
int v[100], n, i, j;
int main(){
fin>>n;
while (v[0]==0) {
j = n;
while (v[j] == 1) {
v[j] = 0;
j--;
}
v[j] = 1;
for (i=1;i<=n;i++)
if (v[i] == 1)
fout<<i<<" ";
fout<<"\n";
}
return 0;
}