Submission #1089693


Source Code Expand

/* template.cpp {{{ */
#include <bits/stdc++.h>
using namespace std;
#define get_macro(a, b, c, d, name, ...) name
#define rep(...) get_macro(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(...) get_macro(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define rep1(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, b) rep4(i, a, b, 1)
#define rep4(i, a, b, s) for (ll i = (a); i < (ll)(b); i += (ll)(s))
#define rrep1(n) rrep2(i_, n)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep3(i, a, b) rrep4(i, a, b, 1)
#define rrep4(i, a, b, s) for (ll i = (ll)(b) - 1; i >= (ll)(a); i -= (ll)(s))
#define each(x, c) for (auto &&x : c)
#define fs first
#define sc second
#define all(c) begin(c), end(c)
using ui = unsigned;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
const int inf = (int)1e9 + 10;
const ll inf_ll = (ll)1e18 + 10;
const ll mod = 1e9 + 7;
const ll mod9 = 1e9 + 9;
const int dx[]{-1, 0, 1, 0, -1, 1, 1, -1};
const int dy[]{0, -1, 0, 1, -1, -1, 1, 1};
template<class T, class U> void chmin(T &x, const U &y){ x = min<T>(x, y); }
template<class T, class U> void chmax(T &x, const U &y){ x = max<T>(x, y); }
struct prepare_ { prepare_(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(12); } } prepare__;
/* }}} */

string s;

int main(){
  cin >> s;
  ll n = s.size();
  ll res = 0;
  rep(i, n){
    ll c = 0;
    while (i + 1 < n && s[i] == '2' && s[i + 1] == '5'){
      c++;
      i += 2;
    }
    res += (c + 1) * c / 2;
  }
  cout << res << endl;
}

Submission Info

Submission Time
Task B - ニコニコ文字列
User jin_matakich
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1611 Byte
Status AC
Exec Time 19 ms
Memory 1184 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 5
AC × 18
AC × 30
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 17 ms 924 KB
subtask0_sample_02.txt AC 18 ms 796 KB
subtask0_sample_03.txt AC 18 ms 800 KB
subtask0_sample_04.txt AC 18 ms 796 KB
subtask0_sample_05.txt AC 16 ms 928 KB
subtask1_01.txt AC 18 ms 840 KB
subtask1_02.txt AC 18 ms 800 KB
subtask1_03.txt AC 18 ms 800 KB
subtask1_04.txt AC 17 ms 800 KB
subtask1_05.txt AC 18 ms 928 KB
subtask1_06.txt AC 18 ms 796 KB
subtask1_07.txt AC 19 ms 796 KB
subtask1_08.txt AC 18 ms 792 KB
subtask1_09.txt AC 18 ms 800 KB
subtask1_10.txt AC 18 ms 796 KB
subtask1_11.txt AC 19 ms 796 KB
subtask1_12.txt AC 16 ms 792 KB
subtask1_13.txt AC 18 ms 924 KB
subtask2_01.txt AC 19 ms 1184 KB
subtask2_02.txt AC 18 ms 1180 KB
subtask2_03.txt AC 19 ms 1056 KB
subtask2_04.txt AC 19 ms 1100 KB
subtask2_05.txt AC 18 ms 1180 KB
subtask2_06.txt AC 19 ms 1180 KB
subtask2_07.txt AC 18 ms 1056 KB
subtask2_08.txt AC 19 ms 1052 KB
subtask2_09.txt AC 18 ms 928 KB
subtask2_10.txt AC 18 ms 920 KB
subtask2_11.txt AC 16 ms 792 KB
subtask2_12.txt AC 18 ms 800 KB