数论基础
creator平
期望破茧成蝶时的飞翔,向往突破蝉蛹后的鸣叫。
展开
-
LightOJ - 1282
Description You are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits of nk. Input Input starts with an integer T (≤ 100...原创 2018-04-18 16:03:39 · 213 阅读 · 0 评论 -
LightOJ - 1259
Goldbach`s Conjecture Goldbach's conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states: Every even integer, greater than 2, can be expressed as t...原创 2018-04-18 17:04:04 · 108 阅读 · 0 评论 -
数论
以下为本人在学习数论过程中看见好的解释而拉来存放: 欧拉函数详解对一个正整数N,欧拉函数是小于N且与N互质的数的个数.。例如φ(24)=8,因为1, 5, 7, 11, 13, 17, 19, 23均和 24 互质。φ(n) = n*(1-1/p1)*(1-1/p2)*......(1-1/pn) 其中(p1.....pn)为N的素因子 欧拉函数的基本性...转载 2018-04-16 20:15:17 · 197 阅读 · 0 评论 -
Codeforces Round #579 (Div. 3)——C. Common Divisors
C. Common Divisorstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an arrayaaconsisting ofnnintegers.Your tas...原创 2019-08-17 09:35:04 · 241 阅读 · 0 评论