Cod sursa(job #1950157)
| Utilizator | Data | 2 aprilie 2017 19:21:54 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
int n,k;
int SOL[20];
void g(int p)
{
if(p==k)
{
for(int i=1;i<=k;i++)
fo<<SOL[i]<<" ";
fo<<"\n";
}
else
for(int i=SOL[p]+1;i<=n;i++)
{
SOL[p+1]=i;
g(p+1);
}
}
int main()
{
fi>>n>>k;
g(0);
fi.close();
fo.close();
return 0;
}
