Cod sursa(job #894712)
Utilizator | Data | 26 februarie 2013 23:06:41 | |
---|---|---|---|
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 a[19],n,m;
void tipar()
{ for(int i=1; i<=m; i++)
g<<a[i]<<' ';
g<<'\n';
}
void back(int k)
{ if(k==m+1)
tipar();
else
for(int i=a[k-1]+1; i<=n; i++)
{ a[k]= i;
back(k+1); }}
int main()
{ f>>n>>m;
back(1);
return 0;}