
省赛真题
文章平均质量分 75
小坏蛋_千千
im0qianqian_站在回忆的河边看着摇晃的渡船终年无声地摆渡,它们就这样安静地画下黄昏画下清晨......
展开
-
山东省第七届ACM省赛------Memory Leak
Memory LeakTime Limit: 2000MS Memory limit: 131072K题目描述Memory Leak is a well-known kind of bug in C/C++. When a string is longer than expected, it will visit the memory of next array whi原创 2016-06-12 21:51:53 · 1017 阅读 · 0 评论 -
山东省第八届 ACM 省赛 Parity check (规律、水)
Description Fascinated with the computer games, Gabriel even forgets to study. Now she needs to finish her homework, and there is an easy problem: >f(n)=⎧⎩⎨>0,n=0>1,n=1>f(n−1)+f(n−2),n≥2>>> f(n)=原创 2017-05-23 16:27:10 · 698 阅读 · 0 评论 -
山东省第八届 ACM 省赛 quadratic equation (水、坑)
Problem Description With given integers a,b,c, you are asked to judge whether the following statement is true: “For any x, if a⋅x2+b⋅x2+c=0a⋅x^2+b⋅x^2+c=0 , then x is an integer.”Input The first l原创 2017-05-09 18:48:38 · 1067 阅读 · 0 评论 -
山东省第八届 ACM 省赛 sum of power (求和、水)
Problem Description Calculate ∑ni=1im mod (1000000000+7)\sum_{i=1}^ni^m~mod~(1000000000+7) for given n,m.Input Input contains two integers n,m(1≤n≤1000,0≤m≤10).Output Output the answer in a sin原创 2017-05-09 19:04:21 · 783 阅读 · 0 评论 -
山东省第八届 ACM 省赛 company (贪心、水)
Problem Description There are n kinds of goods in the company, with each of them has a inventory of cnti and direct unit benefit vali. Now you find due to price changes, for any goods sold on day i,原创 2017-05-09 19:51:11 · 1375 阅读 · 0 评论 -
山东省第八届 ACM 省赛 CF (01背包、水)
Problem Description LYD loves codeforces since there are many Russian contests. In an contest lasting for T minutes there are n problems, and for the ith problem you can get ai−di∗ti points, where ai原创 2017-05-09 19:30:19 · 1520 阅读 · 0 评论 -
山东省第八届 ACM 省赛 Quadrat (找规律)
Description It is well-known that for any n there are exactly four n-digit numbers (including ones with leading zeros) that are self-squares: the last n digits of the square of such number are equal原创 2017-05-23 15:58:53 · 1084 阅读 · 0 评论 -
山东省第二届 ACM 省赛 Simple Game (Nim+Bash)
Problem Description Here is a simple game. In this game, there are several piles of stones and two players. The two players play in turn. In each turn, one can choose at least one pile and at most th原创 2017-05-03 09:36:25 · 701 阅读 · 0 评论 -
山东省第七届 ACM 省赛 Proxy (最短路)
Problem Description Because of the GFW (Great Firewall), we cannot directly visit many websites, such as Facebook, Twitter, YouTube, etc. But with the help of proxy and proxy server, we can easily ge原创 2017-04-27 09:10:54 · 688 阅读 · 0 评论 -
山东省第六届 ACM 省赛 Stars (尺取法)
Problem Description There are N (1 ≤ N ≤ 400) stars in the sky. And each of them has a unique coordinate (x, y) (1 ≤ x, y ≤ N). Please calculate the minimum area of the rectangle (the edges of the re原创 2017-04-27 17:33:48 · 750 阅读 · 0 评论 -
山东省第七届ACM省赛------Julyed
JulyedTime Limit: 2000MS Memory limit: 65536K题目描述 Julyed is preparing for her CET-6. She has N words to remember, but there is only M days left. If she can’t remember all these words,原创 2016-06-10 21:37:10 · 821 阅读 · 0 评论 -
山东省第七届ACM省赛------Fibonacci
FibonacciTime Limit: 2000MS Memory limit: 131072K题目描述Fibonacci numbers are well-known as follow: Now given an integer N, please find out whether N can be represented as the sum of se原创 2016-06-10 21:43:42 · 839 阅读 · 0 评论 -
山东省第七届ACM省赛------The Binding of Isaac
The Binding of IsaacTime Limit: 2000MS Memory limit: 65536K题目描述Ok, now I will introduce this game to you...Isaac is trapped in a maze which has many common rooms…Li原创 2016-06-10 21:49:25 · 885 阅读 · 0 评论 -
山东省第七届ACM省赛------Triple Nim
Triple NimTime Limit: 2000MS Memory limit: 65536K题目描述Alice and Bob are always playing all kinds of Nim games and Alice always goes first. Here is the rule of Nim game: There are som原创 2016-06-12 21:26:39 · 927 阅读 · 0 评论 -
山东省第七届ACM省赛------Reversed Words
Reversed WordsTime Limit: 2000MS Memory limit: 131072K题目描述Some aliens are learning English. They have a very strange way in writing that they revered every word in the sentence but keep原创 2016-06-12 21:30:11 · 948 阅读 · 0 评论 -
山东省第八届 ACM 省赛 fireworks (组合数+逆元)
Description Hmz likes to play fireworks, especially when they are put regularly. Now he puts some fireworks in a line. This time he put a trigger on each firework. With that trigger, each firewo原创 2017-05-23 16:52:38 · 1027 阅读 · 0 评论