Cod sursa(job #557433)
Utilizator | Data | 16 martie 2011 17:42:36 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k,a[21];
void back(int p)
{
int i;
if(p>k)
{
for(i=1; i<=k; i++)
fout<<a[i]<<' ';
fout<<'\n';
}
else
{
for(i=a[p-1]+1; i<=n; i++)
{
a[p]=i;
back(p+1);
}
}
}
int main(){
fin>>n>>k;
back(1);
fout.close();
return 0;
}