結果
| 問題 | No.8054 ほぼ直角二等辺三角形 |
| ユーザー |
 tatyam
|
| 提出日時 | 2019-04-01 23:57:59 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 2 ms / 2,000 ms |
| コード長 | 6,561 bytes |
| コンパイル時間 | 2,219 ms |
| コンパイル使用メモリ | 202,520 KB |
| 最終ジャッジ日時 | 2025-01-07 01:15:51 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 18 |
ソースコード
#include <bits/stdc++.h>#pragma GCC target("avx2")#pragma GCC target ("tune=native")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")using namespace std;using ll=long long;using ld=long double;using ull=unsigned long long;using uint=unsigned int;using pcc=pair<char,char>;using pii=pair<int,int>;using pll=pair<ll,ll>;using pdd=pair<double,double>;using tuplis=pair<ll,pll>;using tuplis2=pair<pll,ll>;template<class T> using pq=priority_queue<T,vector<T>,greater<T>>;const ll LINF=0x1fffffffffffffff;const ll MOD=1000000007;const ll MODD=998244353;const int INF=0x3fffffff;const double DINF=numeric_limits<double>::infinity();const vector<pii> four={{-1,0},{0,1},{1,0},{0,-1}};#define _overload4(_1,_2,_3,_4,name,...) name#define _overload3(_1,_2,_3,name,...) name#define _rep1(n) for(ll i=0;i<n;++i)#define _rep2(i,n) for(ll i=0;i<n;++i)#define _rep3(i,a,b) for(ll i=a;i<b;++i)#define _rep4(i,a,b,c) for(ll i=a;i<b;i+=c)#define rep(...) _overload4(__VA_ARGS__,_rep4,_rep3,_rep2,_rep1)(__VA_ARGS__)#define _rrep1(n) for(ll i=n-1;i>=0;i--)#define _rrep2(i,n) for(ll i=n-1;i>=0;i--)#define _rrep3(i,a,b) for(ll i=b-1;i>=a;i--)#define _rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c)#define rrep(...) _overload4(__VA_ARGS__,_rrep4,_rrep3,_rrep2,_rrep1)(__VA_ARGS__)#define each(i,a) for(auto& i:a)#define sum(...) accumulate(range(__VA_ARGS__),0LL)#define dsum(...) accumulate(range(__VA_ARGS__),double(0))#define _range(i) (i).begin(),(i).end()#define _range2(i,k) (i).begin(),(i).begin()+k#define _range3(i,a,b) (i).begin()+a,(i).begin()+b#define range(...) _overload3(__VA_ARGS__,_range3,_range2,_range)(__VA_ARGS__)#define _rrange(i) (i).rbegin(),(i).rend()#define _rrange2(i,k) (i).rbegin(),(i).rbegin()+k#define _rrange3(i,a,b) (i).rbegin()+a,(i).rbegin()+b#define rrange(...) _overload3(__VA_ARGS__,_rrange3,_rrange2,_rrange)(__VA_ARGS__)#define yes(i) out(i?"yes":"no")#define Yes(i) out(i?"Yes":"No")#define YES(i) out(i?"YES":"NO")#define Possible(i) out(i?"Possible":"Impossible")#define elif else if#define unless(a) if(!(a))#define mp make_pair#define mt make_tuple#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)#define vec(type,name,...) vector<type> name(__VA_ARGS__)#define VEC(type,name,size) vector<type> name(size);in(name)#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))#define VV(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__));in(name)#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))__attribute__((constructor)) void SETTINGS(){cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);};inline constexpr ll gcd(ll a,ll b){if(!a||!b)return 0;if(a<b){ll c=a;a=b;b=c;}while(b){ll c=b;b=a%b;a=c;}return a;}inline constexpr ll lcm(ll a,ll b){if(!a||!b)return 0;return a*b/gcd(a,b);}template<class T>inline constexpr T min(vector<T>& v){return *min_element(range(v));}inline char min(string& v){return *min_element(range(v));}template<class T>inline constexpr T max(vector<T>& v){return *max_element(range(v));}inline char max(string& v){return *max_element(range(v));}inline constexpr ll intpow(const ll&a,const ll&b){if(b==0)return 1;ll ans=intpow(a,b/2);return ans*ans*(b&1?a:1);}inline constexpr ll modpow(const ll&a,const ll&b,const ll&mod=MOD){if(b==0)return 1;ll ans=modpow(a,b/2,mod);ans=ans*ans%mod;if(b&1)ans=ans*a%mod;return ans;}template<typename T>inline constexpr bool update_min(T& mn,const T& cnt){if(mn>cnt){mn=cnt;return 1;}else return 0;}template<typename T>inline constexpr bool update_max(T& mx,const T& cnt){if(mx<cnt){mx=cnt;return 1;}else return 0;}inline void in() {}template<class T>istream& operator >> (istream& is, vector<T>& vec);template<class T,size_t size>istream& operator >> (istream& is, array<T,size>& vec);template<class T,class L>istream& operator >> (istream& is, pair<T,L>& p);template<class T>ostream& operator << (ostream& os, vector<T>& vec);template<class T,class L>ostream& operator << (ostream& os, pair<T,L>& p);template<class T>istream& operator >> (istream& is, vector<T>& vec){for(T& x: vec) is >> x;return is;}template<class T,class L>istream& operator >> (istream& is, pair<T,L>& p){is >> p.first;is >> p.second;return is;}template<class T>ostream& operator << (ostream& os, vector<T>& vec){os << vec[0];rep(i,1,vec.size()){os << ' ' << vec[i];}return os;}template<class T>ostream& operator << (ostream& os, deque<T>& deq){os << deq[0];rep(i,1,deq.size()){os << ' ' << deq[i];}return os;}template<class T,class L>ostream& operator << (ostream& os, pair<T,L>& p){os << p.first << " " << p.second;return os;}template<class T,class L>pair<T,L> operator + (pair<T,L> a, pair<T,L> b){return {a.first + b.first, a.second + b.second};}template <class Head, class... Tail>inline void in(Head&& head,Tail&&... tail){cin>>head;in(move(tail)...);}template <class T>inline bool out(T t){cout<<t<<'\n';return 0;}inline bool out(){cout<<'\n';return 0;}template <class Head, class... Tail>inline bool out(Head head,Tail... tail){cout<<head<<' ';out(move(tail)...);return 0;}template <class T>inline void err(T t){cerr<<t<<'\n';}inline void err(){cerr<<'\n';}template <class Head, class... Tail>inline void err(Head head,Tail... tail){cerr<<head<<' ';out(move(tail)...);}const vector<tuple<ll,ll,ll>>ans={{3,4,5},{20,21,29},{119,120,169},{696,697,985},{4059,4060,5741},{23660,23661,33461},{137903,137904,195025},{803760,803761,1136689},{4684659,4684660,6625109},{27304196,27304197,38613965},{159140519,159140520,225058681},{927538920,927538921,1311738121},{5406093003,5406093004,7645370045},{31509019100,31509019101,44560482149},{183648021599,183648021600,259717522849},{1070379110496,1070379110497,1513744654945},{6238626641379,6238626641380,8822750406821},{36361380737780,36361380737781,51422757785981},{211929657785303,211929657785304,299713796309065},{1235216565974040,1235216565974041,1746860020068409},{7199369738058939,7199369738058940,10181446324101389},{41961001862379596,41961001862379597,59341817924539925},{244566641436218639,244566641436218640,345869461223138161}};signed main(){LL(n);each(i,ans)if(abs(n-1-floor(log10(ld(get<2>(i)))))<1e-8){out(get<0>(i),get<1>(i),get<2>(i));return 0;}}