Write In C Language Input and Output Must Be the same 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

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Write In C Language

Input and Output Must Be the same

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

 

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

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Function Arguments
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education