/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 328.0 KiB
#2 Accepted 2ms 540.0 KiB
#3 Accepted 2ms 540.0 KiB
#4 Accepted 2ms 540.0 KiB
#5 Accepted 2ms 480.0 KiB
#6 Accepted 6ms 544.0 KiB
#7 Accepted 6ms 556.0 KiB
#8 Accepted 6ms 552.0 KiB
#9 Accepted 6ms 528.0 KiB
#10 Accepted 6ms 348.0 KiB
#11 Accepted 5ms 516.0 KiB
#12 Accepted 5ms 492.0 KiB

Code

#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 T;
    cin >> T;
    for(int i=0;i<T;i++) {
        long long int a, b, c, X;
        cin >> a >> b >> c >> X;
        long long int GCM = (a*b)/__gcd(a,b);
        GCM = (GCM*c)/__gcd(GCM,c);
        long long int count = ((X-1)/GCM)*GCM;
        if(count == 0){
           cout << -1 << endl;
        }
        else{
          cout << count << endl;
        } 
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1025 GCM
Contest
Brain booster #2
Language
C++20 (G++ 13.2.0)
Submit At
2024-03-06 16:24:00
Judged At
2024-11-11 03:41:19
Judged By
Score
100
Total Time
6ms
Peak Memory
556.0 KiB