CodeForces 630A Again Twenty Five!（水题，规律小题）

最新推荐文章于 2021-01-29 13:34:38 发布

原创最新推荐文章于 2021-01-29 13:34:38 发布 · 830 阅读

0 ·

CC 4.0 BY-SA版权

一块水过这的题同时被 2 个专栏收录

144 篇文章

订阅专栏

CodeForces

124 篇文章

订阅专栏

博客介绍了CodeForces的一道题目，要求求出5的n次方的最后两位数字。内容涉及解题思路和通过的代码，主要考察数学和找规律的能力。

The HR manager was disappointed again. The last applicant failed the interview the same way as 24 previous ones. "Do I give such a hard task?" — the HR manager thought. "Just raise number 5 to the power of n and get last two digits of the number. Yes, of course, ncan be rather big, and one cannot find the power using a calculator, but we need people who are able to think, not just follow the instructions."

Could you pass the interview in the machine vision company in IT City?

Input

The only line of the input contains a single integer n (2 ≤ n ≤ 2·1018) — the power in which you need to raise number 5.

Output

Output the last two digits of 5n without spaces between them.

   Examples
 
     input
   
2

     output
   
25

题意：

找出 5^n 次方的后两位。

思路：

找规律吧，慢慢手写也行。

AC code：

#include<stdio.h>
#include<cstring>
#include<algorithm>
#define AC main()
using namespace std;
const int MYDD = 1103;

int AC {
	int n;
	scanf("%d", &n);
	if(n == 1) {
		puts("5");
	} else{
		puts("25");
	}
	return 0;
}