Cod sursa(job #2709564)
Utilizator | Data | 20 februarie 2021 13:50:57 | |
---|---|---|---|
Problema | Combinari | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,t,a[9],fr[9];
void bacK(int k)
{
if(k==n+1)
{
for(int j=1;j<=n;j++)
{
out<<a[j]<<' ';
}out<<'\n';
return;
}
for(int i=a[k-1]+1;i<=t;++i)
{
a[k]=i;
bacK(k+1);
}
}
int main()
{
in>>t>>n;
bacK(1);
return 0;
}