結果

問題 No.1143 面積Nの三角形
ユーザー heno239heno239
提出日時 2020-07-31 22:49:46
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 265 ms / 800 ms
コード長 4,650 bytes
コンパイル時間 1,428 ms
コンパイル使用メモリ 136,156 KB
実行使用メモリ 58,608 KB
最終ジャッジ日時 2024-07-06 20:14:21
合計ジャッジ時間 4,011 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 11 ms
44,544 KB
testcase_01 AC 12 ms
44,660 KB
testcase_02 AC 12 ms
44,660 KB
testcase_03 AC 12 ms
44,660 KB
testcase_04 AC 11 ms
44,652 KB
testcase_05 AC 12 ms
44,656 KB
testcase_06 AC 13 ms
44,656 KB
testcase_07 AC 27 ms
45,364 KB
testcase_08 AC 54 ms
45,936 KB
testcase_09 AC 52 ms
45,812 KB
testcase_10 AC 43 ms
44,912 KB
testcase_11 AC 97 ms
50,176 KB
testcase_12 AC 106 ms
50,944 KB
testcase_13 AC 106 ms
50,672 KB
testcase_14 AC 47 ms
44,656 KB
testcase_15 AC 12 ms
44,416 KB
testcase_16 AC 205 ms
55,936 KB
testcase_17 AC 212 ms
56,176 KB
testcase_18 AC 265 ms
58,608 KB
testcase_19 AC 154 ms
52,096 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 17;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

const int sup = 10000001;
int memo[sup];
void init() {
	fill(memo, memo + sup, -1);
	for (int i = 0; i <sup; i++) {
		if (i * i >= sup)break;
		memo[i * i] = i;
	}
}

ll calc_sq(ll x) {
	if (x < 0)return -1;
	if (x < sup)return memo[x];
	ld d = sqrt(x);
	ll dd = d + (1e-8);
	if (dd * dd == x)return dd;
	return -1;
}
void solve() {
	ll n; cin >> n;
	ll z = 16 * n * n;
	vector<ll> ds;
	for (ll d = 1; d <= 4 * n; d++) {
		if (z % d == 0) {
			ds.push_back(z / d);
			ds.push_back(d);
		}
	}
	sort(all(ds));
	ds.erase(unique(all(ds)), ds.end());

	vector<vector<int>> chs(ds.size());
	rep(i, ds.size())Rep(j, i + 1, ds.size()) {
		if (ds[j] % ds[i] == 0)chs[j].push_back(i);
	}
	ll ans = 0;
	
	vector<vector<ll>> anss;
	for (ll d : ds) {
		int lid = lower_bound(all(ds), d) - ds.begin();
		int rid = lower_bound(all(ds), z / d) - ds.begin();
		ll cl = d, cr = z / d;
		if (lid < rid) {
			for (int to : chs[lid]) {
				ll ccl = ds[to];
				ll ccr = cl / ccl;
				if ((ccl + ccr) % 2)continue;
				ll a = (ccr - ccl) / 2;
				if (a <= 0)continue;
				ll x = (ccr + ccl) / 2;
				
				ll y2 = a * a - cr;
				ll y = calc_sq(y2);
				if (y < 0)continue;
				if ((x + y) % 2)continue;
				ll b = (x - y) / 2;
				ll c = (x + y) / 2;
				if (b <= 0 || c <= 0)continue;
				vector<ll> nex = { a,b,c };
				sort(all(nex));
				anss.push_back(nex);
			}
		}
		else {
			for (int to : chs[rid]) {
				ll ccl = ds[to];
				ll ccr = cr / ccl;
				if ((ccl + ccr) % 2)continue;
				ll a = (ccr + ccl) / 2;
				ll y = (ccr - ccl) / 2;
				if (y < 0)continue;

				ll x2 = a * a + cl;
				ll x = calc_sq(x2);
				if (x < 0)continue;
				if ((x + y) % 2)continue;
				ll b = (x - y) / 2;
				ll c = (x + y) / 2;
				if (b <= 0 || c <= 0)continue;
				vector<ll> nex = { a,b,c };
				sort(all(nex));
				anss.push_back(nex);
			}
		}
	}
	sort(all(anss));
	anss.erase(unique(all(anss)), anss.end());
	ans = anss.size();
	cout << ans << "\n";
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//int t; cin >> t; rep(i, t)
	init();
	solve();
	return 0;
}
0