Cod sursa(job #2444955)
| Utilizator | Data | 1 august 2019 21:09:45 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,v[10],k;
void afisare()
{
for(int i=1;i<=k;i++)
fout<<v[i]<<" ";
fout<<"\n";
}
bool OK(int k)
{
for(int i=1;i<k;i++)
if(v[i]==v[k])
return false;
return true;
}
void back(int p)
{
for (int i = v[p - 1] + 1; i <= n - k + p; i++)
{
v[p] = i;
if (p == k)
afisare();
else
back(p + 1);
}
}
int main()
{
fin>>n>>k;
back(1);
return 0;
}
