1. Jojo got some difficulties in searching a name. Help him to make a program to find a specific name (Case Sensitive) in a file. Help him to make a program to search a name in lines of names.   Format Input The input consists of several lines in testdata.in file. The first line of the input will consist of an integer T denoting the number of test cases. Each test case will start with an integer N. The next N lines will consist of a string S denoting the K-th name. After N lines of names will consists of a string F, a name that needs to be found. Format Output For each test case, print "Case #X: Y" where X is the number of test case starting from 1, and Y is the index where the name is. If the name isn’t found, Y will be “Not found” without quotation. If there are repeated names in 1 test case, then output the first found name's index. Constraints 1 <= T <= 100 1 <= N <= 100 1 <= |S| <= 30   C Language

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

 

1. Jojo got some difficulties in searching a name. Help him to make a program to find a specific name (Case Sensitive) in a file. Help him to make a program to search a name in lines of names.

 

Format Input

The input consists of several lines in testdata.in file. The first line of the input will consist of an integer T denoting the number of test cases. Each test case will start with an integer N. The next N lines will consist of a string S denoting the K-th name. After N lines of names will consists of a string F, a name that needs to be found.

Format Output

For each test case, print "Case #X: Y" where X is the number of test case starting from 1, and Y is the index where the name is. If the name isn’t found, Y will be “Not found” without quotation. If there are repeated names in 1 test case, then output the first found name's index.

Constraints

1 <= T <= 100

1 <= N <= 100

1 <= |S| <= 30

 

C Language

Sample Input (testdata.in)
Sample Output
3
Case #1: 2
Case #2: 1
Jojo
Case #3: Not found
Lili
Transcribed Image Text:Sample Input (testdata.in) Sample Output 3 Case #1: 2 Case #2: 1 Jojo Case #3: Not found Lili
Bibi
Lili
2
Jess
Jason
Jess
3
Kevin
Andreas
Peter
Anderson
Transcribed Image Text:Bibi Lili 2 Jess Jason Jess 3 Kevin Andreas Peter Anderson
Expert Solution
steps

Step by step

Solved in 6 steps with 4 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY