![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
codeforces
文章平均质量分 65
击剑的剑没有剑柄
这个作者很懒,什么都没留下…
展开
-
江苏省赛(H. Reverse the String)
江苏省赛H题目:思路:头一定是排序后第一个和之前未排序前不同的点,枚举尾巴,找出字典序最小的尾巴,用哈希+二分寻找尾巴代码:#include<iostream>#include<algorithm>#include<vector>#include<map>#include<queue>#include<stack>#include<set>#include<cmath>#include原创 2022-05-07 19:10:51 · 341 阅读 · 0 评论 -
Codeforces Round #779 (Div. 2) D2. 388535 (Hard Version)
Codeforces Round #779 (Div. 2) D2. 388535 (Hard Version)题目思路:求解ans,使ans与 ai 异或后,数组a是[l,r]的一个全排列,由于每个数不同,所以异或后也不会相同,于是直接寻找ai XOR l 最大异或与最小异或,只要他们分别等于l,r。即可证明ai中每一个数都在[l,r]之中,且互不相等,即可得到结果为ai XOR l。寻找最大最大最小异或对,则采用trie异或树来求解代码#include<bits/stdc++.h>原创 2022-03-28 12:43:57 · 507 阅读 · 0 评论 -
Robot Cleaner Revisit(CF)
Codeforces Round #763 (Div. 2)D. Robot Cleaner Revisit题目链接:https://codeforces.com/contest/1623/problem/D解题代码来自于cf某大佬 :By AlanSkarica;思路:由于最多只有n∗*∗m个点,所以循环的点最多n∗*∗m个,又因为边缘只有两种状态,顶点只有一种状态,故共有4(m-1)(n-1)种状态点,且4(m-1)(n-1)一定是环的边长的整数倍,对于每k种状态x1,x2…xk,每个状态可能原创 2022-01-08 17:55:25 · 223 阅读 · 0 评论 -
Codeforces Round #736 (Div. 2)(A,B,C题解)
Codeforces Round #736 (Div. 2)(A,B,C题解)A. Gregor and CryptographyA. Gregor and Cryptographytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputGregor is learning about RSA cryptography, and although h原创 2021-08-02 22:31:05 · 409 阅读 · 3 评论 -
Educational Codeforces Round 112 (Rated for Div. 2)A,B,C题解(cf1555a-1555c)
Educational Codeforces Round 112 (Rated for Div. 2)A,B,C题解A.PizzaForcesA. PizzaForcestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPizzaForces is Petya’s favorite pizzeria. PizzaForces makes an原创 2021-07-31 09:27:39 · 192 阅读 · 0 评论 -
Codeforces Round #697 (Div. 3) A. Odd Divisor
Codeforces Round #697 (Div. 3) A. Odd Divisor A. Odd Divisor time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard outputYou are gi原创 2021-01-26 20:34:02 · 87 阅读 · 0 评论 -
2020-12-05
Educational Codeforces Round 99 B题题解 (Rated for Div. 2)B. Jumpstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are standing on the OX-axis at point 0 and you want to move to an integer point x&原创 2020-12-05 14:45:16 · 81 阅读 · 1 评论 -
2020-12-03
Educational Codeforces Round 99 C题题解题目:C. Ping-pongtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlice and Bob play ping-pong with simplified rules.During the game, the player serving the ball原创 2020-12-03 14:08:19 · 101 阅读 · 0 评论 -
2020-12-01
Educational Codeforces Round 99A.Strange Functions链接 https://codeforces.com/contest/1455Let’s define a function f(x) (x is a positive integer) as follows: write all digits of the decimal representation of x backwards, then get rid of the leading zeroes.原创 2020-12-01 13:20:00 · 73 阅读 · 0 评论