hackerrank
turbozzz
这个作者很懒,什么都没留下…
展开
-
Hacker Rank: Magic Square Diff
From 1 - 9 , sum is 45. each Line and each Row 15 The 8 valid combinations of 3 numbers that add to 15 are: 9 5 1 7 5 3 2 5 8 4 5 6 2 9 4 6 1 8 6 7 2 8 3 4 All 8 of those combinations need to appear ...原创 2020-04-12 23:10:47 · 159 阅读 · 0 评论 -
HackerRank: Extraordinary long factorial
思路: 用vector保存结果的每一位 代码: void extraLongFactorials(int n) { if (n == 1) { cout << 1 << endl; return; } vector<int> digits(1, 1); for (int curr(2); curr...原创 2020-04-12 20:16:54 · 142 阅读 · 0 评论 -
HackerRank: Non-Divisible Subset
考虑事项: remainder[k/2] = 1 remainder[0] 里面只能抽出一个 即 remainder[0] = std::min(remainder[0], 1) and remainder[k/2] = std::min(remainder[k/2], 1) when k%2 == 0. 计算 for (int i = 0; i<=k/2, i++) maxRes ...原创 2020-04-12 16:33:45 · 315 阅读 · 0 评论