Submission #23577036

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef pair<string,string> Pstring;
typedef pair<double,double> Pdouble;


#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define Precision13 cout << fixed << setprecision(13)
const double PI=3.14159265358979323846;
const int MAX = 510000;
const int MOD = 1000000007;
const int INF = 1<<29;
using Graph = vector<vector<int>>;


int main(){
  ll n;
  cin >> n;
  ll ans;
  ans = n*1.08;
  if(ans<206){
    cout << "Yay!"<<endl;
  }else if(ans == 206){
    cout << "so-so"<<endl;
  }else{
    cout << ":("<<endl;
  }
}

Submission Info

Submission Time
Task A - Maxi-Buying
User takkey
Language C++ (GCC 9.2.1)
Score 100
Code Size 701 Byte
Status AC
Exec Time 5 ms
Memory 3628 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt
Case Name Status Exec Time Memory
sample_01.txt AC 5 ms 3556 KiB
sample_02.txt AC 2 ms 3432 KiB
sample_03.txt AC 2 ms 3628 KiB
test_01.txt AC 2 ms 3404 KiB
test_02.txt AC 2 ms 3556 KiB
test_03.txt AC 2 ms 3612 KiB
test_04.txt AC 2 ms 3432 KiB
test_05.txt AC 2 ms 3524 KiB
test_06.txt AC 2 ms 3524 KiB
test_07.txt AC 2 ms 3396 KiB