백준 알고리즘 21312번 : 홀짝 칵테일

링크

https://www.acmicpc.net/problem/21312

sol1) 구현

#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define int int64_t
using namespace std;

int32_t main(){
  fastio;
  int ret = 1;
  bool flag = false;
  vector<int> v(3),ans;
  for(auto& c : v){
    cin >> c;
    if(c % 2 != 0){
      ret *= c;
      flag = true;
    }
  }
  cout << (flag ? ret : (v[0] * v[1] * v[2])) << "\n";
}