#line 1 "/workspaces/compro/lib/template.hpp" #line 1 "/workspaces/compro/lib/io/vector.hpp" #include #include #ifndef IO_VECTOR #define IO_VECTOR template std::ostream &operator<<(std::ostream &out, const std::vector &v) { int size = v.size(); for (int i = 0; i < size; i++) { std::cout << v[i]; if (i != size - 1) std::cout << " "; } return out; } template std::istream &operator>>(std::istream &in, std::vector &v) { for (auto &el : v) { std::cin >> el; } return in; } #endif #line 4 "/workspaces/compro/lib/template.hpp" #include #define REP(i, n) for (int i = 0; i < n; i++) #define FOR(i, m, n) for (int i = m; i < n; i++) #define ALL(v) (v).begin(), (v).end() #define coutd(n) cout << fixed << setprecision(n) #define ll long long int #define vl vector #define vi vector #define MM << " " << using namespace std; template void chmin(T &a, T b) { if (a > b) a = b; } template void chmax(T &a, T b) { if (a < b) a = b; } // 重複を消す。計算量はO(NlogN) template void unique(std::vector &v) { std::sort(v.begin(), v.end()); v.erase(std::unique(v.begin(), v.end()), v.end()); } #line 2 "main.cpp" int f(int v) { switch (v) { case 0: return 6; case 1: return 2; case 2: return 5; case 3: return 5; case 4: return 4; case 5: return 5; case 6: return 6; case 7: return 4; case 8: return 7; case 9: return 6; default: return 1; } } void solve(string P, string N) { if (N == "0") { cout << P << endl; return; } int p = 0; int len = P.length(); REP(i, len) { if (P[i] == '-') p += 1; else p += f(P[i] - '0'); } if (N.length() == 1) { int num = N[0] - '0'; num--; REP(i, num) { p = f(p); } cout << p << endl; return; } while (p >= 10) { int next = 0; while (p > 0) { next += f(p % 10); p /= 10; } p = next; } while (p != f(p)) { p = f(p); } cout << p << endl; return; // TODO: edit here } // generated by online-judge-template-generator v4.7.1 (https://github.com/online-judge-tools/template-generator) int main() { string P, N; std::cin >> P >> N; solve(P, N); return 0; }