枚举
绝尘花遗落
一骑红尘妃子笑,无人知是荔枝来
展开
-
Manthan, Codefest 16 -C. Spy Syndrome 2
time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard outputAfter observing the results of Spy Syndrome, Yash realised the errors of his w原创 2016-03-03 15:42:16 · 693 阅读 · 0 评论 -
Topcoder SRM 636 Div2 B
题意:定义一种数叫做”sortedness”,对于数组中下标i<j的数,其中a[i]<a[j]的对数数组中下标i<j的数,其中a[i]<a[j]的对数,给你一个长度为数组,数组中的数的大小为0∼n0\sim n,数组中0表示对应得位置没有数,求在在没有数的地方将缺失的数填上使得数组的sortedness 的大小等于给定的sortedness的方案数。同时保证在一个数组中0的个数不会超过5个。思路:由原创 2016-06-02 21:23:22 · 468 阅读 · 0 评论 -
Topcoder SRM 636 Div1 A
题意:这个题意和Div2的C题的题意一样只不过数据更少,估计暴力可过。#include <bits/stdc++.h>using namespace std;class ChocolateDividingEasy{ public : int sum[55][55]; int num[4][55]; int n,m; int ans ; bool Judge(i原创 2016-06-03 13:35:15 · 309 阅读 · 0 评论 -
Topcoder SRM 636 Div1 B
题意:给你一个矩阵,矩阵中有’.’和’#’,’.’表示空闲的地方,’#’表示非空闲的地方,现在有r个机器人,在空闲的地方等概率的选择一个空闲的地方。现在定义他们之间的关系,对于一个机器人,他和距离他最近的机器人有一条边,如果距离相等,那么选择列坐标小的,如果还相等,选择行坐标小的。所谓的距离为他们之间的欧几里得距离。对于选定位置的机器人,会形成r条边r个点的有向图,那么问在这些可能形成的图中连通分量原创 2016-06-03 16:44:11 · 419 阅读 · 0 评论 -
Topcoder 639 Div2
A题意:喂养宠物,给你两个宠物的喂养的初始的时间,喂养的次数和喂养的时间间隔。判断喂养两个宠物是不是有冲突,即两个宠物的喂养的时间是一样的,如果有返回”Difficult“,否则返回“Easy”。思路:暴力计算即可。#include <bits/stdc++.h>using namespace std;class ElectronicPetEasy{ public: string原创 2016-06-20 11:32:09 · 423 阅读 · 0 评论 -
2016 Multi-University Training Contest3
HDU【5752】——Sqrt Bo Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Problem DescriptionLet’s define the function f(n)=|n√|f(n)=|\sqrt{n}|.Bo wanted to know the mini原创 2016-07-27 15:27:16 · 1551 阅读 · 4 评论 -
数论刷题-uva【10168】- Summation of Four Primes
Euler proved in one of his classic theorems that prime numbers are infinite in number. But can every number be expressed as a summation of four positive primes? I don’t know the answer. May be you ca原创 2016-07-18 21:15:13 · 690 阅读 · 0 评论 -
Coderforces 354Div2
A. Nicholas and Permutation time limit per test:1 second memory limit per test:256 megabytesNicholas has an array a that contains n distinct integers from 1 to n. In other words, Nicholas has a per原创 2016-06-23 13:25:25 · 622 阅读 · 0 评论 -
Codeforces 363 Div2
A. Launch of Collider time limit per test 2 seconds memory limit per test 256 megabytesThere will be a launch of a new, powerful and unusual collider very soon, which located along a straight l原创 2016-07-20 09:31:55 · 1295 阅读 · 0 评论