Submission #811053


Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define REP(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int INF = 1e9;
const double PI = acos(-1.0);

ll func(ll a, ll b, ll sum) {
	ll n = b / a;
	ll ans;
	if(b % a == 0) return (n - 1) * a * 2 + a + sum;
	else ans = n * a * 2 + sum;
	
	return func(b % a, a, ans);
}

int main(void) {
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	ll N, X;
	cin >> N >> X;
	
	ll ans = N;
	if(X < N - X) ans += func(X, N - X, 0);
	else ans += func(N - X, X, 0);
	
	cout << ans << "\n";
	
	return 0;
}

Submission Info

Submission Time
Task B - Mysterious Light
User charolles24
Language C++14 (GCC 5.4.1)
Score 500
Code Size 632 Byte
Status AC
Exec Time 4 ms
Memory 256 KiB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 300 / 300 200 / 200
Status
AC × 1
AC × 10
AC × 19
Set Name Test Cases
Sample sample-01.txt
Subtask sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt
All sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt
Case Name Status Exec Time Memory
01-01.txt AC 4 ms 256 KiB
01-02.txt AC 4 ms 256 KiB
01-03.txt AC 4 ms 256 KiB
01-04.txt AC 4 ms 256 KiB
01-05.txt AC 4 ms 256 KiB
01-06.txt AC 4 ms 256 KiB
01-07.txt AC 4 ms 256 KiB
01-08.txt AC 4 ms 256 KiB
01-09.txt AC 4 ms 256 KiB
02-01.txt AC 4 ms 256 KiB
02-02.txt AC 4 ms 256 KiB
02-03.txt AC 4 ms 256 KiB
02-04.txt AC 4 ms 256 KiB
02-05.txt AC 4 ms 256 KiB
02-06.txt AC 4 ms 256 KiB
02-07.txt AC 4 ms 256 KiB
02-08.txt AC 4 ms 256 KiB
02-09.txt AC 4 ms 256 KiB
sample-01.txt AC 4 ms 256 KiB