Cod sursa(job #1694596)
Utilizator | Data | 25 aprilie 2016 17:22:43 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
long long int n,l,v[10000000];
void back(long long int k){
if(k==l){
for(int i=1;i<=k;i++)
fo<<v[i]<<" ";
fo<<endl;
}
else for(int i=v[k]+1;i<=n;i++)
{
v[k+1]=i;
back(k+1);
}
}
int main(){
fi>>n>>l;
back(0);
return 0;
}