Submission #7126524
Source Code Expand
#define _USE_MATH_DEFINES #include <cmath> #include <iostream> #include <string> #include <vector> #include <algorithm> #include <unordered_map> #include <math.h> #include <unordered_set> #include <iomanip> #include <cmath> #include <set> using namespace std; typedef long long ll; #define rep(i,n) for(int i = 0; i < (n); i++) #define INF 2 << 29 #define MOD 1000000007 #define Yes(f) puts((f)? "Yes" : "No") #define YES(f) puts((f)? "YES" : "NO") int gcd(int a, int b) { if (b != 0)return gcd(b, a % b); return a; } int lcm(int a, int b) { return a / gcd(a, b) * b; } using Graph = vector<vector<int>>; //cout << fixed << setprecision(6); int main() { string s, ans; cin >> s; int c = 1; char last = s[0]; for (int i = 1;i < s.length(); i++) { if (last == s[i]) c++; else { cout << s[i - 1] << c; last = s[i]; c = 1; } } cout << s[s.length() - 1] << c << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 高橋くんと文字列圧縮 |
User | takase |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 936 Byte |
Status | AC |
Exec Time | 6 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_1.txt, subtask0_2.txt, subtask0_3.txt |
All | 0.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0.txt | AC | 1 ms | 256 KB |
1.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
13.txt | AC | 1 ms | 256 KB |
14.txt | AC | 6 ms | 384 KB |
15.txt | AC | 1 ms | 256 KB |
16.txt | AC | 1 ms | 256 KB |
17.txt | AC | 1 ms | 256 KB |
18.txt | AC | 1 ms | 256 KB |
19.txt | AC | 1 ms | 256 KB |
2.txt | AC | 1 ms | 256 KB |
20.txt | AC | 1 ms | 256 KB |
21.txt | AC | 1 ms | 256 KB |
22.txt | AC | 1 ms | 256 KB |
23.txt | AC | 1 ms | 256 KB |
24.txt | AC | 1 ms | 256 KB |
25.txt | AC | 1 ms | 256 KB |
26.txt | AC | 1 ms | 256 KB |
27.txt | AC | 1 ms | 256 KB |
28.txt | AC | 1 ms | 256 KB |
29.txt | AC | 1 ms | 256 KB |
3.txt | AC | 1 ms | 256 KB |
4.txt | AC | 1 ms | 256 KB |
5.txt | AC | 1 ms | 256 KB |
6.txt | AC | 1 ms | 256 KB |
7.txt | AC | 1 ms | 256 KB |
8.txt | AC | 1 ms | 256 KB |
9.txt | AC | 1 ms | 256 KB |
subtask0_1.txt | AC | 1 ms | 256 KB |
subtask0_2.txt | AC | 1 ms | 256 KB |
subtask0_3.txt | AC | 1 ms | 256 KB |