Cod sursa(job #2544772)
Utilizator | Data | 12 februarie 2020 15:13:06 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
using namespace std;
ifstream in ("combinari.in");
ofstream out("combinari.out");
int s[20];
int n,m;
void bk(int k)
{
if(k==m){
for(int i=s[k-1]+1; i<=n; i++)
{
s[k]=i;
for(int i=1; i<=m; i++)
out<<s[i]<<" ";
out<<'\n';
}
return;
}
for(int i=s[k-1]+1; i<=n; i++)
{
s[k]=i;
bk(k+1);
}
}
int main()
{
in>>n>>m;
bk(1);
}