DCP-63: Cyclic String Back to All Problems

Easy Beginners Problems > Ad-hoc


Give two string T and S. Take a decision whether T is a cyclic string of S or not . For example abc and bca are two cyclic strings of one another. If we rotate abc for one time we get cab . Then again rotate cab and we get bca. That’s why abc and bca are two cyclic string of each other. But abc and bac are not cyclic string of each other. [Rotate means move the last character to first position of a string] Input: ------ At first gives you an integer **T (T<=10)**, is the number of test cases. Each case gives two strings T and **S ( 1<=T,S<=1000000 )** in two separated lines. Output: ------- Output **“YES”** if T is a cyclic string of S, otherwise output **“NO”**. Sample Input ------------ 2 abc bca abc bcd Sample Output ------------- YES NO *Look, For Test Case – 1 , if we rotate abc we will get abc -> cab -> bca . For Test Case – 2 , character d is not present in abc. So abc and bcd are not cyclic string of each other.*


Problem Setter:

Rajon Bardhan

Please login to submit solution to this problem.

Problem Limits

Language Time Limit (seconds)
C/C++ 3.00
Java 5.00
C# 5.00
PHP 5.00

Problem Stats

29/120

Solve/Submission

Ranking

# User Language Timing
01 tariqiitju Cpp 0.03s
02 codehead Cpp 0.09s
03 dmehrab06 Cpp 0.10s
04 seyedssz Cpp 0.10s
05 mahrahat Cpp 0.18s
06 smjlord068 Cpp 0.24s
07 math10 Cpp 0.48s
08 Indro_BU Cpp 0.52s
09 duronto20 Cpp 0.55s
10 ahqmrf Cpp 0.55s
11 murad_al_wajed Cpp 0.56s
12 SIR_MBSTU Cpp 0.60s
13 nuhu_iu Cpp 0.61s
14 Mahmudul_Tushar Cpp 0.61s
15 alhelal_cse Cpp 0.66s
16 aniscseiu Cpp 0.79s
Feedback

Your feedback is our precious!



Or call +88 02 9853138 for support