【HDOJ】1314 Numerically Speaking

学了几天的Java了,终于独立A了一道大数计算。感觉还得练Java啊。

 1 import java.util.Scanner;
 2 import java.math.BigInteger;
 3 import java.lang.StringBuilder;
 4
 5 public class Main {
 6     public static void main(String[] args) {
 7         Scanner cin = new Scanner(System.in);
 8         while (cin.hasNextLine()) {
 9             String line = cin.nextLine();
10             char l0 = line.charAt(0);
11             if (l0 == ‘*‘)
12                 break;
13             if (l0>=‘0‘ && l0<=‘9‘) {
14                 StringBuilder builder = new StringBuilder();
15                 BigInteger x = new BigInteger(line);
16                 BigInteger div = new BigInteger("26");
17                 BigInteger[] vals = new BigInteger[2];
18                 while (x.compareTo(BigInteger.ZERO) != 0) {
19                     vals = x.divideAndRemainder(div);
20                     char ch = (char)(vals[1].intValue()+96);
21                     builder.append(ch);
22                     x = vals[0];
23                 }
24                 builder.reverse();
25                 String ans = new String(builder.toString());
26                 System.out.print(ans);
27                 int l = ans.length();
28                 while (l < WIDTH) {
29                     System.out.print(‘ ‘);
30                     ++l;
31                 }
32             } else {
33                 int length = line.length();
34                 System.out.print(line);
35                 int l = length;
36                 while (l < WIDTH) {
37                     System.out.print(‘ ‘);
38                     ++l;
39                 }
40                 BigInteger div = new BigInteger("26");
41                 BigInteger sum = new BigInteger(String.valueOf((int)(line.charAt(length-1))-96));
42                 for (int i=length-2; i>=0; --i) {
43                     // System.out.print("current sum = ");
44                     // System.out.println(sum.toString());
45                     BigInteger tmp = div.multiply(new BigInteger(String.valueOf((int)(line.charAt(i))-96)));
46                     sum = sum.add(tmp);
47                     div = div.multiply(new BigInteger("26"));
48                 }
49                 line = new String(sum.toString());
50             }
51             int length = line.length();
52             int x = length%3;
53             x = (x==0) ? 3:x;
54             int j = 0;
55             for (int i=0; i<length; ++i) {
56                 if (i < x) {
57                     System.out.print(line.charAt(i));
58                 } else {
59                     if ((j+1)<length && (j%3)==0) {
60                         System.out.print(‘,‘);
61                     }
62                     ++j;
63                     System.out.print(line.charAt(i));
64                 }
65             }
66             System.out.println();
67         }
68     }
69     public static void reverse(byte[] bytes, int l) {
70         byte tmp;
71         for (int i=0; i+i<l; ++i) {
72             tmp = bytes[i];
73             bytes[i] = bytes[l-1-i];
74             bytes[l-1-i] = tmp;
75         }
76     }
77     static final int WIDTH = 22;
78 }
时间: 2024-10-19 22:29:43

【HDOJ】1314 Numerically Speaking的相关文章

【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 (

【HDOJ】2795 Billboard

线段树.注意h范围(小于等于n). 1 #include <stdio.h> 2 #include <string.h> 3 4 #define MAXN 200005 5 #define lson l, mid, rt<<1 6 #define rson mid+1, r, rt<<1|1 7 #define mymax(x, y) (x>y) ? x:y 8 9 int nums[MAXN<<2]; 10 int h, w; 11 12