2017 Multi-University Training Contest 3 hdu 6063

HDU 6063

思路：

AC代码：

#include "iostream"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#pragma comment(linker, "/STACK:102400000,102400000")
#define ll long long
#define endl ("\n")
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a,x) memset(a,x,sizeof(a))
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define ft (frist)
#define sd (second)
#define lrt (rt<<1)
#define rrt (rt<<1|1)
using namespace std;
const long long INF = 1e18+1LL;
const int inf = 1e9+1e8;
const int N=1e6+100;
const ll mod=1e9+7;ll pow(ll a, ll b){ll ans=1;a%=mod;while(b>0){if(b&1){ans*=a;ans%=mod;}a*=a;a%=mod;b>>=1;}return ans;
}int main(){ll n,m;int T=0;while(cin>>n>>m){cout<<"Case #"<<++T<<": "<<(pow(n,m)+mod)%mod<<endl;}return 0;
}

转载于:https://www.cnblogs.com/max88888888/p/7420818.html

2017 Multi-University Training Contest 3 hdu 6063相关推荐

2016 Multi-University Training Contest 10 [HDU 5861] Road （线段树：区间覆盖+单点最大小）...
HDU 5861 题意在n个村庄之间存在n-1段路,令某段路开放一天需要交纳wi的费用,但是每段路只能开放一次,一旦关闭将不再开放.现在给你接下来m天内的计划,在第i天,需要对村庄ai到村庄bi的道 ...
2018 Multi-University Training Contest 6-oval-and-rectangle(hdu 6362)-题解
一.题意求椭圆内接矩形周长的期望. 二.推导过程已知$c$,容易得出矩形弦长$d=4a\sqrt{1-\frac{c^2}{b^2}}$ 接下来,矩形周长$p=4c+d=4c+4a\sqrt{1- ...
HDU 6091 - Rikka with Match | 2017 Multi-University Training Contest 5
思路来自某FXXL 不过复杂度咋算的.. /* HDU 6091 - Rikka with Match [ 树形DP ] | 2017 Multi-University Training Conte ...
HDU 6051 - If the starlight never fade | 2017 Multi-University Training Contest 2
/* HDU 6051 - If the starlight never fade [ 原根,欧拉函数 ] | 2017 Multi-University Training Contest 2 题意: ...
HDU 6058 - Kanade's sum | 2017 Multi-University Training Contest 3
/* HDU 6058 - Kanade's sum [ 思维,链表 ] | 2017 Multi-University Training Contest 3 题意:给出排列 a[N],求所有区间的第 ...
2017 Multi-University Training Contest - Team 3 Kanade's sum hd6058
地址:http://acm.split.hdu.edu.cn/showproblem.php?pid=6058 题目: Kanade's sum Time Limit: 4000/2000 MS (J ...
hdu 4925 Apple Tree--2014 Multi-University Training Contest 6
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4925 Apple Tree Time Limit: 2000/1000 MS (Java/Others ...
2017 Multi-University Training Contest - Team 1
2017 Multi-University Training Contest - Team 1 01 签到的 #include<bits/stdc++.h> using names ...
2017 Multi-University Training Contest - Team 7：1003. Color the chessboard（...）
其他题目题解: 2017 Multi-University Training Contest - Team 7:1005. Euler theorem 2017 Multi-University Tr ...

2017 Multi-University Training Contest 3 hdu 6063

2017 Multi-University Training Contest 3 hdu 6063相关推荐

最新文章

热门文章