Pagini recente » Cod sursa (job #1705908) | Cod sursa (job #2024806) | Cod sursa (job #2304979) | Cod sursa (job #2425797) | Cod sursa (job #1679302)
#include <iostream>
#include <algorithm>
#include <vector>
#include <fstream>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
int v[17];
int n;
void afisare(int k)
{
int i;
for(int i = 1; i <= k; ++i)
g << v[i] << ' ';
g << '\n';
}
int verifica( int v[],int k){
return v[k] > v[k - 1] ;
}
void submultimi(int v[], int k){
if (k > n) return;
int i;
for(int i = 1; i <= n; ++i){
v[k] = i;
if( verifica(v,k)){
if( k <= n){ // daca am gasit solutie
afisare(k);
}
submultimi(v,k + 1);
}
}
}
int main(){
f >> n;
submultimi(v,1);
return 0;
}