提出 #62616117

---

ソースコード 拡げる

#include "bits/stdc++.h"
#include <chrono>
using namespace std;

#define LL long long
#define mod 998244353ll
//#define mod 1000000007ll
#define PI acos(-1.0)
#define set0(ar) memset(ar, 0, sizeof ar)
#define setinf(ar) memset(ar, 126, sizeof ar)

inline LL bigmod(LL p, LL e, LL M) {
  LL r = 1;
  for (; e > 0; e >>= 1, p = (p * p) % M)
    if (e & 1) r = (r * p) % M;
  return r;
}
inline LL modinverse(LL a, LL M) { return bigmod(a, M - 2, M); }

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());



void solve() {
  int n; cin >> n;
  int odd = 0, even = 0;
  for(int i = 0; i < n; i++) {
    int v; cin >> v;
    if(v % 2 == 0) even++;
    else odd++;
  }

  if(even) {
    if(even == 1 && odd % 2 == 0) cout << "Fennec" << endl;
    else if(odd % 2 == 1 && even > 1) cout << "Fennec" << endl;
    else if(odd % 2 == 1 && odd > 1) cout << "Fennec" << endl;
    else if(even > 0 && odd == 0) cout << "Fennec" << endl;
    else cout << "Snuke" << endl;
  } else {
    if(odd % 2 == 0) cout << "Snuke" << endl;
    else cout << "Fennec" << endl;
  }
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int T = 1;
  //cin >> T; 
  for (int ts = 1; ts <= T; ts++) {
    //cout << "Case " << ts << ": ";
    solve();
  }
}

提出情報

ジャッジ結果