模拟
文章平均质量分 78
GKHack
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #259 (Div. 2) 454A Little Pony and Crystal Mine(模拟)
A. Little Pony and Crystal Minetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwilight Sparkle once got a原创 2015-08-29 13:54:22 · 986 阅读 · 0 评论 -
Codeforces Round #Pi (Div. 2)567A Lineland Mail(模拟)
A. Lineland Mailtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAll cities of Lineland are located on the原创 2015-08-06 10:41:24 · 1285 阅读 · 0 评论 -
NOJ2106 6_多项式输出(模拟)
题目链接:NOJ2106类型:模拟水题AC代码:#include #include #include #include using namespace std;int main(){ //freopen("in.txt", "r+", stdin); //freopen("out.txt", "w", stdout); int n, a[100原创 2015-05-31 11:51:16 · 1098 阅读 · 0 评论 -
Codeforces Round #200 (Div. 2)344C Rational Resistance(模拟)
C. Rational Resistancetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMad scientist Mike is building a time原创 2015-08-13 09:50:36 · 1212 阅读 · 0 评论 -
NOJ2101 7_密码强度(模拟)
题目链接:NOJ2101类型:模拟水题AC代码:#include #include #include #include using namespace std;int main(){// freopen("in.txt", "r+", stdin);// freopen("out.txt", "w", stdout); char s[1000];原创 2015-05-31 11:50:25 · 1073 阅读 · 0 评论 -
NOJ1008 第几天(模拟)
第几天时间限制(普通/Java) : 1000 MS/ 3000 MS 运行内存限制 : 65536 KByte总提交 : 2380 测试通过 : 696 比赛描述在我们现在使用的日历中, 闰年被定义为能被4整除的年份,但是能被100整除而不能被400整除的年是例外,它们不是闰年。例如:1700, 1800, 1900 和 2100不原创 2015-08-14 00:19:44 · 986 阅读 · 0 评论 -
Codeforces Round #325 (Div. 2) 586ABC题解
题目链接:点击打开链接A: 给出Alena的课表, 1代表有课, 0代表没课, 2个连续0以上可以回家休息, 问你一天在学校待多久.直接模拟即可, 可以直接计算1, 101的数目. 我记录了开头的1和结尾的1, 然后减去2个连续0以上的个数就是答案.AC代码:#include "iostream"#include "cstdio"#include "cstring"#原创 2015-10-21 23:53:09 · 1597 阅读 · 0 评论 -
Codeforces Round #326 (Div. 2) 588ABC题解
题目链接:点击打开链接A: 给出n天的需求和肉的价格, 问你满足每天的需求需要花费的最少买肉价格是多少.脑洞题目, 因为肉价格是已知的, 所以对每个上升的子序列需求求和, 乘以最低价格, 然后累加起来就是答案.AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"原创 2015-10-22 00:54:41 · 1116 阅读 · 0 评论 -
Codeforces Round #327 (Div. 2) 591ABC题解
题目链接:点击打开链接A: 两个人在两端相向而行, 第一次碰面后掉头, 到端点后又掉头, 问第二次碰面时候距离左端点的距离.脑洞题目, 第二次和第一次碰面在同一个地方, 要求精度在1e-4以内, 输出5位小数即可.AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm原创 2015-11-09 23:48:27 · 1057 阅读 · 0 评论 -
Codeforces Round #330 (Div. 2) 595AB题解
题目链接: 点击打开链接A: 有n层楼, 每层有2 * m个窗户, 每家有2个窗户, 任何一个窗户亮说明这家还未休息, 问你有几家没有休息.模拟题, 每层楼两个两个窗户遍历一次即可.AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespac原创 2015-11-10 09:20:46 · 1183 阅读 · 0 评论 -
Codeforces Round #328 (Div. 2) 592ABC题解
题目链接:A: 给出8*8的一个棋盘, W为A的棋子, B为B的棋子. 每个棋子只能向上或者向下走, 且不能覆盖或者跳跃棋子, 问你最终谁获胜.模拟题, 遍历每一列, 记录最考上的W以及最靠下的B的位置.AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"usi原创 2015-11-10 00:43:21 · 1113 阅读 · 0 评论 -
Codeforces Round #329 (Div. 2) 593AB题解
题目链接: 点击打开链接A: 给出n个字符串, 要求从中挑选数个字符串构成一个长串最长, 该长串又一个或两个字母组成.模拟题, 遍历n个字符串, 每次遍历通过两个字符a, b判断该字符串是否由一个或两个字母组成, 若是则数组中加上此字符串长度. 最终求最大长度时, 如果字母相同, 则此时长度为dp[i][j]一半.AC代码:#include "iostream"#in原创 2015-11-10 00:07:51 · 927 阅读 · 0 评论 -
Codeforces Round #315 (Div. 2)569A Music(模拟)
Little Lesha loves listening to music via his smartphone. But the smartphone doesn't have much memory, so Lesha listens to his favorite songs in a well-known social network InTalk.Unfortunat原创 2015-08-11 09:21:52 · 126 阅读 · 0 评论 -
Openjudge6039 大师兄,师傅被妖怪抓走啦(模拟)
总时间限制: 1000ms 内存限制: 65536kB描述孙悟空听到沙僧大喊一句:“大师兄,师傅被妖怪抓走啦!”于是孙悟空直追白骨精而去。孙悟空在一条长度为L的森林小路上飞奔,上面有L+1个整点,依次为0,1,2……L。白骨精会使用一种大范围的攻击法术,产生N个能量球,其中第i个能量球的能量值为f[i],落在小路的整点k[i]上。当孙悟空的位置离能量球i的距离为s时,会受到f[i]-s的伤原创 2015-08-05 20:00:12 · 1215 阅读 · 0 评论 -
Openjudge2984 十六进制转十进制(模拟)
总时间限制: 1000ms 内存限制: 65536kB描述将十六进制数转换成十进制数输入第一行有一个整数T,表示共有T组数据接下来T行,每一行为一个16进制无符号正整数,位数不超过8位,数中的a-f均为大写字母,数前没有多余的0输出输出共T行,每一行是一组数据的十进制表示,数字前不得有多余的0。十进制数小于2^31样例输入4AFFFFE10001原创 2015-08-05 16:22:27 · 1306 阅读 · 0 评论 -
BestCoder Round #58 (div.2) HDOJ5494 5495 5496 5497题解
题目连接: 点击打开链接A: 模拟题, 从小到大排序后求a的前m个和与b的后m个和作比较即可.AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespace std;const int MAXN = 505;int n, m, a[MAXN]原创 2015-11-15 13:09:28 · 1054 阅读 · 0 评论 -
Codeforces Round #332 (Div. 2) 599A Patrick and Shopping(模拟)
A. Patrick and Shoppingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputToday Patrick waits for a visit from原创 2015-11-23 10:28:48 · 895 阅读 · 0 评论 -
Codeforces Round #335 (Div. 2) 606B Testing Robots(模拟)
B. Testing Robotstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Cybernetics Failures (CF) organisatio原创 2015-12-11 16:58:10 · 1123 阅读 · 0 评论 -
Codeforces Round #249 (Div. 2)453C Cardiogram(模拟)
C. Cardiogramtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn this problem, your task is to use ASCII gra原创 2015-08-22 10:29:31 · 984 阅读 · 0 评论 -
NOJ1013 三角形判断(模拟)
三角形判断时间限制(普通/Java) : 1000 MS/ 3000 MS 运行内存限制 : 65536 KByte总提交 : 2731 测试通过 : 453 比赛描述给定三条边的长度,判断能否组成三角形,如果可以,判断三角形的形状。输入一组数据,每行三个实数,在(0,10]之间,精确到小数点后第四位。最后以0原创 2015-08-14 00:26:38 · 1259 阅读 · 0 评论 -
Codeforces Round #250 (Div. 2) 437A The Child and Homework(模拟)
A. The Child and Homeworktime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOnce upon a time a child got a tes原创 2015-08-31 20:19:50 · 1422 阅读 · 0 评论 -
HDOJ5131 Song Jiang's rank list(模拟)
Song Jiang's rank listTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 699 Accepted Submission(s): 350Problem Description《Sh原创 2015-08-29 20:25:17 · 768 阅读 · 0 评论 -
HDOJ5477 A Sweet Journey(模拟)
题目链接:点击打开链接t组样例,每组包含n, a, b, l。接下来n行有n个区间,代表沼泽区间,其余为平地区间。沼泽上每米消耗a点体力,平地上每米恢复b点体力,总长区间为0 - l。ed纪录每个区间的右值,x纪录这个区间需要的体力,扫一次即可。AC代码:#include "iostream"#include "cstdio"#include "cs原创 2015-09-27 01:18:53 · 1045 阅读 · 0 评论 -
HDOJ1717 小数化分数2(模拟)
小数化分数2Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3923 Accepted Submission(s): 1592Problem DescriptionRay 在数学课上听老师说,任何小数都原创 2015-09-16 23:14:51 · 3504 阅读 · 0 评论 -
Codeforces Round #321 (Div. 2) 580A Kefa and First Steps(模拟)
题目链接:问你最长不下降子序列的长度是多少,这题都能错,sign..for循环扫一次 记录答案即可。AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespace std;const int MAXN = 1e5 + 5;原创 2015-09-23 09:10:35 · 1088 阅读 · 0 评论 -
HDOJ1002 A + B Problem II(大数)
题目链接:简单的A + B,但是题目中给的数据不超过1000位,爆long long。java大数写法:import java.util.*;import java.io.*;import java.math.BigInteger;public class Main { public static void main(String[] args) { Sc原创 2015-09-25 22:43:52 · 1028 阅读 · 0 评论 -
HDOJ5455 Fang Fang(模拟)
Fang FangTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 159 Accepted Submission(s): 81Problem DescriptionFang Fang says she原创 2015-09-19 19:19:34 · 1113 阅读 · 0 评论 -
BestCoder Round #54 (div.2) HDOJ 5429 Geometric Progression(模拟)
Geometric ProgressionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 316 Accepted Submission(s): 86Problem DescriptionDetermi原创 2015-09-06 01:43:44 · 1154 阅读 · 0 评论 -
HDOJ5122 K.Bro Sorting(树状数组 & 模拟)
K.Bro SortingTime Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 1101 Accepted Submission(s): 492Problem DescriptionMatt’s frie原创 2015-08-31 10:48:55 · 847 阅读 · 0 评论 -
BestCoder Round #54 (div.2) HDOJ 5427 A problem of sorting(模拟)
A problem of sortingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 240 Accepted Submission(s): 115Problem DescriptionThere a原创 2015-09-05 23:59:38 · 1058 阅读 · 0 评论 -
BestCoder Round #50 (div.2) & HDOJ5364 Search Result(模拟)
InputThere are multiply cases.For each case,there is a single integer n(1In second line,there are n integer a1,a2...an(0 OutputOutput ID of the man who should be punished.If原创 2015-08-09 10:33:55 · 982 阅读 · 0 评论 -
Codeforces Round #316 (Div. 2)570A Elections(模拟)
A. Electionstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe country of Byalechinsk is running elections原创 2015-08-14 02:54:28 · 1038 阅读 · 0 评论 -
Codeforces Round #Pi (Div. 2)567B Berland National Library(模拟)
B. Berland National Librarytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBerland National Library has rec原创 2015-08-06 10:45:39 · 1044 阅读 · 0 评论 -
BestCoder Round #64 (div.2) HDOJ5585 Numbers(模拟)
NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 449 Accepted Submission(s): 280Problem DescriptionThere is a number N.原创 2015-12-03 23:31:30 · 815 阅读 · 0 评论