CODEFORCES problem 50/A Domino piling

Problem link (Click here)

#include<cstdio>
#include<iostream>

using namespace std;

int main()
{
    int M,N;
    cin >> M >> N;
    int count=(M*N)/(2*1);
    cout << count << endl;
    return 0;
}