Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
The V Epidemic is spreading fast around the world. Suppose that there are N cities, numbered from 0 to (N-1), arranged in a circular manner. City 0 is connected to city 1, to 2, ., city (N-2) to city (N-1), and city (N-1) to city 0. If you know that the V virus is currently at city X. Each day, it jumps from its current city to the city within a distance K to its right, i.e., from city X to the city (X+K)%N. As the V virus jumps, the cities in- between don't get infected. Cities once infected stay infected. You live in city Y. Find if it will reach your city eventually. If it will, print YES, else print NO.

The V Epidemic is spreading fast around the world. Suppose that there are N cities, numbered from 0 to (N-1), arranged in a circular manner. City 0 is connected to city 1, to 2, ., city (N-2) to city (N-1), and city (N-1) to city 0. If you know that the V virus is currently at city X. Each day, it jumps from its current city to the city within a distance K to its right, i.e., from city X to the city (X+K)%N. As the V virus jumps, the cities in- between don't get infected. Cities once infected stay infected. You live in city Y. Find if it will reach your city eventually. If it will, print YES, else print NO.

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question
5:15 +(65 O O Constraints 1sNs 1000 Os X, Y s N-1 0sKs 1000 SInput Format The first and only line of each tes case contains four space- separated integers N, K, X, and Y, denoting the number of cities, the size of jumps, the V virus's current city, and the city that you live in, respectively. E Output Format Print YES if V virus shall reach your city after a finite number of days, else print NO. Sample #1 Input A
Transcribed Image Text:5:15 +(65 O O Constraints 1sNs 1000 Os X, Y s N-1 0sKs 1000 SInput Format The first and only line of each tes case contains four space- separated integers N, K, X, and Y, denoting the number of cities, the size of jumps, the V virus's current city, and the city that you live in, respectively. E Output Format Print YES if V virus shall reach your city after a finite number of days, else print NO. Sample #1 Input A
5:15 +(65 O O e Challenge task The V Epidemic is spreading fast around the world. Suppose that there are N cities, numbered from 0 to (N-1), arranged in a circular manner. City 0 is connected to city 1, to 2,., city (N-2) to city (N-1), and city (N-1) to city 0. If you know that the V virus is currently at city X. Each day, it jumps from its current city to the city within a distance K to its right, i.e., from city X to the city (X+K)%N. As the V virus jumps, the cities in- between don't get infected. Cities once infected stay infected. You live in city Y. Find if it will reach your city eventually. If it will, print YES, else print NO.
Transcribed Image Text:5:15 +(65 O O e Challenge task The V Epidemic is spreading fast around the world. Suppose that there are N cities, numbered from 0 to (N-1), arranged in a circular manner. City 0 is connected to city 1, to 2,., city (N-2) to city (N-1), and city (N-1) to city 0. If you know that the V virus is currently at city X. Each day, it jumps from its current city to the city within a distance K to its right, i.e., from city X to the city (X+K)%N. As the V virus jumps, the cities in- between don't get infected. Cities once infected stay infected. You live in city Y. Find if it will reach your city eventually. If it will, print YES, else print NO.
Expert Solution
steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
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
SEE MORE TEXTBOOKS