![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
模拟
neuike
这个作者很懒,什么都没留下…
展开
-
【模拟+思维】hdu5200 Trees
http://acm.hdu.edu.cn/showproblem.php?pid=5200TreesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1285 Accepted Submission(s): 400原创 2015-12-20 17:32:15 · 587 阅读 · 0 评论 -
hdu3029
ScalesTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 512 Accepted Submission(s): 230Problem DescriptionGive you a scale, a g原创 2016-07-10 19:52:34 · 447 阅读 · 0 评论 -
Codeforces Beta Round #94 (Div. 1 Only)String
B. String time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output One day in the IT lesson Anna and Maria learned about the lexicographic order.St原创 2016-07-22 14:11:37 · 307 阅读 · 0 评论 -
Backward Digit Sums POJ3187
Backward Digit Sums Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6223 Accepted: 3602 DescriptionFJ and his cows enjoy playing a mental game. They write down the numbers from 1原创 2016-07-25 10:32:11 · 429 阅读 · 0 评论 -
uva10881
本题目是蚂蚁的相遇问题,蚂蚁相遇以后就反向,输出蚂蚁t秒后的次序。这里用ne数组存下新状态的一切信息。注意交换的次序即可。因为所有蚂蚁的相对位置不变,所以当前的相对位置也不变。num存着所有的新位置的相对次序,即当前ne[i].loc是第几大的数字呢?num里面将这个次序分别存下来order[i]里面则表示 大小顺序序号为i的数据将在第order[i]个输出之后ne数组又依照数原创 2016-06-17 01:04:50 · 286 阅读 · 0 评论 -
Tower of Hanoi CodeForces 392B
B. Tower of Hanoi time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output The Tower of Hanoi is a well-known mathematical puzzle. It consists of th原创 2016-07-20 11:11:22 · 281 阅读 · 0 评论 -
Humidexpoj3299
模拟。 注意输入为很多种情况,TD,TH,DH#include<cstdio>#include<cmath>#include<algorithm>#include<cstring>using namespace std;char s1[100],s2[100];double t,d,h;double a1,a2;double E=2.718281828;int vis[300];v原创 2016-12-02 18:46:52 · 297 阅读 · 0 评论 -
poj3094
模拟#include<cstdio>#include<cmath>#include<algorithm>#include<cstring>using namespace std;char ss[10000];int main(){ while(gets(ss)) { if(ss[0]=='#') break; int原创 2016-12-02 19:01:23 · 202 阅读 · 0 评论 -
poj2196
利用海伦公式由海伦公式得出面积 s=sqrt(p*(p-a)(p-b)(p-c)) p=(a+b+c)/2;由三角形面积公式S=1/2*a*b*sin(C) 和正弦定理a/sin(A)=b/sin(B)=c/sin(C)=d=2*r 得d=a*b*c/2/S; (a,b,c为三边长)周长为d*PI#include<cstdio>#include<cmath>#include<al原创 2016-12-02 19:30:06 · 282 阅读 · 0 评论 -
poj1338
模拟。 注意模拟的方法,记录235分别上一次乘的数字。直接暴力会超时。#include<cstdio>#include<cmath>#include<algorithm>#include<cstring>using namespace std;int a[2000];int n;bool ok(int x){ int flag=1; while(flag) {原创 2016-12-02 19:59:57 · 245 阅读 · 0 评论 -
zoj1105
FatMouse's TourTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 1105Appoint description: System Crawler (2016-04-21)Descripti原创 2016-04-22 17:41:53 · 343 阅读 · 0 评论 -
zoj1099 HTML
HTMLTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 1099DescriptionIf you ever tried to read a html document on a Macinto原创 2016-04-22 09:53:57 · 452 阅读 · 0 评论 -
zoj1086
Octal FractionsTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 1086DescriptionFractions in octal (base 8) notation can be原创 2016-04-21 23:50:41 · 476 阅读 · 0 评论 -
cf Educational Codeforces Round 6 C Pearls in a Row
C. Pearls in a Rowtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n pearls in a row. Let's enume原创 2016-01-22 13:16:05 · 446 阅读 · 0 评论 -
poj 2785
4 Values whose Sum is 0Time Limit: 15000MS Memory Limit: 228000KTotal Submissions: 18686 Accepted: 5546Case Time Limit: 5000MSDescriptionThe SUM problem can原创 2016-01-23 17:04:00 · 219 阅读 · 0 评论 -
Ivan and Powers of Two
Ivan and Powers of TwoTime Limit:500MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionIvan has got an array of n non-negative integers a1, a2, ...原创 2016-03-30 20:32:12 · 359 阅读 · 0 评论 -
OpenJ_Bailian - 3421
EncodingTime Limit: 1000MSMemory Limit: 65536KB64bit IO Format: %I64d & %I64uSubmit StatusDescriptionChip and Dale have devised an encryption method to hide their (writ原创 2016-04-05 21:48:45 · 793 阅读 · 0 评论 -
zoj1115 Digital Roots
Digital RootsTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 1115Appoint description: System Crawler (2016-04-26)Description原创 2016-04-26 21:49:00 · 255 阅读 · 0 评论 -
ZOJ_1122
ZOJ_1122: ClockTime Limit: 2000 MS Memory Limit: 64 MB 64bit IO Format: %lldSubmitted: 1 Accepted: 1[Submit][Status][Web Board]DescriptionYou are given a standard 12-hour clock wi原创 2016-04-26 22:19:21 · 251 阅读 · 0 评论 -
ZOJ_1003
ZOJ_1003: Crashing BalloonTime Limit: 2000 MS Memory Limit: 64 MB 64bit IO Format: %lld[Submit][Status][Web Board]DescriptionOn every June 1st, the Children's Day, there will be a原创 2016-04-27 11:21:00 · 215 阅读 · 0 评论 -
ZOJ_1009
ZOJ_1009: EnigmaTime Limit: 10000 MS Memory Limit: 32 MB 64bit IO Format: %lld[Submit][Status][Web Board]DescriptionIn World War II, Germany once used an electronic encryption mach原创 2016-04-30 12:10:05 · 286 阅读 · 0 评论 -
ZOJ_1016
ZOJ_1016: ParencodingsTime Limit: 2000 MS Memory Limit: 64 MB 64bit IO Format: %lldSubmitted: 0 Accepted: 0[Submit][Status][Web Board]DescriptionLet S = s1 s2 ... s2n be a well-fo原创 2016-04-30 15:25:07 · 242 阅读 · 0 评论 -
L1-043. 阅览室
题目有坑,如果出现了两次借同一本书的操作,那么以后借的一次为开始时间。代码:#include<cstdio>#include<cstring>#include<cmath>int sta[1007];int n;char s[10];int time[1007];using namespace std;int coun,ave;int ca...原创 2018-03-26 20:45:23 · 193 阅读 · 1 评论