codeforces今晚上号
文章平均质量分 82
晁棠
学生党
展开
-
Codeforces Round #791 (Div. 2)
Codeforces Round #791 (Div. 2) Problem A 一共有n个轮子,轮子要两两一对,如果有奇数个轮子,就肯定组装不了车。 车子要么是4轮车要么是6轮车,如果不够4个轮子,也肯定组装不了。 首先先将n个轮子两两一组,这样子讨论则变成要2组车轮或3组车轮才能变成一辆车。 如果要考虑组装的车子最多,那么就考虑全部组装4轮车。如果还有一组车轮匹配不了,那我们就去掉一台4轮车,把它变成6轮车。 如果要考虑组装的车子最少,则尽可能组装6轮车。如果有一组车轮剩余,那么去掉一台6轮车,然后加上原创 2022-05-21 00:15:58 · 168 阅读 · 0 评论 -
Codeforces Round #792 (Div. 1 + Div. 2)
Codeforces Round #792 (Div. 1 + Div. 2) Problem A 题目保证了没有0,那么一直除以10,取模10的数最小。但是要特判一位数和两位数的情况。 // Good Good Study, Day Day AC. #include <iostream> #include <stdio.h> #include <cstdio> #include <stdlib.h> #include <string> #incl原创 2022-05-20 11:20:03 · 197 阅读 · 0 评论 -
Codeforces Round #658 (Div. 2) [补题记录]
Codeforces Round #658 (Div. 2) Problem A 找到最少的数,使得这个数在a数组中出现过,同时也在b数组中出现过。最少的个数绝对为1,数据范围小,直接bool数组判重。 // Good Good Study, Day Day AC. #include <iostream> #include <stdio.h> #include <cstdio> #include <stdlib.h> #include <string&原创 2022-05-19 11:28:00 · 98 阅读 · 0 评论 -
Deltix Round,Spring2021(open for everyone,rated,Div.1+Div.2)
A. Game of Life time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output William really likes the cellular automaton called “Game of Life” so he decided to make his own version. For simplicity, William decide原创 2021-05-31 14:50:25 · 281 阅读 · 0 评论 -
Codeforces Round #723 (Div. 2)
A. Mean Inequality time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output You are given an array a of 2n distinct integers. You want to arrange the elements of the array in a circle such that no element is原创 2021-05-29 18:47:13 · 1174 阅读 · 2 评论 -
Codeforces Round #722 (Div. 2) 20210525
A. Eshag Loves Big Arrays time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Eshag has an array a consisting of n integers. Eshag can perform the following operation any number of times: choose some sub原创 2021-05-25 08:28:48 · 284 阅读 · 0 评论