Codeforces 466A Cheap Travel【水题】暴力
来源:互联网 发布:古代皇帝的能力知乎 编辑:程序博客网 时间:2024/06/06 01:58
Ann has recently started commuting by subway. We know that a one ride subway ticket costsa rubles. Besides, Ann found out that she can buy a special ticket form rides (she can buy it several times). It costsb rubles. Ann did the math; she will need to use subwayn times. Help Ann, tell her what is the minimum sum of money she will have to spend to maken rides?
The single line contains four space-separated integers n, m, a, b (1 ≤ n, m, a, b ≤ 1000) — the number of rides Ann has planned, the number of rides covered by them ride ticket, the price of a one ride ticket and the price of anm ride ticket.
Print a single integer — the minimum sum in rubles that Ann will need to spend.
6 2 1 2
6
5 2 2 3
8
In the first sample one of the optimal solutions is: each time buy a one ride ticket. There are other optimal solutions. For example, buy threem ride tickets.
题目大意:
主人公一共需要坐n次列车,其中有两种票,单票是a元一个,能坐一次列车,m票是b元一个,能坐m次列车。
问怎样购买能够坐n次列车并且花费最小?求这个最小花费。
思路:
观察到n并不大,我们可以通过暴力枚举单票和m票购买的个数来枚举出这个最小花费。
枚举过程中对可行解的最小花费进行统计即可。
Ac代码:
#include<stdio.h>#include<iostream>#include<string.h>using namespace std;int main(){ int n,m,a,b; while(~scanf("%d%d%d%d",&n,&m,&a,&b)) { int output=0x3f3f3f3f; for(int i=0;i<=1000;i++) { for(int j=0;j<=1000;j++) { if(i+j*m>=n) { output=min(output,a*i+b*j); } } } printf("%d\n",output); }}
- Codeforces 466A Cheap Travel【水题】暴力
- Codeforces 466A Cheap Travel(水题)
- Codeforces 466 A. Cheap Travel
- CodeForces 466A Cheap Travel
- CodeForces 466A Cheap Travel
- 【CODEFORCES】 A. Cheap Travel
- 466A. Cheap Travel
- codeforces——466A——Cheap Travel
- Codeforces Cheap Travel
- A. Cheap Travel
- Codeforces Round #266 (Div. 2) A. Cheap Travel
- Codeforces Round #266 (Div. 2) A. Cheap Travel
- Cheap Travel(暴力求解法)
- CodeForces 55A. Flea travel
- CodeForces 75A Flea travel
- cf466A Cheap Travel
- CodeForces 13A【暴力】
- Codeforces 485 A. Factory 暴力
- 移植完linux-3.4.2内核,启动系统后使用命令ifconfig -a查看网络配置,没有eth0
- C++中string与char*相互转换
- 【九度OJ】题目1107:搬水果 解题报告
- URAL2068:Game of Nuts(博弈)
- spring4配置文件详解
- Codeforces 466A Cheap Travel【水题】暴力
- LA 5713
- 网页引入特殊字体的几种方案
- STL源码剖析之序列容器deque
- Bootstrap简单认识之Collapse组件
- css清除浮动/闭合浮动
- svn- is already a working copy for a different URL.
- 数据包接收系列 — IP协议处理流程(一)
- 一个女程序员twitter上发了一条tweet