fork download
copy 
  1. #include <bits/stdc++.h>
  2. #define ll long long
  3. #define mp make_pair
  4. #define pb push_back
  5. #define ff first
  6. #define ss second
  7. #define pii pair<int,int>
  8. #define mod 998244353
  9. #define endl '\n'
  10. #define f(i,a,b) for(i=a;i<b;i++)
  11. #define MAX(a,b,c)  max(a,max(b,c))
  12. #define MIN(a,b,c)  min(a,min(b,c))
  13. #define PI 3.1415926535897932
  14. #define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
  15. #define input_file freopen("op.txt", "r", stdin);
  16. #define output_file freopen("op1.txt", "w", stdout);
  17. using namespace std;
  18.  
  19. int main(){
  20.     fast_io
  21.  
  22.     ll n,i,j,x;
  23.     cin>>n;
  24.     char a[3][n];
  25.     f(i,0,3) f(j,0,n) cin>>a[i][j];
  26.  
  27.     string s = "";
  28.  
  29.     for(i=0;i<n;i++){
  30.         if(a[0][i]=='.' && a[1][i]=='.' && a[1][i]=='.'){
  31.             continue;
  32.         }
  33.  
  34.         // for A
  35.         if(i+2 < n && a[0][i]=='.' && a[0][i+1]=='*' && a[0][i+2]=='.' 
  36.                    && a[1][i]=='*' && a[1][i+1]=='*' && a[1][i+2]=='*'
  37.                    && a[2][i]=='*' && a[2][i+1]=='.' && a[2][i+2]=='*'){
  38.             s += 'A';
  39.             i += 2;
  40.             continue;
  41.         }
  42.  
  43.         // for E
  44.         if(i+2 < n && a[0][i]=='*' && a[0][i+1]=='*' && a[0][i+2]=='*' 
  45.                    && a[1][i]=='*' && a[1][i+1]=='*' && a[1][i+2]=='*'
  46.                    && a[2][i]=='*' && a[2][i+1]=='*' && a[2][i+2]=='*'){
  47.             s += 'E';
  48.             i += 2;
  49.             continue;
  50.         }
  51.  
  52.         // for I
  53.         if(i+2 < n && a[0][i]=='*' && a[0][i+1]=='*' && a[0][i+2]=='*' 
  54.                    && a[1][i]=='.' && a[1][i+1]=='*' && a[1][i+2]=='.'
  55.                    && a[2][i]=='*' && a[2][i+1]=='*' && a[2][i+2]=='*'){
  56.             s += 'I';
  57.             i += 2;
  58.             continue;
  59.         }
  60.  
  61.         // for O
  62.         if(i+2 < n && a[0][i]=='*' && a[0][i+1]=='*' && a[0][i+2]=='*' 
  63.                    && a[1][i]=='*' && a[1][i+1]=='.' && a[1][i+2]=='*'
  64.                    && a[2][i]=='*' && a[2][i+1]=='*' && a[2][i+2]=='*'){
  65.             s += 'O';
  66.             i += 2;
  67.             continue;
  68.         }
  69.  
  70.         // for U
  71.         if(i+2 < n && a[0][i]=='*' && a[0][i+1]=='.' && a[0][i+2]=='*' 
  72.                    && a[1][i]=='*' && a[1][i+1]=='.' && a[1][i+2]=='*'
  73.                    && a[2][i]=='*' && a[2][i+1]=='*' && a[2][i+2]=='*'){
  74.             s += 'U';
  75.             i += 2;
  76.             continue;
  77.         }
  78.  
  79.         if(a[0][i]=='#' && a[1][i]=='#' && a[2][i]=='#'){
  80.             s += '#';
  81.         }
  82.     }
  83.  
  84.     cout<<s<<endl;
  85.  
  86. 	return 0;
  87. }
Success #stdin #stdout 0s 4504KB
comments (?)
stdin
copy 
3
* * *
. * .
* * *
stdout
copy 
I
https://ideone.com/dhr0mt
language:
C++14 (gcc 8.3)
created:
5 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!