#241340 (C++14) No.653 E869120 and Lucky Numbers

• 問題: No.653 E869120 and Lucky Numbers
• ユーザー: fiord
• 提出日時: 2018-03-04 19:04:39
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 3 ms / 2,000 ms
• コード長: 3,202 bytes
• コンパイル時間: 1,089 ms
• コンパイル使用メモリ: 119,172 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-09-13 18:18:48
• 合計ジャッジ時間: 2,065 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 31

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <tuple>
#include <bitset>
#include <limits>
#include <algorithm>
#include <random>
#include <complex>
#include <regex>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef complex<ld> compd;
#define reach(i,a)  for(auto i:a)
#define rep(i,n)    for(int i=0;i<(int)n;i++)
#define REP(i,n)    for(int i=0;i<=(int)n;i++)
#define srep(i,a,n) for(int i=a;i<(int)n;i++)
#define SREP(i,a,n) for(int i=a;i<=(int)n;i++)
#define rrep(i,n)   for(int i=n-1;i>=0;i--)
#define RREP(i,n)   for(int i=n;i>=0;i--)
#define all(a)  (a).begin(),(a).end()
#define mp(a,b) make_pair(a,b)
#define mt  make_tuple
#define pb  push_back
#define fst first
#define scn second
int bitcnt(ll x) {
    x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555);
    x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333);
    x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F);
    x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF);
    x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF);
    x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF);
    return x;
}
int bitcnt(int x) {
    x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555);
    x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333);
    x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F);
    x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF);
    x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF);
    return x;
}
ll gcd(ll a, ll b) {
    return a%b == 0 ? b : gcd(b, a%b);
}
#define debug(x)    cout<<"case #" << x << ": " << endl
#define DEBUG 0
const ll inf = 1e9;
const ll mod = 1e9 + 7;
const ld eps = 1e-15;
const int dx[] = { 1,0,-1,0,0 };
const int dy[] = { 0,1,0,-1,0 };
int main() {
    string p;   cin >> p;
    // 1番下の桁は2,3,4のどれかで無いといけない（0は良い数じゃないから）
    int under = p[p.size() - 1] - '0';
    if (under != 2 && under != 3 && under != 4) {
        cout << "No" << endl;
        return 0;
    }
    bool usezero[] = { false,false };
    int up = 0;
    rrep(i, p.size()) {
        int num = p[i] - '0' - up;
        if (usezero[0] & usezero[1]) {
            // 0のみOK
            if (num != 0) {
                cout << "No" << endl;
                return 0;
            }
            up = 0;
        }
        else if (usezero[0]) {
            // 0,6,7ならOK、upは0に。
            up = 0;
            if (num == 6 || num == 7)   continue;
            else if (num == 0) {
                usezero[1] = true;
            }
            else {
                cout << "No" << endl;
                return 0;
            }
        }
        else {
            // 0,2,4,6,7ならOK。
            // 0
            if (num == 0) {
                up = 0;
                usezero[0] = usezero[1] = true;
            }
            // 2(6+6),3(6+7),4(7+7)->up=1に
            else if (num == 2 || num == 3 || num == 4) {
                up = 1;
            }
            // 6,7(up=0,usezero[0]=trueに)
            else if (num == 6 || num == 7) {
                up = 0;
                usezero[0] = true;
            }
            else {
                cout << "No" << endl;
                return 0;
            }
        }
    }
    cout << (up == 0 ? "Yes" : "No") << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX