数论
天涯with0
这个作者很懒,什么都没留下…
展开
-
快速幂(一)
Given a positive integer N, you should output the most right digit of N^N. Input The input contains several test cases. The first line of the input is a single integer T which is the number of test...原创 2018-07-25 18:47:04 · 137 阅读 · 0 评论 -
扩展欧几里得算法模板
#include<stdio.h> int ex_gcd(int a,int b,int &x,int &y) { if(b==0) { x=1; y=0; return a; } int gcd=ex_gcd(b,a%b,x,y); y=y-(a/b)*x; return gcd; } int cal(int a,int b,int c) {...原创 2018-07-30 17:13:47 · 223 阅读 · 0 评论 -
Divisors POJ - 2992 (求逆元)
Your task in this problem is to determine the number of divisors of Cnk. Just for fun -- or do you need any special reason for such a useful computation? Input The input consists of several instance...原创 2018-07-29 21:20:24 · 169 阅读 · 0 评论 -
费马小定理降幂
Sample Input 2 Sample Output 2 Hint 1. For N = 2, S(1) = S(2) = 1. 2. The input file consists of multiple test cases. #include<stdio.h> #include<string.h> ty...原创 2018-07-29 21:18:15 · 519 阅读 · 0 评论 -
算数基本定理代码
#include<stdio.h> #include<string.h> #include<bits/stdc++.h> const int maxn=1e5+10; int isprime[maxn]; int prime[maxn]; int pos[maxn]; void init() { int cnt=1; int cnt2=0; for(in...原创 2018-07-26 15:15:56 · 337 阅读 · 0 评论 -
素数筛选法(四)
Everybody knows any number can be combined by the prime number. Now, your task is telling me what position of the largest prime factor. The position of prime 2 is 1, prime 3 is 2, and prime 5 is 3, ...原创 2018-07-29 19:54:58 · 100 阅读 · 0 评论 -
素数筛选法(三)
In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture: Every even number greater than 4 can be written as the sum of...原创 2018-07-25 18:54:16 · 152 阅读 · 0 评论 -
素数筛选法(二)
To improve the organization of his farm, Farmer John labels each of his N (1 <= N <= 5,000) cows with a distinct serial number in the range 1..20,000. Unfortunately, he is unaware that the cows ...原创 2018-07-25 18:53:13 · 139 阅读 · 0 评论 -
素数筛选法(一)
For any even number n greater than or equal to 4, there exists at least one pair of prime numbers p1 and p2 such that n = p1 + p2 This conjecture has not been proved nor refused yet. No one is su...原创 2018-07-25 18:50:24 · 208 阅读 · 0 评论 -
数论
Give a number n, find the minimum x(x>0) that satisfies 2^x mod n = 1. Input One positive integer on each line, the value of n. Output If the minimum x exists, print a line with 2^x mod n = 1...原创 2018-07-25 18:48:41 · 203 阅读 · 0 评论 -
Revenge of GCD HDU - 5019 (第k大公约数)
In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), highest common factor (hcf), or greatest common measure (gcm), of two or more integers (when at least...原创 2018-07-30 21:42:25 · 260 阅读 · 0 评论