Language: C++

// IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>

// algorithm
#include <algorithm>
#include <cmath// IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>

// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>

// container
#include <vector>
#include <string>
#include <tuple>
#include <set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>

// others
#include <random>
#include <limits>
#include <functional>
#include <ctime>
#include <cassert>

// type alias
using lint = long long;
using ldouble = long double;
template <class T>
using greater_priority_queue = std::priority_queue<T, std::vector<T>, std::greater<T>>;


/* ----- class ----- */

template <class Cost = int>
struct Edge {
    int src, dst;
    Cost cost;
    Edge(int src = -1, int dst = -1, Cost cost = 1)
        : src(src), dst(dst), cost(cost){};

    bool operator<(const Edge<Cost>& e) const { return this->cost < e.cost; }
    bool operator>(const Edge<Cost>& e) const { return this->cost > e.cost; }
};

template <class Cost = int>
using Edges = std::vector<Edge<Cost>>;

template <class Cost = int>
using Graph = std::vector<std::vector<Edge<Cost>>>;


/* ----- debug ----- */

#if __has_include("../setting/source/debug.hpp")
#include "../setting/source/debug.hpp"
#endif


/* ----- short functions ----- */

template <class T>
inline T sq(T a) { return a * a; }

template <class T>
inline T iceil(T n, T d) { return (n + d - 1) / d; }

template <class T>
T gcd(T a, T b) {
    while (b > 0) {
        a %= b;
        std::swap(a, b);
    }
    return a;
}

template <class T, class U>
T ipow(T b, U n) {
    T ret = 1;
    while (n > 0) {
        if (n & 1) ret *= b;
        n >>= 1;
        b *= b;
    }
    return ret;
}

// 0-indexed
template <class T, class U>
inline T kthbit(T a, U k) { return (a >> k) & 1; }

template <class T, class U>
inline T mask(T a, U k) { return a & ((1 << k) - 1); }

template <class T>
std::map<T, int> compress(std::vector<T>& v) {
    std::sort(v.begin(), v.end());
    v.erase(std::unique(v.begin(), v.end()), v.end());

    std::map<T, int> rev;
    for (int i = 0; i < v.size(); ++i) rev[v[i]] = i;
    return rev;
}

template <class T>
T Vec(T v) { return v; }

template <class T, class... Ts>
auto Vec(size_t l, Ts... ts) {
    return std::vector<decltype(Vec<T>(ts...))>(l, Vec<T>(ts...));
}


/* ----- constants ----- */

// const int INF = std::numeric_limits<int>::max() / 3;
// const lint INF = std::numeric_limits<lint>::max() / 3;
// const ldouble PI = acos(-1);
// const ldouble EPS = 1e-10;
// std::mt19937 mt(int(std::time(nullptr)));


using namespace std;

int main() {
    lint W, H;
    cin >> W >> H;
    cout << W * H / 2 << ((W * H) & 1 ? ".5" : "") << " ";

    lint x, y;
    cin >> x >> y;
    cout << (x == W / 2 && y == H / 2 ? 1 : 0) << endl;
    return 0;
}

#include <numeric>

// container
#include <vector>
#include <string>
#include <tuple>
#include <set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>

// others
#include <random>
#include <limits>
#include <functional>
#include <ctime>
#include <cassert>

// type alias
using lint = long long;
using ldouble = long double;
template <class T>
using greater_priority_queue = std::priority_queue<T, std::vector<T>, std::greater<T>>;


/* ----- class ----- */

template <class Cost = int>
struct Edge {
    int src, dst;
    Cost cost;
    Edge(int src = -1, int dst = -1, Cost cost = 1)
        : src(src), dst(dst), cost(cost){};

    bool operator<(const Edge<Cost>& e) const { return this->cost < e.cost; }
    bool operator>(const Edge<Cost>& e) const { return this->cost > e.cost; }
};

template <class Cost = int>
using Edges = std::vector<Edge<Cost>>;

template <class Cost = int>
using Graph = std::vector<std::vector<Edge<Cost>>>;


/* ----- debug ----- */

#if __has_include("../setting/source/debug.hpp")
#include "../setting/source/debug.hpp"
#endif


/* ----- short functions ----- */

template <class T>
inline T sq(T a) { return a * a; }

template <class T>
inline T iceil(T n, T d) { return (n + d - 1) / d; }

template <class T>
T gcd(T a, T b) {
    while (b > 0) {
        a %= b;
        std::swap(a, b);
    }
    return a;
}

template <class T, class U>
T ipow(T b, U n) {
    T ret = 1;
    while (n > 0) {
        if (n & 1) ret *= b;
        n >>= 1;
        b *= b;
    }
    return ret;
}

// 0-indexed
template <class T, class U>
inline T kthbit(T a, U k) { return (a >> k) & 1; }

template <class T, class U>
inline T mask(T a, U k) { return a & ((1 << k) - 1); }

