Advertisement
Guest User

Untitled

a guest
Oct 19th, 2019
83
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.62 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define pi acos(-1)
  5.  
  6. string single_digits[10] = { "zero", "one", "two",
  7. "three", "four","five",
  8. "six", "seven", "eight", "nine"
  9. };
  10. string two_digits[10] = {"ten", "eleven", "twelve",
  11. "thirteen", "fourteen",
  12. "fifteen", "sixteen",
  13. "seventeen", "eighteen", "nineteen"
  14. };
  15.  
  16. string tens_multiple[8] = {"twenty", "thirty", "forty", "fifty",
  17. "sixty", "seventy", "eighty", "ninety"
  18. };
  19.  
  20. string tens_power[2] = {"hundred", "thousand"};
  21.  
  22.  
  23.  
  24. int main()
  25. {
  26. int t;
  27. cin>>t;
  28. cin.ignore();
  29. while(t--)
  30. {
  31. string s;
  32. getline(cin,s);
  33. int n=0,a=0,b=0;
  34. int len=s.size();
  35. for(int i=0; i<len; i++)
  36. {
  37. string str="";
  38. while(i<len&&s[i]!=' ')
  39. {
  40. str+=s[i];
  41. i++;
  42. }
  43. if(str!="")
  44. {
  45. for(int j=0; j<10; j++)
  46. {
  47. if(single_digits[j]==str)
  48. {
  49. b+=j;
  50. break;
  51. }
  52. }
  53. for(int j=0; j<10; j++)
  54. {
  55. if(two_digits[j]==str)
  56. {
  57. b+=j+10;
  58. break;
  59. }
  60. }
  61. for(int j=0; j<8; j++)
  62. {
  63. if(tens_multiple[j]==str)
  64. {
  65. b+=(j+2)*10;
  66. break;
  67. }
  68. }
  69. if(tens_power[0]==str)
  70. {
  71. n+=100*b;
  72. b=0;
  73. }
  74. if(tens_power[1]==str)
  75. {
  76. n+=1000*b;
  77. b=0;
  78. }
  79. }
  80. }
  81. if(b)
  82. n+=b;
  83. string str="";
  84. do
  85. {
  86. if(n%2==0)
  87. str+='0';
  88. else
  89. str+='1';
  90. n/=2;
  91. }
  92. while(n);
  93. int m=str.size();
  94. n=m;
  95. m/=2;
  96. bool flag=1;
  97. for(int i=0; i<m; i++)
  98. {
  99. if(str[i]!=str[n-i-1])
  100. flag=0;
  101. }
  102. if(flag)
  103. cout<<"YES\n";
  104. else
  105. cout<<"NO\n";
  106. }
  107. return 0;
  108. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement