湖南省第十二届大学生计算机程序设计竞赛 A 2016

#include<bits/stdc++.h>
using namespace std;

#pragma comment(linker, "/STACK:102400000,102400000")
#define ls i<<1
#define rs ls | 1
#define mid ((ll+rr)>>1)
#define pii pair<int,int>
#define MP make_pair

typedef long long LL;
const long long INF = 1e18;
const double Pi = acos(-1.0);
const int N = 2e5+10, M = 1e6+11, mod = 1e6+3, inf = 5000;

int n,m;
int main() {
        while(scanf("%d%d",&n,&m)!=EOF) {
                LL ans = 0;
                for(int i = 0; i <= 2015; ++i) {
                    for(int j = 0; j <= 2015; ++j) {
                        LL fi , se;
                         fi = n / 2016;
                        if( i && n%2016>=i) {fi++;}
                         se = m / 2016;
                        if(j && m%2016>=j) se++;
                        if(i*j % 2016 == 0) ans += fi*se;
                    }
                }
                cout<<ans<<endl;
        }
    return 0;
}