Pagini recente » Cod sursa (job #1830222) | Cod sursa (job #814483) | Cod sursa (job #1881388) | Cod sursa (job #1816734) | Cod sursa (job #730918)
Cod sursa(job #730918)
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k, v[21];
void solve(int n, int k)
{for(int i=0, t=(1<<n)-1; i<t; i++)
{int p=0;
for(int j=0, t=i+1; t; j++)
{v[j]=t%2;
t/=2;
if(v[j])
p++;
}
if(p==k)
{for(int j=0; j<21; j++)
if(v[j])
g<<j+1<<" ";
g<<"\n";
}
}
}
int main()
{f>>n>>k;
solve(n, k);
return 0;
}