Codeforces Round #229 (Div. 2) problem B - Inna, Dima and Song solution

Codeforces Round #229 (Div. 2) problem B - Inna, Dima and Song :  http://codeforces.com/contest/390/problem/B

Codeforces Round #229 (Div. 2) problem B - Inna, Dima and Song solution : http://ideone.com/RQi4RR

#include <iostream>

#include <cstdio>

#include <cmath>

using namespace std;

int main() {

int n, a[100005], b;

long long cnt;

scanf("%d", &n);

cnt=0;

for(int i=0; i<n; i++) scanf("%d", &a[i]);

for(int i=0; i<n; i++) {

scanf("%d", &b);

if(b>a[i]*2 || b<2) cnt--;

else cnt+=pow(b, 2)/4;

}

printf("%lld\n", cnt);

return 0;

}

note: put "%I64d" instead of "%lld" when submitting to codeforces