【CF1073D】Berland Fair（模拟）

题意：初始有t元，每次从1开始买，从1到n依次有n个人，每个人的东西价格为a[i]，该人依次能买就买，到n之后再回到1从头开始，问最后能买到的东西数量

n<=2e5，t<=1e18，a[i]<=1e9

思路：显然购买是有周期的，每次周期变化都会少至少一个人，所以至多进行n次周期的变化

#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef vector<int> VI;
#define fi first
#define se second 
#define MP make_pair
#define N  200010
#define M  200
#define MOD 998244353
#define eps 1e-8 
#define pi acos(-1)
#define oo 1000000000

ll a[N];

int main()
{
    //freopen("D.in","r",stdin);
    //freopen("D.out","w",stdout);
    int n;
    ll t;
    scanf("%d%lld",&n,&t);
    ll mn=oo;
    for(int i=1;i<=n;i++) 
    {
        scanf("%lld",&a[i]);
        mn=min(mn,a[i]);
    }

    ll ans=0;
    while(t>=mn)
    {
        ll s=0;
        ll k=0;
        for(int i=1;i<=n;i++) 
         if(t>=a[i])
         {
             t-=a[i];
             s++;
             k+=a[i];
         }
        ans+=s+t/k*s;
        t%=k;
    }
    printf("%lld
",ans);
     return 0;
}