Cod sursa(job #2164415)
Utilizator | Data | 12 martie 2018 23:32:10 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,s[100];
void backk(int l)
{
int i;
if(l==k){
for(i=1;i<=k;i++)
g<<s[i]<<" ";
g<<'\n';
}
else for(i=s[l]+1;i<=n;i++)
{
s[l+1]=i;
backk(l+1);
}
}
int main()
{
f>>n>>k;
backk(0);
return 0;
}