码迷,mamicode.com
首页 >  
搜索关键字:time    ( 52982个结果
Linux显示登录Shell信息
Linux显示登录Shell信息 youhaidong@youhaidong-ThinkPad-Edge-E545:~$ finger -p Login Name Tty Idle Login Time Office Office Phone youhaidong youhaidong *:0 Mar 8...
分类:系统相关   时间:2015-03-08 23:03:52    阅读次数:205
HDU3790(比较坑的最短路)
最短路径问题 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 15024    Accepted Submission(s): 4573 Problem Description 给你n个点,m条无向边,每条边都有长...
分类:其他好文   时间:2015-03-08 23:01:59    阅读次数:231
课上作业
随机的三十道计算题因为是小学生所以是两位数的加减乘除运算。随机的加减乘除计算题所以用switch语句。随机的出数用的rand语句。三十道题用的for循环。代码如下:#include "stdafx.h"#include#include#includeint main(){ srand(time(NU...
分类:其他好文   时间:2015-03-08 22:50:07    阅读次数:193
hdu5115 Dire Wolf
Dire Wolf Time Limit: 5000/5000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others) Total Submission(s): 436    Accepted Submission(s): 251 Problem Description Dire wolves, als...
分类:其他好文   时间:2015-03-08 21:37:04    阅读次数:157
(hdu step 5.2.6)确定比赛名次(求入度为0的点的个数)
题目:确定比赛名次Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 338 Accepted Submission(s): 181 Problem Description有N个比赛队(1 Input输入有若干组,每组中的第一行为二个数N(1 Out...
分类:其他好文   时间:2015-03-08 21:34:27    阅读次数:160
HDU 非诚勿扰 队列、(记一次失败的SBT尝试)
非诚勿扰Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 1312Accepted Submission(s): 473 Problem Descr...
分类:其他好文   时间:2015-03-08 21:24:19    阅读次数:161
【置换,推理】UVa 1315 - Creaz tea party
Dsecriptionn participants of «crazy tea party» sit around the table. Each minute one pair of neighbors can change their places. Find the minimum time ...
分类:其他好文   时间:2015-03-08 21:19:43    阅读次数:199
(hdu step 5.2.5)确定比赛名次(求拓扑序列)
题目:确定比赛名次Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 337 Accepted Submission(s): 180 Problem Description有N个比赛队(1 Input输入有若干组,每组中的第一行为二个数N(1 Out...
分类:其他好文   时间:2015-03-08 20:15:40    阅读次数:152
hdu 3661 Assignments 贪心
Problem Description In a factory, there are N workers to finish two types of tasks (A and B). Each type has N tasks. Each task of type A needs xi time to finish, and each task of type B needs yj time to finish, now, you, as the boss of the factory, need to...
分类:其他好文   时间:2015-03-08 18:55:45    阅读次数:193
最强DE 战斗力 【大数】
最强DE 战斗力 Time Limit: 1 Sec  Memory Limit: 128 MB Submit: 86  Solved: 13 [Submit][Status][Web Board] Description 春秋战国时期,赵国地大物博,资源非常丰富,人民安居乐业。但许多国家对它虎视眈眈,准备联合起来对赵国发起一场战争。 显然,面对多个国家的部队去作战,赵国的兵力...
分类:其他好文   时间:2015-03-08 17:16:40    阅读次数:183
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!