【HDOJ】1315 Basic

这道题目巨坑啊,注意__int64,int wa了一个下午。

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <cstdlib>
 4
 5 #define MAXN 105
 6
 7 char vals[] = "0123456789abcdef";
 8 char s[MAXN];
 9 int l;
10 bool flag;
11
12 bool check(char ch, int base) {
13     if (base <= 10)
14         return ( ch>=‘0‘ && ch<=‘0‘+base-1);
15     else
16         return ( (ch>=‘0‘&&ch<=‘9‘) || (ch>=‘a‘ && ch<‘a‘+base-10) );
17 }
18
19 int getv(int i, int base, __int64 *v) {
20     __int64 ret = 0;
21
22     while (flag && i < l) {
23         if (s[i] == ‘#‘)
24             break;
25         if (flag)   flag = check(s[i], base);
26         if (s[i] >= ‘a‘)
27             ret = ret*base + s[i]-‘a‘+10;
28         else
29             ret = ret*base + s[i]-‘0‘;
30         ++i;
31     }
32
33     *v = ret;
34     return i;
35 }
36
37 void solve() {
38     flag = true;
39     l = strlen(s);
40
41     int i = 0, k=0;
42     __int64 tmp = -1, base = 10;
43     bool ltag = false;
44
45     while (flag && i < l) {
46         if (s[i] == ‘#‘) {
47             if (!ltag) {
48                 ltag = true;
49                 base = tmp;
50                 if (base<2 || base>16)
51                     flag = false;
52             } else {
53                 if (s[i-1] == ‘#‘)
54                     flag = false;
55                 ltag = false;
56             }
57             ++i;
58             ++k;
59         } else {
60             if (i && !ltag)
61                 flag = false;
62             i = getv(i, base, &tmp);
63         }
64     }
65
66     if (k & 1)
67         flag = false;
68 }
69
70 int main() {
71     int t;
72
73 #ifndef ONLINE_JUDGE
74     freopen("data.in", "r", stdin);
75     freopen("data.out", "w", stdout);
76 #endif
77
78     scanf("%d", &t);
79     while (t--) {
80         scanf("%s", s);
81         solve();
82         if (flag) {
83             printf("yes\n");
84         } else {
85             printf("no\n");
86         }
87     }
88
89     return 0;
90 }
时间: 2024-12-14 21:58:50

【HDOJ】1315 Basic的相关文章

【HDOJ】1484 Basic wall maze

BFS. 1 /* 1484 */ 2 #include <iostream> 3 #include <queue> 4 #include <string> 5 #include <cstdio> 6 #include <cstring> 7 #include <algorithm> 8 using namespace std; 9 10 typedef struct { 11 int x, y; 12 string s; 13 }

【HDOJ】4956 Poor Hanamichi

基本数学题一道,看错位数,当成大数减做了,而且还把方向看反了.所求为最接近l的值. 1 #include <cstdio> 2 3 int f(__int64 x) { 4 int i, sum; 5 6 i = sum = 0; 7 while (x) { 8 if (i & 1) 9 sum -= x%10; 10 else 11 sum += x%10; 12 ++i; 13 x/=10; 14 } 15 return sum; 16 } 17 18 int main() { 1

【HDOJ】1099 Lottery

题意超难懂,实则一道概率论的题目.求P(n).P(n) = n*(1+1/2+1/3+1/4+...+1/n).结果如果可以除尽则表示为整数,否则表示为假分数. 1 #include <cstdio> 2 #include <cstring> 3 4 #define MAXN 25 5 6 __int64 buf[MAXN]; 7 8 __int64 gcd(__int64 a, __int64 b) { 9 if (b == 0) return a; 10 else return

【HDOJ】2844 Coins

完全背包. 1 #include <stdio.h> 2 #include <string.h> 3 4 int a[105], c[105]; 5 int n, m; 6 int dp[100005]; 7 8 int mymax(int a, int b) { 9 return a>b ? a:b; 10 } 11 12 void CompletePack(int c) { 13 int i; 14 15 for (i=c; i<=m; ++i) 16 dp[i]

【HDOJ】3509 Buge&#39;s Fibonacci Number Problem

快速矩阵幂,系数矩阵由多个二项分布组成.第1列是(0,(a+b)^k)第2列是(0,(a+b)^(k-1),0)第3列是(0,(a+b)^(k-2),0,0)以此类推. 1 /* 3509 */ 2 #include <iostream> 3 #include <string> 4 #include <map> 5 #include <queue> 6 #include <set> 7 #include <stack> 8 #incl

【HDOJ】1818 It&#39;s not a Bug, It&#39;s a Feature!

状态压缩+优先级bfs. 1 /* 1818 */ 2 #include <iostream> 3 #include <queue> 4 #include <cstdio> 5 #include <cstring> 6 #include <cstdlib> 7 #include <algorithm> 8 using namespace std; 9 10 #define MAXM 105 11 12 typedef struct {

【HDOJ】2424 Gary&#39;s Calculator

大数乘法加法,直接java A了. 1 import java.util.Scanner; 2 import java.math.BigInteger; 3 4 public class Main { 5 public static void main(String[] args) { 6 Scanner cin = new Scanner(System.in); 7 int n; 8 int i, j, k, tmp; 9 int top; 10 boolean flag; 11 int t

【HDOJ】2425 Hiking Trip

优先级队列+BFS. 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <queue> 5 using namespace std; 6 7 #define MAXN 25 8 9 typedef struct node_st { 10 int x, y, t; 11 node_st() {} 12 node_st(int xx, int yy, int tt)

【HDOJ】1686 Oulipo

kmp算法. 1 #include <cstdio> 2 #include <cstring> 3 4 char src[10005], des[1000005]; 5 int next[10005], total; 6 7 void kmp(char des[], char src[]){ 8 int ld = strlen(des); 9 int ls = strlen(src); 10 int i, j; 11 12 total = i = j = 0; 13 while (