Cod sursa(job #1300330)
Utilizator | Data | 24 decembrie 2014 12:43:16 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <iostream>
using namespace std;
int n, m, k, s[20];
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)
{for(int i=1; i<=k; i++)
cout<<s[i]<<' ';
cout<<'\n';}
else{
k++;
s[k]=s[k-1];
}
}
else
k--;
}
return 0;
}