D - Cake 123 A - Five Antennas #include<bits/stdc++.h>usingnamespacestd;constintN =1e6+5;typedeflonglongLL;inta[5];intmain(){for(inti =0; i <5; i++)cin>> a[i];intk;cin>> k;for(inti =0; i <4; i++) {for(intj = i +1; j <5; j++) {if(a[j] - a[i] > ...
AtCoder Beginner Contest 123目录 A - Five Antennas B - Five Dishes C - Five Transportations D - Cake 123A - Five Antennas#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; typedef long long LL; int a[5]; int main() { for (int i = 0; i < 5; i++)...
1、今晚(5月17日)20点在B站开始 AtCoder 初学者竞赛 353 比赛题解直播讲解 2、本周日(5月19日)晚上19点在B站开始 AtCoder Beginner Contest 354的题解直播讲解 3、观看方式: 复制下方链接或直接扫描二维码,PC端建议使用chrome浏览器 https://live.bilibili.com/21371611?live_from=84002 或识别下方二维码查看:...
合集-Atcoder Beginner Contest 题解 AT_ABC406_E Popcount Sum 3 摘要:洛谷题目传送门 ATcoder题目链接 题目大意 给你正整数NN和KK。 求所有不超过NN且满足以下条件的正整数xx的 和(取模998244353998244353):xx的popcountpopcount恰好是KK。 给你TT阅读全文 posted @2025-05-18 20:57Cloudybunny...
AtCoder Beginner Contest 323 A 至 F 題讲解 by dreamoon https://www.bilibili.com/video/BV1VN411b7Pd/ AtCoder Beginner Contest 323 https://www.bilibili.com/video/BV1m84y1177k/ Xy_top Atcoder Beginner Contest #323 实况 https://www.bilibili.com/video/BV1Rj41147sE/ AtCoder Beginner Conte...
AtCoder Beginner Contest 402 A-F 简易题解,如果题解中有什么问题可以找我反馈,谢谢! A.CBC直接枚举整个字符串,只输出大写字母即可。 int main(){ string s; cin >> s; for(int i = 0 ; i < s.size(); i++){… 枫落发表于Atcod... AtCoder Beginner Contest 402(A-F详细题解)...
AtCoder Beginner Contest 402(A-F详细题解) A 思路:我们直接输出字符串中的大写字母即可。 代码:#include<bits/stdc++.h> using namespace std; #define int long long #define N 500010 signed main(){ string s;cin>>… 秋日薄雾 Atcoder Beginner contest 256题解(A-G) A.2^N直接...
AtCoder Beginner Contest 283 E - Don't Isolate Elements https://www.bilibili.com/video/BV1oD4y1L76r/ https://www.cnblogs.com/zltzlt-blog/p/17344192.html AtCoder Beginner Contest 283 E. Don‘t Isolate Elements(预支下一行状态的状压dp) ...
AtCoder Beginner Contest 133 E - Virus Tree 2 (dfs) E - Virus Tree 2 Time Limit: 2 sec / Memory Limit: 1024 MB Score : 500500 points Problem Statement You are given a tree with NN vertices and N−1N−1 edges. The vertices are numbered 11 to NN, and the ii-th edge connects...
AtCoder Beginner Contest 193 部分题解 E - Oversleeping 求是否存在\(t\)满足\(t=t_1(mod (2X+2Y)) and t=t_2(mod (P+Q))\) 注意到\(Q\)和\(Y\)非常小,直接枚举套个\(exCRT\)就行了(虽然赛场上没看出来,\(exCRT\)也忘了记得快速乘...