ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#195728 | #3417. 序列转换 | bianyuexian | 100 | 1ms | 1248kb | C++ | 406b | 2023-10-18 20:52:11 | 2023-10-18 22:34:11 |
answer
#include <iostream>
#include <string>
using namespace std;
int n;
int main(){
cin>>n;
string a;
cin>>a;
int num = 1;//当一个字母出现时它至少会出现一次
for (int i=0;i<n;i++){
if (a[i] == a[i+1]){
num++;
}
if (a[i]!=a[i+1]){//当前后不相等时证明相同字母已经结束,开始结算
cout << num;
cout << a[i];
num = 1;
}
}
return 0;
}
详细
小提示:点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 0ms
memory: 1244kb
input:
10 0123123023
output:
10111213111213101213
result:
ok single line: '10111213111213101213'
Test #2:
score: 10
Accepted
time: 0ms
memory: 1240kb
input:
10 0123412340
output:
10111213141112131410
result:
ok single line: '10111213141112131410'
Test #3:
score: 10
Accepted
time: 0ms
memory: 1248kb
input:
100 011010011001011010010110011010011001011001101001011010011001011010010110011010010110100110010110...
output:
1021101120212011102110112011102120211011202120111021202110112011102110112021201110211011201110212021...
result:
ok single line: '102110112021201110211011201110...1201110211011202120111021202110'
Test #4:
score: 10
Accepted
time: 0ms
memory: 1248kb
input:
100 012120201120201012201012120120201012201012120012120201201012120012120201120201012120201012201012...
output:
1011121112101210211210121011101122101110111211121011121012101110112210111011121112201112111210121011...
result:
ok single line: '101112111210121021121012101110...2101210111011221011101112111220'
Test #5:
score: 10
Accepted
time: 1ms
memory: 1244kb
input:
100 012312302301301212302301301201232301301201231230301201231230230112302301301201232301301201231230...
output:
1011121311121310121310111310111211121310121310111310111210111213121310111310111210111213111213101310...
result:
ok single line: '101112131112131012131011131011...3101112101112131112131013101112'
Test #6:
score: 10
Accepted
time: 0ms
memory: 1248kb
input:
100 012341234023401340124012312340234013401240123012342340134012401230123412340340124012301234123402...
output:
1011121314111213141012131410111314101112141011121311121314101213141011131410111214101112131011121314...
result:
ok single line: '101112131411121314101213141011...3101112131411121314101213141011'
Test #7:
score: 10
Accepted
time: 0ms
memory: 1248kb
input:
1000 01101001100101101001011001101001100101100110100101101001100101101001011001101001011010011001011...
output:
1021101120212011102110112011102120211011202120111021202110112011102110112021201110211011201110212021...
result:
ok single line: '102110112021201110211011201110...1201110212021101120212011102110'
Test #8:
score: 10
Accepted
time: 0ms
memory: 1244kb
input:
1000 01212020112020101220101212012020101220101212001212020120101212001212020112020101212020101220101...
output:
1011121112101210211210121011101122101110111211121011121012101110112210111011121112201112111210121011...
result:
ok single line: '101112111210121021121012101110...2111210121021121012101110111210'
Test #9:
score: 10
Accepted
time: 0ms
memory: 1244kb
input:
1000 01231230230130121230230130120123230130120123123030120123123023011230230130120123230130120123123...
output:
1011121311121310121310111310111211121310121310111310111210111213121310111310111210111213111213101310...
result:
ok single line: '101112131112131012131011131011...1121310121310111011121311121310'
Test #10:
score: 10
Accepted
time: 0ms
memory: 1244kb
input:
1000 01234123402340134012401231234023401340124012301234234013401240123012341234034012401230123412340...
output:
1011121314111213141012131410111314101112141011121311121314101213141011131410111214101112131011121314...
result:
ok single line: '101112131411121314101213141011...2141011121310111213141112131410'
Extra Test:
score: 0
Extra Test Passed