fork download
  1. #include<iostream>
  2. #include <algorithm>
  3. #include <unordered_map>
  4. #include <vector>
  5. #include <stack>
  6. #include <queue>
  7. #include <deque>
  8. #include<string>
  9. #include <set>
  10. #include <map>
  11. #include <cstdlib>
  12. #include <utility>
  13. #include <ctime>
  14. #include <cmath>
  15. #include <valarray>
  16. #include<sstream>
  17. #include <stdio.h>
  18. #include <string.h>
  19. #include <iomanip>
  20. using namespace std;
  21. #define ll long long;
  22. #define ANOOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  23. int check_possibilities(string s22, int fin)
  24. {
  25. string temp;
  26. int cnt = 0;
  27. for (int i = 0; i < s22.size(); i++)
  28. {
  29.  
  30. }
  31. }
  32.  
  33. int main()
  34. {
  35. ANOOS
  36. string s1, s2;
  37. bool ok = false;
  38. cin >> s1 >> s2;
  39. int final_pos = 0, sec_pos = 0,num_QMark=0;
  40. cin >> s1 >> s2;
  41. for (int i = 0; i < s1.size(); i++)
  42. {
  43. if (s1[i] == '+')
  44. final_pos++;
  45. else if (s1[i] == '-')
  46. final_pos--;
  47. }
  48. for (int i = 0; i < s2.size(); i++)
  49. {
  50. if (s2[i] == '+')
  51. sec_pos++;
  52. else if (s2[i] == '-')
  53. sec_pos--;
  54. else if (s2[i] == '?')
  55. {
  56. //ok = true;
  57. num_QMark++;
  58. }
  59.  
  60. }
  61. if (num_QMark > 0)
  62. {
  63. num_QMark=pow(2, num_QMark);
  64. //int pos = check_possibilities(s2, final_pos);
  65.  
  66. }
  67. if (num_QMark==0 && final_pos == sec_pos)//if there's no '?' in sequnce
  68. {
  69. cout << "1.000000000000";
  70. }
  71. else if (num_QMark == 0 && final_pos != sec_pos)//if there's no '?' in sequnce
  72. {
  73. cout << "0.000000000000";
  74. }
  75.  
  76.  
  77. return 0;
  78. }
Success #stdin #stdout 0.01s 5368KB
stdin
Standard input is empty
stdout
1.000000000000