Cod sursa(job #1969078)
Utilizator | Data | 18 aprilie 2017 11:25:12 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int n,st[19],viz[19],x;
void backt(int k){
for(int i=st[k-1]+1;i<=n;i++){
if(viz[i]==0){
st[k]=i;
viz[i]=1;
if(k==x){
for(int j=1;j<=x;j++)g<<st[j]<<" ";
g<<'\n';
}
else backt(k+1);
viz[i]=0;
}
}
}
int main()
{
f>>n>>x;
backt(1);
}