Cod sursa(job #625159)
| Utilizator | Data | 23 octombrie 2011 20:58:12 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
int X[30],V[30],N,K;
ifstream f("combinari.in");
ofstream g("combinari.out");
void print()
{
for(int i=1;i<=K;i++)
g<<X[i]<<" ";
g<<"\n";
}
void back (int k){
if(k>K)
print();
else
for(int i=X[k-1]+1;i<=N;i++)
{
X[k]=i;
V[i]++;
if(V[i]==1)
back (k+1);
V[i]--;
}
}
int main (){
f>>N>>K;
back(1);
return 0;
}
