![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
搜索
neuike
这个作者很懒,什么都没留下…
展开
-
hdu2437
JerboasTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1658 Accepted Submission(s): 444Problem Description Jerboas are s原创 2016-07-10 18:57:35 · 445 阅读 · 0 评论 -
C - 胜利大逃亡(续) HDU - 1429
C - 胜利大逃亡(续) HDU - 1429 #include<cstdio>#include<cstring>#include<queue>using namespace std;int n,m,t;char mp[100][100];struct data{ int x,y; int cost; int sta;}st,en;int dx[]={-1,0,1原创 2016-12-09 12:57:34 · 299 阅读 · 0 评论 -
HDU - 1253
HDU - 1253#include<cstdio>#include<queue>#include<cstring>using namespace std;int a,b,c,t;int mp[57][57][57];struct data{ int x,y,z; int cost; data(){cost=0;} data(int a,int b,in原创 2016-12-07 18:44:01 · 217 阅读 · 0 评论 -
hdu 1043 eight
八数码 逆向dfs打表#include<cstdio>#include<algorithm>#include<cstring>using namespace std;char ss[100];int c[100];struct data{ int a[10]; int loc; int id; int fa; int di; data(){f原创 2016-10-04 14:06:50 · 181 阅读 · 0 评论 -
hiho#1050 : 树中的最长路
1050 : 树中的最长路经典算法。#include<cstdio>#include<algorithm>#include<vector>#include<cstring>using namespace std;int n;const int N=100007;vector<int>ve[N];int dis[N];int vis[N];void dfs(int now,int l原创 2016-09-21 21:25:09 · 277 阅读 · 0 评论 -
文章标题
A. Xor-treetime limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Iahub is very proud of his recent discovery, propagating trees. Right now, he inv原创 2016-07-20 14:50:54 · 170 阅读 · 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 · 272 阅读 · 0 评论 -
A计划hdu2102
A计划 Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatus Description 可怜的fish在一次次被魔王掳走一次次被骑士们救回来之后,而今,不幸的他再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉fish,因为他听信谣言说吃fish的肉也能长生不老。年原创 2016-07-26 09:27:47 · 216 阅读 · 0 评论 -
HDU 2181 哈密顿绕行世界问题
B - 哈密顿绕行世界问题 Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatus Description 一个规则的实心十二面体,它的 20个顶点标出世界著名的20个城市,你从一个城市出发经过每个城市刚好一次后回到出发的城市。 Input 前20行的第i行有3个数,原创 2016-07-25 19:00:09 · 203 阅读 · 0 评论 -
Smallest Difference poj2718
Smallest Difference Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8136 Accepted: 2232 DescriptionGiven a number of distinct decimal digits, you can form one integer by choosing原创 2016-07-24 21:20:54 · 188 阅读 · 0 评论 -
Meteor Showerpoj3669
Meteor Shower Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15192 Accepted: 4003 DescriptionBessie hears that an extraordinary meteor shower is coming; reports say that thes原创 2016-07-24 19:03:44 · 341 阅读 · 0 评论 -
poj1979 Red and Black
A - Red and Black Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%lld & %llu SubmitStatusPracticePOJ 1979 Appoint description: Description There is a rectangular room, covered wit原创 2016-07-24 08:24:37 · 211 阅读 · 0 评论 -
CF 14 problem D - Two paths
D. Two Paths time limit per test2 seconds memory limit per test64 megabytes inputstandard input outputstandard output As you know, Bob’s brother lives in Flatland. In Flatland there are n cities,原创 2016-07-22 13:47:04 · 203 阅读 · 0 评论 -
hdu3095
Eleven puzzleTime Limit: 20000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 616 Accepted Submission(s): 160Problem DescriptionPartychen inv原创 2016-07-10 19:06:30 · 327 阅读 · 0 评论 -
pat L1-006. 连续因子
直接搜索因子。注意题干要求因子的乘积不大于n。输出最小的乘积的因子,即 如果没有连续的因数,那么输出最小的那个因数。代码#include<cstdio>#include<cstring>#include<iostream>#include<cmath>#include<map>#include<string>#include<algorithm>using namespace std;原创 2017-03-23 17:06:55 · 466 阅读 · 0 评论