GerONSo

B

Nov 18th, 2018
50
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.13 KB | None | 0 0
  1. /*
  2. --┬-- | | --┬-- | |
  3. | |\ | | | |
  4. | | \ | | -----> | |
  5. | | \ | | | |
  6. | | \ | | | |
  7. --┴-- | \| | └---- └----
  8.  
  9. */
  10.  
  11. // #define pragma
  12.  
  13. #ifdef pragma
  14. #pragma GCC optimize("Ofast")
  15. #pragma GCC optimize("no-stack-protector")
  16. #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
  17. #pragma GCC optimize("unroll-loops")
  18. #pragma GCC diagnostic ignored "-Wunused-result"
  19. #endif // pragma
  20.  
  21. #include<bits/stdc++.h>
  22. #include <ext/pb_ds/assoc_container.hpp>
  23. #include <ext/pb_ds/tree_policy.hpp>
  24.  
  25. #define ll long long
  26. #define all(x) begin(x), end(x)
  27. #define pb push_back
  28. #define x first
  29. #define y second
  30. #define int long long
  31. #define zero(x) memset(x, 0, sizeof(x))
  32.  
  33. using namespace std;
  34. using namespace __gnu_pbds;
  35.  
  36.  
  37. typedef vector<int> vi;
  38. typedef vector<bool> vb;
  39. typedef pair<int, int> pii;
  40. typedef long double ld;
  41. typedef vector<vi> matrix;
  42. typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
  43.  
  44. const int INF = 1e9 + 7;
  45. const int MAXN = 1e6 + 8;
  46. const ld EPS = 1e-9;
  47. const ld PI = atan2(0, -1);
  48.  
  49. void seriy() {
  50. ios::sync_with_stdio(0);
  51. cin.tie(0);
  52. cout.tie(0);
  53. // cout << fixed << setprecision(7);
  54. // cerr << fixed << setprecision(7);
  55. #if 0
  56. freopen("input", "r", stdin);
  57. freopen("output", "w", stdout);
  58. #endif
  59. }
  60.  
  61. bool tr(int n, int a) {
  62. vi s;
  63. while(n > 0) {
  64. s.pb(n % a);
  65. n /= a;
  66. }
  67. bool f = 0;
  68. for(int i = 0; i < s.size() / 2; i++) {
  69. if(s[i] != s[s.size() - i - 1]) {
  70. f = 1;
  71. }
  72. }
  73. return !f;
  74. }
  75.  
  76. signed main() {
  77. seriy();
  78. int t;
  79. cin >> t;
  80. while(t--) {
  81. int n;
  82. cin >> n;
  83. bool cur = 0;
  84. for(int i = 2; i < n - 1; i++) {
  85. cur = cur | tr(n, i);
  86. }
  87. cout << ((cur) ? "NO\n" : "YES\n");
  88. }
  89. return 0;
  90. }
Add Comment
Please, Sign In to add comment