2019年3月19日

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) 编辑

导航