zoukankan      html  css  js  c++  java
  • HDU 2106 decimal system

    http://acm.hdu.edu.cn/showproblem.php?pid=2106

    Problem Description
    As we know , we always use the decimal system in our common life, even using the computer. If we want to calculate the value that 3 plus 9, we just import 3 and 9.after calculation of computer, we will get the result of 12.
    But after learning <<The Principle Of Computer>>,we know that the computer will do the calculation as the following steps:
    1 computer change the 3 into binary formality like 11;
    2 computer change the 9 into binary formality like 1001;
    3 computer plus the two number and get the result 1100;
    4 computer change the result into decimal formality like 12;
    5 computer export the result;

    In the computer system there are other formalities to deal with the number such as hexadecimal. Now I will give several number with a kind of change method, for example, if I give you 1011(2), it means 1011 is a number in the binary system, and 123(10) means 123 if a number in the decimal system. Now I will give you some numbers with any kind of system, you guys should tell me the sum of the number in the decimal system.
     
    Input
    There will be several cases. The first line of each case contains one integers N, and N means there will be N numbers to import, then there will be N numbers at the next N lines, each line contains a number with such form : X1….Xn.(Y), and 0<=Xi<Y, 1<Y<=10. I promise you that the sum will not exceed the 100000000, and there will be at most 100 cases and the 0<N<=1000.
     
    Output
    There is only one line output case for each input case, which is the sum of all the number. The sum must be expressed using the decimal system.
     
    Sample Input
    3
    1(2)
    2(3)
    3(4)
     
    4
    11(10)
    11(2)
    11(3)
    11(4)
     
    Sample Output
    6
    23
     
    代码:
    #include <bits/stdc++.h>
    using namespace std;
    
    
    const int maxn = 1e5 + 10;
    char s[maxn];
    int suumm[maxn];
    
    int summ(char num[111]) {
        char a1[111], a2[111];
        int len = strlen(num), d, temp = 0;
        for(int i = 0; i < len; i ++) {
            if(num[i] == '(')
                temp = i;
        }
    
        for(int j = 0; j < temp; j ++)
            a1[j] = num[j];
        for(int j = temp + 1; j < len - 1; j ++)
            a2[j - temp - 1] = num[j];
    
        d = atoi(a2);
    
        int sum = 0;
        for(int i = 0; i < temp; i ++) {
            sum += (a1[i] - '0') * pow(d, temp - i - 1);
        }
        return sum;
    }
    
    int main() {
        int n;
        while(~scanf("%d", &n)) {
            for(int i = 1; i<= n; i ++) {
                scanf("%s", s);
                suumm[i] = summ(s);
            }
    
            int out = 0;
            for(int i = 1; i <= n; i ++)
                //printf("%d ", suumm[i]);
                out += suumm[i];
    
            printf("%d
    ", out);
        }
    
        return 0;
    }
    

      

  • 相关阅读:
    ACM题目————STL练习之求次数
    ACM题目————STL + 全排列
    ACM题目———— 一种排序(STL之set)
    ACM第二站————STL之stack
    ACM题目————中位数
    ACM题目————Sunscreen
    ACM题目————区间覆盖问题
    ACM题目————困难的串
    ACM题目————A Knight's Journey
    ACM题目————Face The Right Way
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9410855.html
Copyright © 2011-2022 走看看