結果
問題 | No.152 貯金箱の消失 |
ユーザー |
|
提出日時 | 2020-08-25 18:19:10 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 12 ms / 5,000 ms |
コード長 | 3,143 bytes |
コンパイル時間 | 4,636 ms |
コンパイル使用メモリ | 215,888 KB |
最終ジャッジ日時 | 2025-01-13 14:32:37 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 12 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("03")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std; typedef long double ld; typedef long long ll;typedef unsigned long long ull;#define endl "\n"#define FOR(i,a,b) for(int i=(a);i<=(b);i++)#define rep(i,n) for(int i=0;i<(n);i++)#define PII pair<int, int>#define PLL pair<ll, ll>#define ALL(x) (x).begin(), (x).end()constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1000003; constexpr int NIL = -1;template<class T>vector<T> vec(int len, T elem) { return vector<T>(len, elem); } // auto dp = vec(52, vec(103, vec(103, INF)));template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }template<class T>inline int popcount(T a) {return __builtin_popcount(a);}template<class T>inline T emod(T a, T p) { return (a%p + p) % p;}template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {os << '\n'; for (auto v : vec) os << v << ' '; os << '\n'; return os;}template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; returnos; }template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}';return os; }template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')';return os; }template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first <<"=>" << v.second << ','; os << '}'; return os; }//-------------------ll gcd(ll a, ll b) {return (a%b==0? b: gcd(b, a%b));}int main() {cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15);ll L; cin >> L;ll ans = 0;L /= 4;for(int n=1; 2*n*n<L; n++) {for(int m=n+1; ; m++) {ll a = m*m - n*n;ll b = 2 * m * n;ll c = m*m + n*n;if(a + b + c > L) break;if((m&1 and ~n&1) or (~m&1 and n&1)) {if(gcd(m, n)==1) ans += 1, ans %= mod;}}}cout << ans << endl;return 0;}