Pagini recente » Cod sursa (job #2892783) | Cod sursa (job #1126443) | Cod sursa (job #1535643) | Cod sursa (job #1687949) | Cod sursa (job #694766)
Cod sursa(job #694766)
#include<iostream>
#include<fstream>
using namespace std;
int n,x[10000],m;
ofstream g("combinari.out");
void afisare()
{
int i;
for(i=1;i<=m;i++)
g<<x[i]<<" ";
g<<endl;
}
int verific(int k)
{
int i,ok=1;
if((k>1)&&(x[k]<x[k-1]))
ok=0;
for(i=1;i<k;i++)
if(x[i]==x[k])
ok=0;
return ok;
}
int main()
{
ifstream f("combinari.in");
f>>n>>m;
int i,k=1;
while(k>0)
if(k==m+1)
{
afisare();
k--;
}
else
if(x[k]<n)
{
x[k]++;
if(verific(k))
k++;
}
else
{x[k]=0;
k--;
}
}