CodeForce edu round 53 Div 2. D:Berland Fair

D. Berland Fair

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

XXI Berland Annual Fair is coming really soon! Traditionally fair consists of nn booths, arranged in a circle. The booths are numbered 11through nn clockwise with nn being adjacent to 11. The ii-th booths sells some candies for the price of aiai burles per item. Each booth has an unlimited supply of candies.

Polycarp has decided to spend at most TT burles at the fair. However, he has some plan in mind for his path across the booths:

• at first, he visits booth number 11;
• if he has enough burles to buy exactly one candy from the current booth, then he buys it immediately;
• then he proceeds to the next booth in the clockwise order (regardless of if he bought a candy or not).

Polycarp's money is finite, thus the process will end once he can no longer buy candy at any booth.

Calculate the number of candies Polycarp will buy.

Input

The first line contains two integers nn and TT (1≤n≤2⋅1051≤n≤2⋅105, 1≤T≤10181≤T≤1018) — the number of booths at the fair and the initial amount of burles Polycarp has.

The second line contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109) — the price of the single candy at booth number ii.

Output

Print a single integer — the total number of candies Polycarp will buy.

Examples

input

Copy

3 38
5 2 5

output

Copy

10

input

Copy

5 21
2 4 100 2 6

output

Copy

6

Note

Let's consider the first example. Here are Polycarp's moves until he runs out of money:

1. Booth 11, buys candy for 55, T=33T=33;
2. Booth 22, buys candy for 22, T=31T=31;
3. Booth 33, buys candy for 55, T=26T=26;
4. Booth 11, buys candy for 55, T=21T=21;
5. Booth 22, buys candy for 22, T=19T=19;
6. Booth 33, buys candy for 55, T=14T=14;
7. Booth 11, buys candy for 55, T=9T=9;
8. Booth 22, buys candy for 22, T=7T=7;
9. Booth 33, buys candy for 55, T=2T=2;
10. Booth 11, buys no candy, not enough money;
11. Booth 22, buys candy for 22, T=0T=0.

No candy can be bought later. The total number of candies bought is 1010.

In the second example he has 11 burle left at the end of his path, no candy can be bought with this amount.

之前用线段树做的。超时了很难受。因为没有有效的处理无效的点。之后借鉴了网上的答案。改成链表去做。链表有些不熟悉了。比如删除结点那里都搞错了。

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <stack>
#define ll long long
//#define local

using namespace std;

const int MOD = 1e9+;
const int inf = 0x3f3f3f3f;
const double PI = acos(-1.0);
const int maxn = 2e5+;

ll a[maxn];
ll t;
int n;
int nex[maxn];
int pre[maxn];

int main() {
#ifdef local
    if(freopen("/Users/Andrew/Desktop/data.txt", "r", stdin) == NULL) printf("can't open this file!\n");
#endif

    scanf("%d%lld", &n , &t);
    int num = ;
    for (int i = ; i < n; ++i) {
        ll tmp;
        scanf("%lld", &tmp);
        if (tmp > t) continue;
        a[num++] = tmp;
    }
    n = num-;
    if (n == ) {
        printf("0\n");
        return ;
    }
    for (int i = ; i < n; ++i) {
        nex[i] = i+;
    }
    nex[n] = -;
    for (int i = ; i <= n; ++i)
        pre[i] = i-;
    ll cnt = ;
    while (nex[] != -) {
        ll sum = ;
        int num = ;
        ll rem = t;
        for (int i = nex[]; i != -; i = nex[i]) {
            if (a[i] <= rem) {
                sum += a[i];
                num++;
                rem -= a[i];
            } else {
                nex[pre[i]] = nex[i];
                pre[nex[i]] = pre[i];
            }
        }
        if (sum == ) break;
        cnt += t/sum*num;
        t %= sum;
    }
    printf("%lld\n", cnt);
#ifdef local
    fclose(stdin);
#endif
    return ;
}