#pragma gcc target("avx2") #pragma gcc optimize("o3") #pragma gcc optimize("unroll-loops") //#pragma warning(disable : 4996) //#define ATCODER #ifdef ATCODER #include using namespace atcoder; #endif #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #if defined(LOCAL) || defined(_MSC_VER) void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); } #define DEBUG(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #else #define DEBUG(...) 42 #endif #ifdef _MSC_VER #include #include "stdafx.h" #define __builtin_popcount __popcnt #define __builtin_popcountll __popcnt64 #endif #define ll long long #define REP(i, n) for (ll i = 0; i < (n); ++i) #define REPR(i, n) for (ll i = (n)-1; i >= 0; --i) #define FOR(i, m, n) for (ll i = (m); i < (n); ++i) #define VSORT(v) sort(v.begin(), v.end()); #define VREVERSE(v) reverse(v.begin(), v.end()) #define print(x) cout << (x) << '\n' #define spa << " " << #define lb(v, n) lower_bound(v.begin(), v.end(), (n)) #define ub(v, n) upper_bound(v.begin(), v.end(), (n)) #define int long long //#define double long double #define all(x) (x).begin(), (x).end() #define print_space(v) \ REP(i, (v).size()) cout << v.at(i) << " \n"[i == (int)(v).size() - 1] template inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; } typedef pair pii; typedef pair pll; std::random_device rd; std::mt19937 mt(rd()); constexpr ll MOD = 1e9 + 7; constexpr int MAX = 40040; const double pi = acos(-1); constexpr long double EPS = 1e-9; const int dx[4] = { 0, 0, -1, 1 }, dy[4] = { -1, 1, 0, 0 }; using ld = long double; long long gcd(long long x, long long y) { long long m = max(x, y), n = min(x, y); if (m % n == 0)return n; else return gcd(m % n, n); } void solve() { int X, Y; cin >> X >> Y; print(gcd(X, Y)); } signed main() { //cin.tie(0); //ios::sync_with_stdio(false); // REP(_, 100)test(); //int q; //cin >> q; //while (q--) solve(); }

提出日時	2021/06/05 17:24:00
問題	A: Happiness Number
ユーザ	Mojumbo
言語	C++17 (g++ 10.2.0)
得点
結果	IE

セット名	得点 / 配点	テストケース名
結果		テストケース名
sample	0 / 0

all	100 / 100

セットごとの結果