Cod sursa(job #1958699)
Utilizator | Data | 8 aprilie 2017 17:16:06 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int v[20],k,n,i,cnt,m,j;
int bkt(int j){
if(cnt==k){
for(i=1;i<=k;i++)
g<<v[i]<<" ";
g<<'\n';
}
for(int i=j+1;i<=n;i++)
{
cnt++;
v[cnt]=i;
bkt(i);
cnt--;
}
}
int main()
{
f>>n>>k;
bkt(0);
return 0;
}