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.
Describe: For 2 verses written close together, each separated by brick right question (/). Give it a check 2 That verse is not Alexandrine? Check law: Rhyme in the continent since the end of the word coincides with the second syllable 6 in the bowl. For example: Yellow leaves,
Threads: Born n long sequences of digits. Input: One line contains a number n is the length of sequences required students. Output: x line, each containing a binary sequence, the binary sequence in the order Dictionary. For example: input 2 output: 00
Threads: For 2 integers a, b there 0 <= a, b <= 1 billion billion billion. Calculate and print the total of 2 number. Input: The first line contains integer n is the number of test. n pair next line is the number of a turn, b of each test Top
Source: http://laptrinh.ictu.edu.vn Thai Nguyen Province are planning projects throughout the province and land redistribution by regions. Leaders decided to draw a map for easy management. Maps are rectangular size MxN. With symbols: '#' Is for forest land
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 the name of a person. Detached person's name. Input string as standardized. Input: A string. Output: Give the person's name. For example: input: Dao Thi Hong Mai Hoa output: May
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
