数论
文章平均质量分 77
linmory
头疼....太难了
展开
-
hdu-1742Ellipse(自适应辛普森)
EllipseTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2418 Accepted Submission(s): 1076Problem DescriptionMath is important!! Ma原创 2017-12-11 20:33:04 · 213 阅读 · 0 评论 -
原根
1135 原根 基准时间限制:1 秒 空间限制:131072 KB 分值: 0 难度:基础题 收藏 关注设m是正整数,a是整数,若a模m的阶等于φ(m),则称a为模m的一个原根。(其中φ(m)表示m的欧拉函数)给出1个质数P,找出P最小的原根。Input输入1个质数P(3 <= P <= 10^9)Output输出P最小的原根。Input示例3Output示例2原根的求法:求原根目前的...原创 2018-07-14 18:29:45 · 676 阅读 · 0 评论 -
中国剩余定理
1079 中国剩余定理 基准时间限制:1 秒 空间限制:131072 KB 分值: 0 难度:基础题 收藏 关注一个正整数K,给出K Mod 一些质数的结果,求符合条件的最小的K。例如,K % 2 = 1, K % 3 = 2, K % 5 = 3。符合条件的最小的K = 23。Input第1行:1个数N表示后面输入的质数及模的数量。(2 <= N <= 10...原创 2018-07-13 18:29:41 · 129 阅读 · 0 评论 -
N的阶乘的长度
1130 N的阶乘的长度 V2(斯特林近似) 基准时间限制:1 秒 空间限制:131072 KB 分值: 0 难度:基础题 收藏 关注输入N求N的阶乘的10进制表示的长度。例如6! = 720,长度为3。Input第1行:一个数T,表示后面用作输入测试的数的数量。(1 <= T <= 1000)第2 - T + 1行:每行1个数N。(1 <= N <= 10^9)Outp...原创 2018-07-13 18:21:22 · 321 阅读 · 0 评论 -
数字1的数量
1009 数字1的数量 基准时间限制:1 秒 空间限制:131072 KB 分值: 5 难度:1级算法题 收藏 关注给定一个十进制正整数N,写下从1开始,到N的所有正数,计算出其中出现所有1的个数。例如:n = 12,包含了5个1。1,10,12共包含3个1,11包含2个1,总共5个1。Input输入N(1 <= N <= 10^9)Output...原创 2018-07-19 10:20:54 · 320 阅读 · 0 评论 -
POJ - 2115 C Looooops
A Compiler Mystery: We are given a C-language style for loop of type for (variable = A; variable != B; variable += C) statement;I.e., a loop which starts by setting variable to value A and while vari...原创 2018-05-24 16:54:58 · 138 阅读 · 0 评论 -
SGU - 106 The equation(扩展欧几里德)
There is an equation ax + by + c = 0. Given a,b,c,x1,x2,y1,y2 you must determine, how many integer roots of this equation are satisfy to the following conditions : x1<=x<=x2, y1<=y<=y2. ...原创 2018-05-24 15:43:35 · 222 阅读 · 0 评论 -
LightOJ - 1282 Leading and Trailing
F - 初代 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.InputInput starts with an integer T (≤ 1000), denoting the原创 2017-03-20 17:04:57 · 289 阅读 · 0 评论 -
LightOJ - 1197 Help Hanzo筛素数
Amakusa, the evil spiritual leader has captured the beautiful princess Nakururu. The reason behind this is he had a little problem with Hanzo Hattori, the best ninja and the love of Nakururu. After he...原创 2018-05-16 09:56:57 · 137 阅读 · 0 评论 -
51nod 1283最小周长
1283 最小周长 题目来源: Codility基准时间限制:1 秒 空间限制:131072 KB 分值: 5 难度:1级算法题 收藏 关注一个矩形的面积为S,已知该矩形的边长都是整数,求所有满足条件的矩形中,周长的最小值。例如:S = 24,那么有{1 24} {2 12} {3 8} {4 6}这4种矩形,其中{4 6}的周长最小,为20。Input输入1个数S(...原创 2018-07-20 18:19:38 · 143 阅读 · 0 评论 -
51nod 1305Pairwise Sum and Divide
1305 Pairwise Sum and Divide 题目来源: HackerRank基准时间限制:1 秒 空间限制:131072 KB 分值: 5 难度:1级算法题 收藏 关注有这样一段程序,fun会对整数数组A进行求值,其中Floor表示向下取整: fun(A) sum = 0 for i = 1 to A.length f...原创 2018-07-20 18:29:34 · 108 阅读 · 0 评论 -
CSU - 1803 数论GCD
给出正整数 n 和 m,统计满足以下条件的正整数对 (a,b) 的数量:1. 1≤a≤n,1≤b≤m;2. a×b 是 2016 的倍数。Input输入包含不超过 30 组数据。每组数据包含两个整数 n,m (1≤n,m≤10 9).Output对于每组数据,输出一个整数表示满足条件的数量。Sample Input32 632016 20161000000000 100000...原创 2017-07-16 17:42:05 · 165 阅读 · 0 评论 -
CodeForces - 876B Divisiblity of Differences
Divisiblity of DifferencesYou are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is ...原创 2017-11-12 15:09:30 · 192 阅读 · 0 评论 -
codeforces-894C Marco and GCD Sequence
C. Marco and GCD Sequencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn a dream Marco met an elderly man with a pair of black glasses....原创 2017-12-03 10:08:49 · 241 阅读 · 0 评论 -
CodeForces - 858A k-rounding
k-roundingFor a given positive integer n denote its k-rounding as the minimum positive integer x, such that x ends with k or more zeros in base 10 and is divisible by n.For example, 4-rounding of 3...原创 2017-12-03 10:46:09 · 405 阅读 · 0 评论 -
Wall Painting HDU - 4810(组合数异或和)
Ms.Fang loves painting very much. She paints GFW(Great Funny Wall) every day. Every day before painting, she produces a wonderful color of pigments by mixing water and some bags of pigments. On the K-...原创 2018-10-17 10:26:13 · 172 阅读 · 0 评论 -
Cacti Lottery--------ACM-ICPC 2018 徐州赛区网络预赛
Morgana is playing a game called cacti lottery. In this game, morgana has a 3 \times 33×3 grid graph, and the graph is filled with 11 ~ 99 , each number appears only once. The game is interesting, he ...原创 2018-09-17 19:17:28 · 177 阅读 · 0 评论 -
A---Hard to prepare ACM-ICPC 2018 徐州赛区网络预赛
After Incident, a feast is usually held in Hakurei Shrine. This time Reimu asked Kokoro to deliver a Nogaku show during the feast. To enjoy the show, every audience has to wear a Nogaku mask, and seat...原创 2018-09-16 10:47:25 · 124 阅读 · 0 评论 -
51nod1381硬币游戏
1381 硬币游戏 基准时间限制:1 秒 空间限制:131072 KB 分值: 5 难度:1级算法题 收藏 关注有一个简单但是很有趣的游戏。在这个游戏中有一个硬币还有一张桌子,这张桌子上有很多平行线(如下图所示)。两条相邻平行线之间的距离是1,硬币的半径是R,然后我们来抛硬币到桌子上,抛下之后硬币有时候会和一些直线相交(相切的情况也算是相交),有时候不会。请你来计算一下抛一次硬...原创 2018-07-21 11:37:57 · 159 阅读 · 0 评论 -
LightOJ - 1213 Fantasy of a Summation
If you think codes, eat codes then sometimes you may get stressed. In your dreams you may see huge codes, as I have seen once. Here is the code I saw in my dream.#include <stdio.h>int cases, cas...原创 2018-05-15 20:18:48 · 137 阅读 · 0 评论 -
POJ - 2116 Death to Binary?
The group of Absurd Calculation Maniacs has discovered a great new way how to count. Instead of using the ordinary decadic numbers, they use Fibonacci base numbers. Numbers in this base are expressed ...原创 2018-05-15 17:41:36 · 236 阅读 · 0 评论 -
LightOJ - 1336 Sigma Function (因子和)
Sigma function is an interesting function in Number Theory. It is denoted by the Greek letter Sigma (σ). This function actually denotes the sum of all divisors of a number. For example σ(24) = 1+2+3+4...原创 2018-05-11 09:41:58 · 271 阅读 · 0 评论 -
LightOJ - 1341 Aladdin and the Flying Carpet (筛素数+找素因子+算数基本原理)
It's said that Aladdin had to solve seven mysteries before getting the Magical Lamp which summons a powerful Genie. Here we are concerned about the first mystery.Aladdin was about to enter to a magica...原创 2018-05-10 20:13:57 · 154 阅读 · 0 评论 -
ZOJ - 3336(Friend Number II)
Given a positive integer x, let S(x) denotes the sum of all x's digits. Two integers x and y are friend numbers if S(x)=S(y). Here comes the problem: Given a positive integer x, of course it has a lot原创 2018-05-02 21:03:06 · 167 阅读 · 0 评论 -
Clock(数学题)
ClockTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1195 Accepted Submission(s): 417Problem DescriptionGiven a time HH:MM:SS and原创 2018-04-30 11:23:31 · 172 阅读 · 0 评论 -
Can you find it?
Problem DescriptionGive you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, which satisfy the formula Ai+Bj+C原创 2018-04-06 08:38:48 · 185 阅读 · 0 评论 -
51nod 1284 2 3 5 7的倍数(容斥原理)
1284 2 3 5 7的倍数 基准时间限制:1 秒 空间限制:131072 KB 分值: 5 难度:1级算法题 收藏 关注给出一个数N,求1至N中,有多少个数不是2 3 5 7的倍数。 例如N = 10,只有1不是2 3 5 7的倍数。Input输入1个数N(1 Output输出不是2 3 5 7的倍数的数共有多少。Input示例10Output示例原创 2018-04-17 21:16:18 · 175 阅读 · 0 评论 -
C - C HihoCoder - 1701(逆元)
给定N个整数A1, A2, ... AN,小Hi希望从中选出M个整数,使得任意两个选出的整数的差都是K的倍数。 请你计算有多少种不同的选法。由于选法可能非常多,你只需要输出对1000000009取模的结果。Input第一行包含三个整数N、M和K。 第二行包含N个整数A1, A2, ... AN。 对于30%的数据,2 ≤ M ≤ N ≤ 10 对于100%的数据,2 ≤ M ...原创 2018-03-31 19:19:11 · 254 阅读 · 0 评论 -
对称与反对称
链接:https://www.nowcoder.com/acm/contest/94/H来源:牛客网对称与反对称时间限制:C/C++ 2秒,其他语言4秒空间限制:C/C++ 262144K,其他语言524288K64bit IO Format: %lld题目描述 给出一个N*N的方阵A。构造方阵B,C:使得A = B + C.其中 B为对称矩阵,C为反对称矩阵。对于方阵S中的任意元素,若(S)ij...原创 2018-04-07 21:39:49 · 3112 阅读 · 0 评论 -
Steps POJ - 2590
StepsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8219 Accepted: 3747DescriptionOne steps through integer points of the straight line. The length of a step must be nonnegative and can b...原创 2018-05-11 10:31:06 · 114 阅读 · 0 评论 -
POJ 1061 青蛙的约会(扩展欧几里德算法)
青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 124981 Accepted: 26763Description两只青蛙在网上相识了,它们聊得很开心,于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上,于是它们约定各自朝西跳,直到碰面为止。可是它们出发之前忘记了一件很重要的事情,既没有问原创 2018-04-26 20:33:37 · 124 阅读 · 0 评论 -
LightOJ - 1220 Mysterious Bacteria
Dr. Mob has just discovered a Deathly Bacteria. He named it RC-01. RC-01 has a very strange reproduction system. RC-01 lives exactly x days. Now RC-01 produces exactly p new deadly Bacteria where x = ...原创 2018-05-15 16:10:37 · 157 阅读 · 0 评论 -
51Nod - 1188 最大公约数之和 V2
给出一个数N,输出小于等于N的所有数,两两之间的最大公约数之和。相当于计算这段程序(程序中的gcd(i,j)表示i与j的最大公约数):G=0;for(i=1;i<N;i++)for(j=i+1;j<=N;j++){ G+=gcd(i,j);}Input第1行:1个数T,表示后面用作输入测试的数的数量。(1 <= T <= 50000)第2 - T + 1行:每行一个数...原创 2018-05-15 15:22:55 · 156 阅读 · 0 评论 -
LightOJ - 1138 Trailing Zeroes (III)
You task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As you know N! = 1*2*...*N. For example, 5! = 120, 120 contains one zero on the tra...原创 2018-05-21 20:50:46 · 195 阅读 · 0 评论 -
632-掷骰子
632-掷骰子内存限制:64MB 时间限制:3000ms Special Judge: Noaccepted:9 submit:54题目描述:小明有m个骰子,小红有n个骰子。每一个骰子都是标准六面骰子。他们分别掷出自己的骰子,如果小明的点数和大,则小明胜;否则小红胜。求小明胜利的概率。输入描述:有T组数据。每组数据一行,m和n,用空格隔开。1 输出描述:原创 2018-05-07 20:57:31 · 253 阅读 · 0 评论 -
The Lucky Week(规律)
The Lucky WeekEdward, the headmaster of the Marjar University, is very busy every day and always forgets the date.There was one day Edward suddenly found that if Monday was the 1st, 11th or 21st原创 2018-04-28 17:10:21 · 366 阅读 · 0 评论 -
LightOJ - 1236 Pairs Forming LCM
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) == n )...原创 2018-05-12 20:51:26 · 114 阅读 · 0 评论 -
LightOJ - 1245 Harmonic Number (II)
I was trying to solve problem '1234 - Harmonic Number', I wrote the following codelong long H( int n ) { long long res = 0; for( int i = 1; i <= n; i++ ) res = res + n / i; return r...原创 2018-05-12 09:18:24 · 125 阅读 · 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 the sum of two primes [1].Now...原创 2018-05-11 16:34:48 · 152 阅读 · 0 评论 -
HDU - 5976 Detachment(逆元+贪心+前缀和)
In a highly developed alien society, the habitats are almost infinite dimensional space.In the history of this planet,there is an old puzzle.You have a line segment with x units’ length representi...原创 2019-05-26 18:30:27 · 264 阅读 · 0 评论