Cod sursa(job #1971467)
| Utilizator | Data | 20 aprilie 2017 14:24:17 | |
|---|---|---|---|
| Problema | Combinari | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int Nmax=9;
int N,V[Nmax],j,K;
void Print()
{
for(int i=1;i<=K;++i)
{
fout<<V[i]<<" ";
}
fout<<"\n";
}
void Back(int i)
{
for(int j=1;j<=N;++j)
{
V[i]=j;
if(V[i]>V[i-1])
{
if(i==K)
{
Print();
}
Back(i+1);
}
}
}
int main()
{
fin>>N>>K;
Back(1);
return 0;
}
