# HDU 3826 Squarefree number （素数）

Description In mathematics, a squarefree number is one which is divisible by no perfect squares, except 1. For example, 10 is square-free but 18 is...

# FZU 1759 Super A^B mod C （欧拉函数，降幂公式）

Description Given A,B,C, You should quickly calculate the result of A^B mod C. (1<=A,C<=1000000000,1<=B<=10^1000000).  Input There ar...

# HDU 4609 3-idiots （FFT）

Description King OMeGa catched three men who had been streaking in the street. Looking as idiots though, the three men insisted that it was a kind ...

# HDU 6069 Counting Divisors （素数）

Description In mathematics, the function d(n) denotes the number of divisors of positive integer n. For example, d(12)=6d(12)=6 because 1,2,3,...

# HDU 6053 TrickGCD （莫比乌斯函数）

Description You are given an array AA , and Zhu wants to know there are how many different array BB satisfy the following conditions? 1≤Bi≤...

# HDU 6050 Funny Function （规律+逆元）

Description Function Fx,yF_{x,y} satisfies: F1,1=F1,2=1F_{1,1}=F_{1,2}=1 F1,i=F1,i−1+2∗F1,i−2 (i>=3)F_{1,i}=F_{1,i-1}+2*F_{1,i-2}\ (i&...

# HDU 5976 Detachment （逆元）

Problem Description In a highly developed alien society, the habitats are almost infinite dimensional space. In the history of this planet,the...

# HDU 5974 A Simple Math Problem （数论+解方程组）

Problem Description Given two positive integers a and b,find suitable X and Y to meet the conditions: X+Y=a Least Common Multiple (X, Y) ...

# HZAU 1202 GCD （矩阵快速幂 + GCD）

Problem Description Xiao Ming found the compute time of gcd(fibn,fibn+1)gcd(fib_n,fib_{n+1}) is the most when he learnt the gcd, and the result of ...

# POJ 2891 Strange Way to Express Integers （扩展欧几里得）

Description Elina is reading a book written by Rujia Liu, which introduces a strange way to express non-negative integers. The way is described as ...

# POJ 2115 C Looooops （扩展欧几里得）

Description A Compiler Mystery: We are given a C-language style for loop of type for (variable = A; variable != B; variable += C) statement; ...

# POJ 1845 Sumdiv （数论，约数和）

DescriptionConsider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo 9901 (the rest of the division o...

# POJ 3292 Semi-prime H-numbers (筛法统计)

Description This problem is based on an exercise of David Hilbert, who pedagogically suggested that one study the theory of 4n+1 numbers. Here, we ...

# POJ 2635 The Embarrassed Cryptographer (同余问题)

Description The young and very promising cryptographer Odd Even has implemented the security module of a large system with thousands of users, whic...

# HDU 1576：A/B （乘法逆元）

A/B Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4603    Accepted Submission(s): 3590 ...

# HDU 5902：GCD is Funny （GCD）

GCD is Funny Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 306    Accepted Submission(s): ...

个人资料
等级：
访问量： 36万+
积分： 1万+
排名： 2019
欢迎关注 <千与梦随> 哦！
博客专栏
 那些年,我们一起追过的算法 文章：6篇 阅读：23920
最新评论