Cod sursa(job #1140285)
| Utilizator | Data | 11 martie 2014 21:21:15 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int v1[100],v2[100],n,K;
void perm(int k){
if(k>K){
for(int i=1;i<=K;++i){
g <<v1[i]<<" ";
}
g <<"\n";
}
else{
for(int i=v1[k-1]+1;i<=n;++i){
if(!v2[i]){
v2[i]=1;
v1[k]=i;
perm(k+1);
v2[i]=0;
}
}
}
}
int main(){
f >>n>>K;
perm(1);
return 0;
}