結果

問題 No.736 約比
ユーザー YukimotoPGYukimotoPG
提出日時 2019-03-29 23:32:34
言語 Java19
(openjdk 21)
結果
AC  
実行時間 94 ms / 2,000 ms
コード長 3,750 bytes
コンパイル時間 5,466 ms
コンパイル使用メモリ 80,256 KB
実行使用メモリ 55,452 KB
最終ジャッジ日時 2023-08-06 22:24:55
合計ジャッジ時間 10,101 ms
ジャッジサーバーID
(参考情報)
judge14 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 79 ms
51,740 KB
testcase_01 AC 91 ms
52,716 KB
testcase_02 AC 81 ms
53,592 KB
testcase_03 AC 81 ms
53,420 KB
testcase_04 AC 84 ms
53,496 KB
testcase_05 AC 81 ms
53,432 KB
testcase_06 AC 82 ms
52,376 KB
testcase_07 AC 84 ms
52,680 KB
testcase_08 AC 84 ms
53,404 KB
testcase_09 AC 83 ms
53,368 KB
testcase_10 AC 83 ms
53,176 KB
testcase_11 AC 84 ms
53,596 KB
testcase_12 AC 84 ms
54,000 KB
testcase_13 AC 82 ms
53,324 KB
testcase_14 AC 80 ms
52,432 KB
testcase_15 AC 94 ms
53,544 KB
testcase_16 AC 83 ms
53,828 KB
testcase_17 AC 82 ms
53,812 KB
testcase_18 AC 86 ms
55,452 KB
testcase_19 AC 83 ms
52,036 KB
testcase_20 AC 80 ms
53,448 KB
testcase_21 AC 80 ms
53,260 KB
testcase_22 AC 81 ms
53,588 KB
testcase_23 AC 83 ms
53,660 KB
testcase_24 AC 82 ms
51,868 KB
testcase_25 AC 82 ms
52,668 KB
testcase_26 AC 84 ms
52,592 KB
testcase_27 AC 83 ms
52,452 KB
testcase_28 AC 87 ms
53,484 KB
testcase_29 AC 82 ms
53,576 KB
testcase_30 AC 83 ms
52,644 KB
testcase_31 AC 81 ms
53,092 KB
testcase_32 AC 81 ms
52,656 KB
testcase_33 AC 84 ms
53,012 KB
testcase_34 AC 82 ms
53,660 KB
testcase_35 AC 82 ms
53,380 KB
testcase_36 AC 84 ms
52,456 KB
testcase_37 AC 83 ms
53,936 KB
testcase_38 AC 84 ms
52,400 KB
testcase_39 AC 81 ms
53,764 KB
testcase_40 AC 84 ms
53,260 KB
testcase_41 AC 81 ms
53,708 KB
testcase_42 AC 83 ms
53,360 KB
testcase_43 AC 85 ms
53,668 KB
testcase_44 AC 81 ms
52,816 KB
testcase_45 AC 82 ms
53,204 KB
testcase_46 AC 80 ms
53,616 KB
testcase_47 AC 84 ms
52,556 KB
testcase_48 AC 82 ms
53,424 KB
testcase_49 AC 81 ms
52,660 KB
testcase_50 AC 82 ms
52,660 KB
testcase_51 AC 83 ms
53,576 KB
testcase_52 AC 85 ms
53,572 KB
testcase_53 AC 82 ms
53,436 KB
testcase_54 AC 82 ms
53,544 KB
testcase_55 AC 82 ms
53,584 KB
testcase_56 AC 79 ms
53,420 KB
testcase_57 AC 87 ms
53,508 KB
testcase_58 AC 84 ms
53,552 KB
testcase_59 AC 84 ms
53,580 KB
testcase_60 AC 81 ms
52,912 KB
testcase_61 AC 81 ms
53,648 KB
testcase_62 AC 83 ms
53,172 KB
testcase_63 AC 81 ms
52,604 KB
testcase_64 AC 82 ms
52,680 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.util.*;
import java.io.*;

public class Main {

