Cod sursa(job #1327880)
Utilizator | Hamod Adrian AdrianSL | Data | 27 ianuarie 2015 12:45:14 |
---|---|---|---|
Problema | Combinari | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int main()
{ int n, S[20],i, gata=0,k,p,m;
fin>>n>>k;
for(i=0;i<=n;i++)S[i]=0;
for(m=1;m<=n-k+1;m++)
{
for(i=0;i<=n;i++)S[i]=0;gata=0;
while(!gata)
{ p=0;
for(i=m;i<=n;i++)if(S[i])p++;
if(p==k && S[m]!=0)
{for(i=m;i<=n;i++)if(S[i])fout<<i<<' ';
fout<<endl;
}
for(i=m;i<=n && S[i];i++)S[i]=0;
if(i==n+1)gata=1;
else S[i]=1;
}
}
return 0;
}