A9591. Worms
编程题
普及/提高-
知识点
题目描述
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole $n$ ordered piles of worms such that $i$ -th pile contains $a_{i}$ worms. He labeled all these worms with consecutive integers: worms in first pile are labeled with numbers $1$ to $a_{1}$ , worms in second pile are labeled with numbers $a_{1}+1$ to $a_{1}+a_{2}$ and so on. See the example for a better understanding.
Mole can't eat all the worms (Marmot brought a lot) and, as we all know, Mole is blind, so Marmot tells him the labels of the best juicy worms. Marmot will only give Mole a worm if Mole says correctly in which pile this worm is contained.
Poor Mole asks for your help. For all juicy worms said by Marmot, tell Mole the correct answers.
Marmot brought Mole $n$ ordered piles of worms such that $i$ -th pile contains $a_{i}$ worms. He labeled all these worms with consecutive integers: worms in first pile are labeled with numbers $1$ to $a_{1}$ , worms in second pile are labeled with numbers $a_{1}+1$ to $a_{1}+a_{2}$ and so on. See the example for a better understanding.
Mole can't eat all the worms (Marmot brought a lot) and, as we all know, Mole is blind, so Marmot tells him the labels of the best juicy worms. Marmot will only give Mole a worm if Mole says correctly in which pile this worm is contained.
Poor Mole asks for your help. For all juicy worms said by Marmot, tell Mole the correct answers.
输入格式
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole $n$ ordered piles of worms such that $i$ -th pile contains $a_{i}$ worms. He labeled all these worms with consecutive integers: worms in first pile are labeled with numbers $1$ to $a_{1}$ , worms in second pile are labeled with numbers $a_{1}+1$ to $a_{1}+a_{2}$ and so on. See the example for a better understanding.
Mole can't eat all the worms (Marmot brought a lot) and, as we all know, Mole is blind, so Marmot tells him the labels of the best juicy worms. Marmot will only give Mole a worm if Mole says correctly in which pile this worm is contained.
Poor Mole asks for your help. For all juicy worms said by Marmot, tell Mole the correct answers.
Marmot brought Mole $n$ ordered piles of worms such that $i$ -th pile contains $a_{i}$ worms. He labeled all these worms with consecutive integers: worms in first pile are labeled with numbers $1$ to $a_{1}$ , worms in second pile are labeled with numbers $a_{1}+1$ to $a_{1}+a_{2}$ and so on. See the example for a better understanding.
Mole can't eat all the worms (Marmot brought a lot) and, as we all know, Mole is blind, so Marmot tells him the labels of the best juicy worms. Marmot will only give Mole a worm if Mole says correctly in which pile this worm is contained.
Poor Mole asks for your help. For all juicy worms said by Marmot, tell Mole the correct answers.
输出格式
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole $n$ ordered piles of worms such that $i$ -th pile contains $a_{i}$ worms. He labeled all these worms with consecutive integers: worms in first pile are labeled with numbers $1$ to $a_{1}$ , worms in second pile are labeled with numbers $a_{1}+1$ to $a_{1}+a_{2}$ and so on. See the example for a better understanding.
Mole can't eat all the worms (Marmot brought a lot) and, as we all know, Mole is blind, so Marmot tells him the labels of the best juicy worms. Marmot will only give Mole a worm if Mole says correctly in which pile this worm is contained.
Poor Mole asks for your help. For all juicy worms said by Marmot, tell Mole the correct answers.
Marmot brought Mole $n$ ordered piles of worms such that $i$ -th pile contains $a_{i}$ worms. He labeled all these worms with consecutive integers: worms in first pile are labeled with numbers $1$ to $a_{1}$ , worms in second pile are labeled with numbers $a_{1}+1$ to $a_{1}+a_{2}$ and so on. See the example for a better understanding.
Mole can't eat all the worms (Marmot brought a lot) and, as we all know, Mole is blind, so Marmot tells him the labels of the best juicy worms. Marmot will only give Mole a worm if Mole says correctly in which pile this worm is contained.
Poor Mole asks for your help. For all juicy worms said by Marmot, tell Mole the correct answers.
输入输出样例
输入 #1
5 2 7 3 4 9 3 1 25 11
输出 #1
1 5 3
说明/提示
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole $n$ ordered piles of worms such that $i$ -th pile contains $a_{i}$ worms. He labeled all these worms with consecutive integers: worms in first pile are labeled with numbers $1$ to $a_{1}$ , worms in second pile are labeled with numbers $a_{1}+1$ to $a_{1}+a_{2}$ and so on. See the example for a better understanding.
Mole can't eat all the worms (Marmot brought a lot) and, as we all know, Mole is blind, so Marmot tells him the labels of the best juicy worms. Marmot will only give Mole a worm if Mole says correctly in which pile this worm is contained.
Poor Mole asks for your help. For all juicy worms said by Marmot, tell Mole the correct answers.
Marmot brought Mole $n$ ordered piles of worms such that $i$ -th pile contains $a_{i}$ worms. He labeled all these worms with consecutive integers: worms in first pile are labeled with numbers $1$ to $a_{1}$ , worms in second pile are labeled with numbers $a_{1}+1$ to $a_{1}+a_{2}$ and so on. See the example for a better understanding.
Mole can't eat all the worms (Marmot brought a lot) and, as we all know, Mole is blind, so Marmot tells him the labels of the best juicy worms. Marmot will only give Mole a worm if Mole says correctly in which pile this worm is contained.
Poor Mole asks for your help. For all juicy worms said by Marmot, tell Mole the correct answers.