******比赛******
文章平均质量分 79
Ever_glow
当命运需要你逆风飞翔的时候,就不能随风而去。
展开
-
2018中国大学生程序设计竞赛 - 网络选拔赛 C Dream (构造)
DreamTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 268 Accepted Submission(s): 3Special JudgeProblem DescriptionFreshmen frequently...原创 2018-08-25 19:42:45 · 506 阅读 · 0 评论 -
牛客网暑期ACM多校训练营(第四场)J Hash Function (模拟)
题目描述 Chiaki has just learned hash in today's lesson. A hash function is any function that can be used to map data of arbitrary size to data of fixed size. As a beginner, Chiaki simply chooses a hash...原创 2018-07-29 10:16:54 · 320 阅读 · 0 评论 -
牛客网暑期ACM多校训练营(第四场)D Another Distinct Values(构造)
题目描述 Chiaki has an n x n matrix. She would like to fill each entry by -1, 0 or 1 such that r1,r2,...,rn,c1,c2, ..., cn are distinct values, where ri be the sum of the i-th row and ci be the sum of t...原创 2018-07-28 19:22:53 · 345 阅读 · 0 评论 -
中石油 暑期集训个人赛第一场 题解
中石油 暑期集训个人赛第一场 题解原创 2017-07-25 16:35:42 · 838 阅读 · 0 评论 -
中石油 暑期集训个人赛 DP部分
可恶的C题问题 C: 母鸡下蛋时间限制: 1 Sec 内存限制: 128 MB提交: 196 解决: 44[提交][状态][讨论版]题目描述鸡国中的母鸡最擅长下蛋了,MGMG 是鸡国中一只以下蛋产量高而闻名全鸡国的母鸡。 鸡国专供下蛋的 n 个鸡窝呈一字排列在鸡国的“下蛋中心”,从左到右依次编号为 1 到n。每个鸡窝都有一个最大可下蛋的量,其中第 i 个鸡窝原创 2017-07-25 15:52:19 · 618 阅读 · 1 评论 -
中石油 暑期集训个人赛 水题部分
签到题A问题 A: 公鸡打鸣时间限制: 1 Sec 内存限制: 128 MB提交: 292 解决: 85[提交][状态][讨论版]题目描述鸡国中有两只最喜欢打鸣的公鸡 G1 和 G2,它们每一次打鸣都有一个声音的响度值。一天清晨,G1 开始先开始打鸣,响度值为 x,G2 听到 G1 的打鸣后也开始打鸣,响度值为y。G1 和 G2 很想把它们打鸣声音的响度值调原创 2017-07-25 15:30:46 · 823 阅读 · 1 评论 -
ACM-ICPC 2018 焦作赛区网络预赛 L Poor God Water (BM算法)
God Water likes to eat meat, fish and chocolate very much, but unfortunately, the doctor tells him that some sequence of eating will make them poisonous.Every hour, God Water will eat one kind of fo...原创 2018-09-15 20:05:10 · 755 阅读 · 0 评论 -
ACM-ICPC 2018 焦作赛区网络预赛 H String and Times (后缀数组+容斥)
Now you have a string consists of uppercase letters, two integers A and B. We call a substring wonderful substring when the times it appears in that string is between A and B (A≤times≤B). Can you calc...原创 2018-09-15 20:11:16 · 533 阅读 · 0 评论 -
The 2018 ACM-ICPC China JiangSu Provincial Programming Contest B Array (滚动数组+规律)
JSZKC is the captain of the lala team.There are NN girls in the lala team. And their height is [1,N]and distinct. So it means there are no two girls with a same height.JSZKC has to arrange them as...原创 2018-09-25 09:01:50 · 344 阅读 · 0 评论 -
ACM-ICPC北京赛区2018 D Frog and Portal(构造)
时间限制:1000ms单点时限:1000ms内存限制:512MB描述A small frog wants to get to the other side of a river. The frog is initially located at one bank of the river (position 0) and wants to get to the other bank...原创 2018-11-13 21:29:32 · 424 阅读 · 0 评论 -
ACM-ICPC北京赛区2018 I Palindromes (打表规律)
时间限制:1000ms单点时限:1000ms内存限制:512MB描述Recently, Nvoenewr learnt palindromes in his class.A palindrome is a nonnegative integer that is the same when read from left to right and when read from ri...原创 2018-11-14 09:01:58 · 978 阅读 · 0 评论 -
2018 ACM/ICPC 沈阳站 J How Much Memory Your Code Is Using?
题目描述In the C++ language, the values of variables are stored somewhere in the computer memory as zeros and ones. Our program does not need to know the exact location where a variable is stored since ...原创 2018-11-19 09:13:22 · 1105 阅读 · 2 评论 -
2018 ACM/ICPC 沈阳站 C Insertion Sort
题目描述Insertion sort is a simple sorting algorithm that builds the final sorted array one item at an iteration.More precisely, insertion sort iterates, consuming one input element each repetition, an...原创 2018-11-19 09:34:24 · 1270 阅读 · 1 评论 -
2018 ACM/ICPC 南京站 & GYM 101981
A Adrien and Austin给定一堆石子,每个人可以从其中连续的拿出一段,最优情况下,问最后谁能获得游戏的胜利。需要注意的是,当n==0时,此时先手是无法取石子的,此时输出Austin代码实现:/*Look at the starLook at the shine for U*/#include<bits/stdc++.h>#define ll ...原创 2018-11-18 14:52:00 · 691 阅读 · 0 评论 -
ACM-ICPC 2018 焦作赛区网络预赛 G Give Candies (欧拉降幂)
There are N children in kindergarten. Miss Li bought them N candies. To make the process more interesting, Miss Li comes up with the rule: All the children line up according to their student number (1...原创 2018-09-15 19:57:35 · 469 阅读 · 0 评论 -
2018中国大学生程序设计竞赛 - 网络选拔赛 D Find Integer (规律)
Find IntegerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 293 Accepted Submission(s): 78Special JudgeProblem Descriptionpeople in US...原创 2018-08-25 20:20:35 · 488 阅读 · 1 评论 -
2017 山东理工第九届校赛 A N!(神坑)
N!Time Limit: 1000MS Memory Limit: 65536KBSubmit StatisticProblem Description给出两个数 n, m。求 3748-1 和 3748-2。计算公式:3748-3Input输入数据有多组(数据组数不超过 250),到 EOF 结束。对于每组数据,输入两个用空格隔开的整数 n, m (0 <= m <= n <= 20) 。Output对于每组数据输出一行, 3748-1 和 3748-2。Example I原创 2017-06-04 18:19:27 · 1051 阅读 · 0 评论 -
2017 山东理工第九届校赛 C 康纳的表情包
康纳的表情包Time Limit: 1000MS Memory Limit: 65536KBSubmit StatisticProblem DescriptionUMR 现在手里有 n 张康纳的表情,最上面一张是玛吉呀巴库乃。现在 UMR 如果每次把最上面的 m 张牌移到最下面而不改变他们的顺序及朝向,那么至少经过多少次移动玛吉呀巴库乃才会又出现在最上面呢?3917Input多组输入。每组输入以空格分隔的两个整数 n 和 m(题目中所提及的)。1 <= n, m <= 10^9Out原创 2017-06-04 18:23:08 · 1449 阅读 · 1 评论 -
2017 山东理工第九届校赛 H C~K玩游戏(博弈)
C~K玩游戏Time Limit: 1000MS Memory Limit: 65536KBSubmit StatisticProblem DescriptionC~K 和 PBH 经常玩一个游戏。游戏规则如下:现给定一个 n*n 的棋盘,一个石头被放在棋盘的左上角。他们轮流移动石头。每一回合,两个人只能把石头向上,下,左,右四个方向移动一格,并且要求移动到的格子之前不能被访问过。谁不能移动石头了就算输。假如 C~K 先移动石头,而且 C~K 和 PBH 都足够聪明,那么最后谁能赢?Inpu原创 2017-06-04 18:31:48 · 572 阅读 · 0 评论 -
2017 山东理工第九届校赛 J LL
LLTime Limit: 100MS Memory Limit: 65536KBSubmit StatisticProblem Description这一天希酱又补了一卦,没想到每个人都发到了一张印有整数的牌,现在希酱想要继续占卜的话需要知道每个人手里拿的牌的整数具体是多少,但是她们却打起了哑谜。 穗乃果:我拿到的是 2原创 2017-06-04 20:32:31 · 533 阅读 · 0 评论 -
2017广东工业大学程序设计竞赛决赛 C 爬楼梯
Problem C: 爬楼梯Description小时候,我只能一阶一阶得爬楼梯,后来,我除了能一次爬一阶,还可以一次爬两阶,到现在,我最多一次可以爬三阶。那么现在问题来了,我想爬上n层楼,相邻楼层之间有一段楼梯,虽然我一次可以爬1个台阶、2个台阶和3个台阶,但是我在i与i+1层之间的楼梯上时,我不能跨越到i+1与i+2层之间的楼梯。现在有个原创 2017-03-26 19:36:57 · 1278 阅读 · 0 评论 -
2017广东工业大学程序设计竞赛决赛 D 只有通过毁灭才能揭示真理
Problem D: 只有通过毁灭才能揭示真理Description“只有通过毁灭才能揭示真理。” —— 虚空之眼维克兹是一个有触手的虚空来客,他带着非凡的意图探索着符文之地:吸收掉所有知识。凭借着他不断地注视,维克兹可以发射瓦解光线来灭除并分析他途中的一切东西,并为他供给数量庞大的信息。没人知道他为什么需要如此多的材料,尽管有人推测他设法了解符文之地,是为原创 2017-03-26 19:19:32 · 1046 阅读 · 0 评论 -
ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛 A Visiting Peking University
Visiting Peking University时间限制:1000ms单点时限:1000ms内存限制:256MB描述Ming is going to travel for n days and the date of these days can be represented by n integers: 0, 1, 2, …, n-1. He plans to spend m consecutive days(2 ≤ m ≤ n)in Beijing. During these m days原创 2017-09-23 18:59:42 · 1344 阅读 · 0 评论 -
ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛 G Bounce (规律)
Bounce时间限制:1000ms单点时限:1000ms内存限制:256MB描述For Argo, it is very interesting watching a circle bouncing in a rectangle.As shown in the figure below, the rectangle is divided into N×M grids, and the circle fits exactly one grid.The bouncing rule is sim原创 2017-09-24 09:36:49 · 1498 阅读 · 1 评论 -
2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 M. Frequent Subsets Problem (状态压缩)
The frequent subset problem is defined as follows. Suppose UU={1, 2,\ldots…,N} is the universe, and S_{1}S1 , S_{2}S2 ,\ldots…,S_{M}SM are MM sets over UU. Given a positive constant \alphaα, 0<\alpha \leq 10<α≤1, a subset BB (B \neq 0B≠0) is原创 2017-09-24 17:32:20 · 966 阅读 · 8 评论 -
2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 A Cache Simulator
Cache memories have been used widely in current microprocessor systems. In this problem, you are asked to write a program for a cache simulator. The cache has the following metrics:1. The cache size is 1 KB (K-byte).2. The cache uses the direct mapped原创 2017-09-24 19:42:56 · 810 阅读 · 0 评论 -
2017 ACM-ICPC 亚洲区(西安赛区)网络赛 C.Sum
Define the function S(x)S(x) for xx is a positive integer. S(x)S(x) equals to the sum of all digit of the decimal expression of xx. Please find a positive integer kk that S(k*x)\%233=0S(k∗x)%233=0.Input FormatFirst line an integer TT, indicates the num原创 2017-09-16 20:45:18 · 901 阅读 · 0 评论 -
AtCoder Beginner Contest 103 题解
A - Task Scheduling ProblemTime limit : 2sec / Memory limit : 1024MBScore : 100 pointsProblem StatementYou have three tasks, all of which need to be completed.First, you can complete any one...原创 2018-07-22 09:15:57 · 651 阅读 · 0 评论 -
2018中国大学生程序设计竞赛 - 网络选拔赛 I Tree and Permutation (dfs计数)
Tree and PermutationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 821 Accepted Submission(s): 292Problem DescriptionThere are N vert...原创 2018-08-26 19:16:23 · 307 阅读 · 0 评论 -
2017广东工业大学程序设计竞赛决赛 A 两只老虎
Problem A: 两只老虎Description来,我们先来放松下,听听儿歌,一起“唱”。两只老虎两只老虎,跑得快跑得快。一只没有耳朵,一只没有尾巴。真奇怪,真奇怪。Tmk也觉得很奇怪,因为在他面前突然出现了一群这样的老虎,有的没耳朵,有的没尾巴,不过也有正常的。现在Tmk告诉你这群老虎的耳朵个数,尾巴条数,以及老虎的腿的原创 2017-03-26 19:06:52 · 1083 阅读 · 0 评论