Cod sursa(job #2477831)
Utilizator | Data | 21 octombrie 2019 10:36:03 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,t,m;
int a[19];
void th(int p,int i)
{
for(;p<=n;++p)
{
a[i]=p;
if(i==k){for(int j=0;j<=k;++j)g<<a[j]<<' ';g<<'\n';}
else th(p+1,i+1);
}
}
int main()
{
f>>n>>k;--k;
th(1,0);
}