Submission #2331807

---

Source Code Expand

#include<cstdio>
#include<string>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cstring>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<complex>

using namespace std;

typedef pair<int,int> pii;
typedef long long ll;
typedef vector<int> vi;

#define rep(i,j) for(int i=0;i<(j);i++)
#define reps(i,j,k) for(int i=j;i<=k;i++)
#define in(i,j,k) ((i)>=(j)&&(i)<=(k))
#define INF (1<<28)
#define pb(i) push_back(i)
#define fs first
#define sc second

const char dx[]={0,1,0,-1},dy[]={1,0,-1,0};

int main(){
	int n;
	cin >> n;
	vector<string> s(n);
	string ans="";
	string monica = "monica";
	rep(i,n){
		cin >> s[i];
		if(i)rep(j,n)rep(p,6)if(s[i-1][j] == monica[p]){
			ans += s[i][j];
		}
	}
	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result