結果
問題 | No.2637 Factorize? |
ユーザー | airths |
提出日時 | 2024-02-19 21:25:36 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,599 bytes |
コンパイル時間 | 1,122 ms |
コンパイル使用メモリ | 127,228 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-09-29 01:20:49 |
合計ジャッジ時間 | 2,022 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,820 KB |
testcase_01 | AC | 1 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,820 KB |
testcase_03 | AC | 1 ms
6,820 KB |
testcase_04 | AC | 1 ms
6,816 KB |
testcase_05 | AC | 2 ms
6,820 KB |
testcase_06 | AC | 2 ms
6,816 KB |
testcase_07 | AC | 1 ms
6,820 KB |
testcase_08 | AC | 1 ms
6,816 KB |
testcase_09 | AC | 2 ms
6,816 KB |
testcase_10 | AC | 2 ms
6,816 KB |
testcase_11 | AC | 2 ms
6,816 KB |
testcase_12 | AC | 2 ms
6,816 KB |
testcase_13 | AC | 2 ms
6,816 KB |
testcase_14 | AC | 1 ms
6,820 KB |
testcase_15 | AC | 1 ms
6,820 KB |
testcase_16 | AC | 2 ms
6,816 KB |
testcase_17 | AC | 2 ms
6,820 KB |
testcase_18 | AC | 2 ms
6,816 KB |
testcase_19 | AC | 2 ms
6,816 KB |
testcase_20 | AC | 2 ms
6,816 KB |
testcase_21 | AC | 2 ms
6,816 KB |
testcase_22 | AC | 1 ms
6,816 KB |
testcase_23 | AC | 2 ms
6,816 KB |
testcase_24 | AC | 1 ms
6,820 KB |
testcase_25 | AC | 1 ms
6,816 KB |
testcase_26 | AC | 2 ms
6,820 KB |
testcase_27 | AC | 2 ms
6,816 KB |
testcase_28 | AC | 2 ms
6,820 KB |
testcase_29 | AC | 2 ms
6,820 KB |
testcase_30 | AC | 2 ms
6,816 KB |
testcase_31 | AC | 2 ms
6,816 KB |
ソースコード
/*** ^v^**/#include <iostream>#include <numeric>#include <set>#include <iomanip>#include <chrono>#include <queue>#include <string>#include <vector>#include <functional>#include <map>#include <bitset>#include <algorithm>#include <array>#include <random>using namespace std;using ll = long long int;using ld = long double;#define iamtefu ios_base::sync_with_stdio(false); cin.tie(0);#define fl(i,a,n) for (ll i{a}; i<n; i++)#define fr(x,s) for(auto x:s)#define rfl(i,a,n) for (ll i{n-1}; i>=a; i--)#define ty int _; for(cin>>_; _--;)#define print(a) for(auto ele:a){cout<<ele<<" ";}cout<<'\n';#define all(x) x.begin(), x.end()template <typename L, typename R>inline bool chmax(L &a, R b){if (a<b){a=b;return 1;}return 0;}template <typename L, typename R>inline bool chmin(L &a, R b){if (a>b){a=b;return 1;}return 0;}template <typename L, typename R>ostream& operator<<(ostream &fout, const pair<L, R> &p){fout<<"{"<<p.first<<","<<p.second<<"}";return fout;}template <typename L, typename R, typename U>ostream& operator<<(ostream &fout, const tuple<L, R, U> &p){auto &[l, r, u] = p;fout<<"{"<<l<<","<<r<<","<<u<<"}";return fout;}template <typename T>ostream& operator<<(ostream &fout, const vector <T> &v){for (auto &x:v){fout<<x<<" ";}fout<<"\n";return fout;}template <typename T>ostream& operator<<(ostream &fout, const set <T> &st){for (auto &x:st){fout<<x<<" ";}fout<<"\n";return fout;}template <typename T>ostream& operator<<(ostream &fout, const multiset <T> &st){for (auto &x:st){fout<<x<<" ";}fout<<"\n";return fout;}template <typename K, typename V>ostream& operator<<(ostream &fout, const map<K, V> &mp){fout<<"[";for (auto &[x,y]:mp){fout<<x<<":"<<y<<" ";}fout<<"]\n";return fout;}ll gcd(ll a, ll b){if (b==0){return a;}return gcd(b, a%b);}mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());ll pw(ll a, ll b, ll m){ll res=1;a%=m;while (b){if (b&1){res=(res*a)%m;}a=(a*a)%m;b/=2;}return res;}void scn(){// not necessarily distinct// right downll n; cin>>n;cout<<"1 "<<n<<'\n';}int main(){iamtefu;#if defined(airths)auto t1=chrono::high_resolution_clock::now();freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);#endif// ty{scn();}#if defined(airths)auto t2=chrono::high_resolution_clock::now();ld ti=chrono::duration_cast<chrono::nanoseconds>(t2-t1).count();ti*=1e-6;cerr<<"Time: "<<setprecision(12)<<ti;cerr<<"ms\n";#endifreturn 0;}