Cod sursa(job #1354913)
| Utilizator | Data | 22 februarie 2015 10:40:55 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f1("combinari.in");
ofstream f2("combinari.out");
int N,K, st[20] ;
void afis(int n)
{
for (int i=1; i<=n; i++)
if ( st[i] )
f2<<i<<" ";
f2<<"\n";
}
void back(int n, int k)
{
if ( k==K )
afis(N);
else
if (n>N) return;
else
{
st[n]=1;
back(n+1,k+1);
st[n]=0;
back(n+1,k);
}
}
int main()
{
f1>>N>>K;
back(1,0);
f2.close();
return 0;
}
