Best Coder ^beta
VIP | STD Contests
DIY | Web-DIY ^beta

这个题目没名字

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

Problem Description

给定n和m,求 ( 1^1 + 2^2 + ...... + n^n ) mod m 的值。

Input

输入数据第一行是一个正整数T，表示有T组测试数据。
接下来的T行，每行给出两个整数，分别表示n和m
(1<=n<=1000000000,1<=m<=10000)。

Output

输出T行，分别为对应的结果。

Sample Input

2
2 5
100000 10000

Sample Output

0
2500

Source

杭电ACM程序设计竞赛（2014’05）(暨暑期集训队选拔赛)

Statistic | Submit | Discuss | Note

Home | Top

Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2025 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2025-03-29 00:49:27, Gzip enabled

Administration