blue_hpu的博客

Pseudoprime numbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8656 Accepted: 3634DescriptionFermat's theorem states that for any prime number p a

Problem Descriptionlcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,so lcy makes the problem easier than begin.

The Euler functionTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5724    Accepted Submission(s): 2414Problem DescriptionThe Euler f

DescriptionYou are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits ofnk.InputInput starts with an integer T (≤

A为一个方阵，则Tr A表示A的迹（就是主对角线上各项的和），现要求Tr(A^k)%9973。 Input数据的第一行是一个T，表示有T组数据。每组数据的第一行有n(2  Output对应每组数据，输出Tr(A^k)%9973。 Sample Input22 21 00 13 999999991 2 34 5 67 8

SegmentTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1815    Accepted Submission(s): 669Problem Description    Silen August does