Cod sursa(job #789989)
Utilizator | Data | 19 septembrie 2012 23:29:59 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<iostream>
#include<fstream>
using namespace std;
int n, m, st[20];
ifstream f ("combinari.in");
ofstream g ("combinari.out");
void afis()
{
int j;
for(j=1; j<=m; j++)
g<<st[j]<<" ";
g<<endl;
}
void back(int k)
{
int i;
for(i=st[k-1]+1; i<=n; i++)
{
st[k]=i;
if(k==m)
afis();
else
back(k+1);
}
}
int main()
{
f>>n;
f>>m;
back(1);
}