AtCoder Beginner Contest 128 https://atcoder.jp/contests/abc128 A - Apple Pie #include <bits/stdc++.h> using namespace std; int main () { int a,
AtCoder ABC 128F Frog Jump 题目链接:https://atcoder.jp/contests/abc128/tasks/abc128_f 题目大意 给定长度为 N 的序列s0,s1,…,sN−1s0,s1,…,sN−1,现在要选取两个正整数 A 和 B,从s0s0起跳,按照先往前跳 A 步,再往后跳 B 步的规则正好跳到sN−1sN−1,每跳到一个地方,其所对应的...
Source Code: https://atcoder.jp/contests/abc128/submissions/5640467 D: equeue You can perform operation C and D at very last. Then these two operations are both equivalent to "discarding a jewel." Let's assume that you will perform AA times of Operation A and BB times of Operation B....
题目链接:https://abc092.contest.atcoder.jp/tasks/arc093_a There are N sightseeing spots on the x-axis, numbered 1,2,…,N. Spot i is at the point with coordinate Ai...AtCoder Beginner Contest 086 C - Traveling C - Traveling Time limit : 2sec / Memory limit : 256MB Score : 30...
AtCoder Context 128 C Swtich(控制开关) 伟大不DIAO 2020-01-15 阅读2 分钟题目现有N个开关,它们有on和off两种状态,还有M个电灯泡。开关编号从1到N,电灯泡编号从1到M。电灯泡i和Ki个的开关连接在一起。这些开关的编号从Si1,Si2,Si3,Si4,...Siki.电灯泡i的ki个开关中,状态为on的开关的个数如果和pi的...
Atcoder beginner contest 128D - equeue https://atcoder.jp/contests/abc128/tasks/abc128_d 思路:n,k都很小,可以暴力。先枚举用到的操作次数0-k,设此时操作次数为x。再枚举取的个数0-x,设取数的个数为y,经过推算可以发现可以取到两边的前(x+y)/2个(左边取最左边的a个,右边取最右边的b个,则...
abc128 C - Switches bit 全探索 abc002 D - 派閥 bit 全探索 joi2008yo E - おせんべい bit 全探索 s8pc-4 B - Buildings are Colorful! bit 全探索 abc145 C - Average Length 順列全探索 abc150 C - Count Order 順列全探索 joi2009ho B - ピザ 二分探索 abc023 D - 射撃王...
ABC079_20171118 ABC128_20190526 ABC318 ABC319 ABC320 ABC321 ABC322 ABC323 ABC324 ABC325 ABC326 ABC327 ABC328 ABC329 ABC330 ABC331 ABC332 ABC333 ABC334 ABC335 ABC336 ABC337 ABC338 ABC339 ABC340 ABC341 A.cpp B.cpp C.cpp D.cpp E.cpp ABC342 ABC343 ABC344 ABC345 ABC346 ABC347 ABC...
Contest URL: https://atcoder.jp/contests/abc332 Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20231210T2100&p1=248 Duration: 100 minutes Writer: math957963, leaf1415, evima, m_99 Tester: physics0523, cn449 Rated range: ~ 1999 The point values: 100-200-300-425...
ABC233C - Product 实际上就是一个简单 dp,但是 数组上范围比较大,需要用 map 维护下标以及转移点。 答案爆long long,需使用__int128。 using i128 = __int128; vector<map<i128, i128>> mp; int main() { i128 n, X; read(n, X);