Cod sursa(job #221257)
Utilizator | Data | 15 noiembrie 2008 12:42:33 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream.h>
#include <fstream.h>
int s[100],n,p;
ofstream g("combinari.out");
void back(int k)
{
int i;
if(k==p+1)
{
for(i=1;i<=p;i++)
g<<s[i];
g<<" ";
}
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()
{
ifstream f("combinari.in");
f>>n>>p;
back(1);
}