Cod sursa(job #1268741)
| Utilizator | Data | 21 noiembrie 2014 13:16:14 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m,i,j,sol[20];
void back(int k){
int i;
if(k==m+1){
for(i=1;i<=m;i++)
fout<<sol[i]<<" ";
fout<<endl;
}
else
for(i=sol[k-1]+1;i<=n;i++){
sol[k]=i;
back(k+1);
}
}
int main(){
fin>>n>>m;
back(1);
fin.close();fout.close();
return 0;
}
