lt

  • 关注
  • 短消息
  • 送银子
文章
333
评论
1469
推荐
225
收藏
3
社区会龄
6 年
个人网站
--
个人简介
还没有输入个人简介……
  • lt 2推荐

    欧拉计划614题:特别分解2

    An integer partition of a number n is a way of writing n as a sum of positive integers. Partitions that differ only by the order of their …...

  • lt 推荐

    欧拉计划613题:勾股三角形蚂蚁

    Pythagorean Ant Problem 613 Dave is doing his homework on the balkony and, prepairing a presentation about Pythogorean triangles, has ju…...

  • lt 2推荐

    puzzleup 2017.13

    DIFFERENCE If all numbers with distinct digits from 0 to 9876543210 are listed in ascending order, what is the maximum difference between …...

  • lt 2推荐

    欧拉计划612题:朋友数

    若两个数的10进制表示有同样的数字,则它们是朋友数 。 如1123和3981是朋友数. 设 f(n) 是数字对(p,q)的个数,其中1<=p< q< n且p和q是朋友数 。 f(100)=1539 。 求f(10 18 ) mod 1000267129 . ...

  • lt 1推荐

    std::accumulate的用法

    用于c数组 #include <iostream> // std::cout include <numeric>// std::accumulate int main () { int numbers[] = {10,20,30}; std::cou…...

评论了