Cod sursa(job #1673265)
Utilizator | Data | 3 aprilie 2016 16:42:33 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <bits/stdc++.h>
#define q for(i=0; i<n; ++i)
int n,k,i,v[18];
int main() {
std::ifstream f("combinari.in");
std::ofstream g("combinari.out");
f>>n>>k;
q v[i]=1;
do {
q if(!v[i]) g<<i+1<<' ';
g<<'\n';
}while(std::next_permutation(v,v+n));
}