cltt - 博客园

ACM-ICPC 2018 南京赛区网络预赛 B. The writing on the wall

摘要： Feeling hungry, a cute hamster decides to order some take-away food (like fried chicken for only 3030 Yuan). However, his owner CXY thinks that take-a 阅读全文

posted @ 2018-09-07 23:32 cltt 阅读(219) 评论(0) 推荐(0)

ACM-ICPC 2018 南京赛区网络预赛 J. Sum

摘要： A square-free integer is an integer which is indivisible by any square number except 1. For example, 6 = 2 * 3,6=2*3 is square-free, but 12 = 2^2 * 3, 阅读全文

posted @ 2018-09-06 23:02 cltt 阅读(172) 评论(0) 推荐(0)

法里数列

摘要：题意：给个小数p(0<=p<1)，求差值与其最小的不可约分分数且分母不能超过n。阅读全文

posted @ 2018-09-06 21:58 cltt 阅读(333) 评论(0) 推荐(0)

ACM-ICPC 2018 南京赛区网络预赛 L. Magical Girl Haze

摘要： 262144K There are NN cities in the country, and MM directional roads from uu to v(1\le u, v\le n)v(1≤u,v≤n). Every road has a distance c_ici. Haze is 阅读全文

posted @ 2018-09-04 21:21 cltt 阅读(225) 评论(0) 推荐(1)

状压dp

摘要： //Poj 3254 Corn Fields Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 20258 Accepted: 10633 Description Farmer John has purchased a lush n 阅读全文

posted @ 2018-09-01 21:33 cltt 阅读(284) 评论(0) 推荐(0)

GYM 101350 G

摘要： G. Snake Rana time limit per test 4.0 s memory limit per test 256 MB input standard input output standard output G. Snake Rana time limit per test 4.0 阅读全文

posted @ 2018-09-01 19:38 cltt 阅读(294) 评论(0) 推荐(0)

Wannafly挑战赛23 A 字符串

摘要：题目描述小N现在有一个字符串S。他把这这个字符串的所有子串都挑了出来。一个S的子串T是合法的，当且仅当T中包含了所有的小写字母。小N希望知道所有的合法的S的子串中，长度最短是多少。输入描述: 一行一个字符串S。只包含小写字母。S的长度不超过106. 输出描述: 一行一个数字，代表最短长度。数据保阅读全文

posted @ 2018-08-31 22:52 cltt 阅读(294) 评论(0) 推荐(0)

基础

摘要： vector :push_back priority_queue<int,vector<int>,greater<int> >q2; //top 队首最小阅读全文

posted @ 2018-08-31 00:51 cltt 阅读(161) 评论(0) 推荐(0)

ACM Changchun 2015 A. Too Rich

摘要： You are a rich person, and you think your wallet is too heavy and full now. So you want to give me some money by buying a lovely pusheen sticker which 阅读全文

posted @ 2018-08-30 21:05 cltt 阅读(251) 评论(0) 推荐(0)

最大子串和

摘要： Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1≤i≤j≤K. T 阅读全文

posted @ 2018-08-30 14:43 cltt 阅读(178) 评论(0) 推荐(0)