Cod sursa(job #1119091)
| Utilizator | Data | 24 februarie 2014 15:10:52 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.8 kb |
#include<fstream>
using namespace std;
int n,a[20],i,j,aux,ok,k;
fstream fin,fout;
void tip()
{
int i;
for(i=1;i<=k;i++)
{
fout<<a[i]<<" ";
}
fout<<"\n";
}
int main()
{
fin.open("combinari.in",ios::in);
fout.open("combinari.out",ios::out);
fin>>n;
fin>>k;
for(i=1;i<=k;i++)
{
a[i]=i;
}
tip();
do
{
ok=0;
j=k;
while(j>=1 && a[j]==n-k+j)
{
j--;
}
if(j==0)
{
ok=1;
}
else
{
a[j]++;
for(i=j+1;i<=k;i++)
{
a[i]=a[i-1]+1;
}
tip();
}
}
while(ok==0);
fout.close();
fin.close();
return 0;
}
