Cod sursa(job #396087)
| Utilizator | Data | 14 februarie 2010 14:54:40 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream.h>
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k, x[19], m;
void tipar(int m){
for(int i=1;i<=m;i++)
g<<x[i]<<" ";
g<<'\n';
}
void back(){
m=1;
x[m]=0;
while(m>0)
if(x[m]<n){
x[m]++;
if(m==k)
tipar(m);
else {
m++;
x[m]=x[m-1];
}
}
else m--;
}
int main(){
f>>n>>k;
back();
f.close();
g.close();
return 0;
}
