Fighting_sh - 博客园

Codeforces Round #503 (by SIS, Div. 2)

摘要： Codeforces Round #503 (by SIS, Div. 2) https://codeforces.com/contest/1020 A 1 #include <iostream> 2 #include <cstring> 3 #include <cmath> 4 #include 阅读全文

posted @ 2019-03-22 23:05 Fighting_sh 阅读(183) 评论(0) 推荐(0) 编辑

Codeforces Round #510 (Div. 2)

摘要： Codeforces Round #510 (Div. 2) https://codeforces.com/contest/1042 A 二分 1 #include<iostream> 2 using namespace std; 3 #define lson l,mid,rt<<1 4 #defi 阅读全文

posted @ 2019-03-21 22:14 Fighting_sh 阅读(256) 评论(0) 推荐(0) 编辑

免费送气球

摘要：免费送气球 http://acm.hdu.edu.cn/showproblem.php?pid=6464 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission( 阅读全文

posted @ 2019-03-20 21:40 Fighting_sh 阅读(204) 评论(0) 推荐(0) 编辑

zyb的面试

摘要： zyb的面试 http://acm.hdu.edu.cn/showproblem.php?pid=6468 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission 阅读全文

posted @ 2019-03-20 17:00 Fighting_sh 阅读(273) 评论(0) 推荐(0) 编辑

Codeforces Round #514 (Div. 2)

摘要： Codeforces Round #514 (Div. 2) https://codeforces.com/contest/1059 A 1 #include<bits/stdc++.h> 2 using namespace std; 3 #define lson l,mid,rt<<1 4 #de 阅读全文

posted @ 2019-03-20 12:52 Fighting_sh 阅读(133) 评论(0) 推荐(0) 编辑

Maximum GCD(fgets读入)

摘要： Maximum GCD https://vjudge.net/contest/288520#problem/V Given the N integers, you have to find the maximum GCD (greatest common divisor) of every poss 阅读全文

posted @ 2019-03-19 20:55 Fighting_sh 阅读(158) 评论(0) 推荐(0) 编辑

Harmonic Number(调和级数+欧拉常数)

摘要： Harmonic Number https://vjudge.net/contest/288520#problem/I In mathematics, the nth harmonic number is the sum of the reciprocals of the first n natur 阅读全文

posted @ 2019-03-19 17:31 Fighting_sh 阅读(219) 评论(0) 推荐(0) 编辑

Codeforces Round #516 (Div. 2, by Moscow Team Olympiad)

摘要： Codeforces Round #516 (Div. 2, by Moscow Team Olympiad) https://codeforces.com/contest/1064 A 1 #include<bits/stdc++.h> 2 #define pb push_back 3 using 阅读全文

posted @ 2019-03-19 16:02 Fighting_sh 阅读(267) 评论(0) 推荐(0) 编辑

Sigma Function (平方数与平方数*2的约数和是奇数)

摘要： Sigma Function https://vjudge.net/contest/288520#problem/D Sigma function is an interesting function in Number Theory. It is denoted by the Greek lett 阅读全文

posted @ 2019-03-18 11:56 Fighting_sh 阅读(178) 评论(0) 推荐(0) 编辑

Leading and Trailing （数论）

摘要： Leading and Trailing https://vjudge.net/contest/288520#problem/E You are given two integers: n and k, your task is to find the most significant three 阅读全文

posted @ 2019-03-18 11:19 Fighting_sh 阅读(188) 评论(0) 推荐(0) 编辑