D. Berland Fair

https://codeforc.es/contest/1073/problem/D

题意：n个摊位围成一圈；每个的甜食价格a[i]；从1开始如果可以买就一定买，否则跳过；问最多能买多少个；

思路：勇敢暴力；先跑一圈处理出可以买的数量和总价，ans加上T可以这样跑多少遍；直到T小于最小的a[i]；

#include<algorithm>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=998244353;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x%mod;
        x=x*x%mod;
        n>>=1;
    }
    return ans;
}

ll a[maxn];
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int n;
    ll T=0;
    ll Min=INF;
    cin>>n>>T;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        Min=min(Min,a[i]);
    }
    ll ans=0;
    while(T>=Min)
    {
        ll tmp=T;
        ll cnt=0;
        ll sum=0;
        for(int i=0;i<n;i++)
        {
            if(tmp>=a[i])
            {
                tmp-=a[i];
                sum+=a[i];
                cnt++;
            }
        }
        ll k=T/sum;
        ans=ans+cnt*k;
        T=T%sum;
    }
    cout<<ans<<endl;
	return 0;
}