Cod sursa(job #2266461)
| Utilizator | Data | 22 octombrie 2018 18:10:35 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
const int N=20;
int n,k,s[N];
void bkt(int);
int main()
{
f >> n;
bkt(1);
return 0;
}
void bkt(int poz)
{
for(int i=s[poz-1]+1; i<=n; i++)
{
s[poz]=i;
for(int j=1;j<=poz;j++)g<<s[j]<<' ';g<<'\n';
bkt(poz+1);
}
}
