Cod sursa(job #1512634)
Utilizator | Data | 28 octombrie 2015 13:33:19 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream q("combinari.out");
int n,p,v[20];
void back(int k)
{
if (k<=n)
{
for (int i=1;i<=p;i++)
{
v[k]=i;
if (v[k]>v[k-1])
{
back(k+1);
}
}
}
else{for(int i=1;i<=n;i++){q<<v[i]<<" ";}q<<"\n";}
}
int main()
{
f>>p>>n;
back(1);
f.close();
q.close();
}