03 2015 档案

Codeforces Round #297 (Div. 2)
摘要：E. Anya and Cubestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnya loves to fold and stick. T... 阅读全文

posted @ 2015-03-27 16:45 _log__ 阅读(129) 评论(0) 推荐(0) 编辑

uvalive 6303 Smartphone Manufacturing
摘要：思路：类似背包，直接搞#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define u64 unsigned lo... 阅读全文

posted @ 2015-03-20 23:41 _log__ 阅读(153) 评论(0) 推荐(0) 编辑

Uvalive 6302 Star Travel
摘要：思路：把所有最短路找出来，然后跑一次就好了。把所有最短路找出来大概就是，把边反向，然后从e跑最短路。然后正向从s跑最短路。然后从s开始，每次跟着最短路（字典序最小）走。判断一条边是不是最短路，也就是dis[u]+d[v]+hehe=D#include#include#include#include#... 阅读全文

posted @ 2015-03-20 23:40 _log__ 阅读(162) 评论(0) 推荐(0) 编辑

UVALIVE 6301 The Shortcut Eight-Puzzle
摘要：思路：使用A*算法的搜索#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define u64 unsigned l... 阅读全文

posted @ 2015-03-20 23:33 _log__ 阅读(208) 评论(0) 推荐(0) 编辑

uvalive 6300 Signed Binary Representation of Integers
摘要：6300 Signed Binary Representation of IntegersComputing ax mod n for large integers x and n is the most time-consuming process in most public-keycrypto... 阅读全文

posted @ 2015-03-20 23:30 _log__ 阅读(160) 评论(0) 推荐(0) 编辑

第四届福建省大学生程序设计竞赛
摘要：FZU2140 Forever 0.5题意：构造一些点使得满足一些条件思路：把1个点放在（0,0）然后n-1点平均分在60度的圆弧上，这样也就是有n-1对点距离为1.0因为是60°所以n-1里面有一对点距离是1.0#include#include#include#include#include#in... 阅读全文

posted @ 2015-03-16 22:52 _log__ 阅读(180) 评论(0) 推荐(0) 编辑