ZD_source code for problem 2971

题目链接:http://acm.zju.edu.cn/show_problem.php?pid=2971

解题心得:

1,用scanf("%d",&i)接受整型后,再用gets接受带空格的字符串之前要调用getchar将/n滤掉

2,用关键字是字符串的map时要用string类型

#include <stdio.h>
#include <map>
#include <vector>
#include <string>
using namespace std;

map<string,int> times;
map<string,int> str2int;
vector<string> number;

string str[] = {"zero","one","two","three","four","five","six","seven","eight","nine",
    "ten","eleven","twelve","thirteen","fourteen","fifteen","sixteen","seventeen",
    "eighteen","nineteen","twenty","thirty","forty","fifty","sixty","seventy",
    "eighty","ninety"};
void Input()
{
 number.clear();
 string temp;
 char input[128];
 gets(input);

 int i;
 for(i = 0;input[i] != '/0';i++)
 {
  if(input[i] != ' ')
  {
   temp += input[i];
  }
  else
  {
   number.push_back(temp);
   temp = "";
  }
 }
 number.push_back(temp);
}

void Init()
{
 int i;
 for(i = 0;i <= 20;i++)
  str2int[str[i]] = i;
 
 int j;
 for(i = 21,j = 30;i < 28;i++,j += 10)
  str2int[str[i]] = j;

 times[string("and")] = 1;
 times[string("hundred")] = 100;
 times[string("thousand")] = 1000;
 times[string("million")] = 1000000;
}

void Work()
{
 int size = number.size();
 int i,temp,result;
 for(i = 0,temp = 0,result = 0;i < size;i++)
 {
  if(times.find(number[i]) != times.end())
  {
   temp *= times[number[i]];
   if(number[i] == "million" || number[i] == "thousand")
   {
    result += temp;
    temp = 0;
   }
  }
  else
  {
   temp += str2int[number[i]];
  }
 }
 result += temp;
 printf("%d/n",result);
}

int main(int argc, char* argv[])
{
 Init();
 int count;
 scanf("%d",&count);
 getchar();
 while(count >= 1)
 {
  Input();
  Work();
  count--;
 }
 return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值