fork download
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define fi first
  4. #define se second
  5. #define ll long long
  6. #define ull unsigned long long
  7. #define pll pair<ll,ll>
  8. #define pb push_back
  9. #define emb emplace_back
  10. #define lg(x) __lg(x)
  11. #define all(s) s.begin(),s.end()
  12. #define name "test"
  13. #define Mask(i) (1LL<<i)
  14. #define testbit(mask, i) ((mask >> i) & 1LL)
  15. #define onBit(mask, i) (mask | (1LL << i))
  16. #define offBit(mask, i) (mask & ~(1LL << i))
  17. #define flipBit(mask, i) (mask ^ (1LL << i))
  18. #define showbit(mask, x) bitset<x>(mask)
  19. const ll mod = 1e9 + 7;
  20.  
  21. void add(ll &a, ll b){
  22. if((a += b) >= mod) a -= mod;
  23. }
  24.  
  25.  
  26. const ll inf = 1e18;
  27. const ll lim = 1e7 + 5;
  28. const ll N = 1e7 + 1;
  29.  
  30. int chuyendoi(string x){
  31. int num = 0;
  32. for(int i = 0; i < x.size(); i++){
  33. num = num * 10 + x[i] - '0';
  34. }
  35.  
  36. return num;
  37. }
  38. int main()
  39. {
  40. ios_base::sync_with_stdio(0);
  41.  
  42. string s; cin >> s;
  43. string num = "";
  44. for(int i = 0; i < s.size(); i++){
  45. if('1' <= s[i] && s[i] <= '9'){
  46. while('1' <= s[i] && s[i] <= '9'){
  47. num += s[i];
  48. i++;
  49. }
  50. int so = chuyendoi(num);
  51. for(int j = 1; j <= so; j++) cout << s[i];
  52.  
  53. num = "";
  54. }
  55. else cout << s[i];
  56.  
  57.  
  58. }
  59. }
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
Success #stdin #stdout 0.01s 5288KB
stdin
Standard input is empty
stdout
Standard output is empty