Cod sursa(job #3121753)
Utilizator | Data | 15 aprilie 2023 10:57:51 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
ifstream F("combinari.in");
ofstream G("combinari.out");
int n,m,a[20];
void A(int k)
{
int i;
if(k==m+1) {
for(i=1;i<=k;G<<a[i++]<<' ')
G<<'\n';
} else
for(i=a[k-1]+1;i<=n-m+k;a[k]=i,A(k+1),++i);
}
int main()
{
return F>>n>>m,A(1),0;
}