-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCompetive_Programing_02.java
More file actions
47 lines (34 loc) · 1.12 KB
/
Copy pathCompetive_Programing_02.java
File metadata and controls
47 lines (34 loc) · 1.12 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
import java.util.Scanner;
public class Competive_Programing_02 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String A = sc.next();
String B = sc.next();
int sum= A.length()+B.length();
System.out.println(sum);
int comperision =A.compareTo(B);
if (comperision>0){
System.out.println("yes");
}
else {
System.out.println("no");
}
String case1=A.substring(0 ,1).toUpperCase()+A.substring(1);
String case2=B.substring(0 ,1).toUpperCase()+B.substring(1);
System.out.println(case1+" "+ case2);
// 2
/*import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int i = scan.nextInt();
double d =scan.nextDouble();
String s= scan.next();
System.out.println("String: " + s);
System.out.println("Double: " + d);
System.out.println("Int: " + i);
}
}
*/
}
}