Description: uva 10324 Title Description: give you a series of strings that contains only 0 and 1 (maximum string length to 1,000,000, character string starting 0), to ask you to answer our i-th and the j characters of the Inter (including the i-th and j-th), if all the characters are the same (both are 1 or 0). If you have the same answer Yes, or answer No. The first column of each test Input data string contains only 0 and 1, the next column has an integer n, representatives of the following string to the previous column has n problems. Are down n columns, each have two non-negative integer representing the i and j. Output test string for each column, please output the first of several Case. Then answer Yes or No. according to n a problem Solution: 1. read the entire line gets input string, and calculate the length of 2 to determine the position of the first 0, 0 put 0 into another integer array that is a deposit for loop 1 3. Use the string array to an integer array to convert stored encounter
To Search:
File list (Check if you may need any files):
uva10324\uva10324#a.in.txt
........\uva10324#a.out.txt
........\uva10324#b.in.txt
........\uva10324#b.out.txt
........\uva10324_1101105324.cpp
........\uva10324_1101105324.exe
........\uva10324_readme.txt
uva10324
Download