WEBSITE RETURNED, HOWEVER SUBMIT QUANTITY IS RESTRICTED PER DAY TO VERY LITTLE (UNDER JUDGE0 NEW POLICY, API PROVIDER). Therefore it is very much for you to pay attention TEST CAREFULLY CODE BEFORE SUBMIT.
Threads: Enter two strings s1 and s2 on. Count the number of occurrences of s2 in s1. Not case sensitive. Input: two lines, each containing a string respectively s1, s2. Output: Some of the frequency of occurrence of s2 in s1. For example: input: Dao Thi
Threads: Enter a character string and a. Count the number of occurrences of that character in the string provided. Input: The first line contains the string, second line 2 contains the character should count. Output: Some is the number of occurrences of the characters in the string. Indiscriminate
Threads: Enter a string. Change all the first letters of flowers, the other letters to lowercase according to the correct spelling. String does not contain proper nouns, do not contain extra spaces. Punctuation may include dots (.), question mark (?), exclamation (!). Input:
Threads: Enter a string. Check whether the string that contains all the numbers or not. Input: A string. Output: If the string contains all the printed “TRUE”, if not printed “FALSE”. For example: input: 1234566 output: TRUE
Threads: For a string with the path of a file in the computer. The correct path is the path without the slash (/) at the top, at the end, and in between the folder has only one slash to separate. Please remove the slash excess to
Threads: Please enter a paragraph, count of how many passages from. Input: A single paragraph of no more than 255 characters. Output: A unique number is numbered in sequence. For example: input: Cham Code Online. output: 3
Threads: Please enter a programming language you prefer. Then print out the screen. Input: A string is the name of the programming language. Output: “I love it!” , including language lang instead entered. For example: input: Java output: I love Java!