zoukankan      html  css  js  c++  java
  • Codeforces--630A--Again Twenty Five! (水题)

    

    Again Twenty Five!

    Time Limit: 500MS   Memory Limit: 65536KB   64bit IO Format: %I64d & %I64u

    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, n can 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

    Sample Output

    Hint

    Source


    输出5的n次方的后两位,n>=2,所以嘛,只可能是25

    #include<iostream>
    #include<cmath>
    using namespace std;
    int main()
    {
    	__int64 n;
    	while(cin>>n)
    	cout<<25<<endl;
    	return 0;
    }

  • 相关阅读:
    echarts各个配置项详细说明总结
    享元模式
    观察者模式
    策略模式
    桥接模式
    适配器模式
    建造者模式
    原型模式
    单例模式
    Java8新特性——集合底层源码实现的改变
  • 原文地址:https://www.cnblogs.com/playboy307/p/5273419.html
Copyright © 2011-2022 走看看