Cod sursa(job #2138101)
Utilizator | Data | 21 februarie 2018 12:48:48 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,v[21],k;
void back(int q)
{
int i;
if(q==k)
{
for(i=1; i<=k; i++)
{
g<<v[i]<<" ";
}
g<<endl;
}
else
{
for(i=v[q]+1; i<=n; i++)
{
v[q+1]=i;
back(q+1);
}
}
}
int main()
{
f>>n>>k;
back(0);
return 0;
}