Cod sursa(job #2395702)
| Utilizator | Data | 2 aprilie 2019 20:00:56 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m;
void bkt(int);
vector<int> a;
int main()
{
f>>n>>m;
bkt(1);
return 0;
}
void bkt(int i)
{
if(i==m+1)
{
for(int j=1;j<=m;j++)
g<<a[i]<<' ';
g<<'\n';
return;
}
for(int j=1;j<=n;j++)
{
bool gasit=false;
for(int k=1;k<=n;k++)
if(a[k]==j)
gasit=true;
if(!gasit)
{
a[i]=j;
bkt(i+1);
}
}
}
