Cod sursa(job #690347)
| Utilizator | Data | 25 februarie 2012 15:49:53 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<iostream>
#include<fstream>
using namespace std;
int n,k,sol[20];
int main()
{
int i,j;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
fin>>n>>k;
for(i=1;i<=k;i++)
{
sol[i]=i;
}
int ok=1;
while(ok)
{
if(sol[1]<sol[k])
{
for(i=1;i<=k;i++)
{
fout<<sol[i]<<" ";
}
fout<<'\n';
}
i=k;
while(i>0&&sol[i]==n-k+i) i--;
if(i==0) ok=0;
else
{
sol[i]++;
for(j=i+1;j<=k;j++)
{
sol[j]=sol[j-1]+1;
}
}
}
return 0;
}