Submission #990043


Source Code Expand

#include <string>
#include <iostream>

#include <utility>
#include <algorithm>
#include <array>
#include <vector>
#include <deque>
#include <unordered_map>
#include <unordered_set>

long f (long N, long X) {
  long A = 2 * X * ((N / X) - 1);
  long B = N - X * (N / X);
  if (N % X == 0) {
    return A + X + B;
  }
  return A + X + B + f(X, X - B);
}

int main () {

  std::string line;
  std::getline(std::cin, line);

  char * p;

  p = &line[0];
  long N = std::strtol(p, &p, 0);
  long X = std::strtol(p, &p, 0);

  std::cout << f(N, X) + N - X << std::endl;
}

Submission Info

Submission Time
Task B - Mysterious Light
User toufu12345
Language C++14 (GCC 5.4.1)
Score 0
Code Size 599 Byte
Status WA
Exec Time 2102 ms
Memory 256 KiB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 300 0 / 200
Status
WA × 1
WA × 10
WA × 18
TLE × 1
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 WA 3 ms 256 KiB
01-02.txt WA 3 ms 256 KiB
01-03.txt WA 3 ms 256 KiB
01-04.txt WA 3 ms 256 KiB
01-05.txt WA 3 ms 256 KiB
01-06.txt WA 3 ms 256 KiB
01-07.txt WA 3 ms 256 KiB
01-08.txt WA 2 ms 256 KiB
01-09.txt WA 3 ms 256 KiB
02-01.txt WA 3 ms 256 KiB
02-02.txt TLE 2102 ms 256 KiB
02-03.txt WA 3 ms 256 KiB
02-04.txt WA 2 ms 256 KiB
02-05.txt WA 3 ms 256 KiB
02-06.txt WA 3 ms 256 KiB
02-07.txt WA 3 ms 256 KiB
02-08.txt WA 3 ms 256 KiB
02-09.txt WA 3 ms 256 KiB
sample-01.txt WA 3 ms 256 KiB