Submission #62615859


Source Code Expand

Copy
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <vector>
#include <queue>
#include <cstdlib>
#include <cstring>
#include <cstdint>
#include <functional>
#include <stack>
#include <map>
#include <random>
#include <ctime>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
typedef long long LL;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <vector>
#include <queue>
#include <cstdlib>
#include <cstring>
#include <cstdint>
#include <functional>
#include <stack>
#include <map>
#include <random>
#include <ctime>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>

typedef long long LL;
typedef std::pair<int,int> PII;
typedef std::pair<LL,LL> PLL;

#define INF 0x3f3f3f3f
#define rep(i,l,r) for(auto i(l);i<=(r);++i)
#define per(i,r,l) for(auto i(r);i>=(l);--i)
#define rpp(i,l,r) for(auto i(l);i<(r);++i)
#define ppr(i,r,l) for(auto i(r);i>(l);--i)
#define lowbit(x) ((x)&-(x))
#define ls(p) ((p)<<1)
#define rs(p) ((p)<<1|1)

template<typename T>inline T min(T a,T b){return a<b?a:b;}
template<typename T>inline T max(T a,T b){return a>b?a:b;}
const int N = 1000010;
const int M = 5000010;
const int mod = 998244353;

int n;
int a[N];
int num[2];

int main(){
	scanf("%d",&n);
	if(n==1){puts("Fennec");return 0;}
	if(n==2){puts("Snuke");return 0;}
	rep(i,1,n){
		scanf("%d",&a[i]);
		++num[a[i]&1];
	}
	if(num[0]==1 && num[1]==2){puts("Fennec");return 0;}
	if(!(num[1]&1) && (num[0]&1)){puts("Snuke");return 0;}
	if(((num[0]&1) || (num[1]&1))){puts("Fennec");}
	else{puts("Snuke");}

	return 0;
}
/*
-std=c++14
-Wall -O2 -static
-Wall -O2 -fsanitize=address,undefined
LHY qingchunkeai,shanliangdafang,wengrouxianhui,meilidongren,chenyuluoyan,biyuexiuhua
*/

Submission Info

Submission Time
Task B - Fennec VS. Snuke 2
User Xr0805
Language C++ 20 (gcc 12.2)
Score 600
Code Size 1515 Byte
Status AC
Exec Time 22 ms
Memory 4540 KB

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:45:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   45 |         scanf("%d",&n);
      |         ~~~~~^~~~~~~~~
Main.cpp:49:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   49 |                 scanf("%d",&a[i]);
      |                 ~~~~~^~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 3
