Codeforces Round
文章平均质量分 92
Practice
CoderSilence
1024
展开
-
Codeforces Round #679 (Div. 2, based on Technocup 2021 Elimination Round 1)
传送门 A - Finding Sasuke Naruto has sneaked into the Orochimaru’s lair and is now looking for Sasuke. There are T rooms there. Every room has a door into it, each door can be described by the number n of seals on it and their integer energies a1, a2, …, .原创 2020-10-27 23:19:27 · 403 阅读 · 0 评论 -
Codeforces Round #678 (Div. 2)
Codeforces Round #678 (Div. 2) 传送门 A - Reorder For a given array a consisting of n integers and a given integer m find if it is possible to reorder elements of the array a in such a way that ∑ni=1∑nj=iajj equals m? It is forbidden to delete elements as.原创 2020-10-25 16:18:50 · 651 阅读 · 0 评论 -
Codeforces Round #670 (Div. 2)
Codeforces Round #670 (Div. 2) 传送门 A. Subset Mex Description Given a set of integers (it can contain equal elements). You have to split it into two subsets A and B (both of them can contain equal elements or be empty). You have to maximize the value of .原创 2020-09-27 19:49:07 · 184 阅读 · 0 评论 -
Codeforces Global Round 10
A - Omkar and Password Lord Omkar has permitted you to enter the Holy Church of Omkar! To test your worthiness, Omkar gives you a password which you must interpret! A password is an array a of n positive integers. You apply the following operation to the原创 2020-08-17 01:47:32 · 461 阅读 · 0 评论 -
Codeforces Round #663 (Div. 2)
Codeforces Round #663 (Div. 2) 传送门 A - Suborrays Description A permutation of length n is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears .原创 2020-08-10 00:42:40 · 414 阅读 · 0 评论 -
Codeforces Round #662 (Div. 2)
Codeforces Round #662 (Div. 2) 传送门 B - Applejack and Storages Description This year in Equestria was a year of plenty, so Applejack has decided to build some new apple storages. According to the advice of the farm designers, she chose to build two stora.原创 2020-08-09 11:50:40 · 221 阅读 · 0 评论 -
Codeforces Round #661 (Div. 3)
A - Remove Smallest Code #include<iostream> #include<algorithm> #include<string> #include<vector> using namespace std; int a[100]; int main() { int t; cin>>t; while(t--) { int cnt = 0; int n; cin>>n; for(int原创 2020-08-06 01:50:43 · 481 阅读 · 0 评论 -
Codeforces Round #660 (Div. 2)
Codeforces Round #660 (Div. 2) 传送门 A - Captain Flint and Crew Recruitment Description Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (sol.原创 2020-07-31 00:43:43 · 592 阅读 · 0 评论 -
Codeforces Round #658 (Div. 2)
Codeforces Round #658 (Div. 2) Codeforces Round #658 (Div. 2)比赛地址 A. Common Subsequence 点我去看原题 问题描述 You are given two arrays of integers a1,…,an and b1,…,bm. Your task is to find a non-empty array c1,…,ck that is a subsequence of a1,…,an, and also a subse原创 2020-07-22 01:18:47 · 287 阅读 · 0 评论