Again Twenty Five!

最新推荐文章于 2021-01-26 23:02:36 发布

Sequin_Yf

最新推荐文章于 2021-01-26 23:02:36 发布

阅读量659

点赞数

分类专栏： Algorithm 文章标签：快速幂

本文链接：https://blog.csdn.net/Sequin_YF/article/details/78335134

版权

Algorithm 专栏收录该内容

39 篇文章 0 订阅

订阅专栏

题目：https://vjudge.net/problem/CodeForces-630A

快速幂
ab mod c=(a mod c)(b mod c)mod c

/********************************************************************
* File Name: 2a.cpp
* Author: Sequin
* mail: Catherine199787@outlook.com
* Created Time: 日  8/27 18:08:02 2017
*************************************************************************/


#include <iostream>  
#include <stdio.h>  
#include <string.h>  
#include <stack>  
#include <queue>  
#include <map>
#include <ctype.h>
#include <set>  
#include <vector>   
#include <cmath>
#include <bitset>  
#include <algorithm>  
#include <climits>  
#include <string>
#include <list>
#include <cctype>
#include <cstdlib>
#include <fstream>
#include <sstream>
using namespace std;  

#define lson 2*i  
#define rson 2*i+1  
#define LS l,mid,lson  
#define RS mid+1,r,rson  
#define UP(i,x,y) for(i=x;i<=y;i++)  
#define DOWN(i,x,y) for(i=x;i>=y;i--)  
#define MEM(a,x) memset(a,x,sizeof(a))  
#define W(a) while(a)  
#define gcd(a,b) __gcd(a,b)
#define pi acos(-1.0)
#define pii pair<int,int>
#define ll long long  
#define MAX 10000005  
#define MOD 1000000007  
#define INF 0x3f3f3f3f  
#define EXP 1e-8  
#define lowbit(x) (x&-x)  
ll qpow(ll p,ll q){ll f=1; p %= 100;
    while(q){
        if(q&1)
            f=f*p%100;
        p=p*p%100;q>>=1;}return f;}

int main() {
    int n;
    cin >> n;
    ll ret = qpow(5, n);
    cout << ret << endl;
}