codeforces 776C
来源:互联网 发布:合肥java工资待遇 编辑:程序博客网 时间:2024/06/05 08:44
codeforces 776C
题目:
C. Molly’s Chemicals
time limit per test2.5 seconds
memory limit per test512 megabytes
inputstandard input
outputstandard output
Molly Hooper has n different kinds of chemicals arranged in a line. Each of the chemicals has an affection value, The i-th of them has affection value ai.
Molly wants Sherlock to fall in love with her. She intends to do this by mixing a contiguous segment of chemicals together to make a love potion with total affection value as a non-negative integer power of k. Total affection value of a continuous segment of chemicals is the sum of affection values of each chemical in that segment.
Help her to do so in finding the total number of such segments.
Input
The first line of input contains two integers, n and k, the number of chemicals and the number, such that the total affection value is a non-negative power of this number k. (1 ≤ n ≤ 105, 1 ≤ |k| ≤ 10).
Next line contains n integers a1, a2, …, an ( - 109 ≤ ai ≤ 109) — affection values of chemicals.
Output
Output a single integer — the number of valid segments.
Examples
input
4 2
2 2 2 2
output
8
input
4 -3
3 -6 -3 12
output
3
Note
Do keep in mind that k0 = 1.
In the first sample, Molly can get following different affection values:
2: segments [1, 1], [2, 2], [3, 3], [4, 4];
4: segments [1, 2], [2, 3], [3, 4];
6: segments [1, 3], [2, 4];
8: segments [1, 4].
Out of these, 2, 4 and 8 are powers of k = 2. Therefore, the answer is 8.
In the second sample, Molly can choose segments [1, 2], [3, 3], [3, 4].
C题,题意给你一个序列,让你找出子序列的和等于k的任意次幂有多少个.
遍历一次求出前缀和,然后减去用k^i次幂,再在map里寻找,找到则ans+=map【x】
注意处理1和-1;
AC代码:
#include <iostream>#include <cstdio>#include <cmath>#include <algorithm>#include <cstring>#include <string>#include <set>#include <queue>#include <stack>#include <map>using namespace std;__int64 a[100005];int main(){ int n;int k; while(scanf("%d %d",&n,&k)!=EOF){ for(int i=0;i<n;i++){ scanf("%I64d",&a[i]); } map<__int64,int> s; s[0]++; __int64 sum=0,ans=0; for(int i=0;i<n;i++){ sum+=a[i]; for(__int64 j=1;abs(j)<=1e17;j*=k){ __int64 x=sum-j; if(s.count(x)) {ans+=s[x];} if(k==1||j==-1) break; } s[sum]++; } printf("%I64d\n",ans); } return 0;}
- codeforces 776C
- codeforces 776C
- Codeforces 776C 想法
- codeforces 776C
- 【codeforces 776C】Molly's Chemicals
- CodeForces contest/776 A+B+C题解
- 【codeforces 776C】Molly's Chemicals 题解
- codeforces 776c Molly's Chemicals 【思维】
- Codeforces 776C-Molly's Chemicals
- CodeForces 776C Molly's Chemicals
- Codeforces 776C Molly's Chemicals 【数论】
- Codeforces-340-C(c++)
- Codeforces-507-C(c++)
- CodeForces 731C C
- CodeForces-612C C
- CODEFORCES 265C CODEFORCES, 265C
- codeforces #78 div2 C
- Codeforces 117C Cycle
- git 更换仓库地址
- js获取上传文件的后缀名和大小
- 常见浏览器兼容性问题与解决方案
- Linux系统下scala安装详解
- wpf 全屏
- codeforces 776C
- 学习web前端这样才能拿到高工资
- Android中进程process间通信的实现方式
- MYSql基础命令(收集中.....)
- TCP KEEPALIVE详解
- Java开发—环境搭建之JDK8安装详解
- Android 异步消息处理机制 让你深入理解 Looper、Handler、Message三者关系
- Math数学方法--常用
- 通过Spring @PostConstruct 和 @PreDestroy 方法 实现初始化和销毁bean之前进行的操作