Cod sursa(job #1300326)
| Utilizator | Data | 24 decembrie 2014 12:39:05 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <iostream>
using namespace std;
int n, m, k, s[20];
void scrie(int n){
for(int i=1; i<=n; i++)
cout<<s[i]<<' ';
cout<<'\n';
}
int main()
{
ifstream cin ("combinari.in");
ofstream cout("combinari.out");
cin>>n>>m;
k=1;
s[k]=0;
while(k>0){
if(s[k]<n){
s[k]++;
if(k==m)
scrie(k);
else{
k++;
s[k]=s[k-1];
}
}
else
k--;
}
return 0;
}
