AtCoder Beginner Contest 250 解题报告 这里是时隔nn个月的解题报告,由于 A 至 C 题过于简单,本解题报告从 D 题开始。 D Description 若一个正整数kk满足k=p×q3k=p×q3(其中p,qp,q均为质数且p<qp
// Problem: D - 250-like Number // Contest: AtCoder - AtCoder Beginner Contest 250 // URL: https://atcoder.jp/contests/abc250/tasks/abc250_d // Memory Limit: 1024 MB // Time Limit: 2000 ms // // Powered by CP Editor (https://cpeditor.org) #include <bits/stdc++.h> #defin...
AtCoder Beginner Contest 403 A-G 简易题解,如果题解中有什么问题可以找我反馈,谢谢! A.Odd Position Sum直接 for 循环输入,只对奇数求和即可。int main(){ int n; cin >> n; int res = 0; for(int i = 1; i… 枫落发表于Atcod... AtCoder Beginner Contest 404 A-G 简易题解,如果...
int a[maxn]; int pos[maxn]={0}; int main() { int n,q; cin>>n>>q; for(int i=1;i<=n;i++){ a[i]=i; pos[i]=i; } while(q--){ int x=read(); if(pos[x]==n){ swap(a[n],a[n-1]); pos[x]=n-1; pos[ a[n] ]=n; }else{ int nxt=pos[x]; int nxtt...
·AtCoder Beginner Contest (ABC) 这是最频繁且最简单的入门赛,通常情况下每月至少举行2次。2019年4月27日(含)之前,每场比赛共4题,时长100分钟,满分1000分且Rating超过1199的选手不计Rating值。自2019年5月19日起改版升级为6道题目,时长不变,满分2100分且Rating值超过1999的选手不计Rating值。改版之后比赛质量...
Aising Programming Contest 2022(AtCoder Beginner Contest 255)实况 https://www.bilibili.com/video/BV1mY411K7PJ/ https://www.bilibili.com/video/BV1W3411g79S/ Aising Programming Contest 2022(AtCoder Beginner Contest 255)现场实况 https://www.bilibili.com/video/BV1Ba411L736/ ...
AtCoder Beginner Contest 180 个人题解(快乐DP场) Here A - box 输出\(N - A + B\) B - Various distances 按题意输出 3 种距离即可 #include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios_base::sync_with_stdio(false), cin.tie(0);...
AtCoder Beginner Contest 269「A」「B」「C 二进制枚举」「D 暴力dfs」「E 二分答案」「F 等差数列+推式子」 https://suryxin.blog.csdn.net/article/details/126974824 AtCoder Beginner Contest 269(E-EX) https://www.bilibili.com/opus/707445585544740886 ...
AtCoder Beginner Contest 169(题解) AtCoder Beginner Contest 169(题解)E - Count Median结论题给定nnn个xi∈[ai,bi]x_i\in[a_i,b_i]xi∈[ai,bi],求中位数的个数。定义:k=⌊n2⌋k=\lfloor\dfrac{n}{2}\rfloork=⌊2n⌋,对a,ba,ba,b进行排序后,为ak+1a_{k+1}ak...
This is the approach I implemented during the contest. Of course, I'm (mostly--I actually did do this during the contest) joking, and I'll now describe the solution I assume was intended. The basic idea is that there are two cases to deal with. First, two points form a diameter of...