Cod sursa(job #1492273)
Utilizator | Data | 27 septembrie 2015 15:12:39 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,p,s[19];
void back(int p)
{
int i;
if(p==k)
{
for(i=1; i<=k; i++)
g<<s[i]<<" ";
g<<'\n';
}
else
{
for(i=s[p]+1;i<=n;i++)
{
s[p+1]=i;
back(p+1);
}
}
}
int main()
{
f>>n>>k;
back(0);
f.close();
g.close();
return 0;
}