Codeforces Beta Round #47, problem: (A) Domino piling solution

Codeforces Beta Round #47, problem: (A) Domino piling: http://codeforces.com/problemset/problem/50/A

Codeforces Beta Round #47, problem: (A) Domino piling solution A: http://ideone.com/q94RZf

#include <iostream>
#include <cstdio>
using namespace std;

int main() {
    int m, n;
    scanf("%d%d", &m, &n);
    printf("%d", m*n>>1);
    return 0;
}

Codeforces Beta Round #47, problem: (A) Domino piling solution B: 

#include <iostream>
#include <cstdio>
using namespace std;

int main() {
    int m, n;
    scanf("%d%d", &m, &n);
    printf("%d", m*n/2);
    return 0;
}