루미 알고리즘

#1632브론즈Virus

PO 2025 학교 예선코딩출제 Joshua Andersson영어 원문이 문제가 어렵다면 — 배우는 순서 보기

영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)

Problem

Boschua is not very good at cybersecurity. Last month, he turned off the firewall because it wouldn't let him download cat pictures. Unfortunately, this led to him getting a virus. The virus did something very strange: it added a bunch of letters to all the filenames.

For example, it might have changed the filename katt.png to kattegatto.ping. The virus can add letters but can never remove letters.

Now he is searching for a file named F, but he has many files on his computer. Can you write a program that reads the filename F and the name of a file H on his computer, and determines if F could have been transformed into H by the virus? That is, is it possible that the virus took the filename F and added letters such that the file is now named H?

Input

The first line of input contains the string F, and the second line contains the string H.

Let |F| be the number of characters in F, and similarly for |H|. Then, it holds that 1 ≤ |F| ≤ |H| ≤ 32.

Both F and H contain only the letters a-z and the period. It is guaranteed that F contains exactly one period. The virus can add periods and letters from a-z.

Output

Print “Ja” if H could be the file Boschua is looking for, otherwise print “Nej”.

Scoring

Your solution will be tested on a set of test groups, each worth a number of points. Each test group contains a set of test cases. To get the points for a test group you need to solve all test cases in the test group.

GroupPointsConstraints
120Each character (and period) appears at most once in each string.
220∣H∣ = ∣F∣+1
320∣H∣ = ∣F∣+2
440No additional constraints.

Explanation of Samples

In sample 1, the virus could have made the following transformation to convert F into H: katt.png ⇒ kattegatto.ping.

In sample 2, the virus could have made the following transformation to convert F into H: antivirus.exe ⇒ aaantivisiiruis.egxe.

In sample 3, F and H differ at png and pgn. Since the virus cannot change the order of letters, it could not have transformed F into H.

예제

예제 1

입력
katt.png
kattegatto.ping
출력
Ja

예제 2

입력
antivirus.exe
aaantivisiiruis.egxe
출력
Ja

예제 3

입력
kattenmilly.png
kaaatttenmilly.pgn
출력
Nej

출처 표기

출처: Programmeringsolympiaden 2025년 학교 예선 · 원문 페이지 · 이용 조건 CC BY-SA · LaTeX 원문을 화면용 글로 옮겼습니다(수식·표의 모양이 다를 수 있습니다). 내용은 고치지 않았습니다.

크리에이티브 커먼즈 저작자표시-동일조건변경허락.

문제 출처: 한국정보올림피아드(KOI) (CC BY-NC-SA 4.0) · International Olympiad in Informatics (IOI) (CC BY) · Centre for Education in Mathematics and Computing (CEMC), University of Waterloo (CC BY-NC 4.0) · Programmeringsolympiaden (CC BY-SA) · CSES Problem Set (Antti Laaksonen) (CC BY-NC-SA 4.0). 루미 알고리즘은 위 단체들과 관계없는 별도의 서비스이며, 자료는 원문 그대로 싣습니다. 문제마다 출처와 이용 조건을 따로 표기합니다.