Common Knowledge_快速幂

2024-05-13 06:19:23

问题 I: Common Knowledge

时间限制: 1 Sec 内存限制: 64 MB
提交: 9 解决: 8
[提交][状态][讨论版]

题目描述

Alice and Bob play some game in which they score points. Each of the two has an n-digit scoreboard which depicts numbers in base 10 (with leading zeroes). The digits 0 to 9 are displayed on a seven-segment display in the following fashion:

For some odd reason, the two players cannot see the scoreboards entirely. Alice can only see the lower half of her own scoreboard and the upper half of Bob’s scoreboard. Bob can only see the upper half of his scoreboard and the upper half of Alice’s scoreboard. Here, ‘half’ is meant to
include the horizontal segments in the digits’ centers: they can be seen by both players at all times. For example, if one sees the upper half of an eight, one can conclude that the digit is not a zero.

A pair of n-digit scores is called fully known if both players know both scores (i.e. all 2n digits) by looking at the displays with their restricted vision. The players cannot communicate.

输入

The input consists of:
• one line with an integer n (1 ≤ n ≤ 20), where n is the number of digits.

输出

Output the number of score pairs that can be displayed on two n-digit scoreboards and are fully known by both players.

样例输入

样例输出

1073741824

#include <iostream>
#include <cstdio>
#include <algorithm>using namespace std;int main()
{int x=8;long long int mi;int n;while(scanf("%d",&n)!=EOF){mi=x;if(n==0){printf("1\n");continue;}for(int i=1;i<n;){if(i<n/2){mi*=mi;i*=2;}else{mi*=x;i+=1;}}printf("%lld\n",mi);mi=0;}return 0;
}

转载于:https://www.cnblogs.com/TWS-YIFEI/p/5940256.html

Common Knowledge_快速幂相关推荐

数学--数论--HDU 4675 GCD of Sequence(莫比乌斯反演+卢卡斯定理求组合数+乘法逆元+快速幂取模）
先放知识点: 莫比乌斯反演卢卡斯定理求组合数乘法逆元快速幂取模 GCD of Sequence Alice is playing a game with Bob. Alice shows N i ...
`Computer-Algorithm` 数论基础知识 (同余,取模,快速幂,质数,互质,约数,质因子)
catalog 同余取模快速幂质数互质约数质因子 @Delimiter(旧解释) 经验谈两数之差也整除加一的特殊性取模累加的周期性取模的唯一集合取模下的四则运算除法的不可约性 ...
c语言的幂乘积表达式,POJ 1845 Sumdiv [素数分解快速幂取模二分求和等比数列]
大致题意: 求A^B的所有约数(即因子)之和,并对其取模 9901再输出. 解题基础: 1) 整数的唯一分解定理: 任意正整数都有且只有一种方式写出其素因子的乘积表达式. ,其中为素数 2) 约数和 ...
矩阵快速幂+构造方法
与快速幂一样,可以将递推式通过二进制的方式来进行优化,这个学了快速幂就是十分容易理解大概的板子如下: struct mat///自己定义大小的矩阵 {ll m[11][11]; }; mat mul ...
【做题】SRM701 Div1 Hard - FibonacciStringSum——数学和式＆矩阵快速幂
原文链接 https://www.cnblogs.com/cly-none/p/SRM701Div1C.html 题意:定义"Fibonacci string"为没有连续1的01串 ...
快速幂 + 矩阵快速幂
快速幂 1 #include<iostream> 2 #include<algorithm> 3 #include<cstring> 4 #define LL lo ...
BZOJ1965 [Ahoi2005]SHUFFLE 洗牌快速幂
欢迎访问~原文出处--博客园-zhouzhendong 去博客园看该题解题目传送门 - BZOJ1965 题意概括对于扑克牌的一次洗牌是这样定义的,将一叠N(N为偶数)张扑克牌平均分成上下两叠,取 ...
牛客网练习赛44-B（快速幂+模拟）
题目链接:https://ac.nowcoder.com/acm/contest/548/B 题意:计算m/n小数点后k1位到k2位,1≤m≤n≤109,1<=k1<=k2<=109 ...
【ACM】杭电OJ 4704 Sum （隔板原理+组合数求和公式+费马小定理+快速幂）
http://acm.hdu.edu.cn/showproblem.php?pid=4704 1.隔板原理 1~N有N个元素,每个元素代表一个1.分成K个数,即在(N-1)个空挡里放置(K-1)块隔板 ...

最新文章

热门文章