Cod sursa(job #2588838)
Utilizator | Petrea Nicoleta nicoletaptr2002 | Data | 25 martie 2020 15:29:01 |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.78 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, x[14],p=0;
void afisare()
{
for(int i=1; i<=p; i++) fout<<x[i]<<" ";
fout<<endl;
}
int test(int k)
{
for(int i=1; i<k; i++)
if (x[i]==x[k] ) return 0;
return 1;
}
int main()
{
fin>>n>>p;
k=1;
x[k]=0;
while(k>0)
{
while (x[k]<n)
{
x[k]++;
if (test(k))
if (k==p) afisare();
else
{
k++;
x[k]=0;
}
}
k-- ;
}
}