• 等级
  • 174337 访问
  • 262 原创
  • 0 转发
  • 11006 排名
  • 28 评论
  • 13 获赞

Hexo主题Sally 0.10测试版本发布

Demo hexo-theme-sally Hexo主题Sally拥有以下特点: 简介精致的界面设计 功能齐全的个人资料及友链设置 支持Latex公式 护目养眼的代码高亮,清楚的行号标注,多高亮配色支持(后续更新,敬请期待) 多平台支持的响应式设计(后续更新,敬请期待) 典雅清新的界面交互动画(后续更新,敬请期待) 条理清晰的文章目录(后续更新,敬请期待) 一键直达的本地搜索(后续更新...

2019-01-16 19:32:51

2018-2019 ACM-ICPC, Asia East Continent Finals

F. Interstellar … Fantasy Description: Unfortunately, the boy finally got bankrupt. Looking at his receding figure, Rikka understood more about the world — but she is still herself. Though, she still ...

2019-01-06 21:11:28

POJ 1265 Area(计算几何+皮克定理)

Description: Being well known for its highly innovative products, Merck would definitely be a good target for industrial espionage. To protect its brand-new research and development facility the compa...

2019-01-01 18:25:33

CodeForces 559A Gerald's Hexagon(简单几何)

A. Gerald’s Hexagon Description: Gerald got a very curious hexagon for his birthday. The boy found out that all the angles of the hexagon are equal to . Then he measured the length of its sides, and f...

2019-01-01 17:39:00

Educational Codeforces Round 57 (Rated for Div. 2)

A. Find Divisible Description: You are given a range of positive integers from lll to rrr. Find such a pair of integers (x,y)(x, y)(x,y) that l≤x,y≤rl \le x, y \le rl≤x,y≤r, x≠yx \ne yx̸​=y and xxx di...

2018-12-29 20:07:39

Codeforces Round #529 (Div. 3)

A. Repeating Cipher Description: Polycarp loves ciphers. He has invented his own cipher called repeating. Repeating cipher is used for strings. To encrypt the string s=s1s2…sms=s_{1}s_{2} \dots s_{m}s...

2018-12-28 13:01:37

Technocup 2019 - Elimination Round 4

A. Right-Left Cipher Description: Polycarp loves ciphers. He has invented his own cipher called Right-Left. Right-Left cipher is used for strings. To encrypt the string s=s1s2…sns=s_{1}s_{2} \dots s_{...

2018-12-24 13:22:19

CodeForces 794B Cutting Carrot(简单几何)

Description: Igor the analyst has adopted n little bunnies. As we all know, bunnies love carrots. Thus, Igor has bought a carrot to be shared between his bunnies. Igor wants to treat all the bunnies e...

2018-12-22 14:39:27

HDU 1796 How many integers can you find(容斥原理)

Description: Now you get a number N, and a M-integers set, you should find out how many integers which are small than N, that they can divided exactly by any integers in the set. For example, N=12, an...

2018-12-20 19:05:27

AYITOJ ROUND #3

A.TAT Descriptiion: 给定一个字符串s, 问"TAT"是否为s的子串 一个字符串 s 被称作另一个字符串 S 的子串,表示 s 在 S 中出现了。比如,“中出”是“我们中出了一个叛徒”的子串。 注意子串和子序列是不同的:“苹机”是“苹果手机”的子序列,而不是子串。 前缀和后缀是两种特殊的子串:一个前缀在原串的开始位置出现,而一个后缀在原串的末端出现。 例如,“苹果手机”的所有子串...

2018-12-18 20:11:55

NYOJ 42 一笔画问题(欧拉图)

Description: zyc从小就比较喜欢玩一些小游戏,其中就包括画一笔画,他想请你帮他写一个程序,判断一个图是否能够用一笔画下来。 规定,所有的边都只能画一次,不能重复画。 Input: 第一行只有一个正整数N(N<=10)表示测试数据的组数。 每组测试数据的第一行有两个正整数P,Q(P<=1000,Q<=2000),分别表示这个画中有多少个顶点和多少条连线。(点的编号从1...

2018-12-18 14:19:01

CodeForces GYM 102028 2018-2019 ACM-ICPC, Asia Jiaozuo Regional Contest

A. Xu Xiake in Henan Province Description: Shaolin Monastery, also known as the Shaolin Temple, is a Chan (“Zen”) Buddhist temple in Dengfeng County, Henan Province. Believed to have been founded in t...

2018-12-17 21:07:38

洛谷 P3803 【模板】多项式乘法(FFT)

Description: 这是一道FFT模板题 注意:虽然本题开到3s,但是建议程序在1s内可以跑完,本题需要一定程度的常数优化。 给定一个n次多项式F(x),和一个m次多项式G(x)。 请求出F(x)和G(x)的卷积。 Input: 一行2个正整数n,m。 接下来一行n+1个数字,从低到高表示F(x)的系数。 接下来一行m+1个数字,从低到高表示G(x))的系数。 保证输入中的系数大于等于 ...

2018-12-11 15:25:33

洛谷 P2680 运输计划(LCA+树上差分+二分)

Description: 公元204420442044 年,人类进入了宇宙纪元。 L 国有 nnn 个星球,还有 n−1n-1n−1 条双向航道,每条航道建立在两个星球之间,这 n−1n-1n−1 条航道连通了 LLL 国的所有星球。 小 P 掌管一家物流公司, 该公司有很多个运输计划,每个运输计划形如:有一艘物流飞船需要从 uiu_iui​ 号星球沿最快的宇航路径飞行到 viv_ivi​ 号星球...

2018-12-10 22:06:06

洛谷 P3258 [JLOI2014]松鼠的新家(LCA+树上差分)

Description: 松鼠的新家是一棵树,前几天刚刚装修了新家,新家有n个房间,并且有n-1根树枝连接,每个房间都可以相互到达,且俩个房间之间的路线都是唯一的。天哪,他居然真的住在”树“上。 松鼠想邀请小熊维尼前来参观,并且还指定一份参观指南,他希望维尼能够按照他的指南顺序,先去a1,再去a2,…,最后到an,去参观新家。可是这样会导致维尼重复走很多房间,懒惰的维尼不停地推辞。可是松鼠告诉他,...

2018-12-10 13:48:44

洛谷 P3128 [USACO15DEC]最大流Max Flow(LCA+树上差分)

Description: Farmer John has installed a new system of N−1N-1N−1 pipes to transport milk between the NNN stalls in his barn (2≤N≤50,0002 \leq N \leq 50,0002≤N≤50,000), conveniently numbered 1…N1 \ldot...

2018-12-09 19:07:59

LibreOJ #2332. 「JOI 2017 Final」焚风现象(差分数组)

Description: 焚风是是由于空气作绝热下沉运动时,因温度升高湿度降低而形成的一种干热风。焚风常出现在山脉背风坡,由山地引发的过山气流在背风坡下沉,使过山气流变得干热的一种风。在高压区,空气下沉也可产生焚风。 IOI 王国永远刮着海风。风从地点 000 依次吹到地点 111,地点 222 ……直到地点 NNN,共 N+1N+1N+1 个地点。JOI 君住在地点 NNN。地点 000 的...

2018-12-09 17:19:53

洛谷 P1083 借教室(二分+差分数组)

title: 洛谷 P1083 借教室 date: 2018-12-06 21:46:02 tags: DataStructure Description: 在大学期间,经常需要租借教室。大到院系举办活动,小到学习小组自习讨论,都需要向学校申请借教室。教室的大小功能不同,借教室人的身份不同,借教室的手续也不一样。 面对海量租借教室的信息,我们自然希望编程解决这个问题。 我们需要处理接下来nnn天...

2018-12-06 21:57:00

CodeForces GYM 102012 2018-2019 ACM-ICPC, Asia Xuzhou Regional Contest

A. Rikka with Minimum Spanning Trees Description: Hello everyone! I am your old friend Rikka. Welcome to Xuzhou. This is the first problem, which is a problem about the minimum spanning tree (MST). I ...

2018-12-05 18:14:43

Aizu 1309 The Two Men of the Japanese Alps(计算几何+Bfs)

文章地址:http://henuly.top/?p=971 Description: Two experienced climbers are planning a first-ever attempt: they start at two points of the equal altitudes on a mountain range, move back and forth on a sin...

2018-11-30 23:45:32

Tony5t4rk

河南大学ACMer
关注
奖章
  • 持之以恒