結果
問題 | No.8064 う し た ぷ に き あ く ん 笑 |
ユーザー | Thistle |
提出日時 | 2020-04-01 22:18:01 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,402 bytes |
コンパイル時間 | 1,659 ms |
コンパイル使用メモリ | 126,848 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-06-27 11:19:15 |
合計ジャッジ時間 | 3,199 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
ソースコード
#pragma GCC target ("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #define _USE_MATH_DEFINES #include<iostream> #include<string> #include<queue> #include<cmath> #include<map> #include<set> #include<list> #include<iomanip> #include<vector> #include<random> #include<functional> #include<algorithm> #include<stack> #include<cstdio> #include<cstring> #include<bitset> #include<unordered_map> #include<climits> #include<fstream> #include<complex> #include<time.h> #include<cassert> #include<functional> #include<numeric> #include<tuple> using namespace std; using ll = int_fast64_t; using ld = long double; #define int ll #define all(a) (a).begin(),(a).end() #define fs first #define sc second #define xx first #define yy second.first #define zz second.second #define H pair<int, int> #define P pair<int, pair<int, int>> #define Q(i,j,k) mkp(i,mkp(j,k)) #define rep(i,n) for(int (i) = 0 ; (i) < (n) ; (i)++) #define rng(i,s,n) for(int (i) = (s) ; (i) < (n) ; (i)++) #define req(n,i) for(int (i) = (n) - 1 ; (i) >= 0 ; (i)--) #define range(i,v) for(auto& (i) : v) #define mkp make_pair #define mem(x,k) memset(x,k,sizeof(x)) #define vec vector #define pb emplace_back #define lb lower_bound #define ub upper_bound #define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end()) #define getidx(b,i) lower_bound(all(b),(i))-b.begin() #define ssp(i,n) (i==(ll)(n)-1?"\n":" ") #define ctoi(c) (int)(c-'0') #define itoc(c) (char)(c+'0') #define itn int #define pri_que priority_queue #define pp(x,y) pb(H{x,y}) #define ppp(x,y,z) pb(Q(x,y,z)) #define cdf int q810; cin>>q810; rep(q114,q810) #define cyes cout<<"Yes\n" #define cno cout<<"No\n" //#define endl "\n" constexpr int mod = 1e9 + 7; constexpr int Mod = 998244353; constexpr int MXN = 500000 + 100; constexpr ld EPS = 1e-10; constexpr ll inf = 3 * 1e18; constexpr int Inf = 15 * 1e8; const vec<int>dx{ -1,1,0,0 }, dy{ 0,0,-1,1 }; template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; } template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; } ll read() { ll u, k = scanf("%lld", &u); return u; } string reads() { string s; cin >> s; return s; } H readh(bool g = 0) { H u; ll k = scanf("%lld %lld", &u.fs, &u.sc); if (g) u.fs--, u.sc--; return u; } void printh(H t) { printf("%lld %lld\n", t.fs, t.sc); } bool inarea(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; } ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; } ll mod_pow(ll x, ll n, ll p = mod) { ll res = 1; while (n > 0) { if (n & 1) res = res * x % p; x = x * x % p; n >>= 1; } return res; }//x^n%p ll bitcount(ll x) { int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++; return sum; } /*constexpr int fn_ = 1000005; ll fact_[fn_], comp_[fn_]; ll comb(ll x, ll y, ll Mod = mod) { if (!fact_[0]) { fact_[0] = 1; comp_[0] = 1; for (int i = 1; i < fn_; i++) fact_[i] = fact_[i - 1] * i % Mod; comp_[fn_ - 1] = mod_pow(fact_[fn_ - 1], Mod - 2, Mod); for (int i = fn_ - 2; i > 0; i--) comp_[i] = comp_[i + 1] * (i + 1) % Mod; } if (x < y) return 0; return fact_[x] * comp_[x - y] % Mod * comp_[y] % Mod; }*/ //-------------------------------------------------------------- signed main() { string s; getline(cin, s); cout << s << endl; }