数学
文章平均质量分 76
z245527922
这个作者很懒,什么都没留下…
展开
-
容斥原理
Description Now you get a number N, and a M-integers set, you should find out how many integers which are small than N, that they can divided exactly by any integers in the set. For example, N=12, a转载 2015-06-06 22:59:49 · 233 阅读 · 0 评论 -
Rightmost Digit(快速幂+数学知识OR位运算)
C - Rightmost Digit Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1061Description Given a positive integer N, you should output the most rig原创 2015-07-03 14:56:18 · 347 阅读 · 0 评论 -
扩展欧几里得
poj 1061 青蛙的约会(数论)2009-09-03 17:27:31 分类: http://acm.pku.edu.cn/JudgeOnline/problem?id=1061Memory: 224K Time: 16MS解题思路题意: 略 思路: 根据题意,两个青蛙跳到同一个点上转载 2015-07-11 14:14:54 · 302 阅读 · 0 评论 -
Number of Containers(数学)
Number of ContainersTime Limit: 1 Second Memory Limit: 32768 KBFor two integers m and k, k is said to be a container ofm if k is divisible by m. Given 2 positive integers n and m (m n)转载 2015-07-07 23:42:16 · 680 阅读 · 0 评论