1120(toj)

来源:互联网 发布:深圳cnc数控编程培训 编辑:程序博客网 时间:2024/05/16 14:15
1120.   Mileage Bank
Time Limit: 1.0 Seconds   Memory Limit: 65536K
Total Runs: 7427   Accepted Runs: 2390



Mileage program of ACM (Airline of Charming Merlion) is really nice for the travelers flying frequently. Once you complete a flight with ACM, you can earn ACMPerk miles in your ACM Mileage Bank depended on mileage you actual fly. In addition, you can use the ACMPerk mileage in your Mileage Bank to exchange free flight ticket of ACM in future.

The following table helps you calculate how many ACMPerk miles you can earn when you fly on ACM.

When you fly ACM
Class Code
You'll earn
First Class
F
Actual mileage + 100% mileage Bonus
Business Class
B
Actual mileage + 50% mileage Bonus
Economy Class
1-500 miles
500+ miles
Y

500 miles
Actual mileage

It's shown that your ACMPerk mileage consists of two parts. One is your actual flight mileage (the minimum ACMPerk mileage for Economy Class for one flight is 500 miles), the other is the mileage bonus (its accuracy is up to 1 mile) when you fly in Business Class and First Class. For example, you can earn 1329 ACMPerk miles, 1994 ACMPerk miles and 2658 ACMPerk miles for Y, B or F class respectively for the fly from Beijing to Tokyo (the actual mileage between Beijing and Tokyo is 1329 miles). When you fly from Shanghai to Wuhan, you can earn ACMPerk 500 miles for economy class and ACMPerk 650 miles for business class (the actual mileage between Shanghai and Wuhan is 433 miles).

Your task is to help ACM build a program for automatic calculation of ACMPerk mileage.


Input

The input file contains several data cases. Each case has many flight records, each per line. The flight record is in the following format: 

OriginalCity DistanceCity ActualMiles ClassCode

Each case ends with a line of one zero. 

A line of one # presents the end of the input file.


Output

Output the summary of ACMPerk mileages for each test case, one per line.


Sample Input

Beijing Tokyo 1329 FShanghai Wuhan 433 Y0#


Sample Output

3158
第一次ACM作业留的题,因为觉得的挺难,从网上借鉴了很多。
第一次用用strcmp函数比较两个字符串。如果两个字符串相等,则返回值为0,如果过不相等,则返回值为1。
这道题现在看起来还是挺简单的。
#include <iostream>#include <string.h>#include <stdio.h>#undef strcmpusing namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int main(int argc, char** argv) {   char city[20];   char country[20];   char tag[1];   int mile;   int totalInstant=0;      cin>>city;    while (strcmp(city,"#"))   {    while (strcmp(city,"0"))    {    cin>>country>>mile>>tag;
     if (strcmp(tag,"F")==0)        totalInstant += mile*2;         else if (strcmp(tag,"B")==0)     totalInstant +=mile *1.5;          else if (strcmp(tag,"Y")==0)     totalInstant +=mile>500?mile:500;//如果mile > 500,那么总数加上mile就ok。如果小于500 ,则加上500               cin>>city;     //if (strcmp(city,"0")==0) break;         }    cout <<totalInstant<<endl;    totalInstant = 0; cin>>city; //if (strcmp(city,"#")==0) break;      }   //cout <<totalInstant<<endl;      return 0;}
原创粉丝点击