Cod sursa(job #2506568)
| Utilizator | Data | 8 decembrie 2019 13:43:05 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int sol[105],fol[105],n;
void combinari(int pas ,int k)
{
if(pas > k){
for(int i=1 ;i<=k ; i++)
cout<<sol[i]<<" ";
cout<<"\n";
return;
}
for(int i=sol[pas-1]+1 ; i<=n ; i++){
sol[pas]=i;
combinari(pas+1,k);
}
}
int main()
{
cin>>n;
for(int i=1 ; i<=n ; i++)
combinari(1,i);
return 0;
}
