webturing 5 rokov pred
rodič
commit
9764020ef2
5 zmenil súbory, kde vykonal 132 pridanie a 0 odobranie
  1. 28 0
      A.java
  2. 24 0
      B.java
  3. 34 0
      C.java
  4. 16 0
      D.java
  5. 30 0
      E.java

+ 28 - 0
A.java

@@ -0,0 +1,28 @@
+import java.util.Scanner;
+
+/**
+ * Created by chshru on 2017/11/4.
+ */
+
+public class A {
+
+    public static void main(String[] args) {
+
+        Scanner cin = new Scanner(System.in);
+        while (cin.hasNext()) {
+            int n = cin.nextInt();
+            int t = n;
+            while (n % 2 == 0)
+                n /= 2;
+            while (n % 3 == 0)
+                n /= 3;
+            while (n % 5 == 0)
+                n /= 5;
+            if (n == 1 && n != t)
+                System.out.println("Accepted");
+            else
+                System.out.println("Wrong");
+        }
+        cin.close();
+    }
+}

+ 24 - 0
B.java

@@ -0,0 +1,24 @@
+import java.util.Scanner;
+
+/**
+ * Created by chshru on 2017/11/4.
+ */
+public class B {
+
+    public static void main(String[] args) {
+
+        Scanner cin = new Scanner(System.in);
+        int t = cin.nextInt();
+        while (t-- > 0) {
+            int m = cin.nextInt();
+            int n = (1200 - 6 * m) / 7;
+            if ((1200 - 6 * m) % 7 != 0)
+                n++;
+            System.out.print(n / 2);
+            if (n % 2 != 0)
+                System.out.print(".5");
+            System.out.println();
+        }
+        cin.close();
+    }
+}

+ 34 - 0
C.java

@@ -0,0 +1,34 @@
+import java.util.Scanner;
+
+/**
+ * Created by chshru on 2017/11/4.
+ */
+public class C {
+
+    public static void main(String[] args) {
+
+        Scanner cin = new Scanner(System.in);
+        int[] a = new int[26];
+        a['H' - 'A'] = 1;
+        a['C' - 'A'] = 12;
+        a['O' - 'A'] = 16;
+        a['F' - 'A'] = 19;
+        a['P' - 'A'] = 31;
+        a['S' - 'A'] = 32;
+        a['K' - 'A'] = 39;
+        a['N' - 'A'] = 14;
+        int n = cin.nextInt();
+        while (n-- > 0) {
+            char[] b = cin.next().toCharArray();
+            int ans = 0;
+            for (int i = 0; i < b.length; i++) {
+                if (b[i] >= 'A' && b[i] <= 'Z')
+                    ans += a[b[i] - 'A'];
+                else if (b[i] >= '1' && b[i] <= '9')
+                    ans += (b[i] - '0' - 1) * a[b[i - 1] - 'A'];
+            }
+            System.out.println(ans);
+        }
+        cin.close();
+    }
+}

+ 16 - 0
D.java

@@ -0,0 +1,16 @@
+import java.util.Scanner;
+
+/**
+ * Created by chshru on 2017/11/4.
+ */
+public class D {
+
+    public static void main(String[] args) {
+
+        Scanner cin = new Scanner(System.in);
+        while (cin.hasNext()) {
+            System.out.println(cin.nextLong() + cin.nextLong());
+        }
+        cin.close();
+    }
+}

+ 30 - 0
E.java

@@ -0,0 +1,30 @@
+import java.util.Scanner;
+
+/**
+ * Created by chshru on 2017/11/4.
+ */
+public class E {
+
+    public static void main(String[] args) {
+
+        Scanner cin = new Scanner(System.in);
+        int[] dp = new int[500005];
+        init(dp);
+        int t = cin.nextInt();
+        while (t-- > 0) {
+            int n = cin.nextInt();
+            System.out.println(dp[n]);
+        }
+        cin.close();
+    }
+
+    private static void init(int[] dp) {
+        int MOD = 998244353;
+        dp[0] = 1;
+        for (int i = 0; i < 500000; i++) {
+            dp[i + 1] = (dp[i] + dp[i + 1]) % MOD;
+            dp[i + 2] = (dp[i] + dp[i + 2]) % MOD;
+            dp[i + 3] = (dp[i] + dp[i + 3]) % MOD;
+        }
+    }
+}