90% code
// 区别在于,在于我没脑子
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <cmath>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
// #pragma GCC optimize(2)
// #pragma GCC optimize(3)
#define IOS std::ios::sync_with_stdio(false)
#define inf 0x3f3f3f3f
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define int long long
#define x first
#define y second
#define cmp [&](PII a, PII b){return a.y < b.y;}
const int N = 5e5+10, mod = 1e9+7, M = 5e7+5, K = 2e5+10, Z = 1e5+7, X = 3e5+3;
using namespace std;
typedef long long LL;
typedef priority_queue<int> PQI;
typedef priority_queue <int, vector<int>, greater<>> PQGI;
typedef pair<int, int> PII;
int sum, cnt;
int candy[K];
void solve()
{
int n, t; cin >> n >> t;
for(int i = 1; i <= n; i ++)
{
cin >> candy[i];
sum = sum + candy[i];
}
// sort(candy + 1, candy + 1 + n);
int cnt1 = t / sum, rem = t % sum, f = 200;
cnt = cnt + cnt1 * n;
while(f --)
for(int i = 1; i <= n; i ++)
if(rem >= candy[i]) cnt ++, rem -= candy[i];
cout << cnt << endl;
return;
}
signed main()
{
IOS; int T = 1;
cin.tie(nullptr);
cout.tie(nullptr);
// cin >> T;
while( T -- ) solve();
return 0;
}
AC code
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <cmath>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
// #pragma GCC optimize(2)
// #pragma GCC optimize(3)
#define IOS std::ios::sync_with_stdio(false)
#define inf 0x3f3f3f3f
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define int long long
#define x first
#define y second
#define cmp [&](PII a, PII b){return a.y < b.y;}
const int N = 5e5+10, mod = 1e9+7, M = 5e7+5, K = 2e5+10, Z = 1e5+7, X = 3e5+3;
using namespace std;
typedef long long LL;
typedef priority_queue<int> PQI;
typedef priority_queue <int, vector<int>, greater<>> PQGI;
typedef pair<int, int> PII;
int sum, cnt;
int candy[K];
void solve()
{
int n, t; cin >> n >> t;
for(int i = 1; i <= n; i ++)
{
cin >> candy[i];
sum = sum + candy[i];
}
int cnt1 = t / sum, rem = t % sum;
cnt = cnt + cnt1 * n;
while(true)
{
int a = 0, sum_ = 0;
for(int i = 1; i <= n; i ++)
{
if(sum_ + candy[i] <= rem)
a ++, sum_ += candy[i];
}
if(sum_ == 0) break;
cnt = cnt + rem / sum_ * a;
rem = rem % sum_;
}
cout << cnt << endl;
return;
}
signed main()
{
IOS; int T = 1;
cin.tie(nullptr);
cout.tie(nullptr);
// cin >> T;
while( T -- ) solve();
return 0;
}