剑锋OI SharpSwordOI

≤,≠，≥＜＞ 时间限制：1S / 空间限制：256MB 【在线测试提交传送门】【问题描述】 Given a sequence A with length n,count how many quadruple (a,b,c,d) satisfies: a≠b≠c≠d,1≤a【输入格式】The input consists of multiple test cases. Each t

题目连接： https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1040 Description 给出一个n，求1-n这n个数，同n的最大公约数的和。比如：n = 6 1,2,3,4,5,6 同6的最大公约数分别为1,2,3,2,1,6，加在一起 = 15 Input 1个数N(N O

Codeforces Round #241 (Div. 2) 514C Watto and Mechanism ≤,≠，≥＜＞ 时间限制：1S / 空间限制：256MB 【在线测试提交传送门】【问题描述】 The Holmes children are fighting over who amongst them is the cleverest.Mycroft asked Sh

Codeforces Round #241 (Div. 2) 514C Watto and Mechanism ≤,≠，≥＜＞ 时间限制：1S / 空间限制：256MB 【在线测试提交传送门】【问题描述】 Sherlock met Moriarty for a final battle of wits. He gave him a regular n sided convex p