ACM
ACM训练
AC它真的很香
看心情写博客 | 健忘小天才
展开
-
P2678 跳石头
题目链接#include<iostream>#include<string>#include<string.h>#include<algorithm>#include<vector>#include<map>#include<set>//#include<bits/stdc++.h>using namespace std;typedef long long LL;int l, n, m;i原创 2020-08-11 14:03:38 · 140 阅读 · 0 评论 -
A. Level Statistics
Polycarp has recently created a new level in this cool new game Berlio Maker 85 and uploaded it online. Now players from all over the world can try his level.All levels in this game have two stats to them: the number of plays and the number of clears. So原创 2020-09-23 15:11:36 · 235 阅读 · 0 评论 -
C. Yet Another Array Restoration
We have a secret array. You don’t know this array and you have to restore it. However, you know some facts about this array:The array consists of n distinct positive (greater than 0) integers.The array contains two elements x and y (these elements are kn原创 2020-09-22 19:39:25 · 184 阅读 · 0 评论 -
A. DZY Loves Chessboard
DZY loves chessboard, and he enjoys playing with it.He has a chessboard of n rows and m columns. Some cells of the chessboard are bad, others are good. For every good cell, DZY wants to put a chessman on it. Each chessman is either white or black. After p原创 2020-08-18 14:45:46 · 239 阅读 · 0 评论 -
C. Less or Equal
You are given a sequence of integers of length n and integer number k. You should print any integer number x in the range of [1;10^9] (i.e. 1≤x≤10^9) such that exactly k elements of given sequence are less than or equal to x.Note that the sequence can con原创 2020-08-18 13:18:47 · 232 阅读 · 0 评论 -
A. k-rounding
For a given positive integer n denote its k-rounding as the minimum positive integer x, such that x ends with k or more zeros in base 10 and is divisible by n.For example, 4-rounding of 375 is 375·80 = 30000. 30000 is the minimum integer such that it ends原创 2020-08-13 15:26:50 · 188 阅读 · 0 评论 -
B. Ternary String
You are given a string s such that each its character is either 1, 2, or 3. You have to choose the shortest contiguous substring of s such that it contains each of these three characters at least once.A contiguous substring of string s is a string that ca原创 2020-08-12 16:33:31 · 213 阅读 · 0 评论 -
B. Walking in the Rain
In Berland the opposition is going to arrange mass walking on the boulevard. The boulevard consists of n tiles that are lain in a row and are numbered from 1 to n from right to left. The opposition should start walking on the tile number 1 and the finish o原创 2020-08-12 15:22:36 · 269 阅读 · 0 评论 -
B. Merge it!
You are given an array a consisting of n integers a1,a2,…,an.In one operation you can choose two elements of the array and replace them with the element equal to their sum (it does not matter where you insert the new element). For example, from the array原创 2020-08-12 09:58:32 · 282 阅读 · 0 评论 -
B. Binary Period
Let’s say string s has period k if si=si+k for all i from 1 to |s|−k (|s| means length of string s) and k is the minimum positive integer with this property.Some examples of a period: for s=“0101” the period is k=2, for s=“0000” the period is k=1, for s=“原创 2020-08-11 09:42:17 · 182 阅读 · 0 评论 -
B. GCD Compression
Ashish has an array a of consisting of 2n positive integers. He wants to compress a into an array b of size n−1. To do this, he first discards exactly 2 (any two) elements from a. He then performs the following operation until there are no elements left in原创 2020-08-10 15:40:10 · 205 阅读 · 0 评论 -
A. Cheap Travel
Ann has recently started commuting by subway. We know that a one ride subway ticket costs a rubles. Besides, Ann found out that she can buy a special ticket for m rides (she can buy it several times). It costs b rubles. Ann did the math; she will need to u原创 2020-08-09 13:52:48 · 227 阅读 · 0 评论 -
1384A. Common Prefixes
A. Common PrefixesThe length of the longest common prefix of two strings s=s1s2…sn and t=t1t2…tm is defined as the maximum integer k (0≤k≤min(n,m)) such that s1s2…sk equals t1t2…tk.Koa the Koala initially has n+1 strings s1,s2,…,sn+1.For each i (1≤i≤n)原创 2020-08-09 13:18:59 · 223 阅读 · 0 评论 -
B. Captain Flint and a Long Voyage
Captain Flint and his crew keep heading to a savage shore of Byteland for several months already, drinking rum and telling stories. In such moments uncle Bogdan often remembers his nephew Denis. Today, he has told a story about how Denis helped him to come原创 2020-08-08 16:27:30 · 155 阅读 · 0 评论