Cod sursa(job #913651)
| Utilizator | Data | 13 martie 2013 17:46:51 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int x[31],n,p;
void tipar()
{
int i;
for(i=1;i<=p;i++)
fout<<x[i]<<' ';
fout<<'\n';
}
void back()
{
int k;
k=1;
while(k>0)
{
while(x[k]<n)
{
x[k]=x[k]+1;
if(k==p)tipar();
else {k++;x[k]=x[k-1];}
}
k--;
}
}
int main()
{
fin>>n>>p;
back();
fin.close();
fout.close();
return 0;
}
