2017年3月4日

string用scanf读入（节省时间）

摘要： #include #include #include using namespace std; int main() { string a; a.resize(100); //需要预先分配空间 scanf("%s", &a[0]); puts(a.c_str()); return 0; } 阅读全文

posted @ 2017-03-04 15:39 Annetree 阅读(7111) 评论(0) 推荐(0)

2017年2月22日

好用网站

摘要： 1.http://www.bootcss.com/ 前端开发bootstrap开源阅读全文

posted @ 2017-02-22 19:54 Annetree 阅读(93) 评论(0) 推荐(0)

2017年2月18日

ZOJ 2965 Accurately Say "CocaCola"!

摘要： Time Limit: 2 Seconds Memory Limit: 65536 KB In a party held by CocaCola company, several students stand in a circle and play a game. One of them is s 阅读全文

posted @ 2017-02-18 20:10 Annetree 阅读(230) 评论(0) 推荐(0)

2017年2月16日

B - Build The Electric System 求强连通的最小和//lxm

摘要：有n个城市，有m条线路，每条线路a,b,len表示a到b的线路需要花费len的费用维修，要求能将所有城市联通的最小维修花费按照排序排一下然后利用并查集解决阅读全文

posted @ 2017-02-16 14:18 Annetree 阅读(263) 评论(0) 推荐(0)

2017年2月7日

H - 【59】Lazier Salesgirl 模拟//lxm

摘要： Kochiya Sanae is a lazy girl who makes and sells bread. She is an expert at bread making and selling. She can sell the i-th customer a piece of bread 阅读全文

posted @ 2017-02-07 14:59 Annetree 阅读(193) 评论(0) 推荐(0)

2017年2月3日

E - An Awful Problem 求两段时间内满足条件的天数//lxm

摘要： In order to encourage Hiqivenfin to study math, his mother gave him a sweet candy when the day of the month was a prime number. Hiqivenfin was happy w 阅读全文

posted @ 2017-02-03 15:55 Annetree 阅读(267) 评论(0) 推荐(0)

K - Strange Country II 暴力dfs判断有向图是否连通//lxm

摘要： You want to visit a strange country. There are n cities in the country. Cities are numbered from 1 to n. The unique way to travel in the country is ta 阅读全文

posted @ 2017-02-03 15:51 Annetree 阅读(245) 评论(0) 推荐(0)

2017年2月2日

java的大数运算模板

摘要： import java.math.BigInteger; import java.util.Scanner; public class Main { public static void main(String[] args) { // TODO Auto-generated method stub 阅读全文

posted @ 2017-02-02 14:50 Annetree 阅读(190) 评论(0) 推荐(0)

HDU1042N!大数的阶乘java模板

摘要： import java.math.BigInteger; import java.util.Scanner; public class Main{ public static void main(String[] args) { Scanner inputScanner=new Scanner(Sy 阅读全文

posted @ 2017-02-02 13:55 Annetree 阅读(516) 评论(0) 推荐(0)

2017年1月17日

HDU 1588 Gauss Fibonacci(矩阵快速幂)

摘要： Gauss Fibonacci Gauss Fibonacci Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 27 Accepted Submi 阅读全文

posted @ 2017-01-17 13:09 Annetree 阅读(266) 评论(0) 推荐(0)

HDU 1590 Searching（求复数向量和的极限）

摘要： Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 430 Accepted Submission(s): 77 Problem Descriptio 阅读全文

posted @ 2017-01-17 10:33 Annetree 阅读(398) 评论(0) 推荐(0)

HDU 1591 Encoded Love-letter（简单字符串）

摘要： Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1780 Accepted Submission(s): 635 Problem Descript 阅读全文

posted @ 2017-01-17 10:07 Annetree 阅读(249) 评论(0) 推荐(0)

HDU 1592 Half of and a Half（大数）

摘要： Half of and a Half Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1179 Accepted Submission(s): 5 阅读全文

posted @ 2017-01-17 09:57 Annetree 阅读(288) 评论(0) 推荐(0)

HDU 1589 Stars Couple（计算几何求二维平面的最近点对和最远点对）

摘要： Time Limit: 1000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 930 Accepted Submission(s): 200 Problem Descripti 阅读全文

posted @ 2017-01-17 09:24 Annetree 阅读(573) 评论(0) 推荐(0)

2017年1月16日

HDU 3361 ASCII

摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 756 Accepted Submission(s): 382 Problem Descripti 阅读全文

posted @ 2017-01-16 10:39 Annetree 阅读(263) 评论(0) 推荐(0)