結果
問題 | No.2190 平方数の下12桁 |
ユーザー |
|
提出日時 | 2023-03-01 18:58:26 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,691 bytes |
コンパイル時間 | 4,113 ms |
コンパイル使用メモリ | 239,524 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-16 16:23:52 |
合計ジャッジ時間 | 5,561 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 41 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>typedef long long int ll;using namespace std;typedef pair<ll, ll> P;using namespace atcoder;template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;#define USE998244353#ifdef USE998244353const ll MOD = 998244353;using mint = modint998244353;#elseconst ll MOD = 1000000007;using mint = modint1000000007;#endifconst int MAX = 2000005;long long fac[MAX], finv[MAX], inv[MAX];void COMinit() {fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;for (int i = 2; i < MAX; i++){fac[i] = fac[i - 1] * i % MOD;inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;finv[i] = finv[i - 1] * inv[i] % MOD;}}long long COM(int n, int k){if (n < k) return 0;if (n < 0 || k < 0) return 0;return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;}ll gcd(ll x, ll y) {if (y == 0) return x;else if (y > x) {return gcd (y, x);}else return gcd(x % y, y);}ll lcm(ll x, ll y) {return x / gcd(x, y) * y;}ll my_sqrt(ll x) {//ll m = 0;ll M = 3000000001;while (M - m > 1) {ll now = (M + m) / 2;if (now * now <= x) {m = now;}else {M = now;}}return m;}ll keta(ll num, ll arity) {ll ret = 0;while (num) {num /= arity;ret++;}return ret;}ll ceil(ll n, ll m) {// n > 0, m > 0ll ret = n / m;if (n % m) ret++;return ret;}ll pow_ll(ll x, ll n) {if (n == 0) return 1;if (n % 2) {return pow_ll(x, n - 1) * x;}else {ll tmp = pow_ll(x, n / 2);return tmp * tmp;}}vector<ll> compress(vector<ll>& v) {// [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0]vector<ll> u = v;sort(u.begin(), u.end());u.erase(unique(u.begin(),u.end()),u.end());map<ll, ll> mp;for (int i = 0; i < u.size(); i++) {mp[u[i]] = i;}for (int i = 0; i < v.size(); i++) {v[i] = mp[v[i]];}return v;}void dfs(int i, int candidate, int carry, string& s, vector<int>& ans, bool& useful) {// 10^i の位を決めている。// if (i >= 3) {// cout << i << endl;// for (int j = i - 1; j >= 0; j--) {// cout << ans[11 - j];// }// cout << endl;// cout << "cary is " << carry <<endl;// }// cout << "i is " << i << " carry is " << carry << " candidate is " << candidate << endl;if (useful) return;int key = 11 - i;// cout << "kkk "<< ans[key + 1] << endl;int sumCoe = 22 - i;int now = carry;ans[key] = candidate;for (int j = key; j <= sumCoe - j; j++) {int k = sumCoe - j;if (j == k) {now += ans[j] * ans[j];}else {now += 2 * ans[j] * ans[k];}}carry = now / 10;now %= 10;// cout << "now is " << now << " key is " << (s[key] - '0') << endl;if (now == s[key] - '0') {// candidate is validif (i == 11) {useful = true;// all finishedreturn;}for (int j = 0; j <= 9; j++) {dfs(i + 1, j, carry, s, ans, useful);}}else {return;}}int main() {string s;cin >> s;vector<int> ans(12);bool ini = false;for (int i = 0; i <= 9; i++) dfs(0, i, 0, s, ans, ini);if (ini) {// for (int i = 0; i < 12; i++) {// cout << ans[i];// }cout << "YES" << endl;}else {cout << "NO" << endl;}return 0;}