Cod sursa(job #1666590)
Utilizator | Data | 28 martie 2016 10:03:08 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.31 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,p;
in>>n>>p;
int k,x[p],ok,i;
k=0;
x[k]=0;
while(k>=0)
{
if(x[k]<n)
{
x[k]++;
ok=1;
for(i=0;i<k;i++)
{
if(x[i]>=x[k])
{
ok=0;
break;
}
}
if(ok)
{
if(k==p-1)
{
for(i=0;i<p;i++)
{
out<<x[i]<<" ";
}
out<<"\n";
}
else
{
k++;
x[k]=0;
}
}
}
else
k--;
}
return 0;
}