left_right_steady

分类

题解(45)

/ 注册

全部文章（共8篇）

Codeforces 1520A.Do Not Be Distracted!

题目描述：有26种任务，用大写英文字母表示，Polycarp每天完成一个任务，一旦切换任务，他不能再返回这个任务，否则会被老师怀疑，现在给定任务序列，问是否会被老师怀疑。这太水了每次遇到切换点就判断一下是否出现即可，是否出现用vis[]数组搞一下标记就行。 #include<bits/std...

模拟

2021-05-29

0 734

ZZUACM 2021 省赛训练 2 D-Pipes

因为有图片，不贴题面了，直接甩个cf链接https://codeforces.com/problemset/problem/1234/C 记(fx,fy)为上一步位于哪一次节点，(x,y)是现在在的节点。判断所有情况的下一步是否可走以及往哪走就行了。又是改了一个小时真的是醉了 #include<...

模拟

2021-04-27

0 452

ZZUACM 2021 省赛训练 2 C-Social Network (hard version)

The only difference between easy and hard versions are constraints on n and k.You are messaging in one of the popular social networks via your smartph...

模拟队列

2021-04-27

0 437

ZZUACM 2021 省赛训练 2 B-Social Network (easy version)

The only difference between easy and hard versions are constraints on n and k.You are messaging in one of the popular social networks via your smartph...

模拟队列

2021-04-27

0 488

ZZUACM 2021 省赛训练 1 E-Subsequences (easy version)

The only difference between the easy and the hard versions is constraints.A subsequence is a string that can be derived from another string by deletin...

模拟字符串

2021-04-23

0 390

ZZUACM 2021 省赛训练 1 A-Nearest Interesting Number

Polycarp knows that if the sum of the digits of a number is divisible by 3, then the number itself is divisible by 3. He assumes that the numbers, the...

模拟

2021-04-23

0 432

团体程序设计天梯赛-练习集 L1-046-整除光棍

直接用除法算式模拟即可。需要注意的是要先用while扩大被除数（要找的光棍数），后续只用if 即可 #include<bits/stdc++.h> using namespace std; long long x; long long cnt=1; long long k=1; in...

模拟

2021-04-20

0 328

Zhengzhou University programming trial of year 2021 H-选拔赛

Problem H. 选拔赛Time limit: 6 secondsMemory limit: 256 megabytes郑州大学 ACM 实验室选拔赛开始了！本次选拔赛采取个人赛的形式，一共有 k 名实验室成员报名参与。你作为本次选拔赛的现场工作人员，需要为每一个参赛成员安排一个合适的位置。已知...

模拟

2021-04-18

0 407