LP_Cong

（2017 Multi-University Training Contest - Team 6）

A. Kirill And The Gametime limit per test 2 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputKirill plays a new computer game

Odds and Endstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhere do odds begin, and where do they end? Wh

C. Mahmoud and Ehab and the xorMahmoud and Ehab are on the third stage of their adventures now. As you know, Dr. Evil likes sets. This time he won't show them any set from his large collecti

2017 ACM/ICPC Asia Regional Qingdao Online 1008Chinese ZodiacProblem DescriptionThe Chinese Zodiac, known as Sheng Xiao, is based on a twelve-year cycle, each year in the cycle relat

题意：这是道阅读题，认认真真读完题就好了……解题思路：读完题之后就会发现，是一道简单题。难点在于怎么判断大于1e18……这里我用了long double 去判断……#include#include#include#include#include#include#include#include#include#include#include#in

Dream of Sumtime limit per test2.0 smemory limit per test256 MBinputstandard inputoutputstandard outputSometimes you must fall in order to rise but I seemed to

Feeling of Comradeshiptime limit per test2.0 smemory limit per test256 MBinputstandard inputoutputstandard outputI was tired. Tired of hiding and wandering. Thr

Set of Taskstime limit per test2.0 smemory limit per test256 MBinputstandard inputoutputstandard outputI was heading to the old tavern «ChivalryForces», because

#1631 : Cats and Fish时间限制:1000ms单点时限:1000ms内存限制:256MB描述There are many homeless cats in PKU campus. They are all happy because the students in the cat club of PKU take goo

#1632 : Secret Poems时间限制:1000ms单点时限:1000ms内存限制:256MB描述The Yongzheng Emperor (13 December 1678 – 8 October 1735), was the fifth emperor of the Qing dynasty of China. He wa

Perfect Numbertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe consider a positive integer perfect, if a

World Cuptime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe last stage of Football World Cup is played using the play-off system.There are n teams...

链接：https://www.nowcoder.com/acm/contest/94/C大家都知道想从华南理工大学的本科毕业并不是一件简单的事情，作为一名大四即将毕业的学生，优酱正在为她的毕业论文愁眉不展，为什么呢？并不是毕业设计的课题太难了，而是毕业论文有着非常奇怪的格式要求，其中最令人头痛的就是如何正确地引用参考文献。 而众所周知，某工是一个制度非常严格而且变化速度非常快的学校。因此发生...

LATTICE is learning Digital Electronic Technology. He is talented, so he understood all those pieces of knowledge in 10^{-9}10−9 second. In the next 10^{-9}10−9 second, he built a data decoding device...

链接：https://www.nowcoder.com/acm/contest/206/B来源：牛客网 题目描述恬恬有一个nx n的数组。她在用这个数组玩游戏：开始时，数组中每一个元素都是0。恬恬会做某些操作。在一次操作中，她可以将某一行的所有元素同时加上一个值，也可以将某一列的所有元素同时加上一个值。在几次操作后，一个元素被隐藏了。你能帮助她回忆隐藏的数是几吗？输入描述:...

C. Oh Those Palindromestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA non-empty string is called palindrome, if it reads the ...

cable cable cableProblem DescriptionConnecting the display screen and signal sources which produce different color signals by cables, then the display screen can show the color of the signal

题目：暂时看不到……有的看了再更新题目信息……题意：签到题解题思路：签到题#include#include#include#include#include#include#include#include#include#include#include#include#define INF 1<<29using namespace std;

(2017 Multi-University Training Contest - Team 6)

C++输出谢尔宾斯基三角形

解题思路：水题

解题思路：水题，与栈有点像

解题思路：水题，直接模拟即可

Driving TestPolycarp has just attempted to pass the driving test. He ran over the straight road with the signs of four types.speed limit: this sign comes with a positive integer number —

Two TVstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp is a great fan of television.He wrote

Luba And The Tickettime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLuba has a ticket consisting of 6 digit

A. Leha and FunctionLeha like all kinds of strange things. Recently he liked the function F(n, k). Consider all possible k-element subsets of the set [1, 2, ..., n]. For subset find minimal

ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛 A#1578 : Visiting Peking University时间限制:1000ms单点时限:1000ms内存限制:256MB描述Ming is going to travel for n days and the date of these

Codeforces 862A Mahmoud and Ehab and the MEXA. Mahmoud and Ehab and the MEXDr. Evil kidnapped Mahmoud and Ehab in the evil land because of their performance in the Evil Olympiad in Informatics (EOI). He decided to give them some problems

Consider a system which is described at any time as being in one of a set of NN distinct states, 1,2,3,...,N1,2,3,...,N. We denote the time instants associated with state changes as t = 1,2,...t

You are given a list of train stations, say from the station 11 to the station 100100.The passengers can order several tickets from one station to another before the train leaves the station one.

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

The frequent subset problem is defined as follows. Suppose UU={1, 2,\ldots…,N} is the universe, and S_{1}S​1​​, S_{2}S​2​​,\ldots…,S_{M}S​M​​are MM sets over UU. Given a positive constant \alp

题目：暂时看不到……有的看了再更新题目信息……题意：有一堆猴子，每只猴子都有自己喜欢的香蕉类型，然后香蕉会出现在指定的位置，问每只猴子是否能在每个地方吃到自己喜欢的香蕉解题思路：暴力处理即可，签到题。#include#include#include#include#include#include#include#include#inclu

  解题思路：枚举即可！然后突然就会发现规律了！  #include &lt;iostream&gt;#include &lt;cstring&gt;#include &lt;map&gt;#include &lt;vector&gt;#include &lt;algorithm&gt;using namespace std;typedef long long...