恭喜首次通过该题，获得 10 金币

#	状态分数	耗时	内存占用

#0	Accepted 5	2ms	376 KiB
#1	Accepted 5	2ms	376 KiB
#2	Accepted 5	2ms	384 KiB
#3	Accepted 5	2ms	376 KiB
#4	Accepted 5	2ms	384 KiB
#5	Accepted 5	2ms	376 KiB
#6	Accepted 5	2ms	376 KiB
#7	Accepted 5	2ms	404 KiB
#8	Accepted 5	2ms	376 KiB
#9	Accepted 5	2ms	376 KiB
#10	Accepted 5	2ms	376 KiB
#11	Accepted 5	2ms	376 KiB
#12	Accepted 5	2ms	376 KiB
#13	Accepted 5	2ms	376 KiB
#14	Accepted 5	2ms	376 KiB
#15	Accepted 5	2ms	376 KiB
#16	Accepted 5	2ms	376 KiB
#17	Accepted 5	2ms	376 KiB
#18	Accepted 5	2ms	376 KiB
#19	Accepted 5	2ms	376 KiB

递交者: Eason
题目: OLDOJP328 求两个自然数M和N的最大公约数
作业: 7.21上午8点半
语言: C++14(O2)
递交时间: 2023-7-22 23:39:22
评测时间: 2023-7-22 23:39:23

分数: 100
总耗时: 33ms
峰值时间: 2ms
峰值内存: 404 KiB

状态

开发

开源
API

支持

Worker 0, 88ms
Powered by Hydro v4.19.1 Community