Pagini recente » Cod sursa (job #1769192) | Cod sursa (job #1549524) | Arhiva de probleme | Cod sursa (job #896669) | Cod sursa (job #653732)
Cod sursa(job #653732)
#include <fstream>
using namespace std;
ifstream in;
ofstream out;
int v[19];
int main()
{
int N,K;
in.open("combinari.in");
in>>N>>K;
in.close();
out.open("combinari.out");
for(int ind=1;1;)
{
if(ind>K)
{
--ind;
for(int i=1;i<K;++i)
out<<v[i]<<' ';
out<<v[K]<<'\n';
if(v[1]==N-K+1) break;
continue;
}
if(v[ind]==N)
{
v[ind]=0;
--ind;
continue;
}
if(v[ind]==0)
{
v[ind]=v[ind-1]+1;
if(v[ind]>N)
{
v[ind]=0;
--ind;
continue;
}
++ind;
continue;
}
if(v[ind]<N)
{
++v[ind];
++ind;
continue;
}
}
out.close();
return 0;
}