海绵的博客

竞赛虐我千百遍,我待竞赛如初恋。 Never Give Up!!!

排序:
默认
按更新时间
按访问量

Problem A.Alkane

Multiple query, for each n, you need to get n i-1 ∑ ∑ [gcd(i + j, i - j) = 1] i=1 j=1 Input On the first line, there is a positive integer T, which...

2018-08-23 15:01:33

阅读数:70

评论数:0

GCD - Extreme (II) UVA - 11426

#include<bits/stdc++.h> using namespace std; #define rep(i,a,b) for(int i=a;i<b;i++) #define per(i,a,b) for(int ...

2018-08-14 22:29:50

阅读数:18

评论数:0

A Research Problem UVA - 10837 (欧拉函数定义)

  原文地址   #include<bits/stdc++.h> using namespace std; typedef long long ll; #define rep(i,a,b) for(int i=a;i<...

2018-08-03 12:52:21

阅读数:28

评论数:0

Trees in a Wood. UVA - 10214 (gcd+欧拉函数)

  #include<bits/stdc++.h> using namespace std; typedef long long ll; /* 1.要统计的点的特点 gcd(x,y)=1 2. (1).怎样快速的统计(x*y)*...

2018-07-17 21:58:00

阅读数:65

评论数:0

A - Mathematically Hard LightOJ - 1007

Mathematically some problems look hard. But with the help of the computer, some problems can be easily solvable. In this problem, you will be gi...

2018-05-07 17:17:38

阅读数:30

评论数:0

Irrelevant Elements UVA - 1635

#include<cstdio> #include<cstring> #include<algorithm> using namespace std; typedef...

2018-04-15 20:02:44

阅读数:28

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