結果

問題 No.8054 ほぼ直角二等辺三角形
ユーザー Sumitacchan
提出日時 2019-04-01 23:52:36
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 2,847 bytes
コンパイル時間 1,521 ms
コンパイル使用メモリ 172,688 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-11-27 05:53:44
合計ジャッジ時間 2,695 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define Ans(f, y, n) if(f) cout << y << endl; else cout << n << endl;
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i, v.size()){ cout << v[i] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i, m.size()){ REP(j, m[i].size()){ cout << m[i][j] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
template<typename T> void readv(vector<T> &a){ REP(i, a.size()) cin >> a[i]; }
void readv_m1(vector<int> &a){ REP(i, a.size()){cin >> a[i]; a[i]--;} }
//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
int mod = 1000000007;
//int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod
signed main(){
    mat ans(19);
    ans[1] = vec({3,4,5});
    ans[2] = vec({20,21,29});
    ans[3] = vec({119,120,169});
    ans[4] = vec({4059,4060,5741});
    ans[5] = vec({23660,23661,33461});
    ans[6] = vec({137903,137904,195025});
    ans[7] = vec({803760,803761,1136689});
    ans[8] = vec({27304196,27304197,38613965});
    ans[9] = vec({159140519,159140520,225058681});
    ans[10] = vec({927538920,927538921,1311738121});
    ans[11] = vec({31509019100,31509019101,44560482149});
    ans[12] = vec({183648021599,183648021600,259717522849});
    ans[13] = vec({1070379110496,1070379110497,1513744654945});
    ans[14] = vec({36361380737780,36361380737781,51422757785981});
    ans[15] = vec({211929657785303,211929657785304,299713796309065});
    ans[16] = vec({1235216565974040,1235216565974041,1746860020068409});
    ans[17] = vec({7199369738058939,7199369738058940,10181446324101389});
    ans[18] = vec({244566641436218639,244566641436218640,345869461223138161});
    int X; cin >> X;
    printf("%lld %lld %lld\n", ans[X][0], ans[X][1], ans[X][2]);
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0