Cod sursa(job #2498974)
Utilizator | Data | 24 noiembrie 2019 22:51:12 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,v[32];
void afis()
{
for(int i=1;i<=k;i++)
g<<v[i]<<" ";
g<<"\n";
}
void comb(int u)
{
for(int i=1;i<=n;i++)
{
v[u]=i;
if(v[u]>v[u-1])
{
if(k==u) afis();
else comb(u+1);
}
}
}
int main()
{
f>>n>>k;
comb(1);
return 0;
}