上传文件至 ''

F_SumEven.java

@@ -0,0 +1,29 @@
+package aoj.contest1399;
+
+import java.util.Scanner;
+public class F_SumEven {
+   public static void main(String[] args){
+       Scanner cin=new Scanner(System.in);
+       int m,n,a,sum,k;
+       while(cin.hasNext()){
+         n=cin.nextInt();
+         m=cin.nextInt();
+         a=2;sum=0;k=0;
+         while(n-->0){
+             sum=sum+a;
+             a+=2;
+             k++;
+             if(k==m){
+                 sum=sum/k;
+                 System.out.print(sum+" ");
+                 sum=0;k=0;
+            }
+         }
+         if(k!=0){
+             sum=sum/k;
+             System.out.println(sum);
+         }
+       }
+       cin.close();
+   }
+}

G_SumNumbers.java

@@ -0,0 +1,24 @@
+package aoj.contest1399;
+
+import java.util.Scanner;
+ 
+public class G_SumNumbers {
+    public static void main(String[] args) {
+        Scanner in = new Scanner(System.in);
+        while(in.hasNextInt()){
+            int n,m;
+            n = in.nextInt();
+            m = in.nextInt();
+            System.out.println(fun(n, m));
+        }
+        in.close();
+    }
+    private static int fun(int n, int m){
+        int sum = 0;
+        for(int i = n; i <= m; i++){
+            if((i % 3 == 1) && (i % 5 == 3))
+                sum += i;
+        }
+        return sum;
+    }
+}

H_Goldbach.java

@@ -0,0 +1,19 @@
+package aoj.contest1399;
+
+import java.util.Scanner;
+public class H_Goldbach {
+   public static void main(String[] args){
+       Scanner cin=new Scanner(System.in);
+       int n=cin.nextInt(),sum=0;
+       for(int i=n/2;i>=2;i--)
+           if(prime(i)&& prime(n-i)) sum++;
+       System.out.println(sum);
+       cin.close();
+   }
+ 
+private static boolean prime(int n) {
+    for(int i=2;i*i<=n;i++)
+        if(n%i==0)return false;
+    return true;
+}
+}

I_Score.java

@@ -0,0 +1,25 @@
+package aoj.contest1399;
+
+import java.io.PrintWriter;
+import java.util.Scanner;
+
+public class I_Score {
+    static Scanner cin = new Scanner(System.in);
+    static PrintWriter cout = new PrintWriter(System.out);
+    static {
+    }
+    static final char[] RANK = "EEEEEEDCBAA".toCharArray();
+
+    public static void main(String[] args) {
+        while (cin.hasNext()) {
+            int n = cin.nextInt();
+            if (n < 0 || n > 100)
+                cout.println("Score is error!");
+            else
+                cout.println(RANK[n / 10]);
+        }
+
+        cin.close();
+        cout.close();
+    }
+}

J_DecodePassword.java

@@ -0,0 +1,42 @@
+package aoj.contest1399;
+
+import java.util.HashMap;
+import java.util.Map;
+import java.util.Scanner;
+
+public class J_DecodePassword {
+    private static String abc = "abcdefghijklmnopqrstuvwxyz";
+    private static String[] map = {"0", "1", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
+
+    public static void main(String[] args) {
+        Scanner in = new Scanner(System.in);
+        while (in.hasNext()) {
+            String password = in.nextLine();
+            StringBuffer p = new StringBuffer(password);
+
+            for (int i = 0; i < password.length(); i++) {
+                char ch = password.charAt(i);
+                if (Character.isLowerCase(ch)) {
+                    for (int j = 0; j < map.length; j++) {
+                        if (map[j].contains(Character.toString(ch)))
+                            p.setCharAt(i, String.valueOf(j).charAt(0));
+
+                    }
+                } else if (Character.isUpperCase(ch)) {
+                    ch = Character.toLowerCase(ch);
+                    for (int j = 0; j < abc.length(); j++) {
+                        if (ch == abc.charAt(j)) {
+                            ch = abc.charAt((j + 1) % 26);
+                            p.setCharAt(i, ch);
+                            break;
+                        }
+                    }
+                    p.setCharAt(i, ch);
+                }
+
+            }
+            System.out.println(p.toString());
+        }
+        in.close();
+    }
+}