結果

問題 No.163 cAPSlOCK
ユーザー threepipes_sthreepipes_s
提出日時 2015-03-24 22:30:27
言語 Java21
(openjdk 21)
結果
AC  
実行時間 54 ms / 5,000 ms
コード長 2,656 bytes
コンパイル時間 2,511 ms
コンパイル使用メモリ 79,448 KB
実行使用メモリ 37,072 KB
最終ジャッジ日時 2024-06-29 00:34:44
合計ジャッジ時間 4,410 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
36,584 KB
testcase_01 AC 53 ms
36,672 KB
testcase_02 AC 53 ms
36,708 KB
testcase_03 AC 52 ms
36,748 KB
testcase_04 AC 53 ms
36,512 KB
testcase_05 AC 52 ms
36,860 KB
testcase_06 AC 52 ms
36,720 KB
testcase_07 AC 53 ms
36,812 KB
testcase_08 AC 53 ms
36,408 KB
testcase_09 AC 54 ms
36,416 KB
testcase_10 AC 52 ms
37,072 KB
testcase_11 AC 54 ms
37,028 KB
testcase_12 AC 52 ms
36,540 KB
testcase_13 AC 52 ms
36,808 KB
testcase_14 AC 52 ms
37,012 KB
testcase_15 AC 52 ms
36,724 KB
testcase_16 AC 53 ms
36,940 KB
testcase_17 AC 54 ms
36,720 KB
testcase_18 AC 53 ms
36,724 KB
testcase_19 AC 54 ms
36,724 KB
testcase_20 AC 53 ms
36,812 KB
testcase_21 AC 54 ms
36,848 KB
testcase_22 AC 54 ms
36,848 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;

public class Main {
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		ContestScanner in = new ContestScanner();
		char[] s = in.nextToken().toCharArray();
		for(int i=0; i<s.length; i++){
			if('A' <= s[i] && s[i] <= 'Z'){
				s[i] = (char) (s[i] - 'A' + 'a');
			}else{
				s[i] = (char) (s[i] - 'a' + 'A');
			}
		}
		System.out.println(String.copyValueOf(s));
	}
}

class MyComp0 implements Comparator<int[]> {
	public int compare(int[] a, int[] b) {
		return a[0] - b[0];
	}
}

class MyComp1 implements Comparator<int[]> {
	public int compare(int[] a, int[] b) {
		return a[1] - b[1];
	}
}

class Reverse implements Comparator<Integer> {
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}

class Node {
	int id;
	List<Node> edge = new ArrayList<Node>();

	public Node(int id) {
		this.id = id;
	}

	public void createEdge(Node node) {
		edge.add(node);
	}
}

class ContestWriter {
	private PrintWriter out;

	public ContestWriter(String filename) throws IOException {
		out = new PrintWriter(new BufferedWriter(new FileWriter(filename)));
	}

	public ContestWriter() throws IOException {
		out = new PrintWriter(System.out);
	}

	public void println(String str) {
		out.println(str);
	}

	public void print(String str) {
		out.print(str);
	}

	public void close() {
		out.close();
	}
}

class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;

	public ContestScanner() throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(
				filename)));
	}

	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}

	public long nextLong() throws IOException, NumberFormatException {
		return Long.parseLong(nextToken());
	}

	public int nextInt() throws NumberFormatException, IOException {
		return (int) nextLong();
	}

	public double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(nextToken());
	}
}
0