Cod sursa(job #2451017)
Utilizator | Data | 25 august 2019 13:27:51 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,s[1001];
void bt(int k)
{
if(k-1==m)
{
for(int i=1;i<=m;i++)
g<<s[i]<<" ";
g<<'\n';
}
else
{
for(int i=s[k-1]+1;i<=n;i++)
{
s[k]=i;
bt(k+1);
}
}
}
int main()
{
f>>n>>m;
bt(1);
f.close();
g.close();
return 0;
}