AC × 68
Set Name Test Cases
Sample 00-sample-001.txt, 00-sample-002.txt, 00-sample-003.txt
All 00-sample-001.txt, 00-sample-002.txt, 00-sample-003.txt, 01-random-001.txt, 01-random-002.txt, 01-random-003.txt, 01-random-004.txt, 01-random-005.txt, 01-random-006.txt, 01-random-007.txt, 01-random-008.txt, 01-random-009.txt, 01-random-010.txt, 01-random-011.txt, 01-random-012.txt, 01-random-013.txt, 01-random-014.txt, 01-random-015.txt, 02-large-001.txt, 02-large-002.txt, 02-large-003.txt, 02-large-004.txt, 02-large-005.txt, 02-large-006.txt, 02-large-007.txt, 02-large-008.txt, 02-large-009.txt, 02-large-010.txt, 03-small-001.txt, 03-small-002.txt, 03-small-003.txt, 03-small-004.txt, 03-small-005.txt, 03-small-006.txt, 03-small-007.txt, 03-small-008.txt, 03-small-009.txt, 03-small-010.txt, 03-small-011.txt, 03-small-012.txt, 03-small-013.txt, 03-small-014.txt, 03-small-015.txt, 03-small-016.txt, 03-small-017.txt, 03-small-018.txt, 03-small-019.txt, 03-small-020.txt, 03-small-021.txt, 03-small-022.txt, 03-small-023.txt, 03-small-024.txt, 03-small-025.txt, 03-small-026.txt, 03-small-027.txt, 03-small-028.txt, 03-small-029.txt, 03-small-030.txt, 03-small-031.txt, 03-small-032.txt, 03-small-033.txt, 03-small-034.txt, 03-small-035.txt, 03-small-036.txt, 03-small-037.txt, 03-small-038.txt, 03-small-039.txt, 03-small-040.txt
Case Name Status Exec Time Memory
00-sample-001.txt AC 1 ms 3688 KB
00-sample-002.txt AC 1 ms 3696 KB
00-sample-003.txt AC 1 ms 3724 KB
01-random-001.txt AC 17 ms 4368 KB
01-random-002.txt AC 9 ms 3984 KB
01-random-003.txt AC 16 ms 4280 KB
01-random-004.txt AC 8 ms 3760 KB
01-random-005.txt AC 13 ms 4156 KB
01-random-006.txt AC 10 ms 3996 KB
01-random-007.txt AC 8 ms 3968 KB
01-random-008.txt AC 17 ms 4340 KB
01-random-009.txt AC 13 ms 4088 KB
01-random-010.txt AC 14 ms 4004 KB
01-random-011.txt AC 4 ms 3784 KB
01-random-012.txt AC 4 ms 3828 KB
01-random-013.txt AC 14 ms 4128 KB
01-random-014.txt AC 2 ms 3636 KB
01-random-015.txt AC 10 ms 4036 KB
02-large-001.txt AC 21 ms 4468 KB
02-large-002.txt AC 22 ms 4352 KB
02-large-003.txt AC 21 ms 4424 KB
02-large-004.txt AC 21 ms 4440 KB
02-large-005.txt AC 22 ms 4468 KB
02-large-006.txt AC 21 ms 4456 KB
02-large-007.txt AC 21 ms 4352 KB
02-large-008.txt AC 21 ms 4412 KB
02-large-009.txt AC 21 ms 4540 KB
02-large-010.txt AC 21 ms 4464 KB
03-small-001.txt AC 1 ms 3688 KB
03-small-002.txt AC 1 ms 3760 KB
03-small-003.txt AC 1 ms 3632 KB
03-small-004.txt AC 1 ms 3688 KB
03-small-005.txt AC 1 ms 3632 KB
03-small-006.txt AC 1 ms 3712 KB
03-small-007.txt AC 1 ms 3684 KB
03-small-008.txt AC 1 ms 3696 KB
03-small-009.txt AC 1 ms 3628 KB
03-small-010.txt AC 1 ms 3756 KB
03-small-011.txt AC 1 ms 3632 KB
03-small-012.txt AC 1 ms 3632 KB
03-small-013.txt AC 1 ms 3692 KB
03-small-014.txt AC 1 ms 3640 KB
03-small-015.txt AC 1 ms 3508 KB
03-small-016.txt AC 1 ms 3676 KB
03-small-017.txt AC 1 ms 3628 KB
03-small-018.txt AC 1 ms 3696 KB
03-small-019.txt AC 1 ms 3584 KB
03-small-020.txt AC 1 ms 3680 KB
03-small-021.txt AC 1 ms 3652 KB
03-small-022.txt AC 1 ms 3876 KB
03-small-023.txt AC 1 ms 3680 KB
03-small-024.txt AC 1 ms 3692 KB
03-small-025.txt AC 1 ms 3536 KB
03-small-026.txt AC 1 ms 3572 KB
03-small-027.txt AC 1 ms 3688 KB
03-small-028.txt AC 1 ms 3704 KB
03-small-029.txt AC 1 ms 3572 KB
03-small-030.txt AC 1 ms 3708 KB
03-small-031.txt AC 1 ms 3692 KB
03-small-032.txt AC 1 ms 3600 KB
03-small-033.txt AC 1 ms 3692 KB
03-small-034.txt AC 1 ms 3760 KB
03-small-035.txt AC 1 ms 3696 KB
03-small-036.txt AC 1 ms 3652 KB
03-small-037.txt AC 1 ms 3632 KB
03-small-038.txt AC 1 ms 3684 KB
03-small-039.txt AC 1 ms 3656 KB
03-small-040.txt AC 1 ms 3680 KB


2025-03-26 (Wed)
16:39:22 +00:00