Cod sursa(job #1972742)
Utilizator | Data | 23 aprilie 2017 16:16:03 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int K,n,sol[1001];
void beck (int k)
{
int i;
if(k==K+1){for(i=1;i<=K;i++)g<<sol[i]<<" ";g<<'\n';}
else if(k<=K)
{
for(i=sol[k-1]+1;i<=n;i++)
{
sol[k]=i;
beck(k+1);
}
}
}
int main()
{
f>>n>>K;
beck(1);
return 0;
}