/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 328.0 KiB
#2 Accepted 2ms 328.0 KiB
#3 Accepted 8ms 328.0 KiB
#4 Accepted 11ms 544.0 KiB
#5 Accepted 5ms 540.0 KiB
#6 Accepted 57ms 548.0 KiB
#7 Wrong Answer 76ms 540.0 KiB
#8 Time Exceeded ≥1079ms ≥488.0 KiB

Code

/*CODED BY mahmudulsakib2019
  DATE:-06/3/2024;TIME:-07:39 pm
  BANGALDESH , SYLHET*/

#include <iostream>
#include <cmath>     ///mathematics
#include <vector>    ///array
#include <regex>     ///searching_prefix_suffix
#include <algorithm> ///finding_max_min_from_array
#include <string>    ///string_manipulation
#include <numeric>   ///findin total sum of an array
using namespace std;

int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        int a, b;
        cin >> a >> b;
        int count = 0;
        while (a != 0 && b != 0) {
            int step_1 = max(a, b);
            if (step_1 == a) {
                a = a - b;
                count = count + 1;
            } else if (step_1 == b) {
                b = b - a;
                count = count + 1;
            }
        }
        cout << count << endl;
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1029 Make it zero
Contest
Brain booster #2
Language
C++20 (G++ 13.2.0)
Submit At
2024-03-06 16:03:37
Judged At
2024-11-11 03:41:27
Judged By
Score
50
Total Time
≥1079ms
Peak Memory
≥548.0 KiB