Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
46718 | zhouhuanyu 玙静 | 外观数列 | C++ | Wrong Answer | 0 MS | 276 KB | 453 | 2024-05-05 09:58:48 |
#include <bits/stdc++.h> using namespace std; char x[10001], y[10001]; int main(){ int n, lx, t, k; cin >> x >> n; lx = strlen(x); for(int i = 1; i < n; i++){ t = 1, k = 0; for(int j = 1; j <= lx; j++){ if(x[j] != x[j - 1]){ y[k] = t + '0'; y[k + 1] = x[j - 1]; k += 2; t = 1; }else{ t ++; } lx = k; memcpy(x, y, sizeof(y)); memset(y, 0, sizeof(y)); } } cout << x; return 0; }