Cod sursa(job #3159752)
| Utilizator | Data | 21 octombrie 2023 22:11:52 | |
|---|---|---|---|
| Problema | Jocul Flip | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <iostream>
#include <string.h>
using namespace std;
int n;
int sol[26];
void afis(int k) {
for(int i=0;i<k;++i)
cout<<sol[i];
cout<<'\n';
}
void bkt(int k, int prev, int increasing) {
if(k == n) {
afis(k);
} else {
int v[2] = {-1, 1};
for(auto i : v) {
int c = prev + i;
if(increasing + i < n - k && c>=0) {
sol[k] = c;
bkt(k + 1, c, increasing + i);
}
}
}
}
int main() {
cin >> n;
sol[0] = 0;
bkt(1, 0, 0);
return 0;
}
