Cod sursa(job #897400)
Utilizator | Cota Calin speedylawl | Data | 27 februarie 2013 20:23:04 |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
int x[100];
int k,n,p;
ifstream f("combinari.in");
ofstream g("combinari.out");
void cout()
{
for(int i=1;i<=k;i++)
g<<x[i]<<" ";
g<<endl;
}
int main()
{
f>>n>>p;
x[1]=0;
k=1;
while(k>0)
{
if(x[k]<n)
{
x[k]++;
if(k==p)
cout();
else
{
k++;
x[k]=x[k-1];
}
}
else
k--;
}
f.close();
g.close();
return 0;
}