Cod sursa(job #1360227)
| Utilizator | Data | 25 februarie 2015 13:03:02 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m;
int v[20];
int viz[20];
void afis(){
for(int i=1;i<=m;i++) g<<v[i]<<" ";
g<<endl;
}
void back(int k){
if(k==m+1) afis();
else {
for(int i=v[k-1]+1;i<=n;i++){
if(!viz[i]){
viz[i]=1;
v[k]=i;
back(k+1);
viz[i]=0;
}
}
}
}
int main()
{
f>>n>>m;
back(1);
return 0;
}
