深搜
dxyinme
这个作者很懒,什么都没留下…
展开
-
[USACO1.5]特殊的质数肋骨
题目描述农民约翰的母牛总是产生最好的肋骨。你能通过农民约翰和美国农业部标记在每根肋骨上的数字认出它们。农民约翰确定他卖给买方的是真正的质数肋骨,是因为从右边开始切下肋骨,每次还剩下的肋骨上的数字都组成一个质数,举例来说: 7 3 3 1 全部肋骨上的数字 7331是质数;三根肋骨 733是质数;二根肋骨 73 是质数;当然,最后一根肋骨 7 也是质数。 7331 被叫做长度 4 的特殊质数。写一个程原创 2017-06-28 09:48:54 · 369 阅读 · 0 评论 -
[codeforces917B]MADMAX
time limit per test : 1 secondmemory limit per test : 256 megabytesAs we all know, Max is the best video game player among her friends. Her friends were so jealous of hers, that they created an actu...原创 2019-07-10 10:39:32 · 384 阅读 · 0 评论 -
[hdu3118]Arbiter
Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Problem DescriptionArbiter is a kind of starship in the StarCraft science-fiction series. The Arbiter-class starship...原创 2019-07-09 18:36:29 · 219 阅读 · 0 评论 -
[codeforces][gym101873]2017-2018 ACM-ICPC German Collegiate Programming Contest (GCPC 2017)
队内训练 6题:CDFGIKC. 有n(n<=1000)n(n<=1000)n(nm(m<=1000)m(m<=1000)m(mT(T<=1000)T(T<=1000)T(Tiii个游乐场的游乐设施耗时tititi,花费pipipi的钱,(1<=ti,pi<=106)(1<=ti,pi<=106)(1X(X<=1000)X(...原创 2018-09-07 12:48:02 · 922 阅读 · 0 评论 -
[POJ1934]Trip
DescriptionAlice and Bob want to go on holiday. Each of them has planned a route, which is a list of cities to be visited in a given order. A route may contain a city more than once. As they want t...原创 2018-08-06 19:52:11 · 516 阅读 · 0 评论 -
[HIT 2018 暑期集训 precontest1]
题目来源: 2017 JUST Programming Contest 4.0 CF:http://codeforces.com/gym/101532 vjudge: https://vjudge.net/contest/238023#overviewA. 给一个序列{an},beauty(l,r)=a[l] &amp;amp; a[l+1] &amp;amp; a[l+2] &amp;amp; … &amp;amp..原创 2018-07-14 19:56:19 · 186 阅读 · 0 评论 -
[POJ2531]Network Saboteur
Time Limit: 2000MS Memory Limit: 65536KDescriptionA university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided t...原创 2018-03-29 09:05:27 · 167 阅读 · 0 评论 -
[洛谷 P1036]选数
题目描述已知 n 个整数 x1,x2,…,xn,以及一个整数 k(k<n)。从 n 个整数中任选 k 个整数相加,可分别得到一系列的和。例如当 n=4,k=3,4 个整数分别为 3,7,12,19 时,可得全部的组合与它们的和为:3+7+12=22 3+7+19=29 7+12+19=38 3+12+19=34。现在,要求你计算出和为素数共有多少种。例如上例,只有一种的和为素原创 2017-06-26 11:58:20 · 2091 阅读 · 0 评论 -
[POJ3321]Apple Tree
Time Limit: 2000MS Memory Limit: 65536KDescriptionThere is an apple tree outside of kaka’s house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been原创 2017-10-28 16:52:41 · 510 阅读 · 0 评论 -
[vijos1755]靶形数独
描述小城和小华都是热爱数学的好学生,最近,他们不约而同地迷上了数独游戏,好胜的他 们想用数独来一比高低。但普通的数独对他们来说都过于简单了,于是他们向 Z博士请教, Z 博士拿出了他最近发明的“靶形数独” ,作为这两个孩子比试的题目。 靶形数独的方格同普通数独一样,在 9 格宽×9 格高的大九宫格中有 9 个 3 格宽×3 格 高的小九宫格(用粗黑色线隔开的) 。在这个大九宫格中,有一原创 2016-09-03 23:48:06 · 340 阅读 · 0 评论 -
[附中OJ]细胞问题
题目描述一矩形阵列由数字0到9组成,数字1到9代表细胞,细胞的定义为沿细胞数字上下左右还是细胞数字则为同一细胞,求给定矩形阵列的细胞个数。如:阵列0234500067 1034560500 2045600671 0000000089 有4个细胞输入第一行 :两个数字M N (1输出一行: 细胞个数。 样例输入4 100234500067103456原创 2017-06-29 14:28:58 · 1061 阅读 · 0 评论 -
[POJ1190]生日蛋糕
题目描述:7月17日是Mr.W的生日,ACM-THU为此要制作一个体积为Nπ的M层生日蛋糕,每层都是一个圆柱体。 设从下往上数第i(1 Ri+1且Hi > Hi+1。由于要在蛋糕上抹奶油,为尽可能节约经费,我们希望蛋糕外表面(最下一层的下底面除外)的面积Q最小。 令Q = Sπ 请编程对给出的N和M,找出蛋糕的制作方案(适当的Ri和Hi的值),使S最小(除Q外,原创 2018-01-24 18:56:28 · 258 阅读 · 0 评论 -
2013-2014 ACM-ICPC Brazil Subregional Programming Contest
A. 题意:给A,B,C三个数,A,B,C ∈ {0,1},如果A,B,C中有一个与其他两个不一样,则输出其标号。不存在则输出’*’ 题解:模拟#include<iostream>#include<cstring>#include<cstdio>#include<cstdlib>#include<algorithm>#include<queue>#define LiangJiaJun原创 2017-09-13 13:51:59 · 723 阅读 · 0 评论 -
[洛谷OJ] [USACO06DEC]牛的野餐Cow Picnic
题目描述The cows are having a picnic! Each of Farmer John’s K (1 ≤ K ≤ 100) cows is grazing in one of N (1 ≤ N ≤ 1,000) pastures, conveniently numbered 1…N. The pastures are connected by M (1 ≤ M ≤ 10,000)原创 2017-07-01 23:32:18 · 450 阅读 · 0 评论 -
[codeforces 508D]Tanya and Password
time limit per test : 2 secondsmemory limit per test : 256 megabytesWhile dad was at work, a little girl Tanya decided to play with dad’s password to his secret database. Dad’s password is a string ...原创 2019-07-17 14:24:32 · 247 阅读 · 0 评论