| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 72737 | 邓昊源 | 行程长度压缩 | C++ | Accepted | 1 MS | 288 KB | 426 | 2024-05-12 17:01:22 |
#include<bits/stdc++.h> using namespace std; int main(){ int sum = 0; string s; cin >> s; int len = s.size(); for(int i;i < len;i++){ if(s[i] >='a' && s[i] <= 'z'){ s[i] = s[i]-32; } } for(int i;i < len;i++){ if(i ==0 || s[i] == s[i-1]){ sum++; }else{ cout <<"(" << s[i-1] << "," << sum << ")"; sum = 1; } } cout <<"(" << s[len-1] << "," << sum << ")"; return 0; }