Cod sursa(job #318250)
Utilizator | Data | 27 mai 2009 19:38:07 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
fstream f("combinari.in",ios::in),g("combinari.out",ios::out);
int s[100],n,p;
void tipar(){for(int i=1;i<=p;i++)g<<s[i]<<" ";g<<endl;}
void back(int pas)
{
int i;
if(pas==p+1)tipar();
else
{
for(i=s[pas-1]+1;i<=n;i++)
{
s[pas]=i;
back(pas+1);
}
}
}
int main()
{
f>>n>>p;
f.close();
back(1);
g.close();
return 0;
}