	void solve (FastScanner in, PrintWriter out, Methods ms) {

		int n = in.nextInt();
		long[] a = in.nextLongArray(n);
		long gcd = gcdAll(a);
		
		for (int i=0; i<n; i++) {
			out.print((i==0?"":":")+(a[i]/gcd));
		}
		out.println();
		
	}
	
	static long gcdAll (long[] a) {
		long[] ar = new long[a.length];
		for (int i=0; i<a.length; i++) ar[i] = a[i];
		int t = 1, length = ar.length;
		long temp;
		while (t <= length) {
			for (int i=0; i<length; i+=(t<<1)) {
				if (i+t < length) {
					temp = 0;
					while ((temp=ar[i]%ar[i+t]) != 0) {
						ar[i] = ar[i+t];
						ar[i+t] = temp;
					}
					ar[i] = ar[i+t];
				}
			}
			t = t<<1;
		}
		return ar[0];
	}


	public static void main(String[] args) {
		Main main = new Main();
		FastScanner in = new FastScanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		Methods ms = new Methods();
		main.solve(in, out, ms);
		in.close();
		out.close();
	}

	static class Methods {

		public void print (Object... ar) {System.out.println(Arrays.deepToString(ar));}

		public void yesno (PrintWriter out, boolean b) {out.println(b?"Yes":"No");}

		public void YESNO (PrintWriter out, boolean b) {out.println(b?"YES":"NO");}

		public int max (int... ar) {Arrays.sort(ar); return ar[ar.length-1];}

		public int min (int... ar) {Arrays.sort(ar); return ar[0];}

		public long gcd (long a, long b) {return b>0?gcd(b,a%b):a;}

		public long lcm (long a, long b) {return a/gcd(a,b)*b;}

	}

	static class FastScanner {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private  int length = 0, p = 0;

		public FastScanner (InputStream stream) {
			in = stream;
		}

		public boolean hasNextByte () {
			if (p < length) return true;
			else {
				p = 0;
				try {length = in.read(buffer);}
				catch (Exception e) {e.printStackTrace();}
				if (length <= 0) return false;
			}
			return true;
		}

		public int readByte () {
			if (hasNextByte() == true) return buffer[p++];
			return -1;
		}

		public boolean isPrintable (int n) {return 33<=n&&n<=126;}

		public void skip () {
			while (hasNextByte() && !isPrintable(buffer[p])) p++;
		}

		public boolean hasNext () {skip(); return hasNextByte();}

		public String next () {
			if (!hasNext()) throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int t = readByte();
			while (isPrintable(t)) {
				sb.appendCodePoint(t);
				t = readByte();
			}
			return sb.toString();
		}

		public String[] nextArray (int n) {
			String[] ar = new String[n];
			for (int i=0; i<n; i++) ar[i] = next();
			return ar;
		}

		public int nextInt () {return Math.toIntExact(nextLong());}

		public int[] nextIntArray (int n) {
			int[] ar = new int[n];
			for (int i=0; i<n; i++) ar[i] = nextInt();
			return ar;
		}

		public long nextLong () {
			if (!hasNext()) throw new NoSuchElementException();
			boolean minus = false;
			int temp = readByte();
			if (temp == '-') {
				minus = true;
				temp = readByte();
			}
			if (temp<'0' || '9'<temp) throw new NumberFormatException();
			long n = 0;
			while (isPrintable(temp)) {
				if ('0'<=temp && temp<='9') {
					n *= 10;
					n += temp - '0';
				}
				else throw new NumberFormatException();
				temp = readByte();
			}
			return minus? -n : n;
		}

		public long[] nextLongArray (int n) {
			long[] ar = new long[n];
			for (int i=0; i<n; i++) ar[i] = nextLong();
			return ar;
		}

		public double nextDouble () {
			return Double.parseDouble(next());
		}

		public double[] nextDoubleArray (int n) {
			double[] ar = new double[n];
			for (int i=0; i<n; i++) ar[i] = nextDouble();
			return ar;
		}

		public void close () {
			try {in.close();}
			catch(Exception e){}
		}

	}

}
0