Submission #8091327


Source Code Expand

#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define rep(x, a, b) for(int x = (a); x <= (b); ++x)
#define rop(x, a, b) for(int x = (a); x < (b); ++x)
#define per(x, a, b) for(int x = (a); x >= (b); --x)
using namespace std;
typedef long long LL;
typedef double DB;
LL n, x, as;
LL work(LL a, LL b) {
	if(a > b) swap(a, b);
	if(a == 0) return -1;
	return work(a, b % a) + b / a * 2 * a;
}
int main() {
	cin >> n >> x;
	as += n;
	if(x + x <= n) as += x;
	else as += n - x;
	if(x + x != n) as += x;
	if(x + x < n) as += work(x, n - x - x);
	if(x + x > n) as += work(x - (n - x), n - x);
	cout << as << endl;
	return 0;
}

Submission Info

Submission Time
Task A - BBQ Easy
User Smeow
Language C++ (GCC 5.4.1)
Score 0
Code Size 694 Byte
Status RE
Exec Time 321 ms
Memory 262400 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
AC × 1
RE × 1
AC × 3
WA × 5
RE × 4
Set Name Test Cases
Sample sample-01.txt, sample-02.txt
All sample-01.txt, sample-02.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, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt RE 312 ms 262400 KB
01-02.txt WA 1 ms 256 KB
01-03.txt WA 1 ms 256 KB
01-04.txt WA 1 ms 256 KB
01-05.txt RE 321 ms 262400 KB
01-06.txt WA 1 ms 256 KB
01-07.txt WA 1 ms 256 KB
01-08.txt AC 1 ms 256 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt RE 308 ms 262400 KB