Cod sursa(job #2932707)
Utilizator | Bogdan Schiop bogdan.schiop | Data | 3 noiembrie 2022 18:59:41 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.94 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int a[30];
int n;
int p;
bool verif(int k)
{
for(int i = 1; i < k; i++)
{
if(k == 0) return false;
if(a[i] >= a[k])
return false;
}
return true;
}
void permutari()
{
int i = 1;
do
{
do
{
a[i]++;
if(a[i] > p)
{
a[i] = 0;
i--;
}
else
if(verif(i))
i++;
}while(i <= n && i >= 1);
if(i > n)
{
for(int j = 1; j <= n; j++)
fout << a[j] << ' ';
fout << endl;
i = n;
}
}while(i >= 1);
}
int main()
{
fin >> p >> n;
permutari();
return 0;
}