Submission #1496551


Source Code Expand

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		new Main().solve();
	}
	
	void solve(){
		Scanner sc=new Scanner(System.in);
		String x=sc.next();
		
		int count_t=0;
		int count_s=0;
		for(int i=0;i<x.length();i++){
			if(x.charAt(i)=='T')count_t++;
			else break;
		}
		for(int i=x.length()-1;i>=0;i--){
			if(x.charAt(i)=='S')count_s++;
			else break;
		}
		System.out.println(Math.max(count_t, count_s)*2);
	}
}

Submission Info

Submission Time
Task A - STring
User kwkm0429
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 485 Byte
Status WA
Exec Time 155 ms
Memory 26548 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 200 0 / 100
Status
AC × 3
AC × 6
WA × 3
AC × 7
WA × 6
Set Name Test Cases
Sample example0, example1, example2
Subtask1 example0, example1, example2, sub_corner0, sub_corner1, sub_corner2, sub_rand0, handmade0, handmade1
All corner0, corner1, corner2, example0, example1, example2, handmade0, handmade1, maxrand0, sub_corner0, sub_corner1, sub_corner2, sub_rand0
Case Name Status Exec Time Memory
corner0 AC 155 ms 26548 KB
corner1 WA 151 ms 23124 KB
corner2 WA 143 ms 26524 KB
example0 AC 92 ms 21204 KB
example1 AC 89 ms 18644 KB
example2 AC 91 ms 20948 KB
handmade0 AC 90 ms 20564 KB
handmade1 AC 90 ms 20820 KB
maxrand0 WA 151 ms 24524 KB
sub_corner0 AC 101 ms 19924 KB
sub_corner1 WA 102 ms 21844 KB
sub_corner2 WA 92 ms 21588 KB
sub_rand0 WA 99 ms 19924 KB