Codeforces
文章平均质量分 56
H_chen*
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #719 (Div. 3)
A. Do Not Be Distracted! 输入一串字符,相同字母只可以连续出现,若连续出现后再次出现,则输出no。 标记所有出现过的字母,连续则只标记一次,若再次出现标记则输出no。 来自 https://codeforces.com/contest/1520/problem/A #include<iostream> #include<iomanip> #include<algorithm> #include<cmath> #include<st原创 2021-05-06 23:38:20 · 217 阅读 · 0 评论 -
Contest 2050 and Codeforces Round #718 (Div. 1 + Div. 2)
A. Sum of 2050 输入一个数,若与若干个2050,20500,205000······的和相等,则输出用到数字最少的个数,不能则输出-1. 如果可以,那么这个数必然可以被2050整除,如果不能,直接输出-1,后面的数都是2050的整十倍,最后最少的个数就是n除2050的商上的各位数之和。 来自 https://codeforces.com/contest/1517/problem/A #include<iostream> #include<iomanip> #includ原创 2021-04-24 11:30:41 · 453 阅读 · 0 评论 -
Codeforces Round #717 (Div. 2)
A. Tit for Tat 输入n,k和长度为n的数组,k代表进行操作的次数,每次操作任选两个数进行-1和+1,使得数组与原数组从前往后相比,在第一个不同数字的位置上,比原数组小,在操作次数限制的情况下,输出字典序最小的那种情况。 将数组从前至后,每个位置减至0,因为不能出现负数,并将+1操作放到最后一位上,输出数组。 来自 https://codeforces.com/contest/1516/problem/A #include<iostream> #include<iomanip&原创 2021-04-22 19:28:56 · 274 阅读 · 0 评论 -
Codeforces Round #715 (Div. 2)
A 使得输出的相邻两数之和为偶数 #include<iostream> using namespace std; int main() { int t; cin >> t; while (t--) { int nm[2001] = { 0 }, mn[2001] = { 0 }; int n, m, j1 = 0, j2 = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> m原创 2021-04-20 17:04:42 · 79 阅读 · 0 评论 -
Codeforces Round #716 (Div. 2)
A 找出非平方数 #include<iostream> #include<string> #include<vector> #include<algorithm> #include<set> #include<map> #include<iterator> using namespace std; int main() { int t; cin >> t; while (t--) { int n, nu原创 2021-04-20 13:40:41 · 97 阅读 · 0 评论 -
Codeforces Round #699 (Div. 2) B. New Colony
B. New Colony time limit per test:2 seconds memory limit per test:256 megabytes input:standard input output:standard output After reaching your destination, you want to build a new colony on the new planet. Since this planet has many mountains and the co原创 2021-02-06 13:46:59 · 123 阅读 · 0 评论 -
Codeforces Round #699 (Div. 2) A. Space Navigation
A. Space Navigation time limit per test : 2 seconds memory limit per test : 256 megabytes input : standard input output : standard output You were dreaming that you are traveling to a planet named Planetforces on your personal原创 2021-02-06 13:42:29 · 131 阅读 · 0 评论 -
Codeforces Round #698 (Div. 2) A. Nezzar and Colorful Balls
A. Nezzar and Colorful Balls time limit per test1 second memory limit per test512 megabytes inputstandard input outputstandard output Nezzar has n balls, numbered with integers 1,2,…,n. Numbers a1,a2,…,an are written on them, respectively. Numbers on tho原创 2021-01-30 13:54:58 · 108 阅读 · 0 评论 -
Codeforces Round #697 (Div. 3) B - New Year‘s Number
B. New Year’s Number time limit per test:2 seconds memory limit per test:256 megabytes input:standard input output:standard output Polycarp remembered the 2020-th year, and he is happy with the arrival of the new 2021-th year. To remember such a wonderfu原创 2021-01-30 13:48:07 · 130 阅读 · 0 评论