Telephone Number
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 ss of length nn, consisting of digits.
In one operation you can delete any character from string ss. For example, it is possible to obtain strings 112, 111 or 121 from string 1121.
You need to determine whether there is such a sequence of operations (possibly empty), after which the string ss becomes a telephone number.
The first line contains one integer tt (1≤t≤1001≤t≤100) — the number of test cases.
The first line of each test case contains one integer nn (1≤n≤1001≤n≤100) — the length of string ss.
The second line of each test case contains the string ss (|s|=n|s|=n) consisting of digits.
For each test print one line.
If there is a sequence of operations, after which ss becomes a telephone number, print YES.
Otherwise, print NO.
2 13 7818005553535 11 31415926535
YES NO
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; }
重点注意k的标记,后面if条件必须是n-i,一定不能是n-k,原因自己想想。。。。
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步