結果

問題 No.1626 三角形の構築
ユーザー heno239heno239
提出日時 2021-07-23 23:51:29
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,813 bytes
コンパイル時間 2,775 ms
コンパイル使用メモリ 165,712 KB
実行使用メモリ 19,276 KB
最終ジャッジ日時 2024-10-12 11:51:46
合計ジャッジ時間 4,724 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 23 ms
18,944 KB
testcase_02 AC 21 ms
19,200 KB
testcase_03 AC 21 ms
19,020 KB
testcase_04 AC 21 ms
19,016 KB
testcase_05 AC 22 ms
18,944 KB
testcase_06 AC 22 ms
19,148 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 22 ms
18,944 KB
testcase_13 WA -
testcase_14 AC 22 ms
19,144 KB
testcase_15 AC 22 ms
19,016 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 AC 23 ms
19,148 KB
testcase_19 AC 22 ms
19,144 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 AC 23 ms
19,148 KB
testcase_24 AC 63 ms
19,152 KB
testcase_25 AC 22 ms
19,072 KB
testcase_26 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
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-10;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += 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, ll 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)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1000000;
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];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

int gcd(int a, int b) {
	if (a < b)swap(a, b);
	while (b) {
		int r = a % b; a = b; b = r;
	}
	return a;
}
void solve() {
	ll s, t; cin >> s >> t;
	vector<ll> ds;
	for (ll d = 1; d <= 60000; d++) {
		if (t % d == 0) {
			ds.push_back(d);
			ds.push_back(t / d);
		}
	}
	sort(all(ds)); ds.erase(unique(all(ds)), ds.end());
	vector<vector<ll>> ans;
	rep(i, ds.size()) {
		Rep(j, i, ds.size()) {
			ll n = ds[i];
			ll m = ds[j];
			ll z = t;
			if (z % n)continue;
			z /= n;
			if (z % m)continue;
			z /= m;
			if (z % 2)continue;
			z /= 2;
			if (z != n + m)continue;
			//cout << n << " " << m << "\n";
			ll y = s;
			if (y % (n * m))continue;
			y /= n * m;
			if (y % (n + m))continue;
			y /= (n + m);
			//cout << n << " " << m << "\n";
			//y=k*(m*n-k*k)
			ll yk = round(sqrt(y));
			vector<ll> dd;
			for (ll d = 1; d <= yk + 1; d++) {
				if (y % d == 0) {
					dd.push_back(d);
					dd.push_back(y / d);
				}
			}
			sort(all(dd));
			dd.erase(unique(all(dd)),dd.end());
			for (ll k : dd) {
				//cout << "? " << n << " " << m << " " << k << "\n";
				if (m * n < k * k)continue;
				ll cop = y;
				if (cop % k)continue;
				cop /= k;
				ll cc = m * n - k * k;
				if (cop != cc)continue;
				//cout << "? " << n << " " << m << " " << k << "\n";
				ll a = n * (m * m + k * k);
				ll b = m * (n * n + k * k);
				ll c = (m + n) * (m * n - k * k);
				vector<ll> v = { a,b,c };
				sort(all(v));
				if (v[0] + v[1] <= v[2])continue;
				if (v[0] == 0 || v[2] > 1000000000)continue;
				ans.push_back(v);
			}
		}
	}
	sort(all(ans));
	ans.erase(unique(all(ans)), ans.end());
	cout << ans.size() << "\n";
	rep(i, ans.size()) {
		cout << ans[i][0] << " " << ans[i][1] << " " << ans[i][2] << "\n";
	}
}

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