提出 #14247904

---

ソースコード 拡げる

//Let's join Kaede Takagaki Fan Club !!
//明日は高垣楓さんの誕生日！おめでとうございます！！！
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target ("avx")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
template<class T>
void dmp(T a){
	rep(i,a.size()) cout << a[i] << " ";
	cout << endl;
}
template<class T>
bool chmax(T&a, T b){
	if(a < b){
		a = b;
		return 1;
	}
	return 0;
}
template<class T>
bool chmin(T&a, T b){
	if(a > b){
		a = b;
		return 1;
	}
	return 0;
}
template<class T>
void g(T &a){
	cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 1000000007;//998244353
template<class T>
void add(T&a,T b){
	a+=b;
	if(a >= mod) a-=mod;
}
ll gcd(ll a, ll b){
	if(a < b) swap(a, b);
	if(b == 0) return a;
	else return gcd(b, a%b);
}
ll specific(ll h, ll w, ll dif, ll k){
	ll ans = 0;
	ll DH = gcd(h, dif);
	for(ll i=1;i<h;i++){
		if(dif * i > 450000LL) break;
		ll lb = 0, ub = w-dif;
		chmin(ub, (450000LL-dif*i) / h + 1LL);
		chmax(ub, 1LL);
		while(ub-lb > 1){
			ll mid = (lb+ub)/2;
			ll S = 1LL * h * (mid+dif) - 1LL * (h-i) * (dif);
			S += 2;
			S -= gcd(i, mid) + gcd(h-i, mid+dif) + DH;
			if(S <= 2*k) lb = mid;
			else ub = mid;
		}
		ans += ub-1;
	}
	return ans;
}
ll calc(ll w, ll h, ll k){
	ll ret = 0;
	for(int i=0;i<=w-2;i++){
		ret += specific(h, w, i, k) * (i==0?1LL:2LL);
	}
	return ret;
}
int main(){
	ios::sync_with_stdio(false);
	int w, h, k;
	cin >> w >> h >> k;
	ll ans = calc(w, h, k) + calc(h, w, k);
	ans <<= 1;
	cout << ans << '\n';
}

提出情報

ジャッジ結果