[2011山东ACM省赛] Mathman Bank(模拟题)
版权声明:本文为博主原创文章,未经博主同意不得转载。
https://blog.csdn.net/sr19930829/article/details/24187925
Mathman Bank
nid=24#time" rel="nofollow" style="color:rgb(83,113,197);text-decoration:none;">
Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^
题目描写叙述
computers. Therefore, they want to use computers to manage their banks. However, mathmen's programming skills are not as good as their math-
ematical skills. So they need your help to write a bank management system software.
The
system must support the following operations:
1.
Open account: given the customer's name and password, and an initial deposit,
open an bank account for the customer.
2.
Deposit: given the amount of money and the name of the customer, deposit
money in the customer's account.
3.
Withdraw: given the amount of money, the customer's name and password,
withdraw money from the customer's account.
4.
Transfer: given the amount of money, sender's name, sender's password and
receiver's name, transfer money from the sender's account to the
receiver's
account.
5.
Check: given the customer's name and password, print the balance of the
customer's account.
6.
Change password: given the customer's name and old password, and the
new password, replace the customer's old password with the new one.
Initially,
no account exists in the bank management system .
输入
the number of commands. Each of the following n lines contains one of the following commands, in the
following format:
1.
O "customer" "password" "initial deposit" - open an account for "customer",
set the password to "password" and deposit "inital deposit" money
in the account. "customer" and "password" are strings, and "initial
deposit" is an integer.
2.
D "customer" "amount" - deposit "amount" money in "customer"'sac-
count. "customer" is a string, and "amount" is an integer.
3.
W"customer" "password" "amount" - withdraw "amount" money from "customer"'s
account. "customer" and "password" are strings, and amount
4.
T "sender" "password" "receiver" "amount" - transfer "amount" money from
"sender"'s acount to "receiver"'s account. "sender", "pasword" and
"receiver" are strings, and "amount" is an integer.
5.
C "customer" "password" - check "customer"'s balance. "customer" and
"password" are strings.
6.
X "customer" "old password" "new password" - replace "customer"'s old
password with "new password". "customer", "old password" and "new
password" are strings.
All
of the strings appearing in the input consist of only alphebetical letters and
digits, and has length at most 10. All the integers in the input are nonnegative,
and at most 1000000.
Refer
to the sample input for more details.
输出
1.
Open account: If "customer" already has an account, output "Account
exists." (without quotation marks); otherwise, output "Successfully
opened an account." (without quotation marks).
2.
Deposite: If "customer" doesn't have an account ,output "Account does not
exist."; otherwise, output "Successfully deposited money."(without quotation
marks).
3.
Withdraw: If "customer" doesn't have an account, output "Account does
not exist."; otherwise, if "customer"'s password doesn't match "password",
output "Wrong password."; otherwise, if there are less money
than "amount" in "customer"'s account, output "Money not enough.";
otherwise, output "Successfully withdrew money." quotation marks).
4.
Transfer: If "sender"'s account or "receiver"'s account doesn't exist,
output "Account does not exist."; otherwise, if "sender"'s password
doesn't match "password", output "Wrong password."; otherwise,
if there is less money than 'amount" in "sender"'s account, output
"Money not enough."; otherwise, output "Successfully transfered money."
5.
Check: If "customer"'s account doesn't exist, output "Account does not
exist."; otherwise, if "customer"'s password doesn't match "password",
output "Wrong password."; otherwise, output the balance of "customer"'s
account.
6.
Change password: If "customer" doesn't have an account, output "Account
does not exist."; otherwise, if "customer"'s password doesn't match
"old password", output "Wrong password."; otherwise, output 'Successfully
changed password.".
演示样例输入
25
W Alice alice 10
O Alice alice 10
C Alice alice
D Bob 10000
O Bob bob 100
D Alice 50
C Alice alice
X Bob bob BOB
C Bob bob
O Bob bob 10
T Bob bob Alice 100000
W Alice alice 10
T Bob BOB Alice 100000
T Bob BOB Alice 100
C Alice alice
C Bob BOB
T Alice alice BOB 10
T ALICE alice Bob 10
X Jack jack JACE
X Alice ALICE alice
W Alice Alice 10
W Alice alice 200
T Alice alice Bob 80
C Alice alice
C Bob BOB
演示样例输出
Account does not exist.
Successfully opened an account.
10
Account does not exist.
Successfully opened an account.
Successfully deposited money.
60
Successfully changed password.
Wrong password.
Account exists.
Wrong password.
Successfully withdrew money.
Money not enough.
Successfully transfered money.
150
0
Account does not exist.
Account does not exist.
Account does not exist.
Wrong password.
Wrong password.
Money not enough.
Successfully transfered money.
70
80
提示
来源
解题思路:
模拟银行开设账户,存款,取款。转账等业务,题目没难度,依照题意模拟,写代码时要细致。
watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvc3JfMTk5MzA4Mjk=/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" />
代码:
#include <iostream>
#include <string.h>
using namespace std;
struct Node//为每一个账户开设一个结构体
{
string Name;//姓名
string Code;//密码
int Money;//存款金额
}node[1002];
int find(Node x[],int m,string name)//两个功能,推断name是否已经开了账户,假设已经开了返回在数组中的位置
{
for(int i=0;i<m;i++)
{
if(x[i].Name==name)
{
return i;
}
}
return -1;
}
int main()
{
int n;char cm;
int m=0;
cin>>n;
while(n--)
{
cin>>cm;
if(cm=='O')//开设账户
{
string name,code;
int money;
cin>>name>>code>>money;
if(find(node,m,name)==-1||m==0)//该姓名没有开账户
{
node[m].Name=name;
node[m].Code=code;
node[m].Money=money;
m++;
cout<<"Successfully opened an account."<<endl;
}
else
cout<<"Account exists."<<endl;
}
if(cm=='D')
{
string name;int money;
cin>>name>>money;
if(find(node,m,name)==-1)
cout<<"Account does not exist."<<endl;
else
{
node[find(node,m,name)].Money+=money;
cout<<"Successfully deposited money."<<endl;
}
}
if(cm=='W')
{
string name,code;int money;
cin>>name>>code>>money;
if(find(node,m,name)==-1)
{
cout<<"Account does not exist."<<endl;
}
else
{
if(node[find(node,m,name)].Code!=code)
{
cout<<"Wrong password."<<endl;
}
else if(node[find(node,m,name)].Money<money)
{
cout<<"Money not enough."<<endl;
}
else
{
node[find(node,m,name)].Money-=money;
cout<<"Successfully withdrew money."<<endl;
}
}
}
if(cm=='T')
{
string name1,code,name2;
int money;
cin>>name1>>code>>name2>>money;
if(find(node,m,name1)==-1||find(node,m,name2)==-1)
cout<<"Account does not exist."<<endl;
else if(node[find(node,m,name1)].Code!=code)
cout<<"Wrong password."<<endl;
else if(node[find(node,m,name1)].Money<money)
cout<<"Money not enough."<<endl;
else
{
node[find(node,m,name1)].Money-=money;
node[find(node,m,name2)].Money+=money;
cout<<"Successfully transfered money."<<endl;
}
}
if(cm=='C')
{
string name,code;
cin>>name>>code;
if(find(node,m,name)==-1)
{
cout<<"Account does not exist."<<endl;
}
else if(node[find(node,m,name)].Code!=code)
{
cout<<"Wrong password."<<endl;
}
else
{
cout<<node[find(node,m,name)].Money<<endl;
}
}
if(cm=='X')
{
string name,code1,code2;
cin>>name>>code1>>code2;
int len=find(node,m,name);
if(len==-1)
{
cout<<"Account does not exist."<<endl;
}
else if(node[len].Code!=code1)
{
cout<<"Wrong password."<<endl;
}
else
{
node[len].Code=code2;
cout<<"Successfully changed password."<<endl;
}
}
}
return 0;
}
[2011山东ACM省赛] Mathman Bank(模拟题)的更多相关文章
- [2011山东ACM省赛] Identifiers(模拟)
Identifiers Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^ 题目描写叙述 Identifier is an important ...
- [2011山东ACM省赛] Sequence (动态规划)
Sequence Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^ 题目描述 Given an integer number sequence ...
- [2011山东ACM省赛] Binomial Coeffcients(求组合数)
Binomial Coeffcients nid=24#time" style="padding-bottom:0px; margin:0px; padding-left:0px; ...
- [2012山东ACM省赛] Pick apples (贪心,完全背包,枚举)
Pick apples Time Limit: 1000MS Memory limit: 165536K 题目描述 Once ago, there is a mystery yard which on ...
- [2012山东ACM省赛] Pick apples (贪心,全然背包,枚举)
Pick apples Time Limit: 1000MS Memory limit: 165536K 题目描写叙述 Once ago, there is a mystery yard which ...
- 山东ACM省赛历届入口
山东省第一届ACM大学生程序设计竞赛 山东省第二届ACM大学生程序设计竞赛 山东省第三届ACM大学生程序设计竞赛 山东省第四届ACM大学生程序设计竞赛 山东省第五届ACM大学生程序设计竞赛 山东省第六 ...
- [2013山东ACM]省赛 The number of steps (可能DP,数学期望)
The number of steps nid=24#time" style="padding-bottom:0px; margin:0px; padding-left:0px; ...
- hdu 4023 2011上海赛区网络赛C 贪心+模拟
以为是贪心,结果不是,2333 贪心最后对自己绝对有利的情况 点我 #include<cstdio> #include<iostream> #include<algori ...
- 第八届山东ACM省赛F题-quadratic equation
这个题困扰了我长达1年多,终于在今天下午用两个小时理清楚啦 要注意的有以下几点: 1.a=b=c=0时 因为x有无穷种答案,所以不对 2.注意精度问题 3.b^2-4ac<0时也算对 Probl ...
随机推荐
- 树莓派安装.net core 2.1
0.更新源 sudo apt-get update 1.安装依赖 sudo apt-get install curl libunwind8 gettext 2.下载 SDK 或者 RunTime ht ...
- MVC架构中,用户的请求简单梳理
MVC架构中,用户的请求分为下面3个步骤: 终端用户发送请求,路由器将请求路由到合适的Controller,Controller是逻辑实体和行为action的集合. Controller将请求映射到特 ...
- 简单测试--C#实现中文汉字转拼音首字母
第一种: 这个是自己写的比较简单的实现方法,要做汉字转拼音首字母,首先应该有一个存储首字母的数组,然后将要转拼音码的汉字与每个首字母开头的第一个汉字即“最小”的汉字作比较,这里的最小指的是按拼音规则比 ...
- 关于SDN
传统网络: 一:它们是纯分布式控制 二:控制面和转发面在同一个设备中,紧密耦合 三:管理员无法直接操控转发行为 四:网络协议对转发行为的影响是有固定模式的 而SDN的特性: 一:控制面与转发面分离 二 ...
- jQuery获取子元素的个数
一.获取div下的子元素的个数 $("div").children().length; 二.获取div下的span子元素的个数 $("div").childre ...
- python-责任链模式
源码地址:https://github.com/weilanhanf/PythonDesignPatterns 说明: 当你作为一名coder已经快三十却还还没有女朋友,家中父母已经着急万分,此时要求 ...
- js-ES6学习笔记-对象的扩展
1.ES6允许直接写入变量和函数,作为对象的属性和方法.这种写法用于函数的返回值,将会非常方便.CommonJS模块输出变量,就非常合适使用简洁写法. var ms = {}; function ge ...
- js-权威指南学习笔记20
第二十章 客户端存储 1.客户端存储有一下几种形式:Web存储.cookie.IE userData.离线Web应用.Web数据库.文件系统API. 2.Web存储标准所描述的API包含localSt ...
- 分布式Session一致性解决方案有哪些?
1.使用cookie代替session(不安全,不推荐使用) 2.使用数据库存储session(效率低,不推荐使用) 3.使用nginx反向代理ip绑定方法,同一个ip只能在同一台服务器上进行访问(不 ...
- svn本地连接服务器失败,但是浏览器可以
tortoise svn无法连接到服务器,清空“Autherticate data”后,再进行更新,提交,log查看等操作,svn还是不提示输入用户名和密码,而是报: error: Unable to ...