模拟
文章平均质量分 68
NineFailure
这个作者很懒,什么都没留下…
展开
-
HDU1005
A number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n).InputThe input consists of multiple test原创 2016-06-03 10:52:20 · 295 阅读 · 0 评论 -
CodeForces - 631C(103/600)
Each month Blake gets the report containing main economic indicators of the company “Blake Technologies”. There are n commodities produced by the company. For each of them there is exactly one integer原创 2017-08-29 21:56:46 · 463 阅读 · 0 评论 -
codeforces839B(88/600)
time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Daenerys Targaryen has an army consisting of k groups of soldiers, the i-th group contains a原创 2017-08-13 11:18:42 · 551 阅读 · 0 评论 -
HDU6058 (76/600)
Problem Description Give you an array A[1..n]of length n. Let f(l,r,k) be the k-th largest element of A[l..r].Specially , f(l,r,k)=0 if r−l+1#include<bits/stdc++.h>using namespace std;#define int un原创 2017-08-02 11:04:58 · 380 阅读 · 0 评论 -
CodeForces - 830B(47/600)
Vasily has a deck of cards consisting of n cards. There is an integer on each of the cards, this integer is between 1 and 100 000, inclusive. It is possible that some cards have the same integers on th原创 2017-07-18 11:57:57 · 324 阅读 · 0 评论 -
CodeForces - 705C (16/600)
Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He has only one minor issue: he can’t count the number原创 2017-06-14 19:38:56 · 333 阅读 · 0 评论 -
codeforces 814D(25/600)
The crowdedness of the discotheque would never stop our friends from having fun, but a bit more spaciousness won’t hurt, will it?The discotheque can be seen as an infinite xy-plane, in which there are原创 2017-07-03 21:28:27 · 281 阅读 · 0 评论 -
51NOD 1276(24/600)
有N个岛连在一起形成了一个大的岛屿,如果海平面上升超过某些岛的高度时,则这个岛会被淹没。原本的大岛屿则会分为多个小岛屿,如果海平面一直上升,则所有岛都会被淹没在水下。 给出N个岛的高度。然后有Q个查询,每个查询给出一个海平面的高度H,问当海平面高度达到H时,海上共有多少个岛屿。例如: 岛屿的高度为:{2, 1, 3, 2, 3}, 查询为:{0, 1, 3, 2}。 当海面高度为0时,所有的岛原创 2017-07-03 19:51:04 · 225 阅读 · 0 评论 -
codeforces-816C(19/600)
C. Karen and Game time limit per test2 seconds memory limit per test512 megabytes inputstandard input outputstandard output On the way to school, Karen became fixated on the puzzle game on her pho原创 2017-06-20 17:56:00 · 346 阅读 · 0 评论 -
Codeforces Round #324 (Div. 2)C
C. Marina and Vasya time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Marina loves strings of the same length and Vasya loves when there is a原创 2017-02-13 00:22:22 · 241 阅读 · 0 评论 -
HDU5038 讲道理在一大堆题里真的找不到会的东西的时候就连模拟我也能下的去手..
#include<iostream>#include<queue>#include<algorithm>#include<cstdio>#include<memory.h>#include<string>using namespace std;int tu[100000];int main(){ int T; cin >> T; int u = 0;原创 2016-10-14 00:48:30 · 312 阅读 · 0 评论 -
HDU5024
Problem Description 《Dream of the Red Chamber》(also 《The Story of the Stone》) is one of the Four Great Classical Novels of Chinese literature, and it is commonly regarded as the best one. This novel w原创 2016-10-13 11:02:35 · 329 阅读 · 0 评论 -
HDU1216
水模拟#include<iostream>#include<algorithm>using namespace std;long long s[999999] = { 0 };int main(){ s[0] = 1; s[1] = 1; for (int a = 2;a <= 50000;a++) { if (s[a] == 1)conti原创 2016-07-19 20:28:33 · 349 阅读 · 0 评论 -
HDU1022
十分水,就是模拟模拟就可以了…. 先把这一大堆东西放到两个队列一个栈里,栈就是站点 队列就是火车…. 如果合适就开出去不行就摞上 直到都罗进去站点还是开不动就结束 As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to scho原创 2016-07-14 11:19:37 · 350 阅读 · 0 评论 -
CodeForces - 650A(104/600)
Watchmen are in a danger and Doctor Manhattan together with his friend Daniel Dreiberg should warn them as soon as possible. There are n watchmen on a plane, the i-th watchman is located at point (xi,原创 2017-08-30 14:40:31 · 424 阅读 · 0 评论