Cod sursa(job #1188348)
Utilizator | Data | 19 mai 2014 14:25:32 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include<fstream>
using namespace std;
int x[21],n,i,k;
int valid(int k)
{
int i;
for(i=1;i<=k-1;i++)
if(x[i]>=x[k])
return 0;
return 1;
}
int main()
{
ifstream f("combinari.in");
ofstream g("combinari.out");
f>>n>>k;
i=1;
do
{
do
{
x[i]++;
if(x[i]>n)
{
x[i]=0;
i--;
}
else
if(valid(i))
i++;
}while(i<=k&&i>0);
if(i>k)
{
for(i=1;i<=k;i++)
g<<x[i]<<" ";
g<<"\n";
i=k;
}
}while(i>0);
return 0;
}