結果
| 問題 | No.167 N^M mod 10 |
| ユーザー |
 penguinshunya
|
| 提出日時 | 2019-07-13 15:42:04 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 25 ms / 1,000 ms |
| コード長 | 3,713 bytes |
| コンパイル時間 | 2,117 ms |
| コンパイル使用メモリ | 195,880 KB |
| 最終ジャッジ日時 | 2025-01-07 06:45:14 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 27 |
ソースコード
#include <bits/stdc++.h>#define rep(i, n) for (int i = 0; i < int(n); i++)#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)#define reps(i, n) for (int i = 1; i <= int(n); i++)#define rreps(i, n) for (int i = int(n); i >= 1; i--)#define repc(i, n) for (int i = 0; i <= int(n); i++)#define rrepc(i, n) for (int i = int(n); i >= 0; i--)#define repi(i, a, b) for (int i = int(a); i < int(b); i++)#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)#define repp(i, n) rep(i, n)#define reppp(i, n) repp(i, n)#define rrepp(i, n) rrep(i, n)#define repss(i, n) reps(i, n)#define repcc(i, n) repc(i, n)#define repii(i, a, b) repi(i, a, b)#define each(x, y) for (auto &x : y)#define all(a) (a).begin(), (a).end()#define bit(b) (1ll << (b))using namespace std;using i32 = int;using i64 = long long;using u64 = unsigned long long;using f80 = long double;using vi32 = vector<i32>;using vi64 = vector<i64>;using vu64 = vector<u64>;using vf80 = vector<f80>;using vstr = vector<string>;inline void yes() { cout << "Yes" << '\n'; exit(0); }inline void no() { cout << "No" << '\n'; exit(0); }inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }void solve() {string N, M; cin >> N >> M;int m = M[M.size() - 1] - '0';if (M.size() >= 2) m += (M[M.size() - 2] - '0') * 10;if (M == "0") {cout << 1 << '\n';return;}m %= 4;int n = N[N.size() - 1] - '0';switch (n) {case 0:case 1:case 5:case 6:cout << n << '\n';return;case 4:if (m == 1 || m == 3) cout << 4 << '\n';else cout << 6 << '\n';break;case 9:if (m == 1 || m == 3) cout << 9 << '\n';else cout << 1 << '\n';break;case 2:if (m == 0) cout << 6 << '\n';if (m == 1) cout << 2 << '\n';if (m == 2) cout << 4 << '\n';if (m == 3) cout << 8 << '\n';break;case 3:if (m == 0) cout << 1 << '\n';if (m == 1) cout << 3 << '\n';if (m == 2) cout << 9 << '\n';if (m == 3) cout << 7 << '\n';break;case 7:if (m == 0) cout << 1 << '\n';if (m == 1) cout << 7 << '\n';if (m == 2) cout << 9 << '\n';if (m == 3) cout << 3 << '\n';break;case 8:if (m == 0) cout << 6 << '\n';if (m == 1) cout << 8 << '\n';if (m == 2) cout << 4 << '\n';if (m == 3) cout << 2 << '\n';break;}}