Cod sursa(job #1983082)
Utilizator | Data | 21 mai 2017 11:36:07 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
long long n,m,a[10];
void scr()
{
int i;
for(i=1;i<=m;i++) g<<a[i]<<" ";
g<<'\n';
}
void back(int k)
{
int i;
if(k==m) scr();
else
{
for(i=a[k]+1;i<=n;i++)
{
a[k+1]=i;
back(k+1);
}
}
}
int main()
{
f>>n>>m;
back(0);
return 0;
}