Cod sursa(job #1360214)
| Utilizator | Data | 25 februarie 2015 12:54:20 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m;
int v[20];
void afis(){
for(int i=1;i<=m;i++) g<<v[i]<<" ";
g<<endl;
}
bool verif(int punct){
for(int i=1;i<punct;i++) if(v[i]>=v[punct]) return 0;
return 1;
}
void back(int k){
if(k==m+1) afis();
else {
for(int i=1;i<=n;i++){
v[k]=i;
if(verif(k)) back(k+1);
}
}
}
int main()
{
f>>n>>m;
back(1);
return 0;
}
