Submission #1689897
Source Code Expand
using System; using System.Text; using System.Linq; using System.Collections; using System.Collections.Generic; using static System.Console; using static System.Math; namespace NotFounds { public class Program { public static void Main(string[] args) { new Program().Solve(); } public void Solve() { var cin = new MyInputStream(); var n = cin.ReadInt() - 1; var x = cin.ReadLong(); for (int i = 0; i < n; ++i) { var t = cin.ReadLong(); x = Lcm(x, t); } WriteLine(x); } private static void PrintYN(bool b) { //WriteLine(b ? "YES" : "NO"); WriteLine(b ? "Yes" : "No"); } private static string Reverse(string s) { return string.Join("", s.Reverse()); } /// <summary>最大公約数</summary> public static long Gcd(long m, long n) { if (n == 0) return m; return Gcd(n, m % n); } /// <summary>最小公倍数</summary> public static long Lcm(long m, long n) { return m / Gcd(m, n) * n; } } public class MyInputStream { private char separator = ' '; private Queue<string> inputStream; public MyInputStream(char separator = ' ') { this.separator = separator; inputStream = new Queue<string>(); } public string Read() { if (inputStream.Count != 0) return inputStream.Dequeue(); string[] tmp = Console.ReadLine().Split(separator); for (int i = 0; i < tmp.Length; ++i) inputStream.Enqueue(tmp[i]); return inputStream.Dequeue(); } public string ReadLine() { return Console.ReadLine(); } public int ReadInt() { return int.Parse(Read()); } public long ReadLong() { return long.Parse(Read()); } public double ReadDouble() { return double.Parse(Read()); } public string[] ReadStrArray(long N) { var ret = new string[N]; for (long i = 0; i < N; ++i) ret[i] = Read(); return ret;} public int[] ReadIntArray(long N) { var ret = new int[N]; for (long i = 0; i < N; ++i) ret[i] = ReadInt(); return ret;} public long[] ReadLongArray(long N) { var ret = new long[N]; for (long i = 0; i < N; ++i) ret[i] = ReadLong(); return ret;} } }
Submission Info
Submission Time | |
---|---|
Task | C - Multiple Clocks |
User | donguri411 |
Language | C# (Mono 4.6.2.0) |
Score | 300 |
Code Size | 2595 Byte |
Status | AC |
Exec Time | 22 ms |
Memory | 11220 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 22 ms | 11220 KB |
sample_02.txt | AC | 22 ms | 11220 KB |
subtask_1_1.txt | AC | 22 ms | 9172 KB |
subtask_1_10.txt | AC | 22 ms | 11220 KB |
subtask_1_11.txt | AC | 22 ms | 11220 KB |
subtask_1_12.txt | AC | 22 ms | 9172 KB |
subtask_1_13.txt | AC | 22 ms | 11220 KB |
subtask_1_14.txt | AC | 22 ms | 9172 KB |
subtask_1_15.txt | AC | 22 ms | 11220 KB |
subtask_1_2.txt | AC | 22 ms | 11220 KB |
subtask_1_3.txt | AC | 22 ms | 9172 KB |
subtask_1_4.txt | AC | 22 ms | 11220 KB |
subtask_1_5.txt | AC | 22 ms | 9172 KB |
subtask_1_6.txt | AC | 22 ms | 11220 KB |
subtask_1_7.txt | AC | 22 ms | 11220 KB |
subtask_1_8.txt | AC | 22 ms | 11220 KB |
subtask_1_9.txt | AC | 22 ms | 11220 KB |