Cod sursa(job #837446)
Utilizator | Data | 17 decembrie 2012 23:48:43 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,i,j,m,a[20];
void gen(int k)
{
int i,j;
if(k==m+1)
{
for(j=1;j<=m;++j)
g<<a[j];
g<<"\n";
}
else
for(i=a[k-1]+1;i<=n;++i)
{
a[k]=i;
gen(k+1);
}
}
int main()
{
f>>n>>m;;
a[0]=0;
gen(1);
return 0;
}