Submission #62814063


Source Code Expand

Copy
#pragma GCC optimize("Ofast","inline","unroll-loops","no-stack-protector")
#include <bits/stdc++.h>
#define MountainRain main
//#define int long long
//#define double long double
#define INF 0x3f3f3f3f
#define endl '\n'
#define fi first
#define se second
using namespace std;typedef pair<int,int> PII;typedef pair<double,double> PDD;typedef long long LL;typedef unsigned long long ULL;int in(){int x=0,y=0;char c=0;while(!isdigit(c))y|=c=='-',c=getchar();while(isdigit(c))x=(x<<3)+(x<<1)+(c^48),c=getchar();return y?-x:x;}void out(int x){if(x<0)putchar('-'),x=-x;if(x>9)out(x/10);putchar(x%10+'0');}
void solve()
{
string s1,s2;cin>>s1>>s2;
if(s1=="sick" and s2=="sick")cout<<1;
else if(s1=="sick" and s2=="fine")cout<<2;
else if(s1=="fine" and s2=="sick")cout<<3;
else cout<<4;
}
signed MountainRain()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#pragma GCC optimize("Ofast","inline","unroll-loops","no-stack-protector")
#include <bits/stdc++.h>
#define MountainRain main
//#define int long long
//#define double long double
#define INF 0x3f3f3f3f
#define endl '\n'
#define fi first
#define se second
using namespace std;typedef pair<int,int> PII;typedef pair<double,double> PDD;typedef long long LL;typedef unsigned long long ULL;int in(){int x=0,y=0;char c=0;while(!isdigit(c))y|=c=='-',c=getchar();while(isdigit(c))x=(x<<3)+(x<<1)+(c^48),c=getchar();return y?-x:x;}void out(int x){if(x<0)putchar('-'),x=-x;if(x>9)out(x/10);putchar(x%10+'0');}
void solve()
{
	string s1,s2;cin>>s1>>s2;
	if(s1=="sick" and s2=="sick")cout<<1;
	else if(s1=="sick" and s2=="fine")cout<<2;
	else if(s1=="fine" and s2=="sick")cout<<3;
	else cout<<4;		
}
signed MountainRain()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cout.setf(ios::fixed),cout.precision(2);
	int T=1;//cin>>T;
	while(T--)solve();
	return 0;
}

Submission Info

Submission Time
Task A - Poisonous Oyster
User MountainRain
Language C++ 17 (gcc 12.2)
Score 100
Code Size 979 Byte
Status AC
Exec Time 1 ms
Memory 3540 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 10
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt
All 00_sample_00.txt, 00_sample_01.txt, 01_all_00.txt, 01_all_01.txt, 01_all_02.txt, 01_all_03.txt, 02_random_00.txt, 02_random_01.txt, 02_random_02.txt, 02_random_03.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 3400 KiB
00_sample_01.txt AC 1 ms 3404 KiB
01_all_00.txt AC 1 ms 3492 KiB
01_all_01.txt AC 1 ms 3496 KiB
01_all_02.txt AC 1 ms 3500 KiB
01_all_03.txt AC 1 ms 3540 KiB
02_random_00.txt AC 1 ms 3416 KiB
02_random_01.txt AC 1 ms 3356 KiB
02_random_02.txt AC 1 ms 3500 KiB
02_random_03.txt AC 1 ms 3392 KiB


2025-09-23 (Tue)
01:13:47 +00:00