Cod sursa(job #2076122)
Utilizator | Data | 26 noiembrie 2017 11:11:12 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,i,j,v[20],m;
int main()
{
f>>n>>m;
k=1; v[k]=0;
while (k)
if (v[k]<n-m+k) {
v[k]++;
if (k==m) {
for (i=1; i<=m; i++) g<<v[i]<<' ';
g<<'\n';
}
else { k++; v[k]=v[k-1]; }
}
else k--;
return 0;
}