Cod sursa(job #2261550)
| Utilizator | Data | 16 octombrie 2018 12:55:57 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.75 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int v[10],n,m,k;
int a,b;
bool verif(int a)
{
for(int i=1; i<a; i++)
if(v[i]==v[a])
return 0;
return 1;
}
void afisare()
{
for(int i=1; i<=n; i++)
fout<<v[i]<<" ";
fout<<"\n";
}
void backtr (int pas)
{
while(pas>0)
{
v[pas]++;
if(v[pas]>m&&v[pas]>k-n+pas)
pas--;
else
{
if(pas<n){
pas++;
v[pas]=v[pas-1];
}
else
afisare();
}
}
}
int main()
{
fin>>k>>n;
backtr(1);
}
