Cod sursa(job #2524891)
Utilizator | Data | 16 ianuarie 2020 15:24:58 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int x[20],n,i,p;
int valid(int k)
{
int i;
for(i=1;i<=k-1;i++)
if(x[i]>=x[k])
return 0;
return 1;
}
int main()
{
f>>n>>p;
i=1;
do
{
do
{
x[i]++;
if(x[i]>n)
{
x[i]=0;
i--;
}
else
if(valid(i))
i++;
}while(i<=p&&i>0);
if(i>p)
{
for(i=1;i<=p;i++)
g<<x[i]<<" ";
i=p;
g<<"\n";
}
}while(i>0);
return 0;
}