codeforces
文章平均质量分 70
HsgTef
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #770 (Div. 2) D.Finding Zero题解
Finding Zero思路:刚拿到题目就看到最多提问2n-2次,仔细一想:如果能找到最大值,那么就可以花n-2次来找到0,原理很简单,遍历1 maxid i,不断更新max() - min()的最大值,最后得到一个下标ansid,可以知道0一定是在1或者ansid之中,直接输出即可。所以只需要花n次提问来找最大值,后面一直处理不好,结果第二天才解出来。解释一下代码:刚开始花n-2次提问去找最大值的下标(选2个数不动,循环n-2次),得出来的maxid可能是0,可能是最大值,也可能是一个很特殊的值(既不原创 2022-02-07 15:39:32 · 675 阅读 · 0 评论 -
codeforces 731A - Night at the Museum
链接:https://codeforces.ml/problemset/problem/731/A题意:一个⚪从刚开始是a到所给的每个字符的最短路径思路:两个相邻的字符如果大于13,则说明走相反的路会更近点。ac代码如下:#include<iostream>#include<string>using namespace std;int main(){ string s1,s; cin>>s1; s = "a"+s1; int sum=0; for原创 2021-03-07 21:36:47 · 169 阅读 · 0 评论 -
codeforces 381A- Sereja and Dima(stl vector)
A. Sereja and Dimatime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSereja and Dima play a game. The rules of the game are very simple. The players have n cards in a row. Each card contains a number,原创 2021-02-28 23:42:09 · 194 阅读 · 0 评论 -
codeforce 1370A Maximum GCD(简单思维)
A. Maximum GCDtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet’s consider all integers in the range from 1 to n (inclusive).Among all pairs of distinct integers in this range, find the maximum p原创 2021-02-23 21:04:36 · 258 阅读 · 0 评论 -
codeforces 1385B - Restore the Permutation by Merger(肯定用vector啦)
B. Restore the Permutation by Mergertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA permutation of length n is a sequence of integers from 1 to n of length n containing each number exactly once. F原创 2021-02-23 20:45:41 · 1238 阅读 · 0 评论 -
codeforces 1360B - Honest Coach(排序)
B. Honest Coachtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n athletes in front of you. Athletes are numbered from 1 to n from left to right. You know the strength of each athlete — th原创 2021-02-20 21:04:09 · 430 阅读 · 0 评论 -
codeforces 1348A - Phoenix and Balance
A. Phoenix and Balancetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPhoenix has n coins with weights 21,22,…,2n. He knows that n is even.He wants to split the coins into two piles such that each原创 2021-02-20 20:53:27 · 176 阅读 · 0 评论 -
codeforces 1367B - Even Array
B. Even Arraytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array a[0…n−1] of length n which consists of non-negative integers. Note that array indices start from zero.An array i原创 2021-02-20 19:36:20 · 234 阅读 · 0 评论 -
codeforces 443A-Anton and Letters(set)
A. Anton and Letterstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, Anton has found a set. The set consists of small English letters. Anton carefully wrote out all the letters from the se原创 2021-02-14 19:18:06 · 512 阅读 · 0 评论 -
CodeForces 144A Arrival of the General
A. Arrival of the Generaltime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper原创 2021-02-14 18:47:16 · 362 阅读 · 0 评论 -
CodeForces-228A-Is your horseshoe on the other hoof?(set方便好理解)
A. Is your horseshoe on the other hoof?time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputValera the Horse is going to the party with friends. He has been following the fashion trends for a while, and原创 2021-02-13 23:16:14 · 342 阅读 · 0 评论