Complete main() to read dates from input, one date per line. Each date's format must be as follows: March 1, 1990. Any date not following that format is incorrect and should be ignored. Use the substring() method to parse the string and extract the date. The input ends with -1 on a line alone. Output each correct date as: 3/1/1990. Ex: If the input is: March 1, 1990 April 2 1995 7/15/20 December 13, 2003 -1 then the output is: 3/1/1990 12/13/2003

Complete main() to read dates from input, one date per line. Each date's format must be as follows: March 1, 1990. Any date not following that format is incorrect and should be ignored. Use the substring() method to parse the string and extract the date. The input ends with -1 on a line alone. Output each correct date as: 3/1/1990. Ex: If the input is: March 1, 1990 April 2 1995 7/15/20 December 13, 2003 -1 then the output is: 3/1/1990 12/13/2003

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter7: User-defined Simple Data Types, Namespaces, And The String Type

Section: Chapter Questions

Problem 8PE: Write a program that reads in a line consisting of a students name, Social Security number, user ID,...

See similar textbooks

Similar questions

Complete main() to read dates from input, one date per line. Each date's format must be as follows: March 1, 1990. Any date not following that format is incorrect and should be ignored. Use the substring() method to parse the string and extract the date. The input ends with -1 on a line alone. Output each correct date as: 3/1/1990. Ex: If the input is: March 1, 1990 April 2 1995 7/15/20 December 13, 2003 -1 then the output is: 3/1/1990 12/13/2003 Code I am using: import java.util.Scanner; public class DateParser {public static int getMonthAsInt(String monthString) {int monthInt; switch (monthstr) { case "January": monthInt = 1; break; case "February": monthInt = 2; break; case "March": monthInt = 3; break; case "April": monthInt = 4; break; case "May": monthInt = 5; break; case "June": monthInt = 6; break; case "July": monthInt = 7; break; case "August": monthInt = 8; break; case "September": monthInt = 9; break; case "October": monthInt = 10; break; case…
Given 2 strings, return their concatenation, except remove the last character of each and swap the order of the inputted words. The strings will be at least length 3. Ex: If the input is: bird penguin the output is: pengiubir Ex: If the input is: loving csce the output is: csclovin
Write a program that reads in a line consisting of a students name, Social Security number, user ID, and password. The program outputs the string in which all the digits of the Social Security number and all the characters in the password are replaced by x. (The Social Security number is in the form 000-00-0000, and the user ID and the password do not contain any spaces.) Your program should not use the operator [] to access a string element. Use the appropriate functions described in Table 7-1.
Complete main() to read dates from input, one date per line. Each date's format must be as follows: March 1, 1990. Any date not following that format is incorrect and should be ignored. Use the substr() function to parse the string and extract the date. The input ends with -1 on a line alone. Output each correct date as: 3/1/1990. Ex: If the input is: March 1, 1990 April 2 1995 7/15/20 December 13, 2003 -1 then the output is: 3/1/1990 12/13/2003 main.cpp #include <iostream>#include <string> using namespace std; int DateParser(string month) {int monthInt = 0;if (month == "January")monthInt = 1;else if (month == "February")monthInt = 2;else if (month == "March")monthInt = 3;else if (month == "April")monthInt = 4;else if (month == "May")monthInt = 5;else if (month == "June")monthInt = 6;else if (month == "July")monthInt = 7;else if (month == "August")monthInt = 8;else if (month == "September")monthInt = 9;else if (month == "October")monthInt = 10;else if (month ==…
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string
String replacement is read from input. Then, sentence is read from input. If replacement is in sentence, then: Output 'Located at index: ' followed by the index of the last occurrence. Create a string from sentence with the first two occurrences of replacement replaced by '5' and output sentence on a newline.
City and State. Extract the city name and state from strings like “Utica, NY” and “Los Angeles, CA”. Assume the state is always the last two characters in the string, the city name has at least one character, there is a comma following the city name, and a single space after the comma. Use the split method to separate the city name from the state (Notice the city name will still have a comma at the end). The following attachement is a sample execution:
Write T if the sentence is right; write F else, and fix the incorrect one. You need only respond to 5 of the following questions.The get() function may be used to append a new plot to an existing one.
Write a function that finds the number of occurrences of a specified character in a string using the following header:def count(s, ch):The str class has the count method. Implement your method without using the count method. For example, count("Welcome", 'e') returns 2. Write a test program that prompts the user to enter a string followed by a character and displays the number of occurrences of the character in the string.
Ex: Use getline() to get a line of user input into a string. Output the line. Enter text: IDK if I'll go. It's my BFF's birthday. You entered: IDK if I'll go. It's my BFF's birthday. Search the string (using find()) for common abbreviations and print a list of each found abbreviation along with its decoded meaning. Ex: Enter text: IDK if I'll go. It's my BFF's birthday. You entered: IDK if I'll go. It's my BFF's birthday. BFF: best friend forever IDK: I don't know Support these abbreviations: BFF -- best friend forever IDK -- I don't know . JK -- just kidding TMI -- too much information TTYL-talk to you later 1 #include 2 // FIXME include the string Library 3 using namespace std; 4 5 int main() { 6 7 8 9 10 } /* Type your code here. */ return 0; main.cpp
The following function is intended to take a list of strings as an argument (with each element representing a vote for the candidate of that name), and output the winner of the election in the form of the name of the candidate who received more than half of the votes, def majorvote(votes): vote_count 0; candidate = votes[i] %3D vote_count += 1 or 'no-one' if there was no outright winner. maxvotes = 0 For example: if votes [j] == candidate: >>> majorvote(['alice', 'bob', 'alice', 'carol', 'alice 'alice' else: >>> majorvote(['alice', 'alice', 'carol', 'bob', 'eric' 'no-one' maxvotes = vote_count; winner = candidate >>> majorvote(['alice']) 'alice' for j in range (len(votes)): In the first case, the output is 'alice' as they received three votes if vote_count > maxvotes: out of the total of five (i.e. more than half the votes), but in the second cate, the output is 'no-one', as no candidate receives three or more (out of the total of five) votes. if maxvotes > len(votes)/2: return…
Complete the function ratio_similarity, which computes the ratio of "similarity" between two non-empty strings. The ratio is computed as follows: 2 (the number of matches of characters) / (total number of characters in both strings) The matches are determined in pairwise fashion. For example, consider the strings abcdef and abdce. The three characters at indexes 0, 1 and 4 match. Therefore, the similarity ratio is 2 * 3/(6 + 5) = 0.5454 .... Examples: Function Call string_similarity('abcdef', 'abdce') string_similarity('dragon', 'flagon') string_similarity('stony', 'stony') string_similarity('Stony Brook University', 'WolfieNet Secure') string_similarity('yabba dabba doo', 'bippity boppity boo') string_similarity('Wolfie the Seawolf', "What's...a Seawolf?") [ ] Return Value 3 4 5 # Test cases 6 print (string_similarity('abcdef', 'abdce')) 7 print (string_similarity('dragon' 1 'flagon')) 'stony')) 0.5454545454545454 0.6666666666666666 1.0 0.0 0.058823529411764705 0.4864864864864865 1…