Cod sursa(job #2506514)
Utilizator | Data | 8 decembrie 2019 12:29:51 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int sol[105],fol[105],n,k;
void combinari(int pas)
{
if(pas > k){
for(int i=1 ;i<=k ; i++)
g<<sol[i]<<" ";
g<<"\n";
return;
}
for(int i=sol[pas-1]+1 ; i<=n ; i++){
sol[pas]=i;
combinari(pas+1);
}
}
int main()
{
f>>n>>k;
combinari(1);
return 0;
}