Manasa and Stones
2015-05-12 17:22
323 查看
from __future__ import print_function def main(): t = int(raw_input()) for _ in range(t): n = int(raw_input()) a = int(raw_input()) b = int(raw_input()) possible_value = [] for _ in range(n): temp_value = (_ * a + (n - 1 - _) * b) # 抽象化理解题目的意思 if temp_value not in possible_value: possible_value.append(temp_value) possible_value.sort() # 使用list结构的方便性 for _ in possible_value: print(_, end = ' ') # 使用Dash帮助自己理解这个函数 print() main()
Link:
https://www.hackerrank.com/challenges/manasa-and-stones
学习:
Dash的辅助使用
怎样修改相应的参数
调用合适的函数
合理数据结构的选用
做题时候选用合适的数据结构
相关文章推荐
- Hackerran Manasa and Stones
- 【HackerRank】Manasa and Stones
- [hackerrank]Manasa and Stones
- 771. Jewels and Stones
- 771. Jewels and Stones
- Manasa and Combinatorics
- 【Hihocoder1636】Pangu and Stones(区间DP)
- Hash Table389. Find the Difference+771. Jewels and Stones+554. Brick Wall
- LeetCode之771:Jewels and Stones
- 771. Jewels and Stones
- Light OJ 1343 - Aladdin and the Black Stones
- Boxes and Stones - UVa 12525 dp
- 【CodeChef】 Chef and Stones
- UVa 12525 Boxes and Stones (dp 博弈)
- 771. Jewels and Stones
- hidocoder 1636 : Pangu and Stones 区间DP
- LC-Jewels and Stones
- 771. Jewels and Stones
- CF101E Candies and Stones题解
- Pangu and Stones(区间dp)