Cod sursa(job #1842567)
Utilizator | Data | 7 ianuarie 2017 11:12:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int s[20],n,l;
void back(int k)
{
int i;
for(i=s[k-1]+1; i<=n; ++i)
{
s[k]=i;
if(k==l)
{
for(int j=1; j<=l; ++j) fout<<s[j]<<' ';
fout<<'\n';
}
else back(k+1);
}
}
int main()
{
fin>>n>>l;
back(1);
return 0;
}