# Rest in peace - 21-1! | Hackerearth practice problem solution

Problem:-

The grandest stage of all, Wrestlemania XXX recently happened. And with it, happened one of the biggest heartbreaks for the WWE fans around the world. The Undertaker's undefeated streak was finally over.

Now as an Undertaker fan, you're disappointed, disheartened and shattered to pieces. And Little Jhool doesn't want to upset you in any way possible. (After all you are his only friend, true friend!) Little Jhool knows that you're still sensitive to the loss, so he decides to help you out.

Every time you come across a number, Little Jhool carefully manipulates it. He doesn't want you to face numbers which have "21" as a part of them. Or, in the worst case possible, are divisible by 21.

If you end up facing such a number you feel sad... and no one wants that - because you start chanting "The streak is broken!" , if the number doesn't make you feel sad, you say, "The streak lives still in our heart!"

Input Format:
The first line contains a number, t, denoting the number of test cases.
After that, for t lines there is one number in every line.

Output Format:
Print the required string, depending on how the number will make you feel.

Constraints:
1 ≤ t ≤ 100
1 ≤ n ≤ 1000000

Sample Input
```3
120
121
231

```
Sample Output
```The streak lives still in our heart!
The streak is broken!
The streak is broken!
```
Time Limit: 1
Memory Limit: 256

Code:-

#include<bits/stdc++.h>
using namespace std;
int main()
{
int t,n;
cin>>t;
while(t--)
{
cin>>n;
int flag=0;

// check number is divisible by 21 or not
if(n%21==0)
{
flag=1;
}

// if not divisible then chekck it has 21 or not
if(flag==0)
{
while(n!=0)
{
int r=n%10;
n=n/10;
if(r==1)
{
if(n%10==2)
{
flag=1;
break;
}
}

}
}
if(flag==1)
cout<<"The streak is broken!"<<endl;
else
cout<<"The streak lives still in our heart!"<<endl;
}
return 0;
}

Recommended post:-

Hackerearth Problems:-

Data structure:-

Key points:-