HUSTM 1601 - Shepherd
题目描述
Hehe keeps a flock of sheep, numbered from 1 to n and each with a weight wi. To keep the sheep healthy, he prepared some training for his sheep. Everytime he selects a pair of numbers (a,b), and chooses the sheep with number a, a+b, a+2b, … to get trained. For the distance between the sheepfold and the training site is too far, he needs to arrange a truck with appropriate loading capability to transport those sheep. So he wants to know the total weight of the sheep he selected each time, and he finds you to help him.
输入
There’re several test cases. For each case:
The first line contains a positive integer n (1≤n≤10^5)—the number of sheep Hehe keeps.
The second line contains n positive integer wi(1≤n≤10^9), separated by spaces, where the i-th number describes the weight of the i-th sheep.
The third line contains a positive integer q (1≤q≤10^5)—the number of training plans Hehe prepared.
Each following line contains integer parameters a and b (1≤a,b≤n)of the corresponding plan.
输出
For each plan (the same order in the input), print the total weight of sheep selected.
样例输入
5
1 2 3 4 5
3
1 1
2 2
3 3
样例输出
15
6
3
提示
暴力也能过
醉了
#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
int n;
int a[100005];
int s[100005];
int q;
int b,c;
int main()
{
while(scanf("%d",&n)!=EOF)
{
s[0]=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
s[i]=s[i-1]+a[i];
}
scanf("%d",&q);
for(int i=1;i<=q;i++)
{
long long int ans=0;
scanf("%d%d",&b,&c);
if(c==0)
{
ans=a[b];
printf("%lld\n",ans);
continue;
}
else
{
for(int j=b;j<=n;j+=c)
ans+=a[j];
}
printf("%lld\n",ans);
}
}
return 0;
}
最新文章
- oracle的回收站介绍
- 【Android自定义控件】支持多层嵌套RadioButton的RadioGroup
- hadoop初识
- tidyr包--数据处理包
- FileWriter和FileReader简单使用
- linux交叉编译裁剪内核记录
- Android Camera拍照 压缩
- VC++ 视频播放器 图文步骤记录
- Qt Creator 代码自动补全设置
- angularjs控制器之间通信,事件通知服务
- 结对作业--基于GUI的四则运算生成器
- JBDC工具类
- Visual Studio 2013版本安装
- php的 $_REQUEST取值为空
- GAN初步——本质上就是在做优化,对于生成器传给辨别器的生成图片,生成器希望辨别器打上标签 1,体现在loss上!
- bzoj1294 [SCOI2009]围豆豆
- Netty 粘包/拆包应用案例及解决方案分析
- Android开发技术重要参考资料
- 【linux】Linux查看各类日志
- flume jetty 进程关系 flume jetty 跨域问题 jetty 源码分析