Cod sursa(job #1472537)
Utilizator | Data | 17 august 2015 12:19:56 | |
---|---|---|---|
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 sol[20],n,K;
inline void Back(int k){
if(k==K+1)
{
for(int i=1;i<=K;i++)
g<<sol[i]<<" ";
g<<"\n";
return;
}
for(int i=sol[k-1]+1;i<=n;i++)
{
sol[k]=i;
Back(k+1);
}
}
int main()
{
f>>n>>K;
Back(1);
return 0;
}