Advertisement
Guest User

Untitled

a guest
Sep 20th, 2019
99
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 4.37 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. #include<iostream>
  3. #include<math.h>
  4. #include<vector>
  5. #include<set>
  6. #include<queue>
  7. #include<algorithm>
  8. #include<cstring> //for memset
  9. using namespace std;
  10.  
  11. #define lli int long long
  12. #define ull unsigned long long
  13. #define ld long double
  14. #define pi acos(-1)
  15. #define pb push_back
  16. #define pbk pop_back
  17. #define mp make_pair
  18. #define ff first
  19. #define ss second
  20. #define pii pair<int,int>
  21. #define gcd(a,b) __gcd(a,b)
  22. #define lcm(a,b) (a/gcd(a,b))*b
  23. #define READ freopen("in.txt","r",stdin);
  24. #define WRITE freopen("outer.txt","w",stdout);
  25. #define sort(t) sort(t.begin(),t.end())
  26. #define mem(a,b) memset(a,b,sizeof a)
  27. #define sf scanf
  28. #define pf printf
  29. #define cs(p) printf("Case %d: ", ++(p))
  30. #define dist(ax,ay,bx,by) sqrt((ax-bx)*(ax-bx)+(ay-by)*(ay-by))
  31. #define MM 100003
  32. #define inf 10000000000000000+7
  33. #define M 1000000002
  34. #define MINI -1000000003
  35. //const int fx[]={+1,-1,+0,+0};
  36. //const int fy[]={+0,+0,+1,-1};
  37. //const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
  38. //const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
  39.  
  40. //#define for(i,a,n) for(int i=a;i<n;i++)
  41. //it=myset.find(20);
  42. //int a[8]= {0,0,-1,1,-1,1,-1,1};
  43. //int b[8]= {-1,1,0,0,-1,1,1 ,-1};
  44. int main()
  45. {
  46. string s[9];
  47. int n,i,j,k;
  48. for(i=0;i<7;i++)
  49. {
  50. cin>>s[i];
  51. }
  52. int r=s[0].size();
  53. int p1=0,p2=4,ss=0,ss1=0;
  54. while(p2<r)
  55. //cout<<s[0][p1]<<" "<<s[0][p2]<<" "<<s[6][p1]<<" "<<s[6][p2]<<endl;
  56. {
  57. if(s[0][p1]=='.' && s[0][p2]=='.' && s[6][p1]=='.' && s[6][p2]=='*')
  58. {
  59. cout<<"Q";
  60. }
  61. else if(s[0][p1]=='.' && s[0][p2]=='*' && s[6][p1]=='*' && s[6][p2]=='.')
  62. {
  63. cout<<"S";
  64. }
  65. else if(s[0][p1]=='.' && s[0][p2]=='.' && s[6][p1]=='.' && s[6][p2]=='.')
  66. {
  67. if(s[1][p1]=='.')
  68. {
  69. cout<<"I";
  70. }
  71. else if(s[4][p1+3]=='*')
  72. {
  73. cout<<"G";
  74. }
  75. else if(s[2][p2]=='*')cout<<"O";
  76. else cout<<"C";
  77. }
  78. else if(s[0][p1]=='*' && s[0][p2]=='.' && s[6][p1]=='*' && s[6][p2]=='*')
  79. {
  80. if(s[0][p1+1]=='*')
  81. {
  82. cout<<"R";
  83. }
  84. else
  85. {
  86. cout<<"L";
  87. }
  88. }
  89. else if(s[0][p1]=='*' && s[0][p2]=='*' && s[6][p1]=='*' && s[6][p2]=='*')
  90. {
  91. if(s[3][p1+2]=='.')
  92. {
  93. cout<<"K";
  94. }
  95. else if(s[3][p2]=='.')
  96. {
  97. if(s[1][p1]=='.') cout<<"Z";
  98. else if(s[2][p1]=='.') cout<<"X";
  99. else cout<<"E";
  100. }
  101. else
  102. {
  103. if(s[1][p1+1]=='*') cout<<"M";
  104. else if(s[2][p1+1]=='*')cout<<"N";
  105. else cout<<"H";
  106. }
  107. }
  108. else if(s[0][p1]=='*' && s[0][p2]=='.' && s[6][p1]=='*' && s[6][p2]=='.')
  109. {
  110. if(s[5][p2]=='.')
  111. {
  112. cout<<"P";
  113. }
  114. else if(s[3][p2]=='.')cout<<"B";
  115. else cout<<"D";
  116. }
  117. else if(s[0][p1]=='*' && s[0][p2]=='*' && s[6][p1]=='.' && s[6][p2]=='.')
  118. {
  119. if(s[0][p1+1]=='*')
  120. {
  121. cout<<"T";
  122. }
  123. else if(s[2][p1]=='.')
  124. {
  125. cout<<"Y";
  126. }
  127. else if(s[4][p1]=='.')
  128. {
  129. cout<<"V";
  130. }
  131. else if(s[6][p1+2]=='*')
  132. {
  133. cout<<"U";
  134. }
  135. else
  136. {
  137. cout<<"W";
  138. }
  139. }
  140. else if(s[0][p1]=='.' && s[0][p1+1]=='.')
  141. {
  142. cout<<"J";
  143. }
  144. else if(s[0][p1]=='.' && s[0][p2]=='.' && s[6][p1]=='*' && s[6][p2]=='*')
  145. {
  146. cout<<"A";
  147. }
  148. else
  149. cout<<"F";
  150. p1=p1+6;
  151. p2=p2+6;
  152. }
  153. return 0;
  154. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement