Cod sursa(job #1312270)
| Utilizator | Data | 9 ianuarie 2015 08:41:03 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, m, k,x[19];
void afis()
{
for(int i=1;i<=n;i++)
g<<x[i]<<" ";
g<<endl;
}
void back()
{
k=1;x[k]=0;
do{
while(x[k]<m-n+k)
{
x[k]++;
if(k==n) afis();
else
k++, x[k]=x[k-1];
}
k--;
}while(k>0);
}
int main()
{
f>>m>>n;
back();
return 0;
}
