#include <iostream> #include <algorithm> #include <vector> using namespace std; string res; int generate(int n) { int ret = 0; if(n % 2) { if((n >> 1) != 0) { res += "1+(1+1)*("; ret += generate( n >> 1 ) + 1; } else { res += "1"; } } else { if( n != 0 ) { res += "(1+1)*("; ret += generate ( n >> 1); ret++; } } return ret; } void zamyk(int nawiasy) { while(nawiasy--) res += ")"; } void klir() { res.clear(); } void correcting() { for(int i=0; i<res.size(); i++) { if(i < res.size() - 1 && (res[i] == '(' && res[i+1] == '(')) { res[i] = 'x'; res.pop_back(); continue; } if(i < res.size() - 2) { if(res[i] == '(' && res[i+1] == '1' && res[i+2] == ')' ) { res[i] = res[i+2] = 'x'; i += 2; } } } } int main() { ios_base::sync_with_stdio(0); int testy; cin >> testy; while(testy--) { int n; cin >> n; int nawiasy = generate(n); zamyk(nawiasy); correcting(); for(int i=0; i<res.size(); i++) { if(res[i] == 'x') continue; cout<<res[i]; } cout<< "\n"; klir(); } return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 | #include <iostream> #include <algorithm> #include <vector> using namespace std; string res; int generate(int n) { int ret = 0; if(n % 2) { if((n >> 1) != 0) { res += "1+(1+1)*("; ret += generate( n >> 1 ) + 1; } else { res += "1"; } } else { if( n != 0 ) { res += "(1+1)*("; ret += generate ( n >> 1); ret++; } } return ret; } void zamyk(int nawiasy) { while(nawiasy--) res += ")"; } void klir() { res.clear(); } void correcting() { for(int i=0; i<res.size(); i++) { if(i < res.size() - 1 && (res[i] == '(' && res[i+1] == '(')) { res[i] = 'x'; res.pop_back(); continue; } if(i < res.size() - 2) { if(res[i] == '(' && res[i+1] == '1' && res[i+2] == ')' ) { res[i] = res[i+2] = 'x'; i += 2; } } } } int main() { ios_base::sync_with_stdio(0); int testy; cin >> testy; while(testy--) { int n; cin >> n; int nawiasy = generate(n); zamyk(nawiasy); correcting(); for(int i=0; i<res.size(); i++) { if(res[i] == 'x') continue; cout<<res[i]; } cout<< "\n"; klir(); } return 0; } |