加载中...

Patrick
• 博客等级：
• 博客积分：0
• 博客访问：22,509
• 关注人气：3
• 获赠金笔：0支
• 赠出金笔：0支
• 荣誉徽章：

(2011-05-21 21:04)

it

b^(n-1)mod n = 1

(2011-05-06 19:06)

杂谈

 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 23080 Accepted: 7190

Description

Input

(2011-05-04 16:13)

杂谈

Perfection
 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7890 Accepted: 3788

Description

From the article Number Theory in the 1994 Microsoft Encarta: ``If a, b, c are integers such that a = bc, a is called a multiple of b or of c, and b or c is called a divisor or factor of a. If c is not 1/-1, b is called a proper divisor of a. Even integers, which include 0, are multiples of 2, for example, -4, 0, 2, 10; an odd integer is an integer that is not even, for example, -5, 1, 3, 9. A perfect number is a positive integer that is equa

(2011-04-27 20:36)

教育

Moo Volume
 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13475 Accepted: 3906

Description

Farmer John has received a noi

(2011-04-26 21:46)

教育

Number Sequence
 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 23398 Accepted: 6243

Description

A single positive integer

(2011-04-26 16:42)

教育

Code
 Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 4683 Accepted: 2149

Description

Transmitting and memorizing inf

(2011-04-25 16:42)

教育

Round Numbers
 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 4233 Accepted: 1395

Description

The cows, as you k

(2011-04-13 10:36)

学通信的海纸你们

(2011-02-08 10:27)

Big Event in HDU

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7128    Accepted Submission(s): 2370

Problem Description

(2011-02-01 10:20)

I NEED A OFFER!

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5184    Accepted Submission(s): 1782

Problem Description