Cod sursa(job #661090)
| Utilizator | Data | 13 ianuarie 2012 19:19:03 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
int i,n,sol[25],r,m;
ifstream f("combinari.in");
ofstream g("combinari.out");
bool ok(int r)
{
if (r>1 & sol[r-1]>=sol[r]) return false;
else
return true;
}
void back(int r)
{
int i;
if (r>m) {
for (i=1;i<=m;i++)
g<<sol[i]<<" ";
g<<"\n";
}
else {
for (i=1;i<=n;i++){
sol[r]=i;
if (ok(r)) back(r+1);
}
}
}
int main(){
f>>n>>m;
back(1);
return 0;
}
