Cod sursa(job #1184166)
Utilizator | Data | 11 mai 2014 16:39:41 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<fstream>
using namespace std;
int n,p,s[20];
ifstream f("combinari.in",ios::in);
ofstream g("combinari.out",ios::out);
void back( int k)
{
if(k==p+1)
{
for(int i=1;i<=p;i++)
g<<s[i];
g<<'\n';}
else
{
if(k>1)
s[k]=s[k-1];
else
s[k]=0;
while(s[k]<n-p+k)
{
s[k]++;
back(k+1);}}}
int main()
{
f>>n;
f>>p;
back(1);
return 0;}