Cod sursa(job #701944)
| Utilizator | Data | 1 martie 2012 18:43:08 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
int v[18], k=1, b, n, m;
void valid()
{
int i;
b=1;
if(v[k]>n)
b=0;
else
for(i=1;i<k;i++)
if(v[i]>=v[k]){
b=0;
break;}
}
int main ()
{
ifstream in ("combinari.in");
ofstream out ("combinari.out");
int i;
v[1]=0;
in>>n>>m;
while(k>0){
do{
v[k]++;
valid();
}while(!b&&v[k]<=n);
if(b){
if(k==m){
for(i=1;i<=m;i++)
out<<v[i]<<' ';
out<<'\n';}
else
k++;}
else{
v[k]=0;
k--;}}
return 0;
}
