Cod sursa(job #2295493)
Utilizator | Data | 3 decembrie 2018 18:21:52 | |
---|---|---|---|
Problema | Combinari | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,i,j,v[30],k,l;
int main()
{
fin>>n>>k;
if(n==1)
{
fout<<1;
return 0;
}
j=1;
v[j]=1;
while(v[1]<=n-k+1)
{
for(i=j+1;i<=k;i++)
v[i]=v[i-1]+1;
for(i=1;i<=k;i++)
fout<<v[i]<<" ";
fout<<'\n';
j=k;
while(v[j]>=n-k+j && v[j]>-1)
j--;
if(j==0)
break;
v[j]++;
}
return 0;
}