Telephone Number

最新推荐文章于 2024-05-24 09:30:10 发布

weixin_30407099

最新推荐文章于 2024-05-24 09:30:10 发布

阅读量294

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/ylrwj/p/10877665.html

本文介绍了一种用于验证11位手机号的有效性算法，特别关注以8开头的号码。通过删除非必要字符，检查字符串是否能转换为有效的电话号码格式。

A telephone number is a sequence of exactly 11 digits, where the first digit is 8. For example, the sequence 80011223388 is a telephone number, but the sequences 70011223388 and 80000011223388 are not.

You are given a string

In one operation you can delete any character from string

You need to determine whether there is such a sequence of operations (possibly empty), after which the string

Input

The first line contains one integer

The first line of each test case contains one integer

The second line of each test case contains the string

Output

For each test print one line.

If there is a sequence of operations, after which

Otherwise, print NO.

Example

Input

2
13
7818005553535
11
31415926535

Output

YES
NO

Note

In the first test case you need to delete the first and the third digits. Then the string 7818005553535 becomes 88005553535

这道题就是判断11位的手机号，并且是以8开头；

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,k,i;
        cin>>n;
        char a[110];
        cin>>a;
        for(i=0;i<n;i++)
        {
            if(a[i]=='8')
            {
                k=i;//标记第一次出现8的位置
                break;
            }
        }
        if(n-i<11)
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
    return 0;
}