#893665 (C++14) No.2385 Parse Integer with Radix

• 問題: No.2385 Parse Integer with Radix
• ユーザー: Pon9078
• 提出日時: 2023-07-21 21:31:20
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 3 ms / 2,000 ms
• コード長: 2,123 bytes
• コンパイル時間: 753 ms
• コンパイル使用メモリ: 82,640 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-21 22:49:09
• 合計ジャッジ時間: 1,313 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
sample	AC * 1
other	AC * 11

ソースコード

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
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
#define loop1(n) for(int loopt = 0; loopt < (n); loopt++)
#define loop2(i,n) for((i) = 0; (i) < (n); (i)++)
#define loop3(i,k,n) for((i) = (k); (i) < (n); (i)++)
#define GET_NAME_LOOP(_2,_3,NAME,...) NAME
#define loop(n,...) GET_NAME_LOOP(__VA_ARGS__,loop3,loop2,loop1)(n,__VA_ARGS__)
#define rloop1(n) for(int loopt = (n)-1; loopt >= 0; loopt--)
#define rloop2(i,n) for((i) = (n)-1; (i) >= 0; (i)--)
#define rloop3(i,k,n) for((i) = (k)-1; (i) >= (n); (i)--)
#define GET_NAME_RLOOP(_2,_3,NAME,...) NAME
#define rloop(n,...) GET_NAME_RLOOP(__VA_ARGS__,rloop3,rloop2,rloop1)(n,__VA_ARGS__)
#define outone cout << "First" << endl
#define outtwo cout << "Second" << endl
#define outyes cout << "Yes" << endl
#define outno cout << "No" << endl
#define outans cout << ans << endl
#define all(i) i.begin(),i.end()
//const ll mod =  998244353L;
//const ll mod = 1e9+7L;
//const double PI =3.14159265359d;
//const double E =2.718281828d;
int main() {
    int i,j,k,q;
    cin >> q;
    while(q--){
        string l;
        cin >> l;
        long ans = 0;
        switch(l[1]){
            case 'b':
                loop(i,2,l.size()){
                    ans*=2;
                    ans+= (l[i]-'0');
                }
                break;
            case 'o':
                loop(i,2,l.size()){
                    ans*=8;
                    ans+= (l[i]-'0');
                }
                break;
            case 'x':
                loop(i,2,l.size()){
                    ans*=16;
                    if('0' <=l[i] && l[i] <= '9')ans+= (l[i]-'0');
                    else{
                        ans+=10;
                        ans+=(l[i]-'a');
                    }
                }
                break;
            default:
                loop(i,0,l.size()){
                    ans*=10;
                    ans+= (l[i]-'0');
                }
                break;
        }
        cout << ans << endl;
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX