Cod sursa(job #1701692)
Utilizator | Data | 13 mai 2016 21:27:37 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
int n,k,v[1000];
ifstream f("combinari.in");
ofstream g("combinari.out");
void afisare()
{
int i;
for(i=1;i<=k;i++)
g<<v[i]<<" ";
g<<'\n';
}
int main()
{
int i,j;
f>>n;
f>>k;
v[1]=0;
i=1;
while(i>0)
{
v[i]+=1;
if(v[i]>n-k+i)
{
v[i]=0;
i--;
}
else
{
if(i==k)
afisare();
else
{
i+=1;
v[i]=v[i-1];
}
}
}
return 0;
}