n=int(input())
a=list(map(int,input().split()))
juicy=int(input())
jarr=list(map(int,input().split()))
pre=[]
count=0
for i in a:
count+=1
for j in range(i):
pre.append(count)
for i in jarr:
print(pre[i-1])
#include<iostream>
using namespace std;
int main(){
int a, sum=0, b;
cin>>a;
int f[a];
for(int i=0; i<a; i++){
cin>>b;
sum+=b;
f[i]=sum;
// cout<<f[i]<<endl;
}
// cout<<endl;
int c=0, d, cacing[sum+1];
for(int i=1; i<=sum; i++){
if(i>f[c]){
c++;
}
cacing[i]=c+1;
// cout<<cacing[i]<<endl;
}
cin>>d; int e;
for(int i=0; i<d; i++){
cin>>e;
cout<<cacing[e]<<endl;
}
}
Two Strings | Anagrams |
Prime Number | Lexical Sorting Reloaded |
1514A - Perfectly Imperfect Array | 580A- Kefa and First Steps |
1472B- Fair Division | 996A - Hit the Lottery |
MSNSADM1 Football | MATCHES Playing with Matches |
HRDSEQ Hard Sequence | DRCHEF Doctor Chef |
559. Maximum Depth of N-ary Tree | 821. Shortest Distance to a Character |
1441. Build an Array With Stack Operations | 1356. Sort Integers by The Number of 1 Bits |
922. Sort Array By Parity II | 344. Reverse String |
1047. Remove All Adjacent Duplicates In String | 977. Squares of a Sorted Array |
852. Peak Index in a Mountain Array | 461. Hamming Distance |
1748. Sum of Unique Elements | 897. Increasing Order Search Tree |
905. Sort Array By Parity | 1351. Count Negative Numbers in a Sorted Matrix |
617. Merge Two Binary Trees | 1450. Number of Students Doing Homework at a Given Time |
700. Search in a Binary Search Tree | 590. N-ary Tree Postorder Traversal |