Cod sursa(job #2548678)
Utilizator | Data | 16 februarie 2020 21:34:10 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
#define mod 1999999973
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,x[20],t;
void bt(int k)
{
for(int i=x[k-1]+1;i<=n;i++)
{
x[k]=i;
if(k==t)
{
for( int j=1;j<=k;j++)
g<<x[j]<<" ";
g<<'\n';
}
else
bt(k+1);
}
}
int main()
{
f>>n>>t;
x[0]=0;
bt(1);
return 0;
}