Pagini recente » Cod sursa (job #2557930) | Cod sursa (job #2147251) | Borderou de evaluare (job #1768729) | Cod sursa (job #2378073) | Cod sursa (job #897368)
Cod sursa(job #897368)
#include <fstream>
using namespace std;
int x[100];
int main()
{
int k,n,p;
ifstream f("combinari.in");
ofstream g("combinari.out");
f>>n>>p;
x[1]=0;
k=1;
while(k>0)
{
if(x[k]<n)
{
x[k]++;
if(k==p)
{
for(int i=1;i<=k;i++)
g<<x[i]<<" ";
g<<endl;
}
else
{
k++;
x[k]=x[k-1]+1;
}
}
else
k--;
}
f.close();
g.close();
return 0;
}