Cod sursa(job #1740481)
| Utilizator | Data | 11 august 2016 17:16:06 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,p,sol[1000];
void afisare()
{
for(int i=1; i<=p; i++)
g<<sol[i]<<" ";
g<<"\n";
}
void backTR(int k)
{
if(k==p+1){
afisare();
return;
}
for(int i=sol[k-1]+1;i<=n-p+k;i++)
{
sol[k]=i;
backTR(k+1);
}
}
int main()
{
f>>n>>p;
backTR(1);
return 0;
}
