您的位置:首页 > 大数据 > 人工智能

CodeForces 630A:Again Twenty Five!【水题】

2016-03-09 14:40 681 查看
 Again Twenty Five!
Time Limit:500MS     Memory Limit:65536KB     64bit IO Format:%I64d
& %I64u
Submit Status

Description

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.

Sample Input

Input
2


Output
25



AC代码:

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
long long  n;
while(scanf("%lld",&n)!=EOF)
{
printf("25\n");
}
return  0;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息