Cod sursa(job #2630876)
Utilizator | Data | 27 iunie 2020 17:17:05 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include<fstream>
using namespace std;
int n, p, s[20];
ifstream f ("combinari.in");
ofstream g ("combinari.out");
void citeste()
{
f>>n>>p;
}
void afiseaza()
{ for (int i=1;i<=p;i++) g<<s[i]<<" "; g<<"\n"; }
void bkt(int k)
{ int i;
if(k==p+1) afiseaza();
else for(i=s[k-1]+1;i<=n;i++)
{s[k]=i; bkt(k+1); } }
int main()
{citeste();
bkt(1); return 0; }