Submission #2856095
Source Code Expand
import java.util.List; import java.util.Scanner; public class Main { public static void main(String[] args) { Main main = new Main(); main.run(); } void run() { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int[] A = new int[N]; for (int i = 0; i < N; i++) { A[i] = sc.nextInt(); } int ans=0; for (int i = 0; i < N; i++) { if(A[i]%2==1) { continue; } while(A[i]%2==0) { A[i]=A[i]/2; ++ans; } } System.out.println(ans); } //以下テンプレート public static int[] extgcd(int a, int b) { int x0 = 1; int x1 = 0; int y0 = 0; int y1 = 1; while (b != 0) { int q = a / b; int r = a % b; int x2 = x0 - q * x1; int y2 = y0 - q * y1; a = b; b = r; x0 = x1; x1 = x2; y0 = y1; y1 = y2; } return new int[] { a, x0, y0 }; } static int gcd(int a, int b) { if (b == 0) return a; if (a < b) { int t = a; a = b; b = t; } return gcd(b, a % b); } static int lcm(int a, int b) { return a * b / gcd(a, b); } static void swap(int[] a) { int t; t = a[0]; a[0] = a[1]; a[1] = t; return; } static <T> void output(List<T> list) { for (int i = 0; i < list.size(); i++) { System.out.print(list.get(i)); if (i != list.size() - 1) { System.out.print(" "); } else { nl(); } } } static void output(String[][] str) { for (int i = 0; i < str.length; i++) { for (int j = 0; j < str[i].length; j++) { print(str[i][j]); } nl(); } } static void output(boolean flg, String Yes, String No) { if (flg) { pln(Yes); } else { pln(No); } } static void output(String[][] str, int digit) { String dig = "%" + String.valueOf(digit) + "s"; for (int i = 0; i < str.length; i++) { for (int j = 0; j < str[i].length; j++) { System.out.printf(dig, str[i][j]); } nl(); } } static void pln(String str) { System.out.println(str); } static void pln(int x) { System.out.println(x); } static void print(String str) { System.out.print(str); } static void print(int x) { System.out.print(x); } static void print(String str, int times) { for (int i = 0; i < times; i++) { print(str); } } static void print(int x, int times) { for (int i = 0; i < times; i++) { print(x); } } static void nl() { System.out.println(); } }
Submission Info
Submission Time | |
---|---|
Task | C - *3 or /2 |
User | poporo |
Language | Java8 (OpenJDK 1.8.0) |
Score | 300 |
Code Size | 2573 Byte |
Status | AC |
Exec Time | 225 ms |
Memory | 34212 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, sample_03.txt |
All | in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, sample_01.txt, sample_02.txt, sample_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in01.txt | AC | 202 ms | 31276 KB |
in02.txt | AC | 212 ms | 32200 KB |
in03.txt | AC | 207 ms | 34064 KB |
in04.txt | AC | 199 ms | 31320 KB |
in05.txt | AC | 208 ms | 34212 KB |
in06.txt | AC | 219 ms | 30996 KB |
in07.txt | AC | 201 ms | 31620 KB |
in08.txt | AC | 206 ms | 33752 KB |
in09.txt | AC | 204 ms | 31632 KB |
in10.txt | AC | 208 ms | 32236 KB |
in11.txt | AC | 225 ms | 32356 KB |
in12.txt | AC | 215 ms | 33296 KB |
sample_01.txt | AC | 93 ms | 20692 KB |
sample_02.txt | AC | 94 ms | 19796 KB |
sample_03.txt | AC | 95 ms | 23892 KB |