Codeforces Round #354 (Div. 2) E (数学题)
来源:互联网 发布:cool edit for mac版 编辑:程序博客网 时间:2024/05/23 13:30
100 years have passed since the last victory of the man versus computer in Go. Technologies made a huge step forward and robots conquered the Earth! It's time for the final fight between human and robot that will decide the faith of the planet.
The following game was chosen for the fights: initially there is a polynomial
Polynomial P(x) is said to be divisible by polynomial Q(x) if there exists a representation P(x) = B(x)Q(x), where B(x) is also some polynomial.
Some moves have been made already and now you wonder, is it true that human can guarantee the victory if he plays optimally?
The first line of the input contains two integers n and k (1 ≤ n ≤ 100 000, |k| ≤ 10 000) — the size of the polynomial and the integer k.
The i-th of the following n + 1 lines contain character '?' if the coefficient near xi - 1 is yet undefined or the integer value ai, if the coefficient is already known ( - 10 000 ≤ ai ≤ 10 000). Each of integers ai (and even an) may be equal to 0.
Please note, that it's not guaranteed that you are given the position of the game where it's computer's turn to move.
Print "Yes" (without quotes) if the human has winning strategy, or "No" (without quotes) otherwise.
1 2-1?
Yes
2 100-1000001
Yes
4 5?1?1?
No
In the first sample, computer set a0 to - 1 on the first move, so if human can set coefficient a1 to 0.5 and win.
In the second sample, all coefficients are already set and the resulting polynomial is divisible by x - 100, so the human has won.
题解:
输入一个P(x),没有系数,求可不可能P(x) = B(x)Q(x),其中Q(x)=x-k,由机器人先开始,计算人类会不会赢,并且局面可能是玩了几局之后的局面。
(x-k)|P(x)等价于P(k)==0,分两种情况考虑,if(k=0),谁先使得a[0]=0就谁赢。如果k!=0的话,注意到每一步都可以任意改变P(k)的值,因此只有最后一步是有用的,如果所有数都已经确定,那么检查P(k)是否为0,否则胜负取决于最后一步操作的先手。
AC代码:
#include<bits/stdc++.h>using namespace std;int poly[100010],idx=0;int well(int n,int k){long long ans=0;for(int i=n;i>=0;i--){ans=ans*(long long)k+(long long)poly[i];if(ans>10000000000||ans<-10000000000) return 0;}if(ans==0) return 1;return 0;}int main(){int n,k,unknown=0;char tmp[10];int position;scanf("%d%d",&n,&k);for(int i=0;i<=n;i++){scanf("%s",&tmp);if(tmp[0]=='?'){unknown++;position=i;if(i==0) idx=1;}poly[i]=atoi(tmp);}if(k==0){if(idx){if((n+1-unknown)%2==0) printf("No");else printf("Yes");}else{if(poly[0]==0) printf("Yes");else printf("No");}} else if(unknown>=1) {if(n%2==0) printf("No");else printf("Yes");}else{if(k==1){long long sum=0;for(int i=0;i<=n;i++){sum+=(long long)poly[i];}if(sum==0) printf("Yes");else printf("No");}else if(k==0){if(poly[0]==0) printf("Yes");else printf("No");}else if(k==-1){long long sum=0;for(int i=0;i<=n;i++){if(i%2==0) sum+=(long long)poly[i];else sum-=(long long)poly[i];}if(sum==0) printf("Yes");else printf("No");}else {if(well(n,k)) printf("Yes");else printf("No");}}return 0;}
- Codeforces Round #354 (Div. 2) E (数学题)
- Codeforces Round #353 (Div. 2) C. Money Transfers(数学题)
- Codeforces Round #360 (Div. 2) D 数学题
- Codeforces 405E Codeforces Round #238 (Div. 2)E
- Codeforces Round #265 (Div. 2) 465A. inc ARG(数学题)
- Codeforces Round #426 (Div. 2)The Meaningless Game【数学题】【水题】
- Codeforces Round #262 (Div. 2)E(贪心+暴搜)
- Codeforces Round #257 (Div. 2)E(数论+构造)
- Codeforces Round #256 (Div. 2)E(DFS暴搜)
- Codeforces Round #FF (Div. 2)E(线段树成段更新)
- Codeforces Round #265 (Div. 2)E(数位dp)
- Codeforces Round #254 (Div. 2)E(线段树懒标记)
- Codeforces Round #281 (Div. 2)E(数学)
- Codeforces Round #249 (Div. 2)E(构造)
- Codeforces Round #291 (Div. 2)E(DP+矩阵)
- Codeforces Round #117 (Div. 2)E---Wooden Fence(dp)
- E. Vanya and Brackets(Codeforces Round #308 (Div. 2))
- Codeforces Round #320 (Div. 2)(A~E)
- CSS3 animation
- SpringMVC配置<mvc:resources mapping="/resources/**" location="/WEB-INF/resources/" />访问页面404错误
- Mysql查询使用Limit优化
- JSP中的相对路径和绝对路径
- 六爻:占卜记录(By eof)
- Codeforces Round #354 (Div. 2) E (数学题)
- 词法分析器
- JDBC常用组件
- 利用反射获取类或者方法或者字段上的注解的值
- android方面文章收藏
- Android View.onMeasure方法的理解
- poj2828题解buy tickets
- git的版本管理使用(一)-初识git
- ora-1031: message 1031 not found