Cod sursa(job #818626)
Utilizator | Data | 17 noiembrie 2012 19:16:10 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,p,x[20];
void back()
{
int i,k;
k=1;
x[k]=0;
while(k)
{
while(x[k]<n&&k<=p)
{
x[k]++;
if(k==p)
{
for(i=1;i<=k;i++)
g<<x[i]<<" ";
g<<endl;
}
else
{
k++;
x[k]=x[k-1];
}
}
k--;
}
}
int main()
{
f>>n>>p;
back();
}