Educational Codeforces Round 8 A. Tennis Tournament 暴力
2016-02-21 13:35
330 查看
A. Tennis Tournament
题目连接:
http://www.codeforces.com/contest/628/problem/ADescription
A tennis tournament with n participants is running. The participants are playing by an olympic system, so the winners move on and the losers drop out.The tournament takes place in the following way (below, m is the number of the participants of the current round):
let k be the maximal power of the number 2 such that k ≤ m,
k participants compete in the current round and a half of them passes to the next round, the other m - k participants pass to the next round directly,
when only one participant remains, the tournament finishes.
Each match requires b bottles of water for each participant and one bottle for the judge. Besides p towels are given to each participant for the whole tournament.
Find the number of bottles and towels needed for the tournament.
Note that it's a tennis tournament so in each match two participants compete (one of them will win and the other will lose).
Input
The only line contains three integers n, b, p (1 ≤ n, b, p ≤ 500) — the number of participants and the parameters described in the problem statement.Output
Print two integers x and y — the number of bottles and towels need for the tournament.Sample Input
5 2 3Sample Output
20 15Hint
题意
有两种水,n个人参加比赛每次都会选择出小于等于n的最大2的倍数,然后让这些人比赛,每个参加比赛的人可以获得b瓶A水,裁判也得有一瓶A水
然后每个人都会获得p瓶B水
然后问你打完所有比赛后,需要多少瓶A水,多少瓶B水
题解:
A题就不要想太多,直接暴力吧……虽然O(1)公式也有
代码
#include<bits/stdc++.h> using namespace std; vector<int> two; int main() { long long n,b,p; cin>>n>>b>>p; long long ans = 0,ans2 = n*p; while(n>1) { int t = (n)/2*2; ans+=t*b+t/2; n-=t/2; } cout<<ans<<" "<<ans2<<endl; }
相关文章推荐
- WebService梳理
- Java 序列化Serializable详解
- 单片机系列知识1--单片机的内外结构
- JAVA多线程-Lock的使用(二)-公平锁与非公平锁
- [Node入门] => 读书笔记(三)
- HDOJ 5630-Rikka with Chess
- 【慕课笔记】第二章 认识JAVA中的字符串 第5节 认识JAVA中stringBuilder类
- HighCharts_数据值重叠问题
- Ubuntu安装wine时停止在"正在设定ttf-mscorefonts-installer"解决方法
- Android面试整理(2016)
- 进程上下文
- 分布式缓存系统_Memcached
- 深入理解Linux内核 第二章知识点总结
- hive原生和复合类型的数据载入和使用
- LeetCode-95. Unique Binary Search Trees II
- window.onload和DOMReady
- C#删除WebBrowser控件的Session
- git的安装配置及使用
- C#删除WebBrowser控件的Session
- Machine Learning - Solving the Problem of Overfitting: Regularization