Submission #2213777


Source Code Expand

import java.util.*;	
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String o = sc.next();
		String e = sc.next();
		int a = 0,mozilong = o.length() + e.length();
		char ans[] = new char[mozilong];
		for(int i = 0;i < e.length() ;i++) {
			ans[a] = o.charAt(i);
			a++;
			ans[a] = e.charAt(i);
			a++;
		}
		if( o.length() > e.length())ans[a] = o.charAt(o.length()-1);
		System.out.println(ans);
	}

}

Submission Info

Submission Time
Task B - ∵∴∵
User ne290014
Language Java8 (OpenJDK 1.8.0)
Score 200
Code Size 477 Byte
Status AC
Exec Time 91 ms
Memory 20564 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 10
Set Name Test Cases
Sample 0_000.txt, 0_001.txt
All 0_000.txt, 0_001.txt, rnd0.txt, rnd1.txt, rnd2.txt, rnd3.txt, short1.txt, short2.txt, short3.txt, wf.txt
Case Name Status Exec Time Memory
0_000.txt AC 89 ms 20564 KB
0_001.txt AC 91 ms 19540 KB
rnd0.txt AC 89 ms 19796 KB
rnd1.txt AC 90 ms 19924 KB
rnd2.txt AC 90 ms 19284 KB
rnd3.txt AC 90 ms 19796 KB
short1.txt AC 89 ms 16848 KB
short2.txt AC 90 ms 20564 KB
short3.txt AC 89 ms 18644 KB
wf.txt AC 91 ms 20564 KB