AtCoder Beginner Contest 008

Submission #7474185

Source codeソースコード

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.util.*;
 
public class Main  {
	static long mod=1000000000+7;
	public static void main(String[] args){
		PrintWriter out = new PrintWriter(System.out);
		InputReader sc=new InputReader(System.in);
		int N=sc.nextInt();
		int[] C=sc.nextIntArray(N);
		double ans=0;
		for (int i = 0; i < C.length; i++) {
			double s=0;
			for (int j = 0; j < C.length; j++) {
				if (i==j) {
					continue;
				}
				if (C[i]%C[j]==0) {
					s++;
				}
			}
			if (s%2==0) {
				ans+=(s+2.0)/(2.0*s+2.0);
			}
			else {
				ans+=1.0/2.0;
			}
		}
		System.out.println(ans);
	}
	static class InputReader { 
		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;
 
		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}
 
		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}
 
		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}
 
		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}
 
		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}
 
		public boolean hasNext() {
			skip();
			return hasNextByte();
		}
 
		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}
 
		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		public double nextDouble() {
			return Double.parseDouble(next());
		}
 
		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}
 
		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}
 
		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}
}

Submission

Task問題 C - コイン
User nameユーザ名 bouperson
Created time投稿日時
Language言語 Java8 (OpenJDK 1.8.0)
Status状態 AC
Score得点 100
Source lengthソースコード長 3386 Byte
File nameファイル名
Exec time実行時間 74 ms
Memory usageメモリ使用量 23124 KB

Test case

Set

Set name Score得点 / Max score Cases
Sample - sample_01.txt,sample_02.txt,sample_03.txt
Subtask1 99 / 99 subtask1_01.txt,subtask1_02.txt,subtask1_03.txt,subtask1_04.txt,subtask1_05.txt,subtask1_06.txt,subtask1_07.txt,subtask1_08.txt,subtask1_09.txt,subtask1_10.txt,subtask1_11.txt,subtask1_12.txt,subtask1_13.txt,subtask1_14.txt,subtask1_15.txt,subtask1_16.txt,subtask1_17.txt,subtask1_18.txt,subtask1_19.txt,subtask1_20.txt
Subtask2 1 / 1 subtask1_01.txt,subtask1_02.txt,subtask1_03.txt,subtask1_04.txt,subtask1_05.txt,subtask1_06.txt,subtask1_07.txt,subtask1_08.txt,subtask1_09.txt,subtask1_10.txt,subtask1_11.txt,subtask1_12.txt,subtask1_13.txt,subtask1_14.txt,subtask1_15.txt,subtask1_16.txt,subtask1_17.txt,subtask1_18.txt,subtask1_19.txt,subtask1_20.txt,subtask2_01.txt,subtask2_02.txt,subtask2_03.txt,subtask2_04.txt,subtask2_05.txt,subtask2_06.txt,subtask2_07.txt,subtask2_08.txt,subtask2_09.txt,subtask2_10.txt,subtask2_11.txt,subtask2_12.txt,subtask2_13.txt,subtask2_14.txt,subtask2_15.txt,subtask2_16.txt,subtask2_17.txt,subtask2_18.txt,subtask2_19.txt,subtask2_20.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
sample_01.txt AC 71 ms 19924 KB
sample_02.txt AC 70 ms 21204 KB
sample_03.txt AC 71 ms 18260 KB
subtask1_01.txt AC 70 ms 18132 KB
subtask1_02.txt AC 72 ms 20692 KB
subtask1_03.txt AC 71 ms 20436 KB
subtask1_04.txt AC 69 ms 19284 KB
subtask1_05.txt AC 69 ms 18516 KB
subtask1_06.txt AC 71 ms 23124 KB
subtask1_07.txt AC 70 ms 19540 KB
subtask1_08.txt AC 71 ms 21204 KB
subtask1_09.txt AC 71 ms 19028 KB
subtask1_10.txt AC 71 ms 16212 KB
subtask1_11.txt AC 73 ms 20820 KB
subtask1_12.txt AC 70 ms 21204 KB
subtask1_13.txt AC 74 ms 21844 KB
subtask1_14.txt AC 72 ms 20564 KB
subtask1_15.txt AC 71 ms 20052 KB
subtask1_16.txt AC 71 ms 21076 KB
subtask1_17.txt AC 70 ms 17492 KB
subtask1_18.txt AC 72 ms 20564 KB
subtask1_19.txt AC 71 ms 21076 KB
subtask1_20.txt AC 70 ms 20692 KB
subtask2_01.txt AC 70 ms 20436 KB
subtask2_02.txt AC 73 ms 20820 KB
subtask2_03.txt AC 69 ms 21332 KB
subtask2_04.txt AC 70 ms 17748 KB
subtask2_05.txt AC 71 ms 21076 KB
subtask2_06.txt AC 71 ms 21076 KB
subtask2_07.txt AC 71 ms 19796 KB
subtask2_08.txt AC 71 ms 19156 KB
subtask2_09.txt AC 71 ms 17364 KB
subtask2_10.txt AC 73 ms 19924 KB
subtask2_11.txt AC 70 ms 18644 KB
subtask2_12.txt AC 72 ms 21076 KB
subtask2_13.txt AC 72 ms 18772 KB
subtask2_14.txt AC 73 ms 18900 KB
subtask2_15.txt AC 72 ms 18516 KB
subtask2_16.txt AC 72 ms 19412 KB
subtask2_17.txt AC 74 ms 18900 KB
subtask2_18.txt AC 73 ms 19028 KB
subtask2_19.txt AC 72 ms 19540 KB
subtask2_20.txt AC 71 ms 18772 KB