# DCP-63: Cyclic String Back to All Problems

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 Limits

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

# 44/187

Solve/Submission

### Ranking

# User Language Timing
01 nasif2587 Cpp 0.02s
02 mdshs Cpp 0.02s
03 emrul Cpp 0.02s
04 Zeronfinity Cpp 0.03s
05 tariqiitju Cpp 0.03s
07 dmehrab06 Cpp 0.10s
08 seyedssz Cpp 0.10s
09 saiful130104 Cpp 0.14s
10 anikatahsin Cpp 0.14s
11 mahrahat Cpp 0.18s
12 haasib Cpp 0.20s
13 rayhan50001 Cpp 0.20s
15 ash12 Cpp 0.21s
16 smjlord068 Cpp 0.24s
17 ssavi Cpp 0.25s
18 math10 Cpp 0.48s
19 Indro_BU Cpp 0.52s
20 duronto20 Cpp 0.55s
21 ahqmrf Cpp 0.55s