Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2) 【ABC】
2017-05-16 16:37
495 查看
老年人题解,语言python3
题解:对于每个数判断一下就好了嘛
题解:初中几何题,假设第i次砍的位置是x,则
,那么答案就出来了嘛
题解:贪心。A,B只可能用前n/2个字符,排序之后。如果A的字符小于B的字符,那么显然都会抢占最前面的位置;否则的话,就都会抢占最后的位置,让对方尽量放在前面。
A - Bank Robbery
题意:给你ABC,以及n个数,问你在(B,C)之间的数有多少个。题解:对于每个数判断一下就好了嘛
x,y,z = map(int,input().split()) n = int(input()) print(len(list(filter(lambda x:y<int(x) and z>int(x),input().split()))))
B. Cutting Carrot
题意:给你一个高为h,底为1的等腰三角形,你需要平行的砍n-1刀,然后使得每一块的面积都相同,问你每次砍的位置在哪儿。题解:初中几何题,假设第i次砍的位置是x,则
,那么答案就出来了嘛
n,h = map(int,input().split()) for x in range(1,n): print("%.10f"%(h*(x/n)**0.5),end=' ')
C. Naming Company
题意:每个人都有一个字符集,A想让最后的字符串的大小最小,B想让字符串的大小最大,都很机智,问你最后的答案是什么模样的。题解:贪心。A,B只可能用前n/2个字符,排序之后。如果A的字符小于B的字符,那么显然都会抢占最前面的位置;否则的话,就都会抢占最后的位置,让对方尽量放在前面。
a = list(input()) b = list(input()) a.sort() b.sort(reverse=True) ans = list() for i in a: ans.append("a") len1 = len(a)//2 - 1 len2 = len(a)//2 - 1 if len(a)%2: len1 = len1 + 1 i = 0 # first j = 0 # end flag = 0 ai = 0 aj = 0 bi = 0 bj = 0 while i + j < len(a): if i + j < len(a): if a[ai] < b[bi] and flag == 0: ans[i] = a[ai] i = i + 1 ai = ai + 1 else: ans[len(a)-j-1] = a[len1 - aj] j = j + 1 aj = aj + 1 flag = 1 if i + j < len(a): if a[ai] < b[bi] and flag == 0: ans[i] = b[bi] i = i + 1 bi = bi + 1 else: ans[len(a)-j-1] = b[len2 - bj] j = j + 1 bj = bj + 1 flag = 1 print("".join(ans))
相关文章推荐
- 【贪心】【multiset】Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2) C. Naming Company
- Codeforces Round #405 (rated, Div. 2, based on VK Cup 2017 Round 1) 菜鸡只会ABC!
- [占坑]Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2) 解题报告
- Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2) 题解
- Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2)
- 【构造】Tinkoff Challenge - Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2) D. Labelling Cities
- Codeforces Round #325 (Div. 2)ABC
- Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1) C. Bear and Company(DP)
- 8VC Venture Cup 2016 - Final Round (Div2) E
- CROC-MBTU 2012, Final Round (Online version, Div. 2)
- Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3) C. Success Rate
- Codeforces Round #412 (rated, Div. 2, base on VK Cup 2017 Round 3) C. Success Rate(数学,二分)
- Educational Codeforces Round 33 (Rated for Div. 2) A - Chess For Three
- Educational Codeforces Round 34 (Rated for Div. 2) D. Almost Difference(高精度)
- Educational Codeforces Round 34 (Rated for Div. 2) E. Swapping Characters(暴力)
- Educational Codeforces Round 35 (Rated for Div. 2) - (A,B,C,D)
- 【构造】Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals) B. High Load
- Educational Codeforces Round 36 (Rated for Div. 2) A-C
- Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)C. Jury Marks
- 【推导】Codeforces Round #424 (Div. 1, rated, based on VK Cup Finals) A. Office Keys