Cod sursa(job #2135235)
| Utilizator | Data | 18 februarie 2018 18:26:37 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,v[20],k,m;
//combinari de n luate cate k
void init(){v[k]=v[k-1];}
int sol(){return (k==m);}
void afisare()
{
for(int i=1;i<=m;i++)g<<v[i]<<" ";
g<<'\n';
}
void bt()
{
k=1;
init();
while(k>0)
{
while(v[k]<n-m+k)
{
v[k]++;
if(sol())afisare();
else{k++;init();}
}
k--;
}
}
int main()
{
f>>n>>m;
bt();
return 0;
}
