Submission #40415475


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a,b;
ll gcd(ll a,ll b) {
	return b?gcd(b,a%b):a;
}
int main() {
	scanf("%lld%lld",&a,&b);
	if(a==b) {
		printf("1\n");
		return 0;
	}
	if(a>b)swap(a,b);
	ll ans=0,d=0;
	while(a) {
		d=gcd(a,b);
		a/=d,b/=d;
		d=b-a;
		if(d==1) {
			ans+=a;
			break;
		}
		ll tmp=d;
		for(ll i=2; i*i<=d; ++i)
			if(d%i==0) {
				if(a%i<a%tmp)tmp=i;
				if(a%(d/i)<a%tmp) tmp=d/i;
			}
		tmp=a%tmp;
		a-=tmp,b-=tmp,ans+=tmp;
	}
	printf("%lld\n",ans);
	return 0;
}

Submission Info

Submission Time
Task B - GCD Subtraction
User mod998244353
Language C++ (GCC 9.2.1)
Score 400
Code Size 550 Byte
Status AC
Exec Time 23 ms
Memory 3748 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:9:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    9 |  scanf("%lld%lld",&a,&b);
      |  ~~~~~^~~~~~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 41
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 02_same_00.txt, 02_same_01.txt, 02_same_02.txt, 02_same_03.txt, 03_max_00.txt, 03_max_01.txt, 03_max_02.txt, 04_max2_00.txt, 04_max2_01.txt, 04_max2_02.txt, 04_max2_03.txt, 04_max2_04.txt, 04_max2_05.txt, 04_max2_06.txt, 04_max2_07.txt, 04_max2_08.txt, 04_max2_09.txt, 05_max3_00.txt, 05_max3_01.txt, 05_max3_02.txt, 05_max3_03.txt, 05_max3_04.txt, 05_max3_05.txt, 05_max3_06.txt, 05_max3_07.txt, 05_max3_08.txt, 05_max3_09.txt, 05_max3_10.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 6 ms 3692 KiB
00_sample_01.txt AC 2 ms 3636 KiB
00_sample_02.txt AC 4 ms 3684 KiB
01_rnd_00.txt AC 5 ms 3624 KiB
01_rnd_01.txt AC 15 ms 3588 KiB
01_rnd_02.txt AC 11 ms 3620 KiB
01_rnd_03.txt AC 13 ms 3620 KiB
01_rnd_04.txt AC 21 ms 3588 KiB
01_rnd_05.txt AC 5 ms 3684 KiB
01_rnd_06.txt AC 12 ms 3616 KiB
01_rnd_07.txt AC 23 ms 3552 KiB
01_rnd_08.txt AC 7 ms 3604 KiB
01_rnd_09.txt AC 6 ms 3612 KiB
02_same_00.txt AC 2 ms 3604 KiB
02_same_01.txt AC 2 ms 3552 KiB
02_same_02.txt AC 2 ms 3628 KiB
02_same_03.txt AC 2 ms 3496 KiB
03_max_00.txt AC 2 ms 3608 KiB
03_max_01.txt AC 1 ms 3748 KiB
03_max_02.txt AC 2 ms 3688 KiB
04_max2_00.txt AC 2 ms 3668 KiB
04_max2_01.txt AC 2 ms 3616 KiB
04_max2_02.txt AC 2 ms 3608 KiB
04_max2_03.txt AC 2 ms 3680 KiB
04_max2_04.txt AC 2 ms 3620 KiB
04_max2_05.txt AC 4 ms 3612 KiB
04_max2_06.txt AC 8 ms 3548 KiB
04_max2_07.txt AC 10 ms 3608 KiB
04_max2_08.txt AC 16 ms 3748 KiB
04_max2_09.txt AC 13 ms 3696 KiB
05_max3_00.txt AC 2 ms 3696 KiB
05_max3_01.txt AC 2 ms 3728 KiB
05_max3_02.txt AC 2 ms 3544 KiB
05_max3_03.txt AC 2 ms 3544 KiB
05_max3_04.txt AC 2 ms 3608 KiB
05_max3_05.txt AC 2 ms 3608 KiB
05_max3_06.txt AC 2 ms 3612 KiB
05_max3_07.txt AC 2 ms 3616 KiB
05_max3_08.txt AC 2 ms 3696 KiB
05_max3_09.txt AC 7 ms 3604 KiB
05_max3_10.txt AC 3 ms 3540 KiB