翎泠风-CSDN博客

牛客2021年多校训练营<1>Alice and Bob输入描述：输出描述：Ball Dropping输入描述：输出描述：Determine the Photo Position输入描述：输出描述：Alice and Bob时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 262144K，其他语言524288K64bit IO Format: %lld题目描述Alice and Bob like playing games. There are two piles of

2021-07-21 21:17:32 327

原创 B2. Palindrome Game (hard version)

B2. Palindrome Game (hard version)time limit per test:1 secondmemory limit per test:256 megabytesinput:standard inputoutput:standard outputThe only difference between the easy and hard versions is that the given string s in the easy version is initial

2021-05-21 20:59:12 311

原创 B1. Palindrome Game （easy version）

B1. Palindrome Game （easy version）time limit per test:1 secondmemory limit per test:256 megabytesinput:standard inputoutput:standard outputThe only difference between the easy and hard versions is that the given string s in the easy version is initial

2021-05-21 19:46:59 423

原创 A. And Then There Were K

A. And Then There Were Ktime limit per test:1 secondmemory limit per test:256 megabytesinput:standard inputoutput:standard outputGiven an integer n, find the maximum value of integer k such that the following condition holds: n & (n−1) &am

2021-05-21 19:36:19 362

原创 B. Partial Replacement

B. Partial Replacementtime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputYou are given a number k and a string s of length n, consisting of the characters ‘.’ and ‘’. You want to replace some of t

2021-05-21 19:26:44 199

原创 A. K-divisible Sum

A. K-divisible Sumtime limit per test:1 secondmemory limit per test:256 megabytesinput:standard inputoutput:standard outputYou are given two integers n and k.You should create an array of n positive integers a1,a2,…,an such that the sum (a1+a2+⋯+an)

2021-05-15 13:12:41 194

原创 B. Inflation

B. InflationB. Inflationtime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputYou have a statistic of price changes for one product represented as an array of n positive integers p0,p1,…,pn−1, where

2021-05-15 12:54:47 225

原创 B. Beautiful Numbers

B. Beautiful NumbersB. Beautiful Numberstime limit per test:1 secondmemory limit per test:256 megabytesinput:standard inputoutput:standard outputYou are given a permutation p=[p1,p2,…,pn] of integers from 1 to n. Let’s call the number m (1≤m≤n) beaut

2021-05-15 08:37:12 145

原创 D. Corrupted Array

D. Corrupted ArrayD. Corrupted Arraytime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputYou are given a number n and an array b1,b2,…,bn+2, obtained according to the following algorithm:some arra

2021-05-14 17:35:16 259

原创 B. National Project

B. National Projecttime limit per test ：2 secondsmemory limit per test：256 megabytesinput：standard inputoutput：standard outputYour company was appointed to lay new asphalt on the highway of length n. You know that every day you can either repair one u

2021-05-12 17:37:21 110

原创 A. Erasing Zeroes

A. Erasing Zeroestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a string s. Each character is either 0 or 1.You want all 1’s in the string to form a contiguous subsegment. For examp

2021-05-12 17:25:20 138