Cod sursa(job #302811)
Utilizator | Data | 9 aprilie 2009 12:14:27 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,k,i,j,q,x[50];
void afis()
{
for(i=1;i<=k;i++)
out<<x[i]<<" ";
out<<"\n";
}
int cc(int q)
{
for(i=1;i<q;i++)
if(x[i]>=x[q])
return 0;
return 1;
}
void back()
{
q=1;
while(q)
{while(x[q]<n)
{
x[q]++;
//if(cc(q))
if(q==k)
afis();
else
x[++q]=x[q-1];
}
--q;
}
}
int main ()
{
in>>n>>k;
back();
}