Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
107454 | 陈昊然 | 行程长度压缩 | C++ | Wrong Answer | 1 MS | 272 KB | 587 | 2025-01-17 21:06:00 |
#include<bits/stdc++.h> using namespace std; string s; int z; int main (){ cin>>s; int a=s.size(); for(int i=0;i<=a-1;i++){ if(s[i]==s[i+1]||s[i]-32==s[i+1]||s[i]+32==s[i+1]){ z++; }else if(s[i]>='A'&&s[i]<='S'){ cout<<"("<<s[i]<<","<<z+1<<")"; z=0; }else if(s[i]>='a'&&s[i]<='s'){ s[i]=s[i]+32; cout<<"("<<s[i]<<","<<z+1<<")"; z=0; } } if(s[a-1]>='A'&&s[a-1]<='S'){ cout<<"("<<s[a-1]<<","<<z+1<<")"; z=0; }else if(s[a-1]>='a'&&s[a-1]<='s'){ s[a-1]=s[a-1]+32; cout<<"("<<s[a-1]<<","<<z+1<<")"; z=0; } return 0; }