QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#78251#5503. Euclidean AlgorithmCrysflyTL 2ms3324kbC++11924b2023-02-17 14:55:002023-02-17 14:55:03

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-02-17 14:55:03]
  • 评测
  • 测评结果:TL
  • 用时:2ms
  • 内存:3324kb
  • [2023-02-17 14:55:00]
  • 提交

answer

// what is matter? never mind. 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define int long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 800005
#define inf 0x3f3f3f3f

int n;
void work()
{
	n=read();
	int res=0;
	For(i,1,n)
		For(j,i+1,n){
			int g=__gcd(i,j);
			int x=i/g,y=j/g;
			int k=y-x;
			if(k==1 || x%k==1)++res;
		}
	cout<<res<<'\n';
}

signed main()
{
	int T=read();
	while(T--)work();
	return 0;
}
/*

10 17
3 10 31

G 3G 5G 7G 9G
G 2G 3G 4G 5G


4
A
QUERY B
ADD BBABBBBAAB
QUERY B
*/

詳細信息

Test #1:

score: 100
Accepted
time: 2ms
memory: 3324kb

input:

3
2
5
14

output:

1
9
62

result:

ok 3 lines

Test #2:

score: -100
Time Limit Exceeded

input:

3
29107867360
65171672278
41641960535

output:


result: