codeforces 456A
来源:互联网 发布:数控铣床手工编程 编辑:程序博客网 时间:2024/05/19 17:24
需要找到性价比最高的电脑(它的价格比某台电脑低,但质量更好),因此我首先写了双重循环(小函数调用),结果
显示Time limit exceeded on test 6def lalala(price,quality,start_index,n): for i in range(start_index,n): if price[start_index] < price[i] and quality[start_index] > quality[i]: return True return Falsen = int(raw_input())price = []quality=[]for i in range(n): line = map(int,raw_input().split()) price.append(line[0]) quality.append(line[1])result = Falsefor i in range(n): result = lalala(price,quality,i,n) if result == True: breakif result == True: print "Happy Alex"else: print "Poor Alex"
因此,只能想别的思路。先去写,通过了再上传
阅读全文
0 0
- Codeforces 456 A. Laptops
- CodeForces 456A Laptops
- codeforces 456A
- Codeforces 456A Laptops(水题)
- CodeForces-a
- Codeforces 903A A
- ACM篇:Codeforces 456A-- Laptops
- CodeForces 18A A - Triangle
- CodeForces 133A A. HQ9+
- codeforces 651A A. Joysticks
- 【Codeforces 597A】A. Divisibility
- 【 Codeforces 615A】A. Bulbs
- A. Divisibility CodeForces 597A
- codeforces 417A A. Elimination
- CodeForces 534A A. Exam
- codeforces#98 a
- codeforces#99 a
- codeforces 105 div2 A
- (M)Dynamic Programming:343. Integer Break
- String.split 与StringUtils.split StringUtils.splitPreserveAllTokens 比较
- ucos-iii学习之资源管理
- 欢迎使用CSDN-markdown编辑器
- 决策树
- codeforces 456A
- Oracle package包头和package body包体例子
- view的绘制流程
- 22222222222
- 33333
- 444444
- myEclipse2017添加tomcat服务器
- HTML与JSP页面的区别
- java中HashMap详解