Cod sursa(job #1597640)
Utilizator | Data | 12 februarie 2016 10:46:05 | |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
int a[20],n;
int main()
{
int k,i,m,s;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
fin>>n>>k;
a[1]=1;
m=n+1;
while(a[m]==0)
{
s=0;
for(i=1;i<=n;i++)
s=s+a[i];
if(s==k)
{
for(i=1;i<=n;i++)
if(a[i]==1)
fout <<i<<" ";
fout<<"\n";
}
for(i=1;a[i]==1;i++)
a[i]=0;
a[i]=1;
}
return 0;
}