唯一分解定理
文章平均质量分 77
陶鸿杰
这个作者很懒,什么都没留下…
展开
-
Pairs Forming LCM LightOJ - 1236————(算术基本定理+容斥)
Find the result of the following code: long long pairsFormLCM( int n ) { long long res = 0; for( int i = 1; i <= n; i++ ) for( int j = i; j <= n; j++ ) if( lcm(i, j...原创 2018-07-29 09:42:15 · 334 阅读 · 0 评论 -
Sum of Consecutive Integers LightOJ - 1278————(算术基本定理+容斥)
Given an integer NNN, you have to find the number of ways you can express NNN as sum of consecutive integers. You have to use at least two integers. For example, N=15N=15N = 15 \;has three solutions,...原创 2018-07-29 09:47:56 · 255 阅读 · 0 评论 -
Ekka Dokka LightOJ 1116简单数学
Ekka and his friend Dokka decided to buy a cake. They both love cakes and that’s why they want to share the cake after buying it. As the name suggested that Ekka is very fond of odd numbers and Dokka ...原创 2018-07-26 22:33:34 · 278 阅读 · 0 评论 -
算术基本定理及其应用
算术基本定理,又称为正整数的唯一分解定理,即:每个大于1的自然数均可写为质数的积,而且这些素因子按大小排列之后,写法仅有一种方式。例如: 6936=23×3×172,1200=24×3×526936=23×3×172,1200=24×3×52{\displaystyle 6936=2^{3}\times 3\times 17^{2}} , {\displaystyle 1200=2^{4}\tim...原创 2018-07-26 22:55:29 · 2542 阅读 · 1 评论 -
Smith Numbers
While skimming his phone directory in 1982, Albert Wilansky, a mathematician of Lehigh University,noticed that the telephone number of his brother-in-law H. Smith had the following peculiar property: ...原创 2018-07-26 23:01:49 · 331 阅读 · 0 评论 -
How many integers can you find————(算术基本定理+容斥)
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, and M-integer s...原创 2018-07-26 23:29:43 · 411 阅读 · 0 评论 -
牛客练习赛25 A 因数个数和——————数学
时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 262144K,其他语言524288K 64bit IO Format: %lld 题目描述 q次询问,每次给一个x,问1到x的因数个数的和。 输入描述: 第一行一个正整数q ; 接下来q行,每行一个正整数 x 输出描述: 共q行,每行一个正整数表示答案 输入 4 1 2 3 10 输出 1 3 ...原创 2018-08-25 17:12:40 · 338 阅读 · 0 评论