Infinite Replacement Codeforces Solution | Codeforces Problem Solution 2022

Infinite Replacement Codeforces Solution | Codeforces Problem Solution 2022

C. Infinite Replacement

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a string 𝑠$s$, consisting only of Latin letters 'a', and a string 𝑡$t$, consisting of lowercase Latin letters.

In one move, you can replace any letter 'a' in the string 𝑠$s$ with a string 𝑡$t$. Note that after the replacement string 𝑠$s$ might contain letters other than 'a'.

You can perform an arbitrary number of moves (including zero). How many different strings can you obtain? Print the number, or report that it is infinitely large.

Solution Click Below:-  CLICK HERE

Two strings are considered different if they have different length, or they differ at some index.

Input

The first line contains a single integer 𝑞$q$ (1≤𝑞≤104$1\le q\le {10}^4$) — the number of testcases.

Number Transformation Codeforces Solution

Remove Directed Edges Codeforces Solution

Desktop Rearrangement Codeforces Solution

Breaking the Wall Codeforces Solution

A-B-C Sort Codeforces Solution

Infinite Replacement Codeforces Solution 

The first line of each testcase contains a non-empty string 𝑠$s$, consisting only of Latin letters 'a'. The length of 𝑠$s$ doesn't exceed 50$50$.

The second line contains a non-empty string 𝑡$t$, consisting of lowercase Latin letters. The length of 𝑡$t$ doesn't exceed 50$50$.

Output

For each testcase, print the number of different strings 𝑠$s$ that can be obtained after an arbitrary amount of moves (including zero). If the number is infinitely large, print -1. Otherwise, print the number.

Join Now for Solution:-