Mai intai trebuie sa te autentifici.
Cod sursa(job #1014550)
| Utilizator | Data | 22 octombrie 2013 21:13:25 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
#include<iostream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m;
int st[18];
void printSol()
{
for(int i =1;i<=m;i++)
g<<st[i]<<" ";
}
int valid(int k)
{
if(k>1)
if(st[k-1]>=st[k]) return 0;
return 1;
}
void back(int k)
{
if(k>m) {
printSol(); g<<"\n";
}
else
{
for(int i =1;i<=n;i++)
{
st[k]=i;
if(valid(k))
back(k+1);
}
}
}
int main()
{
f>>n>>m;
back(1);
return 0;
}
