Submission #62261143

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
#define int long long
#define endl "\n"
#define pb push_back
#define ceil(n, m) (((n) + (m) - 1) / (m))
#define all(a) (a).begin(), (a).end()
#define add_mod(a, b) (((a % modn) + (b % modn)) % modn)
#define sub_mod(a, b) (((a % modn) - (b % modn) + modn) % modn)
#define mul_mod(a, b) (((a % modn) * (b % modn)) % modn)
#define modn 1000000007
using namespace std;
int power(int a, int b) {
  int ans = 1;
  while (b) {
    if (b & 1) {
      ans = (ans * 1ll *  a);
    }
    b >>= 1;
    a = (a * 1ll * a);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
#define int long long
#define endl "\n"
#define pb push_back
#define ceil(n, m) (((n) + (m) - 1) / (m))
#define all(a) (a).begin(), (a).end()
#define add_mod(a, b) (((a % modn) + (b % modn)) % modn)
#define sub_mod(a, b) (((a % modn) - (b % modn) + modn) % modn)
#define mul_mod(a, b) (((a % modn) * (b % modn)) % modn)
#define modn 1000000007
using namespace std;


int power(int a, int b) {
	int ans = 1;
	while (b) {
		if (b & 1) {
			ans = (ans * 1ll *  a);
		}
		b >>= 1;
		a = (a * 1ll * a);
	}
	return ans;
}

int binpow(int a, int b, int mod) {
	if (b == 0)
		return 1;
	if (b % 2) {
		return a * binpow(a, b - 1, mod) % mod;
	} else {
		int temp = binpow(a, b / 2, mod);
		return temp * temp % mod;
	}
}

int fact(int n) {
	int res = 1;
	for (int i = 1; i <= n; i++) {
		res = res * 1ll * i % modn;
	}
	return res;
}

int nCr(int n, int k) {
	return fact(n) * binpow(fact(k), modn - 2, modn) % modn * binpow(fact(n - k), modn - 2, modn) % modn;
}

void solve()
{
	map<string, string> mp;
	mp["N"] = "S";
	mp["S"] = "N";
	mp["E"] = "W";
	mp["W"] = "E";
	mp["NE"] = "SW";
	mp["SW"] = "NE";
	mp["NW"] = "SE";
	mp["SE"] = "NW";
	string s;
	cin >> s;
	cout << mp[s] << endl;

}

int32_t main() {

	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);

#ifdef ONLINEJUDGE
	clock_t tStart = clock();
	freopen("inputf.in", "r", stdin); //can need to change file . this one for taking input
	freopen("outputf.out", "w", stdout); // this one for output
#endif

	//Your Code

#ifdef ONLINEJUDGE
	fprintf(stderr, "\n>> Runtime: %.10fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC); // this line gives your code runtime
#endif


	int t = 1;
	// cin >> t;
	while (t--)
	{
		solve();
	}

	return 0;
}

Submission Info

Judge Result