- 博客(4)
- 收藏
- 关注
RSS订阅原创 Gcd Queries（打表法）
Gcd QueriesRead problems statements in Mandarin Chinese and Russian.You are given an array A of integers of size N. You will be given Q queries where each query is represented by two integers L, R. You have to find the gcd(Greatest Common Divisor) of the
2021-05-30 00:30:21
307
原创 E - Hello XTCPC
E - Hello XTCPCYou have a string of lowercase letters.You need to find as many sequence “xtCpc” as possible.But letters in the same position can only be used once。InputThe input file contains two lines.The first line is an integer n show the length of
2021-05-29 23:44:25
209
原创 J - Worker(最小公倍数）
**J - Worker(最小公倍数）**Avin meets a rich customer today. He will earn 1 million dollars if he can solve a hard problem. There are n warehouses and m workers. Any worker in the i-th warehouse can handle ai orders per day. The customer wonders whether there
2021-05-23 00:43:18
219
1
原创 tokitsukaze and Soldier
tokitsukaze and Soldier链接：https://ac.nowcoder.com/acm/problem/50439题目描述在一个游戏中，tokitsukaze需要在n个士兵中选出一些士兵组成一个团去打副本。第i个士兵的战力为v[i]，团的战力是团内所有士兵的战力之和。但是这些士兵有特殊的要求：如果选了第i个士兵，这个士兵希望团的人数不超过s[i]。(如果不选第i个士兵，就没有这个限制。)tokitsukaze想知道，团的战力最大为多少。输入描述:第一行包含一个正整数n(1
2021-05-14 19:51:51
148
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人