Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define ul unsigned long long int
- ul findlcm(vector<ul> salaries, ul size)
- {
- ul lcm = salaries[0];
- for (int i = 1; i < size; i++)
- {
- lcm = (((salaries[i] * lcm)) /
- (gcd(salaries[i], lcm)));
- }
- return lcm;
- }
- int main()
- {
- int t;
- cin >> t;
- while (t--)
- {
- ul size, startingSalary;
- cin >> size >> startingSalary;
- vector<ul> salaries;
- for (ul i = 0; i < size; i++)
- {
- int temp;
- cin >> temp;
- salaries.push_back(temp);
- }
- salaries.push_back(startingSalary);
- ul common = findlcm(salaries, size + 1);
- cout << (common / startingSalary) - 1 << endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement