Submission #2558729


Source Code Expand

#include <iostream>
#include <algorithm>
#include <functional>
#include<vector>
#include<math.h>
#include<bitset>
#include<string>
#include<queue>
#include<map>
using namespace std;

int main() {
	int N;
	cin >> N;
	vector<long long int> vec(N);

	

	for (int i = 0; i < N; i++) {
		cin >> vec[i];
	}

	long long int Y = vec[0];

	sort(vec.begin(), vec.end());

	for (int i = 1; i < N; i++) {
		long long int X = vec[i] * Y;
		long long int r = vec[i] % Y;
		if (vec[i] % Y == 0)Y = vec[i];
		else {
			while (r != 0) {
				vec[i] = Y;
				Y = r;
				r = vec[i] % Y;
			}
			Y = X / Y;
		}
		
	}

	cout << Y << endl;

	return 0;
}

Submission Info

Submission Time
Task C - Multiple Clocks
User aoneko
Language C++14 (GCC 5.4.1)
Score 0
Code Size 676 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 8
WA × 9
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
subtask_1_1.txt WA 1 ms 256 KB
subtask_1_10.txt AC 1 ms 256 KB
subtask_1_11.txt AC 1 ms 256 KB
subtask_1_12.txt WA 1 ms 256 KB
subtask_1_13.txt WA 1 ms 256 KB
subtask_1_14.txt WA 1 ms 256 KB
subtask_1_15.txt WA 1 ms 256 KB
subtask_1_2.txt WA 1 ms 256 KB
subtask_1_3.txt WA 1 ms 256 KB
subtask_1_4.txt WA 1 ms 256 KB
subtask_1_5.txt AC 1 ms 256 KB
subtask_1_6.txt AC 1 ms 256 KB
subtask_1_7.txt AC 1 ms 256 KB
subtask_1_8.txt AC 1 ms 256 KB
subtask_1_9.txt WA 1 ms 256 KB