Cod sursa(job #3223020)
Utilizator | Data | 12 aprilie 2024 10:25:15 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
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,k,a[19];
void A(int l)
{
int i;
if(l==k+1) {
for(i=1;i<l;G<<a[i++]<<' ');
G<<'\n';
} else
for(i=a[l-1]+1;i<=n-k+l;a[l]=i,A(l+1),++i);
}
int main()
{
return F>>n>>k,A(1),0;
}