{"problem":{"name":"Long Sequence","description":{"content":"We have a sequence of $N$ positive integers: $A=(A_1,\\dots,A_N)$.   Let $B$ be the concatenation of $10^{100}$ copies of $A$. Consider summing up the terms of $B$ from left to right. When does the sum","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc220_c"},"statements":[{"statement_type":"Markdown","content":"We have a sequence of $N$ positive integers: $A=(A_1,\\dots,A_N)$.  \nLet $B$ be the concatenation of $10^{100}$ copies of $A$.\nConsider summing up the terms of $B$ from left to right. When does the sum exceed $X$ for the first time?  \nIn other words, find the minimum integer $k$ such that:\n$\\displaystyle{\\sum_{i=1}^{k} B_i \\gt X}$.\n\n## Constraints\n\n*   $1 \\leq N \\leq 10^5$\n*   $1 \\leq A_i \\leq 10^9$\n*   $1 \\leq X \\leq 10^{18}$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $\\ldots$ $A_N$\n$X$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc220_c","tags":[],"sample_group":[["3\n3 5 2\n26","8\n\nWe have $B=(3,5,2,3,5,2,3,5,2,\\dots)$.  \n$\\displaystyle{\\sum_{i=1}^{8} B_i = 28 \\gt 26}$ holds, but the condition is not satisfied when $k$ is $7$ or less, so the answer is $8$."],["4\n12 34 56 78\n1000","23"]],"created_at":"2026-03-03 11:01:14"}}