template <class T>
std::map<T, int> compress(std::vector<T>& v) {
    std::sort(v.begin(), v.end());
    v.erase(std::unique(v.begin(), v.end()), v.end());

    std::map<T, int> rev;
    for (int i = 0; i < v.size(); ++i) rev[v[i]] = i;
    return rev;
}

template <class T>
T Vec(T v) { return v; }

template <class T, class... Ts>
auto Vec(size_t l, Ts... ts) {
    return std::vector<decltype(Vec<T>(ts...))>(l, Vec<T>(ts...));
}


/* ----- constants ----- */

// const int INF = std::numeric_limits<int>::max() / 3;
// const lint INF = std::numeric_limits<lint>::max() / 3;
// const ldouble PI = acos(-1);
// const ldouble EPS = 1e-10;
// std::mt19937 mt(int(std::time(nullptr)));


using namespace std;

int main() {
    lint W, H;
    cin >> W >> H;
    cout << W * H / 2 << " ";

    lint x, y;
    cin >> x >> y;
    cout << (x == W / 2 && y == H / 2 ? 1 : 0) << endl;
    return 0;
}


Compiler output:
a.cc:9:21: error: missing terminating > character
    9 | #include <cmath// IO
      |                     ^
a.cc:177:11: error: redefinition of default argument for 'class Cost'
  177 | template <class Cost = int>
      |           ^~~~~
a.cc:47:11: note: original definition appeared here
   47 | template <class Cost = int>
      |           ^~~~~
a.cc:205:10: error: redefinition of 'template<class T> T sq(T)'
  205 | inline T sq(T a) { return a * a; }
      |          ^~
a.cc:75:10: note: 'template<class T> T sq(T)' previously declared here
   75 | inline T sq(T a) { return a * a; }
      |          ^~
a.cc:208:10: error: redefinition of 'template<class T> T iceil(T, T)'
  208 | inline T iceil(T n, T d) { return (n + d - 1) / d; }
      |          ^~~~~
a.cc:78:10: note: 'template<class T> T iceil(T, T)' previously declared here
   78 | inline T iceil(T n, T d) { return (n + d - 1) / d; }
      |          ^~~~~
a.cc:211:3: error: redefinition of 'template<class T> T gcd(T, T)'
  211 | T gcd(T a, T b) {
      |   ^~~
a.cc:81:3: note: 'template<class T> T gcd(T, T)' previously declared here
   81 | T gcd(T a, T b) {
      |   ^~~
a.cc:220:3: error: redefinition of 'template<class T, class U> T ipow(T, U)'
  220 | T ipow(T b, U n) {
      |   ^~~~
a.cc:90:3: note: 'template<class T, class U> T ipow(T, U)' previously declared here
   90 | T ipow(T b, U n) {
      |   ^~~~
a.cc:232:10: error: redefinition of 'template<class T, class U> T kthbit(T, U)'
  232 | inline T kthbit(T a, U k) { return (a >> k) & 1; }
      |          ^~~~~~
a.cc:102:10: note: 'template<class T, class U> T kthbit(T, U)' previously declared here
  102 | inline T kthbit(T a, U k) { return (a >> k) & 1; }
      |          ^~~~~~
a.cc:235:10: error: redefinition of 'template<class T, class U> T mask(T, U)'
  235 | inline T mask(T a, U k) { return a & ((1 << k) - 1); }
      |          ^~~~
a.cc:105:10: note: 'template<class T, class U> T mask(T, U)' previously declared here
  105 | inline T mask(T a, U k) { return a & ((1 << k) - 1); }
      |          ^~~~
a.cc:238:18: error: redefinition of 'template<class T> std::map<T, int> compress(std::vector<_Tp>&)'
  238 | std::map<T, int> compress(std::vector<T>& v) {
      |                  ^~~~~~~~
a.cc:108:18: note: 'template<class T> std::map<T, int> compress(std::vector<_Tp>&)' previously declared here
  108 | std::map<T, int> compress(std::vector<T>& v) {
      |                  ^~~~~~~~
a.cc:248:3: error: redefinition of 'template<class T> T Vec(T)'
  248 | T Vec(T v) { return v; }
      |   ^~~
a.cc:118:3: note: 'template<class T> T Vec(T)' previously declared here
  118 | T Vec(T v) { return v; }
      |   ^~~
a.cc:251:6: error: redefinition of 'template<class T, class ... Ts> auto Vec(size_t, Ts ...)'
  251 | auto Vec(size_t l, Ts... ts) {
      |      ^~~
a.cc:121:6: note: 'template<class T, class ... Ts> auto Vec(size_t, Ts ...)' previously declared here
  121 | auto Vec(size_t l, Ts... ts) {
      |      ^~~
a.cc:267:5: error: redefinition of 'int main()'
  267 | int main() {
      |     ^~~~
a.cc:137:5: note: 'int main()' previously defined here
  137 | int main() {
      |     ^~~~