problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02701 | Python | Time Limit Exceeded | N = int(input())
S = []
for i in range(N):
s = input()
if s not in S:
S.append(s)
print(len(S))
| N = int(input())
S = []
for i in range(N):
s = input()
S.append(s)
ans = len(S)
S.sort()
for i in range(1, N):
if S[i] == S[i - 1]:
ans -= 1
print(ans)
| replace | 4 | 7 | 4 | 11 | TLE | |
p02701 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> prise(N);
for (int i = 0; i < N; i++) {
cin >> prise.at(i);
}
int minus = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
if (prise.at(i) == prise.at(j)) {
prise.at(j) = j;
minus++;
}
}
}
cout << N - minus << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> prise(N);
for (int i = 0; i < N; i++) {
cin >> prise.at(i);
}
int minus = 0;
sort(prise.begin(), prise.end());
for (int i = 1; i < N; i++) {
if (prise.at(i - 1) == prise.at(i)) {
minus++;
}
}
cout << N - minus << endl;
} | replace | 11 | 17 | 11 | 15 | TLE | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
sort(s.begin(), s.end());
int cnt = 0;
rep(i, n) {
if (s[i - 1] != s[i])
cnt++;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
sort(s.begin(), s.end());
int cnt = 1;
for (int i = 1; i < n; i++) {
if (s[i - 1] != s[i])
cnt++;
}
cout << cnt << endl;
return 0;
}
| replace | 11 | 13 | 11 | 13 | 0 | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define vvi vector<vi>
#define vvl vector<vl>
#define all(x) x.begin(), x.end()
#define contains(con, x) con.find(x) != con.end()
#define fastread ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
int main() {
fastread;
int T = 1;
// cin >> T;
while (T--) {
int N;
cin >> N;
vector<string> s;
set<string> uniq;
for (int i = 0; i < N; i++) {
cin >> s[i];
uniq.insert(s[i]);
}
cout << uniq.size() << '\n';
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define vvi vector<vi>
#define vvl vector<vl>
#define all(x) x.begin(), x.end()
#define contains(con, x) con.find(x) != con.end()
#define fastread ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
int main() {
fastread;
int T = 1;
// cin >> T;
while (T--) {
int N;
cin >> N;
vector<string> s(N);
set<string> uniq;
for (int i = 0; i < N; i++) {
cin >> s[i];
uniq.insert(s[i]);
}
cout << uniq.size() << '\n';
}
} | replace | 24 | 25 | 24 | 25 | -11 | |
p02701 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int i, t;
cin >> t;
string val;
vector<string> name;
for (i = 0; i < t; i++) {
cin >> val;
name.push_back(val);
}
sort(name.begin(), name.end());
for (i = 0; i < t; i++) {
name.erase(unique(name.begin(), name.end()), name.end());
}
cout << name.size() << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int i, t;
cin >> t;
string val;
vector<string> name;
for (i = 0; i < t; i++) {
cin >> val;
name.push_back(val);
}
sort(name.begin(), name.end());
name.erase(unique(name.begin(), name.end()), name.end());
cout << name.size() << endl;
return 0;
}
| replace | 16 | 19 | 16 | 18 | TLE | |
p02701 | C++ | Time Limit Exceeded | /*
* WelcomeToAtCoder.cpp
*
* Created on: 2020/02/19
* Author: black
*/
#include <algorithm>
#include <iostream>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int N;
unordered_set<string> strList;
string tmp;
cin >> N;
int count = 0;
for (int i = 0; i < N; ++i) {
cin >> tmp;
if (std::find(strList.begin(), strList.end(), tmp) == strList.end()) {
strList.insert(tmp);
count++;
}
}
cout << count << endl;
return 0;
}
| /*
* WelcomeToAtCoder.cpp
*
* Created on: 2020/02/19
* Author: black
*/
#include <algorithm>
#include <iostream>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int N;
unordered_set<string> strList;
string tmp;
cin >> N;
int count = 0;
for (int i = 0; i < N; ++i) {
cin >> tmp;
if (strList.find(tmp) == strList.end()) {
strList.insert(tmp);
count++;
}
}
cout << count << endl;
return 0;
}
| replace | 21 | 22 | 21 | 22 | TLE | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++)
cin >> s[i];
sort(s, s + n);
int ans = 1;
string prev = s[1];
for (int i = 1; i < n; i++)
if (prev != s[i]) {
ans++;
prev = s[i];
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++)
cin >> s[i];
sort(s, s + n);
int ans = 1;
string prev = s[0];
for (int i = 1; i < n; i++)
if (prev != s[i]) {
ans++;
prev = s[i];
}
cout << ans;
} | replace | 14 | 15 | 14 | 15 | 0 | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define NewNode (TreeNode *)malloc(sizeof(TreeNode))
#define Mem(a, b) memset(a, b, sizeof(a))
const int N = 5e5 + 5;
const int INF = 0x3f3f3f3f;
const double EPS = 1e-10;
const unsigned long long mod = 19999999999999997;
const int II = 3.1415926535;
typedef long long ll;
typedef unsigned long long ull;
ull HASH[30050];
char str[30050];
int num = 279;
ull Hash(char str[]) {
ull ans = 0;
int len = strlen(str);
for (int i = 0; i < len; i++)
ans = (ans * num + (ull)str[i]) % mod;
return ans % mod;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%s", str);
HASH[i] = Hash(str);
}
int sum = n;
sort(HASH + 1, HASH + n + 1);
for (int i = 1; i < n; i++)
if (HASH[i] == HASH[i + 1])
sum--;
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define NewNode (TreeNode *)malloc(sizeof(TreeNode))
#define Mem(a, b) memset(a, b, sizeof(a))
const int N = 5e5 + 5;
const int INF = 0x3f3f3f3f;
const double EPS = 1e-10;
const unsigned long long mod = 19999999999999997;
const int II = 3.1415926535;
typedef long long ll;
typedef unsigned long long ull;
ull HASH[N];
char str[N];
int num = 279;
ull Hash(char str[]) {
ull ans = 0;
int len = strlen(str);
for (int i = 0; i < len; i++)
ans = (ans * num + (ull)str[i]) % mod;
return ans % mod;
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%s", str);
HASH[i] = Hash(str);
}
int sum = n;
sort(HASH + 1, HASH + n + 1);
for (int i = 1; i < n; i++)
if (HASH[i] == HASH[i + 1])
sum--;
cout << sum << endl;
} | replace | 11 | 13 | 11 | 13 | 0 | |
p02701 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
int ct = 0;
for (int i = 0; i < n; i++) {
ct++;
for (int j = i + 1; j < n; j++) {
if (s[i] == s[j]) {
ct--;
break;
}
}
}
cout << ct << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++)
cin >> s[i];
sort(s.begin(), s.end());
s.erase(unique(s.begin(), s.end()), s.end());
cout << s.size() << endl;
}
| replace | 11 | 22 | 11 | 15 | TLE | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> k(N);
for (int i = 0; i < N; i++) {
cin >> k.at(i);
}
sort(k.begin(), k.end());
cout << k.at(1) << endl;
k.erase(unique(k.begin(), k.end()));
cout << k.at(1) << endl;
cout << k.size() << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> k(N);
for (int i = 0; i < N; i++) {
cin >> k.at(i);
}
sort(k.begin(), k.end());
k.erase(unique(k.begin(), k.end()), k.end());
cout << k.size() << endl;
} | replace | 11 | 14 | 11 | 12 | 0 | |
p02701 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
long long inp_c, i1, out_n;
string inp_a[100005];
long long readNumber() {
long long temp_func;
scanf("%lld", &temp_func);
return temp_func;
};
long long printNumber(long long temp_func) {
printf("%lld", temp_func);
return 0;
};
int main() {
inp_c = readNumber();
for (i1 = 1; i1 <= inp_c; i1++) {
cin >> inp_a[i1];
};
sort(inp_a + 1, inp_a + 1 + inp_c);
for (i1 = 1; i1 <= inp_c; i1++) {
out_n += inp_a[i1] != inp_a[i1 - 1];
};
printNumber(out_n);
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
long long inp_c, i1, out_n;
string inp_a[200005];
long long readNumber() {
long long temp_func;
scanf("%lld", &temp_func);
return temp_func;
};
long long printNumber(long long temp_func) {
printf("%lld", temp_func);
return 0;
};
int main() {
inp_c = readNumber();
for (i1 = 1; i1 <= inp_c; i1++) {
cin >> inp_a[i1];
};
sort(inp_a + 1, inp_a + 1 + inp_c);
for (i1 = 1; i1 <= inp_c; i1++) {
out_n += inp_a[i1] != inp_a[i1 - 1];
};
printNumber(out_n);
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<string> v(n);
for (ll i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
ll ans = 0;
for (ll i = 0; i < n; i++) {
if (v[i] != v[i - 1])
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n;
cin >> n;
vector<string> v(n);
for (ll i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
ll ans = 1;
for (ll i = 1; i < n; i++) {
if (v[i] != v[i - 1])
ans++;
}
cout << ans << endl;
return 0;
} | replace | 12 | 14 | 12 | 14 | 0 | |
p02701 | C++ | Runtime Error | #include <iostream>
#include <set>
using namespace std;
int main() {
int N;
int i, num;
string S[1000];
cin >> N;
set<string> gift;
for (i = 0; i < N; i++) {
cin >> S[i];
}
for (i = 0; i < N; i++) {
gift.insert(S[i]);
}
num = gift.size();
cout << num << endl;
} | #include <iostream>
#include <set>
using namespace std;
int main() {
int N;
int i, num;
N >= 1;
N <= 200000;
string S[200000];
cin >> N;
set<string> gift;
for (i = 0; i < N; i++) {
cin >> S[i];
}
for (i = 0; i < N; i++) {
gift.insert(S[i]);
}
num = gift.size();
cout << num << endl;
} | replace | 7 | 8 | 7 | 10 | 0 | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<string> str(n);
rep(i, n) cin >> str[i];
sort(str.begin(), str.end());
int cnt = 1;
rep(i, n - 1) {
if (str[i - 1] != str[i])
cnt++;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<string> str(n);
rep(i, n) cin >> str[i];
sort(str.begin(), str.end());
int cnt = 1;
for (int i = 1; i < n; i++) {
if (str[i - 1] != str[i])
cnt++;
}
cout << cnt << endl;
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02701 | C++ | Runtime Error | #include <iostream>
#include <set>
using namespace std;
int main() {
int N;
int i, num;
N >= 1;
N <= 20000;
string S[20000];
cin >> N;
set<string> gift;
for (i = 0; i < N; i++) {
cin >> S[i];
}
for (i = 0; i < N; i++) {
gift.insert(S[i]);
}
num = gift.size();
cout << num << endl;
} | #include <iostream>
#include <set>
using namespace std;
int main() {
int N;
int i, num;
N >= 1;
N <= 200000;
string S[200000];
cin >> N;
set<string> gift;
for (i = 0; i < N; i++) {
cin >> S[i];
}
for (i = 0; i < N; i++) {
gift.insert(S[i]);
}
num = gift.size();
cout << num << endl;
} | replace | 8 | 10 | 8 | 10 | 0 | |
p02701 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++)
cin >> s[i];
int count = n;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (s[i] != "A" && s[i] == s[j]) {
count--;
s[j] = "A";
}
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s[n];
for (int i = 0; i < n; i++)
cin >> s[i];
int count = n;
sort(s, s + n);
for (int i = 1; i < n; i++) {
if (s[i - 1] == s[i]) {
count--;
}
}
cout << count << endl;
} | replace | 10 | 16 | 10 | 14 | TLE | |
p02701 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using Graph = vector<vector<int>>;
// MOD
const int MOD = 1000000007;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
int H, W;
int field[100][100];
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const double PI = 3.14159265358979323846;
bool seen[100][100];
string N[100];
bool memo[110];
bool flag;
Graph G;
int dist[100][100];
void dfs(int v, vector<bool> &seen, int &res) {
bool end = true;
for (int i = 0; i < seen.size(); ++i)
if (!seen[i] && i != v)
end = false;
if (end) {
++res;
return;
}
seen[v] = true;
for (auto nv : G[v]) {
if (seen[nv])
continue;
dfs(nv, seen, res);
}
seen[v] = false;
}
bool compare_f(pair<int, int> &x, pair<int, int> &y) {
return x.second < y.second;
}
int dp[100000];
int main() {
int n;
cin >> n;
// int n=3;
string s[n];
for (int i = 0; i < n; i++)
cin >> s[i];
int res = 0;
for (int i = 0; i < n; i++) {
bool ans = false;
for (int j = i + 1; j < n; j++) {
if (s[i] == s[j])
ans = true;
}
if (!ans)
res++;
}
cout << res << endl;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using Graph = vector<vector<int>>;
// MOD
const int MOD = 1000000007;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
int H, W;
int field[100][100];
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const double PI = 3.14159265358979323846;
bool seen[100][100];
string N[100];
bool memo[110];
bool flag;
Graph G;
int dist[100][100];
void dfs(int v, vector<bool> &seen, int &res) {
bool end = true;
for (int i = 0; i < seen.size(); ++i)
if (!seen[i] && i != v)
end = false;
if (end) {
++res;
return;
}
seen[v] = true;
for (auto nv : G[v]) {
if (seen[nv])
continue;
dfs(nv, seen, res);
}
seen[v] = false;
}
bool compare_f(pair<int, int> &x, pair<int, int> &y) {
return x.second < y.second;
}
int dp[100000];
int main() {
int n;
cin >> n;
// int n=3;
string s[n];
for (int i = 0; i < n; i++)
cin >> s[i];
int res = 1;
sort(s, s + n);
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1])
res++;
}
cout << res << endl;
} | replace | 80 | 89 | 80 | 84 | TLE | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> v;
while (n--) {
string s;
cin >> s;
v.push_back(s);
}
vector<string>::iterator ip;
ip = unique(v.begin(), v.begin() + n);
v.resize(distance(v.begin(), ip));
cout << v.size() << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> v;
while (n--) {
string s;
cin >> s;
v.push_back(s);
}
unordered_set<string> s;
int distinct = 0;
for (int i = 0; i < v.size(); i++) {
if (s.find(v[i]) == s.end()) {
s.insert(v[i]);
distinct++;
}
}
cout << distinct << endl;
}
| replace | 15 | 19 | 15 | 24 | -11 | |
p02701 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repp(i, n) for (int i = 1; i <= (int)(n); i++)
#define co(x) cout << x << endl
typedef long long int lint;
int main() {
int N;
cin >> N;
vector<string> S(0);
string si;
bool flg = true;
for (int i = 0; i < N; i++) {
cin >> si;
flg = true;
for (int j = 0; j < S.size(); j++) {
if (S.at(j) == si) {
flg = false;
break;
}
}
if (flg == true) {
S.push_back(si);
}
}
co(S.size());
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repp(i, n) for (int i = 1; i <= (int)(n); i++)
#define co(x) cout << x << endl
typedef long long int lint;
int main() {
int N;
cin >> N;
vector<string> S(N);
rep(i, N) { cin >> S.at(i); }
sort(S.begin(), S.end());
S.erase(unique(S.begin(), S.end()), S.end());
co(S.size());
} | replace | 10 | 27 | 10 | 14 | TLE | |
p02701 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s, n) for (int i = s; i < (n); ++i)
#define ALL(n) begin(n), end(n)
using ll = long long;
const ll INF = 1e18;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int N;
cin >> N;
vector<string> S(N);
REP(i, 0, N) cin >> S[i];
vector<string> data(N);
int data_num = 0;
int same_cnt = 0;
REP(i, 0, N) {
if (data_num == 0) {
data[0] = S[i];
++data_num;
} else {
REP(j, 0, data_num) {
if (S[i] == data[j]) {
++same_cnt;
break;
}
}
if (same_cnt == 0) {
data[data_num] = S[i];
++data_num;
}
same_cnt = 0;
}
}
cout << data_num << endl;
return 0;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s, n) for (int i = s; i < (n); ++i)
#define ALL(n) begin(n), end(n)
using ll = long long;
const ll INF = 1e18;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
int N;
cin >> N;
vector<string> S(N);
REP(i, 0, N) cin >> S[i];
// vector<string> data(N);
// int data_num = 0;
// int same_cnt = 0;
// REP(i, 0, N){
// if (data_num == 0){
// data[0] = S[i];
// ++data_num;
// } else{
// REP(j, 0, data_num){
// if (S[i] == data[j]){
// ++same_cnt;
// break;
// }
// }
// if (same_cnt == 0){
// data[data_num] = S[i];
// ++data_num;
// }
// same_cnt = 0;
// }
// }
// cout << data_num << endl;
set<string> st;
REP(i, 0, N) { st.insert(S[i]); }
cout << st.size() << endl;
return 0;
}
| replace | 28 | 50 | 28 | 54 | TLE | |
p02701 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define Sort(Array) sort(Array.begin(), Array.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define out(ans) cout << ans << endl;
int main() {
ll n;
cin >> n;
vector<string> s;
ll ans = 0;
for (ll i = 0; i < n; i++) {
// printf("%d time\n", i);
string k;
cin >> k;
if (binary_search(s.begin(), s.end(), k)) { // あったら
// printf("already exist ");
// out(k);
continue;
} else {
ans++; // なかったら
s.push_back(k);
Sort(s);
}
}
out(ans);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define Sort(Array) sort(Array.begin(), Array.end())
#define Reverse(a) reverse(a.begin(), a.end())
#define out(ans) cout << ans << endl;
int main() {
ll n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
sort(s.begin(), s.end());
ll ans = n;
for (ll i = 1; i < n; i++) {
if (s[i] == s[i - 1])
ans--;
}
out(ans);
}
| replace | 12 | 27 | 12 | 22 | TLE | |
p02701 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int i, cnt, n;
string a[100000];
scanf("%d", &n);
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
cnt = 1;
for (i = 1; i < n; i++) {
if (a[i] != a[i - 1])
cnt++;
}
cout << cnt << endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int i, cnt, n;
string a[200000];
scanf("%d", &n);
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
cnt = 1;
for (i = 1; i < n; i++) {
if (a[i] != a[i - 1])
cnt++;
}
cout << cnt << endl;
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
string s[100010];
map<string, int> mp;
int n;
int main() {
cin >> n;
// for(register int i = 1; i <= n; i++) cin >> s[i];
for (register int i = 1; i <= n; i++) {
cin >> s[i];
mp[s[i]]++;
}
int jsq = 0;
map<string, int>::iterator iter;
for (iter = mp.begin(); iter != mp.end(); iter++) {
if (iter->second >= 1)
jsq++;
}
cout << jsq;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
string s[300010];
map<string, int> mp;
int n;
int main() {
cin >> n;
// for(register int i = 1; i <= n; i++) cin >> s[i];
for (register int i = 1; i <= n; i++) {
cin >> s[i];
mp[s[i]]++;
}
int jsq = 0;
map<string, int>::iterator iter;
for (iter = mp.begin(); iter != mp.end(); iter++) {
if (iter->second >= 1)
jsq++;
}
cout << jsq;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02701 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> arr(N);
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
int flag = true;
vector<string> kind;
for (int i = 0; i < N; i++) {
flag = true;
for (int j = 0; j < kind.size(); j++) {
if (arr[i] == kind[j]) {
flag = false;
break;
}
}
if (flag)
kind.push_back(arr[i]);
}
cout << kind.size() << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> arr(N);
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
sort(arr.begin(), arr.end());
arr.erase(unique(arr.begin(), arr.end()), arr.end());
cout << arr.size() << endl;
}
| replace | 12 | 26 | 12 | 15 | TLE | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
string s[N];
set<string> st;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
st.insert(s[i]);
}
cout << st.size() << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
string s[N];
set<string> st;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
st.insert(s[i]);
}
cout << st.size() << endl;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pb push_back
#define sz(s) (int)s.size()
#define all(v) v.begin(), v.end()
#define show(a) cerr << #a << " -> " << a << "\n"
ll mn = 1000000, mx = -1000000000;
ll cnt, cnt2, sum, x, y;
int n;
string s[10000];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s, s + n);
for (int i = 0; i < n; i++) {
if (s[i] != s[i + 1]) {
cnt++;
}
}
cout << cnt;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pb push_back
#define sz(s) (int)s.size()
#define all(v) v.begin(), v.end()
#define show(a) cerr << #a << " -> " << a << "\n"
ll mn = 1000000, mx = -1000000000;
ll cnt, cnt2, sum, x, y;
int n;
string s[300001];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s, s + n);
for (int i = 0; i < n; i++) {
if (s[i] != s[i + 1]) {
cnt++;
}
}
cout << cnt;
return 0;
} | replace | 14 | 15 | 14 | 15 | 0 | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
sort(s.begin(), s.end());
int cnt = 0;
rep(i, n) {
if (s[i] != s[i - 1])
cnt++;
}
cout << cnt << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s[i];
sort(s.begin(), s.end());
int cnt = 1;
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1])
cnt++;
}
cout << cnt << endl;
return 0;
}
| replace | 11 | 13 | 11 | 13 | 0 | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
sort(S.begin(), S.end());
int count = N;
for (int i = 0; i < N; i++) {
if (S.at(i) == S.at(i + 1)) {
count--;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
sort(S.begin(), S.end());
int count = N;
for (int i = 1; i < N; i++) {
if (S.at(i - 1) == S.at(i)) {
count--;
}
}
cout << count << endl;
} | replace | 11 | 13 | 11 | 13 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 3) >= this->size() (which is 3)
|
p02701 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
int N;
cin >> N;
string S[20010];
for (int i = 0; i < N; i++) {
cin >> S[i];
}
unordered_map<string, int> map;
for (int i = 0; i < N; i++) {
map[S[i]] = 1;
}
cout << map.size() << endl;
} | #include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
int N;
cin >> N;
string S[200010];
for (int i = 0; i < N; i++) {
cin >> S[i];
}
unordered_map<string, int> map;
for (int i = 0; i < N; i++) {
map[S[i]] = 1;
}
cout << map.size() << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02701 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const int N = 1e5 + 10;
string s[N];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
sort(s, s + n);
cout << (unique(s, s + n) - s) << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const int N = 2e5 + 10;
string s[N];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
sort(s, s + n);
cout << (unique(s, s + n) - s) << endl;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02701 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, k;
k = 1;
cin >> N;
vector<string> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
if (vec.at(i) == vec.at(j)) {
break;
} else {
if (j == N - 1) {
k = k + 1;
}
}
}
}
cout << k << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, k;
k = 1;
cin >> N;
vector<string> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N - 1; i++) {
if (vec.at(i) != vec.at(i + 1)) {
k = k + 1;
}
}
cout << k << endl;
}
| replace | 11 | 20 | 11 | 15 | TLE | |
p02701 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map> //map<int, int> x;
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i <= (int)(n); i++)
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using ll = long long;
using namespace std;
int main() {
int n;
int count = 0;
cin >> n;
string a;
vector<string> strlist(1000);
rep(i, n) cin >> strlist[i];
sort(strlist.begin(), strlist.end());
strlist.erase(unique(strlist.begin(), strlist.end()), strlist.end());
cout << int(strlist.size() - 1) << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map> //map<int, int> x;
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i <= (int)(n); i++)
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
using ll = long long;
using namespace std;
int main() {
int n;
int count = 0;
cin >> n;
string a;
vector<string> strlist(10000000);
rep(i, n) cin >> strlist[i];
sort(strlist.begin(), strlist.end());
strlist.erase(unique(strlist.begin(), strlist.end()), strlist.end());
cout << int(strlist.size() - 1) << endl;
return 0;
} | replace | 18 | 19 | 18 | 19 | 0 | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s.at(i);
sort(s.begin(), s.end());
int ans = n;
rep(i, n) {
if (s[i] == s[i - 1])
ans--;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<string> s(n);
rep(i, n) cin >> s.at(i);
sort(s.begin(), s.end());
int ans = n;
for (int j = 1; j < n; j++) {
if (s[j] == s[j - 1])
ans--;
}
cout << ans << endl;
}
| replace | 12 | 14 | 12 | 14 | 0 | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<string> vec(20001);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
vec.erase(unique(vec.begin(), vec.end()), vec.end());
cout << vec.size() - 1;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
vector<string> vec(200002);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
vec.erase(unique(vec.begin(), vec.end()), vec.end());
cout << vec.size() - 1;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02701 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int N;
vector<string> s;
int main() {
cin >> N;
s.resize(N);
for (int i = 0; i < N; i++)
cin >> s[i];
int cnt = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
if (s[i] == s[j])
break;
if (j == N - 1)
cnt++;
}
if (i == N - 1)
cnt++;
}
cout << cnt << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int N;
vector<string> s;
int main() {
cin >> N;
s.resize(N);
for (int i = 0; i < N; i++)
cin >> s[i];
sort(s.begin(), s.end());
int cnt = 1;
for (int i = 0; i < N - 1; i++) {
if (s[i] != s[i + 1])
cnt++;
}
cout << cnt << endl;
return 0;
}
| replace | 11 | 20 | 11 | 15 | TLE | |
p02701 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
void solve(long long N, std::vector<std::string> S) {
long long ans = 0;
std::vector<std::string> tmp;
std::vector<std::string>::iterator sIter;
for (long long i = 0; i < N; i++) {
sIter = std::find(tmp.begin(), tmp.end(), S[i]);
if (sIter == tmp.end()) {
tmp.push_back(S[i]);
ans += 1;
}
}
cout << ans << endl;
return;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long N;
scanf("%lld", &N);
std::vector<std::string> S(N);
for (int i = 0; i < N; i++) {
std::cin >> S[i];
}
solve(N, std::move(S));
return 0;
}
| #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
void solve(long long N, std::vector<std::string> S) {
std::sort(S.begin(), S.end());
S.erase(std::unique(S.begin(), S.end()), S.end());
cout << S.size() << endl;
return;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long N;
scanf("%lld", &N);
std::vector<std::string> S(N);
for (int i = 0; i < N; i++) {
std::cin >> S[i];
}
solve(N, std::move(S));
return 0;
}
| replace | 8 | 22 | 8 | 11 | TLE | |
p02701 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
vector<string> s;
int answer = 0;
for (int i = 0; i < N; i++) {
if (find(s.begin(), s.end(), S.at(i)) == s.end()) {
answer++;
s.emplace_back(S.at(i));
}
}
cout << answer << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
sort(S.begin(), S.end());
S.erase(unique(S.begin(), S.end()), S.end());
cout << S.size() << endl;
} | replace | 10 | 19 | 10 | 13 | TLE | |
p02701 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int N = 2e5 + 5;
int a[N][26];
int cnt[N], idx, ans;
void ins(char str[]) {
int p = 0;
for (int i = 0; str[i]; i++) {
int u = str[i] - 'a';
if (!a[p][u])
a[p][u] = ++idx;
p = a[p][u];
}
cnt[p]++;
if (cnt[p] == 1)
ans++;
}
int main() {
int t;
cin >> t;
while (t--) {
char str[12];
scanf("%s", str);
ins(str);
}
cout << ans;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const int N = 2e6 + 5;
int a[N][26];
int cnt[N], idx, ans;
void ins(char str[]) {
int p = 0;
for (int i = 0; str[i]; i++) {
int u = str[i] - 'a';
if (!a[p][u])
a[p][u] = ++idx;
p = a[p][u];
}
cnt[p]++;
if (cnt[p] == 1)
ans++;
}
int main() {
int t;
cin >> t;
while (t--) {
char str[12];
scanf("%s", str);
ins(str);
}
cout << ans;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
sort(S.begin(), S.end());
for (int i = 0; i < N; i++) {
bool memo = true;
if (S.at(i) == S.at(i + 1)) {
memo = false;
}
if (memo == true) {
ans++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
int ans = 0;
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
sort(S.begin(), S.end());
for (int i = 0; i < N; i++) {
bool memo = true;
if (i != N - 1) {
if (S.at(i) == S.at(i + 1)) {
memo = false;
}
}
if (memo == true) {
ans++;
}
}
cout << ans << endl;
} | replace | 14 | 16 | 14 | 18 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 3) >= this->size() (which is 3)
|
p02701 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main() {
ll n;
cin >> n;
ll ans = n;
ll ka = 0;
vector<string> a(n);
rep(i, n) {
cin >> a.at(i);
rep(j, i) {
if (a.at(i) == a.at(j)) {
ka++;
break;
}
}
}
cout << ans - ka << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main() {
ll n;
cin >> n;
ll ans = n;
ll ka = 0;
vector<string> a(n);
rep(i, n) { cin >> a.at(i); }
sort(all(a));
rep(i, n - 1) {
if (a.at(i) == a.at(i + 1))
ka++;
}
cout << ans - ka << endl;
}
| replace | 14 | 22 | 14 | 20 | TLE | |
p02701 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n;
int flag = 0;
int count = 0;
cin >> n;
vector<string> s(n);
for (i = 0; i < n; i++) {
cin >> s.at(i);
}
for (i = 0; i < n; i++) {
flag = 0;
for (j = 0; j < i; j++) {
if (s.at(i) == s.at(j)) {
flag = 1;
}
}
if (flag == 0) {
count++;
}
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n;
int flag = 0;
int count = 0;
cin >> n;
vector<string> s(n);
for (i = 0; i < n; i++) {
cin >> s.at(i);
}
sort(s.begin(), s.end());
s.erase(unique(s.begin(), s.end()), s.end());
for (i = 0; i < s.size(); i++) {
count++;
}
cout << count << endl;
}
| replace | 14 | 24 | 14 | 19 | TLE | |
p02701 | C++ | Time Limit Exceeded | // gacha
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
vector<string> v;
v.push_back(s[0]);
for (int i = 1; i < n; i++) {
v.push_back(s[i]);
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
}
cout << v.size() << endl;
return 0;
} | // gacha
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s.begin(), s.end());
s.erase(unique(s.begin(), s.end()), s.end());
cout << s.size() << endl;
return 0;
} | replace | 11 | 19 | 11 | 16 | TLE | |
p02701 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S[i];
}
vector<string> prize;
for (int i = 0; i < N; i++) {
if (find(prize.begin(), prize.end(), S[i]) == prize.end()) {
prize.push_back(S[i]);
}
}
cout << prize.size() << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S[i];
}
sort(S.begin(), S.end());
S.erase(unique(S.begin(), S.end()), S.end());
// vector<string> prize;
// for (int i = 0; i < N; i++) {
// if (find(prize.begin(), prize.end(), S[i]) == prize.end()) {
// prize.push_back(S[i]);
//}
//}
cout << S.size() << endl;
return 0;
}
| replace | 11 | 18 | 11 | 20 | TLE | |
p02701 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s[10005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i];
}
sort(s + 1, s + 1 + n);
int cnt = 1;
for (int i = 2; i <= n; i++) {
if (s[i] != s[i - 1]) {
cnt++;
}
}
cout << cnt << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string s[200005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i];
}
sort(s + 1, s + 1 + n);
int cnt = 1;
for (int i = 2; i <= n; i++) {
if (s[i] != s[i - 1]) {
cnt++;
}
}
cout << cnt << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s[100005];
long n, i;
map<string, long> mp;
while (cin >> n) {
for (i = 0; i < n; i++) {
cin >> s[i];
mp[s[i]] = i;
}
cout << mp.size() << endl;
mp.clear();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s[200005];
long n, i;
map<string, long> mp;
while (cin >> n) {
for (i = 0; i < n; i++) {
cin >> s[i];
mp[s[i]] = i;
}
cout << mp.size() << endl;
mp.clear();
}
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02701 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s[100000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s, s + n);
int ans = 1;
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1]) {
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s[200000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
sort(s, s + n);
int ans = 1;
for (int i = 1; i < n; i++) {
if (s[i] != s[i - 1]) {
ans++;
}
}
cout << ans << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = array<ll, 3>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MINF = 0x7fffffffffff;
const ll LPLMT = 10000000; // O(n)のloop上限
const ll NLGLMT =
200000; // O(NlogN)のloop上限（これで指定されたfor文の中にO(logN)の処理を書く）
const ll N2LMT = 3000; // O(n^2)のloop上限
const ll N3LMT = 100; // O(n^3)のloop上限
const ll N4LMT = 50; // O(n^4)のloop上限
const ll TNLMT =
20; // O(2^n)のloop上限（実際この計算量になるのは全探索くらいなので，この値自体を使うことはなさそう）（オーダの参考程度に）
const int INF = 0x3fffffff;
const int MOD = 1000000007;
const int MODD = 998244353;
const ld DINF = numeric_limits<ld>::infinity();
const ld EPS = 1e-9;
const ld PI = 3.1415926535897932;
const ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(_1, _2, _3, name, ...) name
/*繰り返し*/
#define rep1(n) for (ll i = 0; i < n; ++i) // n回repeat
#define rep2(i, n) for (ll i = 0; i < n; ++i) // n回repeat（変数指定）
#define rep3(i, a, b) for (ll i = a; i < b; ++i) // a-bまでrepeat
#define rep4(i, a, b, c) \
for (ll i = a; i < b; i += c) // a-bまで公差cでrepeat（等差数列で使えそう）
#define rep(...) \
overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) // repeatまとめ
#define rrep1(n) for (ll i = (n); i--;)
#define rrep2(i, n) for (ll i = (n); i--;)
#define rrep3(i, a, b) for (ll i = (b); i-- > (a);)
#define rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
overload4(__VA_ARGS__, rrep4, rrep3, rrep2, \
rrep1)(__VA_ARGS__) // 逆repeatまとめ
#define each1(i, a) for (auto &&i : a)
#define each2(x, y, a) for (auto &&[x, y] : a)
#define each3(x, y, z, a) for (auto &&[x, y, z] : a)
#define each(...) \
overload4(__VA_ARGS__, each3, each2, \
each1)(__VA_ARGS__) // 配列の各要素の読み出し
#define all1(i) begin(i), end(i)
#define all2(i, a) begin(i), begin(i) + a
#define all3(i, a, b) begin(i) + a, begin(i) + b
#define all(...) \
overload3(__VA_ARGS__, all3, all2, \
all1)(__VA_ARGS__) // vectorの始めと終わりの読み取り
#define rall1(i) (i).rbegin(), (i).rend()
#define rall2(i, k) (i).rbegin(), (i).rbegin() + k
#define rall3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rall(...) \
overload3(__VA_ARGS__, rall3, rall2, \
rall1)(__VA_ARGS__) // 逆イテレータの取得(rbegin：末尾,rend：頭）
#define sum(...) \
accumulate( \
all(__VA_ARGS__), \
0LL) // vectorの合計(int形で受け付けてしまうので，小数で扱いたい場合はdsumを使う)
#define dsum(...) \
accumulate(all(__VA_ARGS__), 0.0L) // 小数で扱う(long long doubleなど)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
/*標準入力*/
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__) // int型標準入力受付，以下LDまで同様
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define LD(...) \
ld __VA_ARGS__; \
in(__VA_ARGS__)
/*vector操作*/
#define Sort(a) sort(all(a)) // 昇順ソート
#define RSort(vec) sort(vec.begin(), vec.end(), greater<ll>()) // 降順ソート
#define Rev(a) reverse(all(a)) // 逆順
#define Uniq(a) \
sort(all(a)); \
a.erase(unique(all(a)), end(a))
#define vec(type, name, ...) vector<type> name(__VA_ARGS__) // type型vectorの定義
#define VEC(type, name, size) \
vector<type> name(size); \
in(name) // type型vector(size指定)標準入力受付
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
in(name)
#define IV(type, name, size) \
vector<pair<int, int>> name; \
for (int i = 0; i < size; i++) { \
int a_i; \
cin >> a_i; \
name.emplace_back(a_i, i); \
} // Indexつきvector（pair型Vector,(data,index)）
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
template <class T> auto min(const T &a) { return *min_element(all(a)); }
template <class T> auto max(const T &a) { return *max_element(all(a)); }
inline ll popcnt(ull a) { return __builtin_popcountll(a); }
ll gcd(ll a, ll b) {
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
ll intpow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans *= a;
a *= a;
b /= 2;
}
return ans;
}
ll modpow(ll a, ll b, ll p) {
ll ans = 1;
while (b) {
if (b & 1)
(ans *= a) %= p;
(a *= a) %= p;
b /= 2;
}
return ans;
}
template <class T, class U> bool chmin(T &a, const U &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
vector<ll> iota(ll n) {
vector<ll> a(n);
iota(a.begin(), a.end(), 0);
return a;
}
vector<pll> factor(ull x) {
vector<pll> ans;
for (ull i = 2; i * i <= x; i++)
if (x % i == 0) {
ans.push_back({i, 1});
while ((x /= i) % i == 0)
ans.back().second++;
}
if (x != 1)
ans.push_back({x, 1});
return ans;
}
map<ll, ll> factor_map(ull x) {
map<ll, ll> ans;
for (ull i = 2; i * i <= x; i++)
if (x % i == 0) {
ans[i] = 1;
while ((x /= i) % i == 0)
ans[i]++;
}
if (x != 1)
ans[x] = 1;
return ans;
}
vector<ll> divisor(ull x) {
vector<ll> ans;
for (ull i = 1; i * i <= x; i++)
if (x % i == 0)
ans.push_back(i);
rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]);
return ans;
}
template <class T> unordered_map<T, ll> press(vector<T> &a) {
auto b = a;
sort(all(b));
b.erase(unique(all(b)), b.end());
unordered_map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
template <class T> map<T, ll> press_map(vector<T> &a) {
auto b = a;
sort(all(b));
b.erase(unique(all(b)), b.end());
map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
int scan() { return getchar(); }
void scan(int &a) { scanf("%d", &a); }
void scan(unsigned &a) { scanf("%u", &a); }
void scan(long &a) { scanf("%ld", &a); }
void scan(long long &a) { scanf("%lld", &a); }
void scan(unsigned long long &a) { scanf("%llu", &a); }
void scan(char &a) {
do {
a = getchar();
} while (a == ' ' || a == '\n');
}
void scan(float &a) { scanf("%f", &a); }
void scan(double &a) { scanf("%lf", &a); }
void scan(long double &a) { scanf("%Lf", &a); }
void scan(vector<bool> &a) {
for (unsigned i = 0; i < a.size(); i++) {
int b;
scan(b);
a[i] = b;
}
}
void scan(char a[]) { scanf("%s", a); }
void scan(string &a) { cin >> a; }
template <class T> void scan(vector<T> &);
template <class T, size_t size> void scan(array<T, size> &);
template <class T, class L> void scan(pair<T, L> &);
template <class T, size_t size> void scan(T (&)[size]);
template <class T> void scan(vector<T> &a) {
for (auto &&i : a)
scan(i);
}
template <class T> void scan(deque<T> &a) {
for (auto &&i : a)
scan(i);
}
template <class T, size_t size> void scan(array<T, size> &a) {
for (auto &&i : a)
scan(i);
}
template <class T, class L> void scan(pair<T, L> &p) {
scan(p.first);
scan(p.second);
}
template <class T, size_t size> void scan(T (&a)[size]) {
for (auto &&i : a)
scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
void print() { putchar(' '); }
void print(bool a) { printf("%d", a); }
void print(int a) { printf("%d", a); }
void print(unsigned a) { printf("%u", a); }
void print(long a) { printf("%ld", a); }
void print(long long a) { printf("%lld", a); }
void print(unsigned long long a) { printf("%llu", a); }
void print(char a) { printf("%c", a); }
void print(char a[]) { printf("%s", a); }
void print(const char a[]) { printf("%s", a); }
void print(float a) { printf("%.15f", a); }
void print(double a) { printf("%.15f", a); }
void print(long double a) { printf("%.15Lf", a); }
void print(const string &a) {
for (auto &&i : a)
print(i);
}
template <class T> void print(const vector<T> &);
template <class T, size_t size> void print(const array<T, size> &);
template <class T, class L> void print(const pair<T, L> &p);
template <class T, size_t size> void print(const T (&)[size]);
template <class T> void print(const vector<T> &a) {
if (a.empty())
return;
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T> void print(const deque<T> &a) {
if (a.empty())
return;
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T, size_t size> void print(const array<T, size> &a) {
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T, class L> void print(const pair<T, L> &p) {
print(p.first);
putchar(' ');
print(p.second);
}
template <class T, size_t size> void print(const T (&a)[size]) {
print(a[0]);
for (auto i = a; ++i != end(a);) {
putchar(' ');
print(*i);
}
}
template <class T> void print(const T &a) { cout << a; }
int out() {
putchar('\n');
return 0;
}
template <class T> int out(const T &t) {
print(t);
putchar('\n');
return 0;
} // cout<<t<<endl
template <class Head, class... Tail>
int out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
return 0;
}
#ifdef DEBUG
inline ll __lg(ull __n) {
return sizeof(ull) * __CHAR_BIT__ - 1 - __builtin_clzll(__n);
}
#define debug(...) \
{ \
print(#__VA_ARGS__); \
print(":"); \
out(__VA_ARGS__); \
}
#else
#define debug(...) void(0)
#endif
/*判定出力*/
int first(bool i = true) {
return out(i ? "first" : "second");
} // iがfirstか判断，以下同様
int yes(bool i = true) { return out(i ? "yes" : "no"); }
int Yes(bool i = true) { return out(i ? "Yes" : "No"); }
int No() { return out("No"); }
int YES(bool i = true) { return out(i ? "YES" : "NO"); }
int NO() { return out("NO"); }
int Yay(bool i = true) { return out(i ? "Yay!" : ":("); }
int possible(bool i = true) { return out(i ? "possible" : "impossible"); }
int Possible(bool i = true) { return out(i ? "Possible" : "Impossible"); }
int POSSIBLE(bool i = true) { return out(i ? "POSSIBLE" : "IMPOSSIBLE"); }
void Case(ll i) { printf("Case #%lld: ", i); }
/*vector探索*/
#define bSearch(v, k) \
binary_search(all(v), k) // ソートされた配列vの中の要素にkがあるか(boolean)
#define lowB(v, k) \
lower_bound(all(v), \
k) // ソートされた配列vの中の要素のうちk以上かつ最小のイテレータ
#define DLbetB(v, k) lowB(v, k) - v.begin() // 先頭からの距離
#define DLbetE(v, k) v.end() - lowB(v, k) // 末尾からの距離
#define uppB(v, k) \
upper_bound( \
all(v), \
k) // ソートされた配列vの中の要素のうちkより大きいかつ最小のイテレータ
#define DUbetB(v, k) uppB(v, k) - v.begin() // 先頭からの距離
#define DUbetE(v, k) v.end() - uppB(v, k) // 末尾からの距離
#define Cnt(v, k) count(all(v), k) // 配列vの中で要素kが何個あるかを返す(size_t)
#define CntIf(v, l) \
count_if(all(v), \
l) // 配列vの中で条件式(lambda式)を満たす個数を返す(ex.int num =
// count_if(v.begin(), v.end(), [](int i){return i % 3 == 0;});)
#define Sort2D(myVec, i) \
sort(myVec.begin(), myVec.end(), \
[](const vector<ll> &alpha, const vector<ll> &beta) { \
return alpha[i] < beta[i]; \
}); // i列めでソート
/*最大公約数*/
template <class T> T vgcd(T m, T n) { return gcd(m, n); }
template <class T, class... Args> T vgcd(T a, Args... args) {
return vgcd(a, vgcd(args...));
}
/*階乗*/
ll facctorialMethod(ll k) {
ll sum = 1;
for (ll i = 1; i <= k; ++i) {
sum *= i;
// sum%=MOD;//あまりを出力せよ問題の時はこれもやる
}
return sum;
}
/*組み合わせnCk*/
ll comb(const ll N, const ll K) {
vector<vector<long long int>> v(N + 1, vector<long long int>(N + 1, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
return v[N][K];
}
/*逆元 あまりの割り算をするときにこいつをかける(a/b→a*modinv(b))*/
// mod. m での a の逆元 a^{-1} を計算する
ll modinv(ll a, ll m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
/*ダブリング*/
/*
参考：http://satanic0258.hatenablog.com/entry/2017/02/23/222647
使える場所：1回遷移した先が明確にわかる時
目的：
・ある数XのQ乗を求める
・根付き木において、ある頂点vのQ個上の親を知る
・ある地点からQ回進んだ先を求める
*/
// int N; // 全体の要素数
// int Q;//試行回数
ll doubling(
const ll N, const ll Q,
vector<ll> a) { // cin>>N>>Q;//標準入力から要素数と試行回数を受け取る場合
ll LOG_Q = floor(log2(Q)) + 1;
// next[k][i]で、i番目の要素の「2^k個次の要素」を指す
// (なお、i番目の要素に対して「2^k個次の要素」が存在しないとき、
// next[k][i]が指し示す要素番号を-1とします)
std::vector<std::vector<ll>> next(LOG_Q + 1, std::vector<ll>(N));
// ll a[N];//各要素の次の行き先
// next[0]を計算
for (int i = 0; i < N; ++i) {
next[0][i] = a[i];
}
// nextを計算
for (ll k = 0; k < LOG_Q; ++k) {
for (int i = 0; i < N; ++i) {
if (next[k][i] == -1) {
// 2^k個次に要素が無い時、当然2^(k+1)個次にも要素はありません
next[k + 1][i] = -1;
} else {
// 「2^k個次の要素」の2^k個次の要素は、2^(k+1)個次の要素です
next[k + 1][i] = next[k][next[k][i]];
}
}
}
// ----ここまで準備----
// p番目の要素の「Q個次の要素」を求めることを考えます
ll p = 0;
for (ll k = LOG_Q - 1; k >= 0; --k) {
if (p == -1) {
// pがすでに存在しない要素を指していたら、
// それ以降で存在する要素を指すことはないためループを抜けます
break;
}
if ((Q >> k) & 1) { // ex(Q=5)5=101(2)であり，2^2+2^0回進むことを表す
// Qを二進展開した際、k番目のビットが立っていたら、
// pの位置を2^kだけ次にずらします
p = next[k][p];
}
}
return p; // ここでのpが最終的な答えになる
}
/*素数判定*/
bool IsPrime(ll num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
// 素数ではない
return false;
}
}
// 素数である
return true;
}
/*ページのソースを表示->command+F->問題文 で問題文コピペする
*/
// ceil()//切り上げ
// floor()//切り捨て
// round()//四捨五入
// deque<ll> deq;//両端キュー使う，先頭と末尾へのアクセスが早い
// using std::map;
// map<ll,ll>memo;//<キー，その要素＞，キーの検索が早い，キーは昇順にソートされる
signed main() {
/*以下コード*/
ll ans = 0;
STR(s);
size_t n = s.size();
std::vector<ll> dp(n + 1, 0);
std::vector<ll> mod(2019, 0);
mod[0]++;
ll t = 1;
rep(n) {
dp[i + 1] = (dp[i] + t * (int)(s[n - 1 - i] - '0')) % 2019;
mod[dp[i + 1]]++;
t *= 10;
t %= 2019;
}
each(i, mod) if (i > 1) ans +=
facctorialMethod(i) / (2 * facctorialMethod(i - 2));
out(ans);
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = array<ll, 3>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MINF = 0x7fffffffffff;
const ll LPLMT = 10000000; // O(n)のloop上限
const ll NLGLMT =
200000; // O(NlogN)のloop上限（これで指定されたfor文の中にO(logN)の処理を書く）
const ll N2LMT = 3000; // O(n^2)のloop上限
const ll N3LMT = 100; // O(n^3)のloop上限
const ll N4LMT = 50; // O(n^4)のloop上限
const ll TNLMT =
20; // O(2^n)のloop上限（実際この計算量になるのは全探索くらいなので，この値自体を使うことはなさそう）（オーダの参考程度に）
const int INF = 0x3fffffff;
const int MOD = 1000000007;
const int MODD = 998244353;
const ld DINF = numeric_limits<ld>::infinity();
const ld EPS = 1e-9;
const ld PI = 3.1415926535897932;
const ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(_1, _2, _3, name, ...) name
/*繰り返し*/
#define rep1(n) for (ll i = 0; i < n; ++i) // n回repeat
#define rep2(i, n) for (ll i = 0; i < n; ++i) // n回repeat（変数指定）
#define rep3(i, a, b) for (ll i = a; i < b; ++i) // a-bまでrepeat
#define rep4(i, a, b, c) \
for (ll i = a; i < b; i += c) // a-bまで公差cでrepeat（等差数列で使えそう）
#define rep(...) \
overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) // repeatまとめ
#define rrep1(n) for (ll i = (n); i--;)
#define rrep2(i, n) for (ll i = (n); i--;)
#define rrep3(i, a, b) for (ll i = (b); i-- > (a);)
#define rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
overload4(__VA_ARGS__, rrep4, rrep3, rrep2, \
rrep1)(__VA_ARGS__) // 逆repeatまとめ
#define each1(i, a) for (auto &&i : a)
#define each2(x, y, a) for (auto &&[x, y] : a)
#define each3(x, y, z, a) for (auto &&[x, y, z] : a)
#define each(...) \
overload4(__VA_ARGS__, each3, each2, \
each1)(__VA_ARGS__) // 配列の各要素の読み出し
#define all1(i) begin(i), end(i)
#define all2(i, a) begin(i), begin(i) + a
#define all3(i, a, b) begin(i) + a, begin(i) + b
#define all(...) \
overload3(__VA_ARGS__, all3, all2, \
all1)(__VA_ARGS__) // vectorの始めと終わりの読み取り
#define rall1(i) (i).rbegin(), (i).rend()
#define rall2(i, k) (i).rbegin(), (i).rbegin() + k
#define rall3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rall(...) \
overload3(__VA_ARGS__, rall3, rall2, \
rall1)(__VA_ARGS__) // 逆イテレータの取得(rbegin：末尾,rend：頭）
#define sum(...) \
accumulate( \
all(__VA_ARGS__), \
0LL) // vectorの合計(int形で受け付けてしまうので，小数で扱いたい場合はdsumを使う)
#define dsum(...) \
accumulate(all(__VA_ARGS__), 0.0L) // 小数で扱う(long long doubleなど)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
/*標準入力*/
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__) // int型標準入力受付，以下LDまで同様
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define LD(...) \
ld __VA_ARGS__; \
in(__VA_ARGS__)
/*vector操作*/
#define Sort(a) sort(all(a)) // 昇順ソート
#define RSort(vec) sort(vec.begin(), vec.end(), greater<ll>()) // 降順ソート
#define Rev(a) reverse(all(a)) // 逆順
#define Uniq(a) \
sort(all(a)); \
a.erase(unique(all(a)), end(a))
#define vec(type, name, ...) vector<type> name(__VA_ARGS__) // type型vectorの定義
#define VEC(type, name, size) \
vector<type> name(size); \
in(name) // type型vector(size指定)標準入力受付
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
in(name)
#define IV(type, name, size) \
vector<pair<int, int>> name; \
for (int i = 0; i < size; i++) { \
int a_i; \
cin >> a_i; \
name.emplace_back(a_i, i); \
} // Indexつきvector（pair型Vector,(data,index)）
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
template <class T> auto min(const T &a) { return *min_element(all(a)); }
template <class T> auto max(const T &a) { return *max_element(all(a)); }
inline ll popcnt(ull a) { return __builtin_popcountll(a); }
ll gcd(ll a, ll b) {
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
ll intpow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans *= a;
a *= a;
b /= 2;
}
return ans;
}
ll modpow(ll a, ll b, ll p) {
ll ans = 1;
while (b) {
if (b & 1)
(ans *= a) %= p;
(a *= a) %= p;
b /= 2;
}
return ans;
}
template <class T, class U> bool chmin(T &a, const U &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
vector<ll> iota(ll n) {
vector<ll> a(n);
iota(a.begin(), a.end(), 0);
return a;
}
vector<pll> factor(ull x) {
vector<pll> ans;
for (ull i = 2; i * i <= x; i++)
if (x % i == 0) {
ans.push_back({i, 1});
while ((x /= i) % i == 0)
ans.back().second++;
}
if (x != 1)
ans.push_back({x, 1});
return ans;
}
map<ll, ll> factor_map(ull x) {
map<ll, ll> ans;
for (ull i = 2; i * i <= x; i++)
if (x % i == 0) {
ans[i] = 1;
while ((x /= i) % i == 0)
ans[i]++;
}
if (x != 1)
ans[x] = 1;
return ans;
}
vector<ll> divisor(ull x) {
vector<ll> ans;
for (ull i = 1; i * i <= x; i++)
if (x % i == 0)
ans.push_back(i);
rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]);
return ans;
}
template <class T> unordered_map<T, ll> press(vector<T> &a) {
auto b = a;
sort(all(b));
b.erase(unique(all(b)), b.end());
unordered_map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
template <class T> map<T, ll> press_map(vector<T> &a) {
auto b = a;
sort(all(b));
b.erase(unique(all(b)), b.end());
map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
int scan() { return getchar(); }
void scan(int &a) { scanf("%d", &a); }
void scan(unsigned &a) { scanf("%u", &a); }
void scan(long &a) { scanf("%ld", &a); }
void scan(long long &a) { scanf("%lld", &a); }
void scan(unsigned long long &a) { scanf("%llu", &a); }
void scan(char &a) {
do {
a = getchar();
} while (a == ' ' || a == '\n');
}
void scan(float &a) { scanf("%f", &a); }
void scan(double &a) { scanf("%lf", &a); }
void scan(long double &a) { scanf("%Lf", &a); }
void scan(vector<bool> &a) {
for (unsigned i = 0; i < a.size(); i++) {
int b;
scan(b);
a[i] = b;
}
}
void scan(char a[]) { scanf("%s", a); }
void scan(string &a) { cin >> a; }
template <class T> void scan(vector<T> &);
template <class T, size_t size> void scan(array<T, size> &);
template <class T, class L> void scan(pair<T, L> &);
template <class T, size_t size> void scan(T (&)[size]);
template <class T> void scan(vector<T> &a) {
for (auto &&i : a)
scan(i);
}
template <class T> void scan(deque<T> &a) {
for (auto &&i : a)
scan(i);
}
template <class T, size_t size> void scan(array<T, size> &a) {
for (auto &&i : a)
scan(i);
}
template <class T, class L> void scan(pair<T, L> &p) {
scan(p.first);
scan(p.second);
}
template <class T, size_t size> void scan(T (&a)[size]) {
for (auto &&i : a)
scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
void print() { putchar(' '); }
void print(bool a) { printf("%d", a); }
void print(int a) { printf("%d", a); }
void print(unsigned a) { printf("%u", a); }
void print(long a) { printf("%ld", a); }
void print(long long a) { printf("%lld", a); }
void print(unsigned long long a) { printf("%llu", a); }
void print(char a) { printf("%c", a); }
void print(char a[]) { printf("%s", a); }
void print(const char a[]) { printf("%s", a); }
void print(float a) { printf("%.15f", a); }
void print(double a) { printf("%.15f", a); }
void print(long double a) { printf("%.15Lf", a); }
void print(const string &a) {
for (auto &&i : a)
print(i);
}
template <class T> void print(const vector<T> &);
template <class T, size_t size> void print(const array<T, size> &);
template <class T, class L> void print(const pair<T, L> &p);
template <class T, size_t size> void print(const T (&)[size]);
template <class T> void print(const vector<T> &a) {
if (a.empty())
return;
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T> void print(const deque<T> &a) {
if (a.empty())
return;
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T, size_t size> void print(const array<T, size> &a) {
print(a[0]);
for (auto i = a.begin(); ++i != a.end();) {
putchar(' ');
print(*i);
}
}
template <class T, class L> void print(const pair<T, L> &p) {
print(p.first);
putchar(' ');
print(p.second);
}
template <class T, size_t size> void print(const T (&a)[size]) {
print(a[0]);
for (auto i = a; ++i != end(a);) {
putchar(' ');
print(*i);
}
}
template <class T> void print(const T &a) { cout << a; }
int out() {
putchar('\n');
return 0;
}
template <class T> int out(const T &t) {
print(t);
putchar('\n');
return 0;
} // cout<<t<<endl
template <class Head, class... Tail>
int out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
return 0;
}
#ifdef DEBUG
inline ll __lg(ull __n) {
return sizeof(ull) * __CHAR_BIT__ - 1 - __builtin_clzll(__n);
}
#define debug(...) \
{ \
print(#__VA_ARGS__); \
print(":"); \
out(__VA_ARGS__); \
}
#else
#define debug(...) void(0)
#endif
/*判定出力*/
int first(bool i = true) {
return out(i ? "first" : "second");
} // iがfirstか判断，以下同様
int yes(bool i = true) { return out(i ? "yes" : "no"); }
int Yes(bool i = true) { return out(i ? "Yes" : "No"); }
int No() { return out("No"); }
int YES(bool i = true) { return out(i ? "YES" : "NO"); }
int NO() { return out("NO"); }
int Yay(bool i = true) { return out(i ? "Yay!" : ":("); }
int possible(bool i = true) { return out(i ? "possible" : "impossible"); }
int Possible(bool i = true) { return out(i ? "Possible" : "Impossible"); }
int POSSIBLE(bool i = true) { return out(i ? "POSSIBLE" : "IMPOSSIBLE"); }
void Case(ll i) { printf("Case #%lld: ", i); }
/*vector探索*/
#define bSearch(v, k) \
binary_search(all(v), k) // ソートされた配列vの中の要素にkがあるか(boolean)
#define lowB(v, k) \
lower_bound(all(v), \
k) // ソートされた配列vの中の要素のうちk以上かつ最小のイテレータ
#define DLbetB(v, k) lowB(v, k) - v.begin() // 先頭からの距離
#define DLbetE(v, k) v.end() - lowB(v, k) // 末尾からの距離
#define uppB(v, k) \
upper_bound( \
all(v), \
k) // ソートされた配列vの中の要素のうちkより大きいかつ最小のイテレータ
#define DUbetB(v, k) uppB(v, k) - v.begin() // 先頭からの距離
#define DUbetE(v, k) v.end() - uppB(v, k) // 末尾からの距離
#define Cnt(v, k) count(all(v), k) // 配列vの中で要素kが何個あるかを返す(size_t)
#define CntIf(v, l) \
count_if(all(v), \
l) // 配列vの中で条件式(lambda式)を満たす個数を返す(ex.int num =
// count_if(v.begin(), v.end(), [](int i){return i % 3 == 0;});)
#define Sort2D(myVec, i) \
sort(myVec.begin(), myVec.end(), \
[](const vector<ll> &alpha, const vector<ll> &beta) { \
return alpha[i] < beta[i]; \
}); // i列めでソート
/*最大公約数*/
template <class T> T vgcd(T m, T n) { return gcd(m, n); }
template <class T, class... Args> T vgcd(T a, Args... args) {
return vgcd(a, vgcd(args...));
}
/*階乗*/
ll facctorialMethod(ll k) {
ll sum = 1;
for (ll i = 1; i <= k; ++i) {
sum *= i;
// sum%=MOD;//あまりを出力せよ問題の時はこれもやる
}
return sum;
}
/*組み合わせnCk*/
ll comb(const ll N, const ll K) {
vector<vector<long long int>> v(N + 1, vector<long long int>(N + 1, 0));
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
return v[N][K];
}
/*逆元 あまりの割り算をするときにこいつをかける(a/b→a*modinv(b))*/
// mod. m での a の逆元 a^{-1} を計算する
ll modinv(ll a, ll m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
/*ダブリング*/
/*
参考：http://satanic0258.hatenablog.com/entry/2017/02/23/222647
使える場所：1回遷移した先が明確にわかる時
目的：
・ある数XのQ乗を求める
・根付き木において、ある頂点vのQ個上の親を知る
・ある地点からQ回進んだ先を求める
*/
// int N; // 全体の要素数
// int Q;//試行回数
ll doubling(
const ll N, const ll Q,
vector<ll> a) { // cin>>N>>Q;//標準入力から要素数と試行回数を受け取る場合
ll LOG_Q = floor(log2(Q)) + 1;
// next[k][i]で、i番目の要素の「2^k個次の要素」を指す
// (なお、i番目の要素に対して「2^k個次の要素」が存在しないとき、
// next[k][i]が指し示す要素番号を-1とします)
std::vector<std::vector<ll>> next(LOG_Q + 1, std::vector<ll>(N));
// ll a[N];//各要素の次の行き先
// next[0]を計算
for (int i = 0; i < N; ++i) {
next[0][i] = a[i];
}
// nextを計算
for (ll k = 0; k < LOG_Q; ++k) {
for (int i = 0; i < N; ++i) {
if (next[k][i] == -1) {
// 2^k個次に要素が無い時、当然2^(k+1)個次にも要素はありません
next[k + 1][i] = -1;
} else {
// 「2^k個次の要素」の2^k個次の要素は、2^(k+1)個次の要素です
next[k + 1][i] = next[k][next[k][i]];
}
}
}
// ----ここまで準備----
// p番目の要素の「Q個次の要素」を求めることを考えます
ll p = 0;
for (ll k = LOG_Q - 1; k >= 0; --k) {
if (p == -1) {
// pがすでに存在しない要素を指していたら、
// それ以降で存在する要素を指すことはないためループを抜けます
break;
}
if ((Q >> k) & 1) { // ex(Q=5)5=101(2)であり，2^2+2^0回進むことを表す
// Qを二進展開した際、k番目のビットが立っていたら、
// pの位置を2^kだけ次にずらします
p = next[k][p];
}
}
return p; // ここでのpが最終的な答えになる
}
/*素数判定*/
bool IsPrime(ll num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
// 素数ではない
return false;
}
}
// 素数である
return true;
}
/*ページのソースを表示->command+F->問題文 で問題文コピペする
*/
// ceil()//切り上げ
// floor()//切り捨て
// round()//四捨五入
// deque<ll> deq;//両端キュー使う，先頭と末尾へのアクセスが早い
// using std::map;
// map<ll,ll>memo;//<キー，その要素＞，キーの検索が早い，キーは昇順にソートされる
signed main() {
/*以下コード*/
ll ans = 0;
STR(s);
size_t n = s.size();
std::vector<ll> dp(n + 1, 0);
std::vector<ll> mod(2019, 0);
mod[0]++;
ll t = 1;
rep(n) {
dp[i + 1] = (dp[i] + t * (int)(s[n - 1 - i] - '0')) % 2019;
mod[dp[i + 1]]++;
t *= 10;
t %= 2019;
}
each(i, mod) if (i > 1) ans += i * (i - 1) / 2;
out(ans);
}
| replace | 557 | 559 | 557 | 558 | 0 | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int mod = 1000000007;
#define ll long long
string s;
int tens[220000] = {0};
int temp[220000] = {0};
void pre() {
tens[0] = 1;
rep(i, 210000) { tens[i + 1] = (tens[i] * 10) % 2019; }
}
int solve() {
temp[0] = s[s.size() - 1] - '0';
rep(i, s.size() - 1) {
temp[i + 1] = (temp[i] + tens[i + 1] * (s[s.size() - i - 2] - '0')) % 2019;
}
}
int main() {
int ans = 0, divi[2020] = {0};
cin >> s;
pre();
solve();
rep(i, s.size()) { divi[temp[i]]++; }
rep(i, 2020) {
if (divi[i] > 1)
ans += divi[i] * (divi[i] - 1) / 2;
}
cout << ans + divi[0] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int mod = 1000000007;
#define ll long long
string s;
int tens[220000] = {0};
int temp[220000] = {0};
void pre() {
tens[0] = 1;
rep(i, 210000) { tens[i + 1] = (tens[i] * 10) % 2019; }
}
void solve() {
temp[0] = s[s.size() - 1] - '0';
rep(i, s.size() - 1) {
temp[i + 1] = (temp[i] + tens[i + 1] * (s[s.size() - i - 2] - '0')) % 2019;
}
}
int main() {
int ans = 0, divi[2020] = {0};
cin >> s;
pre();
solve();
rep(i, s.size()) { divi[temp[i]]++; }
rep(i, 2020) {
if (divi[i] > 1)
ans += divi[i] * (divi[i] - 1) / 2;
}
cout << ans + divi[0] << endl;
return 0;
} | replace | 14 | 15 | 14 | 15 | 0 | |
p02702 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
const ll mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
string s;
cin >> s;
ll n = s.length();
vector<vector<ll>> dp(n, vector<ll>(2019, 0));
vector<ll> dp1(2019, 0), dp2(2019, 0);
dp1[s[0] - '0'] = 1;
ll ans = 0;
for (int i = 1; i < n; i++) {
ll num = s[i] - '0';
dp2[num] = 1;
for (int j = 0; j < 2019; j++) {
dp2[(10 * j + num) % 2019] += dp1[j];
}
ans += dp2[0];
dp1 = dp2;
dp2.assign(2019, 0);
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
const ll mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
string s;
cin >> s;
ll n = s.length();
vector<ll> dp1(2019, 0), dp2(2019, 0);
dp1[s[0] - '0'] = 1;
ll ans = 0;
for (int i = 1; i < n; i++) {
ll num = s[i] - '0';
dp2[num] = 1;
for (int j = 0; j < 2019; j++) {
dp2[(10 * j + num) % 2019] += dp1[j];
}
ans += dp2[0];
dp1 = dp2;
dp2.assign(2019, 0);
}
cout << ans << '\n';
}
| delete | 22 | 23 | 22 | 22 | TLE | |
p02702 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vll = vector<vl>;
using vpll = vector<pll>;
//**デバッグ準備**//
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {
cerr << " " << h;
if (sizeof...(t) > 0)
cerr << " :";
debug_out(t...);
}
template <typename T> ostream &operator<<(ostream &os, vector<T> vec) {
for (size_t i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
ll ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case '9':
return 9;
default:
return 0;
}
}
bool pairCompare(const pll firstElof, pll secondElof) {
return firstElof.first > secondElof.first;
}
//**Snippetリスト**//
// rep, vin, all, iteLoop//
// bitSearch, bitList, gcdlcm, isPrime, primeFactorize, Npow, divisor, modinv,
// dfs, bfs, eratos// dijkstra, WarshallFloyd, BellmanFord, UnionFind, COM,
// digitDP ,RMQ//
ll i, j, k, l;
ll N, M, K, H, W, L, X, Y, Z, R;
ll MOD = 1000000007;
ll INF = 1LL << 62;
ll ans = 0;
ll z = 0, o = 1;
vl flag, color, D;
vll path;
ll Npow(ll x, ll n) {
if (n == 0)
return 1;
if (n % 2 == 0)
return Npow(x * x % 2019, n / 2);
else
return x * Npow(x, n - 1) % 2019;
}
int main() {
string S;
cin >> S;
N = S.length();
for (i = 5; i <= 100; i++) {
// ll key = 0;
for (j = 0; j <= N - i; j++) {
ll key = 0;
ll p = i - 1;
for (k = j; k < j + i; k++) {
ll Q = Npow(10, p);
key = (key + ctoi(S[k]) * Q) % 2019;
p--;
// debug(i,j,k,key);
}
if (key % 2019 == 0)
ans++;
}
}
cout << ans;
} | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vll = vector<vl>;
using vpll = vector<pll>;
//**デバッグ準備**//
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {
cerr << " " << h;
if (sizeof...(t) > 0)
cerr << " :";
debug_out(t...);
}
template <typename T> ostream &operator<<(ostream &os, vector<T> vec) {
for (size_t i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
ll ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case '9':
return 9;
default:
return 0;
}
}
bool pairCompare(const pll firstElof, pll secondElof) {
return firstElof.first > secondElof.first;
}
//**Snippetリスト**//
// rep, vin, all, iteLoop//
// bitSearch, bitList, gcdlcm, isPrime, primeFactorize, Npow, divisor, modinv,
// dfs, bfs, eratos// dijkstra, WarshallFloyd, BellmanFord, UnionFind, COM,
// digitDP ,RMQ//
ll i, j, k, l;
ll N, M, K, H, W, L, X, Y, Z, R;
ll MOD = 1000000007;
ll INF = 1LL << 62;
ll ans = 0;
ll z = 0, o = 1;
vl flag, color, D;
vll path;
ll Npow(ll x, ll n) {
if (n == 0)
return 1;
if (n % 2 == 0)
return Npow(x * x % 2019, n / 2);
else
return x * Npow(x, n - 1) % 2019;
}
int main() {
string S;
cin >> S;
N = S.length();
vl T(N + 1);
vl P(2019);
T[N] = 0;
P[T[N]]++;
ll c = 0;
for (i = N - 1; i >= 0; i--) {
T[i] = (T[i + 1] + ctoi(S[i]) * Npow(10, c)) % 2019;
P[T[i]]++;
c++;
// debug(i, T[i]);
}
for (i = 0; i < 2019; i++) {
ans += P[i] * (P[i] - 1) / 2;
}
cout << ans;
} | replace | 87 | 101 | 87 | 100 | TLE | |
p02702 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
ll ans = 0;
int n = s.size();
vector<vector<ll>> dp(n, vector<ll>(n));
vector<ll> v(2020);
rep(i, n) {
int now = (int)(s[i] - '0');
vector<ll> n = v;
rep(j, 2019) {
if (v[j] == 0)
continue;
ll next = (j * 10 + now) % 2019;
n[next] += v[j];
n[j] -= v[j];
// if(i<5) cout << i << " " << j << " " << next << " " << v[next] << " "
// << v[j] << endl;
}
v = n;
v[now]++;
ans += v[0];
}
// rep(i, 2019) cout << i << " :" << v[i] << endl;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
ll ans = 0;
int n = s.size();
vector<ll> v(2020);
rep(i, n) {
int now = (int)(s[i] - '0');
vector<ll> n = v;
rep(j, 2019) {
if (v[j] == 0)
continue;
ll next = (j * 10 + now) % 2019;
n[next] += v[j];
n[j] -= v[j];
// if(i<5) cout << i << " " << j << " " << next << " " << v[next] << " "
// << v[j] << endl;
}
v = n;
v[now]++;
ans += v[0];
}
// rep(i, 2019) cout << i << " :" << v[i] << endl;
cout << ans << endl;
return 0;
} | delete | 11 | 12 | 11 | 11 | TLE | |
p02702 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int F[200000][2019] = {};
int main() {
string S;
cin >> S;
int i, r, s, N = S.size(), R[10][2019] = {};
for (r = 0; r < 2019; r++) {
for (i = 1; i < 10; i++) {
for (s = 0; s < 2019; s++) {
if ((10 * s + i) % 2019 == r) {
R[i][r] = s;
break;
}
}
}
}
for (i = 0; i < N; i++) {
F[i][S[i] - '0'] = 1;
}
for (i = 1; i < N; i++) {
for (r = 0; r < 2019; r++) {
F[i][r] += F[i - 1][R[S[i] - '0'][r]];
}
}
long ans = 0;
for (i = 0; i < N; i++) {
ans += F[i][0];
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
unsigned short F[200000][2019] = {};
int main() {
string S;
cin >> S;
int i, r, s, N = S.size(), R[10][2019] = {};
for (r = 0; r < 2019; r++) {
for (i = 1; i < 10; i++) {
for (s = 0; s < 2019; s++) {
if ((10 * s + i) % 2019 == r) {
R[i][r] = s;
break;
}
}
}
}
for (i = 0; i < N; i++) {
F[i][S[i] - '0'] = 1;
}
for (i = 1; i < N; i++) {
for (r = 0; r < 2019; r++) {
F[i][r] += F[i - 1][R[S[i] - '0'][r]];
}
}
long ans = 0;
for (i = 0; i < N; i++) {
ans += F[i][0];
}
cout << ans << "\n";
} | replace | 2 | 3 | 2 | 3 | MLE | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 100000000;
#define rep1(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, k, n) for (ll i = k; i < (n); i++)
// 累積和的なものを考えると良いらしい
int main() {
string s;
cin >> s;
ll n = s.size();
vector<ll> a(2019, 0);
ll fac = 1;
ll cur = 0;
a[cur]++;
rep1(i, n) {
ll add = s[n - 1 - i] - '0';
cur = (cur + fac * add) % 2019;
fac = (fac * 10) % 2019;
a[cur]++;
}
ll ans = 0;
rep1(i, n) { ans += a[i] * (a[i] - 1) / 2; }
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 100000000;
#define rep1(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, k, n) for (ll i = k; i < (n); i++)
// 累積和的なものを考えると良いらしい
int main() {
string s;
cin >> s;
ll n = s.size();
vector<ll> a(2019, 0);
ll fac = 1;
ll cur = 0;
a[cur]++;
rep1(i, n) {
ll add = s[n - 1 - i] - '0';
cur = (cur + fac * add) % 2019;
fac = (fac * 10) % 2019;
a[cur]++;
}
ll ans = 0;
rep1(i, a.size()) { ans += a[i] * (a[i] - 1) / 2; }
cout << ans << endl;
} | replace | 24 | 25 | 24 | 25 | 0 | |
p02702 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#define pb push_back
#define pf push_front
#define eb emplace_back
using namespace std;
typedef long long ll;
template <class t, class u> void chmax(t &a, u b) {
if (a < b)
a = b;
}
template <class t, class u> void chmin(t &a, u b) {
if (b < a)
a = b;
}
template <class t> using vc = vector<t>;
template <class t> using vvc = vc<vc<t>>;
using pi = pair<int, int>;
using vi = vc<int>;
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
int SIZE(string s) { return (int)s.size(); }
const long long INF = 1LL << 60;
int main() {
cout << fixed << setprecision(20);
string s;
cin >> s;
int si = SIZE(s);
ll ans = 0;
for (int l = 0; l < si; l++) {
ll cur = s[l] - '0';
for (int r = l; r < si; r++) {
if (cur == 0)
ans++;
cur = (cur * 10 + (s[r + 1] - '0')) % 2019;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#define pb push_back
#define pf push_front
#define eb emplace_back
using namespace std;
typedef long long ll;
template <class t, class u> void chmax(t &a, u b) {
if (a < b)
a = b;
}
template <class t, class u> void chmin(t &a, u b) {
if (b < a)
a = b;
}
template <class t> using vc = vector<t>;
template <class t> using vvc = vc<vc<t>>;
using pi = pair<int, int>;
using vi = vc<int>;
void yes() { cout << "Yes" << endl; }
void no() { cout << "No" << endl; }
int SIZE(string s) { return (int)s.size(); }
const long long INF = 1LL << 60;
int main() {
cout << fixed << setprecision(20);
string s;
cin >> s;
int si = SIZE(s);
ll ans = 0;
vc<ll> a(200010);
a[0]++;
ll next = 1, cur = 0;
for (int i = si - 1; i >= 0; i--) {
cur = (cur + (s[i] - '0') * next) % 2019;
next = next * 10 % 2019;
ans += a[cur];
a[cur]++;
}
cout << ans << endl;
return 0;
}
| replace | 37 | 44 | 37 | 45 | TLE | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 2019;
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
string s;
cin >> s;
ll n = s.size();
vector<ll> ab(n + 1, 0);
ll tmp = 0;
ll mod = 1;
for (int i = 0; i < n; i++) {
tmp += (ll(s[n - 1 - i] - '0') * mod);
ab[i + 1] = tmp % MOD;
mod *= 10;
mod %= MOD;
}
ll ans = 0;
vector<ll> c(2019, 0);
for (int i = 0; i < n + 1; i++) {
c[ab[i - 1]]++;
}
for (int i = 0; i < 2019; i++) {
ans += c[i] * (c[i] - 1) / 2;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 2019;
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
string s;
cin >> s;
ll n = s.size();
vector<ll> ab(n + 1, 0);
ll tmp = 0;
ll mod = 1;
for (int i = 0; i < n; i++) {
tmp += (ll(s[n - 1 - i] - '0') * mod);
ab[i + 1] = tmp % MOD;
mod *= 10;
mod %= MOD;
}
ll ans = 0;
vector<ll> c(2019, 0);
for (int i = 0; i < n + 1; i++) {
c[ab[i]]++;
}
for (int i = 0; i < 2019; i++) {
ans += c[i] * (c[i] - 1) / 2;
}
cout << ans << endl;
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p02702 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.length(); i++) {
int num = (s[i] - '0');
for (int j = i + 1; j < s.length(); j++) {
num = 10 * num + (s[j] - '0');
if (num % 2019 == 0)
count++;
num %= 2019;
}
}
cout << count << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long long dp[2][2019];
for (int i = 0; i < 2019; i++) {
dp[0][i] = 0;
dp[1][i] = 0;
}
long long count = 0;
for (long long i = 0; i < s.length(); i++) {
int d = s[i] - '0';
for (int j = 0; j < 2019; j++)
dp[0][j] = dp[1][j];
for (int j = 0; j < 2019; j++)
dp[1][(10 * j + d) % 2019] = dp[0][j];
if (d != 0)
dp[1][d]++;
count += dp[1][0];
}
cout << count << endl;
return 0;
}
| replace | 8 | 17 | 8 | 25 | TLE | |
p02702 | C++ | Runtime Error | // by Isaunoya
#include <bits/stdc++.h>
#define int long long
using namespace std;
struct io {
char buf[1 << 25 | 3], *s;
int f;
io() { f = 0, buf[fread(s = buf, 1, 1 << 25, stdin)] = '\n'; }
io &operator>>(int &x) {
for (x = f = 0; !isdigit(*s); ++s)
f |= *s == '-';
while (isdigit(*s))
x = x * 10 + (*s++ ^ 48);
return x = f ? -x : x, *this;
}
};
const int maxn = 1e5 + 51;
int g[maxn];
signed main() {
#ifdef LOCAL
freopen("testdata.in", "r", stdin);
#endif
string s;
cin >> s;
int n = s.length(), res = 0;
int x, y;
x = y = 0;
g[0] = 1;
for (int i = 1; i <= n; i++)
g[i] = g[i - 1] * 10 % 2019;
static int a[23333];
int ans = 0;
a[0] = 1;
for (int i = n - 1; ~i; --i) {
x = (s[i] ^ '0') * g[n - i - 1] % 2019;
ans += a[(x + y) % 2019]++;
y = (x + y) % 2019;
}
cout << ans << '\n';
return 0;
}
| // by Isaunoya
#include <bits/stdc++.h>
#define int long long
using namespace std;
struct io {
char buf[1 << 25 | 3], *s;
int f;
io() { f = 0, buf[fread(s = buf, 1, 1 << 25, stdin)] = '\n'; }
io &operator>>(int &x) {
for (x = f = 0; !isdigit(*s); ++s)
f |= *s == '-';
while (isdigit(*s))
x = x * 10 + (*s++ ^ 48);
return x = f ? -x : x, *this;
}
};
const int maxn = 2e5 + 52;
int g[maxn];
signed main() {
#ifdef LOCAL
freopen("testdata.in", "r", stdin);
#endif
string s;
cin >> s;
int n = s.length(), res = 0;
int x, y;
x = y = 0;
g[0] = 1;
for (int i = 1; i <= n; i++)
g[i] = g[i - 1] * 10 % 2019;
static int a[23333];
int ans = 0;
a[0] = 1;
for (int i = n - 1; ~i; --i) {
x = (s[i] ^ '0') * g[n - i - 1] % 2019;
ans += a[(x + y) % 2019]++;
y = (x + y) % 2019;
}
cout << ans << '\n';
return 0;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
int ten = 1, sum = 0, cnt[2019] = {};
long long ans = 0;
for (int i = 0; i < s.size(); i++) {
cnt[sum]++;
sum += ((s[i] - '0') * ten) % 2019;
ans += cnt[sum];
ten = (ten * 10) % 2019;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
int ten = 1, sum = 0, cnt[2019] = {};
long long ans = 0;
for (int i = 0; i < s.size(); i++) {
cnt[sum]++;
sum += (s[i] - '0') * ten;
sum %= 2019;
ans += cnt[sum];
ten = (ten * 10) % 2019;
}
cout << ans << endl;
}
| replace | 12 | 13 | 12 | 14 | -11 | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define all(cont) cont.begin(), cont.end()
#define foreach(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define fore(i, a, b) for (int i = a, almo5t = b; i < almo5t; ++i)
#define SZ(x) ((int)x.size())
#define EPS 1e-9
#define PI acos(-1)
#define MOD 1000000007
#define FIN \
std::ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
const int N = 0;
typedef long long int ll;
using namespace std;
int main() {
FIN;
// freopen("../input.txt", "r", stdin);freopen("../output.txt", "w", stdout);
string s;
cin >> s;
ll modulo[2000];
fore(i, 0, 2000) modulo[i] = 0;
modulo[0] = 1;
ll temp = 0;
ll mod10 = 1;
ll ans = 0;
fore(i, 0, s.size()) {
int pos = s.size() - 1 - i;
temp += ((s[pos] - '0') * mod10) % 2019;
temp %= 2019;
mod10 = ((mod10 % 2019) * 10) % 2019;
modulo[temp]++;
if (modulo[temp] >= 2) {
ans += modulo[temp] - 1;
}
// cout<<temp<<"\n";
}
cout << ans;
return 0;
}
// ============== Notes =============== //
// common bugs
// - remove reader
// - fastio
// - int overflow (especially intermediate expressionns)
// - array bounds (indices bigger than MAXN?, is MAXN correct?)
// - special cases (n=1, graph not connected?)
// - re-initialize efficiently between test cases | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define all(cont) cont.begin(), cont.end()
#define foreach(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define fore(i, a, b) for (int i = a, almo5t = b; i < almo5t; ++i)
#define SZ(x) ((int)x.size())
#define EPS 1e-9
#define PI acos(-1)
#define MOD 1000000007
#define FIN \
std::ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
const int N = 0;
typedef long long int ll;
using namespace std;
int main() {
FIN;
// freopen("../input.txt", "r", stdin);freopen("../output.txt", "w", stdout);
string s;
cin >> s;
ll modulo[2020];
fore(i, 0, 2020) modulo[i] = 0;
modulo[0] = 1;
ll temp = 0;
ll mod10 = 1;
ll ans = 0;
fore(i, 0, s.size()) {
int pos = s.size() - 1 - i;
temp += ((s[pos] - '0') * mod10) % 2019;
temp %= 2019;
mod10 = ((mod10 % 2019) * 10) % 2019;
modulo[temp]++;
if (modulo[temp] >= 2) {
ans += modulo[temp] - 1;
}
// cout<<temp<<"\n";
}
cout << ans;
return 0;
}
// ============== Notes =============== //
// common bugs
// - remove reader
// - fastio
// - int overflow (especially intermediate expressionns)
// - array bounds (indices bigger than MAXN?, is MAXN correct?)
// - special cases (n=1, graph not connected?)
// - re-initialize efficiently between test cases | replace | 28 | 30 | 28 | 30 | 0 | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define DEBUG(x) cout << #x << ": " << (x) << '\n'
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << ' ' << v[i]; \
cout << '\n'
#define ALL(a) (a).begin(), (a).end()
template <typename T> inline void CHMAX(T &a, const T b) {
if (a < b)
a = b;
}
template <typename T> inline void CHMIN(T &a, const T b) {
if (a > b)
a = b;
}
constexpr ll MOD = 1000000007ll;
// constexpr ll MOD=998244353ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
const double EPS = 1e-9;
#define EQ0(x) (abs((x)) < EPS)
#define EQ(a, b) (abs((a) - (b)) < EPS)
ll sum[2525];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout<<setprecision(10)<<fixed;
string s;
cin >> s;
int n = s.size();
sum[n] = 0;
int ten = 1;
FORR(i, 0, n) {
int x = s[i] - '0';
sum[i] = (x * ten + sum[i + 1]) % 2019;
ten = (ten * 10) % 2019;
}
// REP(i, n+1){
// cout<<sum[i]<<" \n"[i==n];
// }
sort(sum, sum + n + 1);
ll ans = 0;
int l = 0, r = 0;
while (l < n + 1) {
while (r < n + 1 && sum[l] == sum[r]) {
++r;
}
ans += (r - l) * (r - l - 1) / 2;
// DEBUG(l);DEBUG(r);
l = r;
}
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define DEBUG(x) cout << #x << ": " << (x) << '\n'
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << ' ' << v[i]; \
cout << '\n'
#define ALL(a) (a).begin(), (a).end()
template <typename T> inline void CHMAX(T &a, const T b) {
if (a < b)
a = b;
}
template <typename T> inline void CHMIN(T &a, const T b) {
if (a > b)
a = b;
}
constexpr ll MOD = 1000000007ll;
// constexpr ll MOD=998244353ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
const double EPS = 1e-9;
#define EQ0(x) (abs((x)) < EPS)
#define EQ(a, b) (abs((a) - (b)) < EPS)
ll sum[252521];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout<<setprecision(10)<<fixed;
string s;
cin >> s;
int n = s.size();
sum[n] = 0;
int ten = 1;
FORR(i, 0, n) {
int x = s[i] - '0';
sum[i] = (x * ten + sum[i + 1]) % 2019;
ten = (ten * 10) % 2019;
}
// REP(i, n+1){
// cout<<sum[i]<<" \n"[i==n];
// }
sort(sum, sum + n + 1);
ll ans = 0;
int l = 0, r = 0;
while (l < n + 1) {
while (r < n + 1 && sum[l] == sum[r]) {
++r;
}
ans += (r - l) * (r - l - 1) / 2;
// DEBUG(l);DEBUG(r);
l = r;
}
cout << ans << '\n';
return 0;
}
| replace | 39 | 40 | 39 | 40 | 0 | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll, ll>
#define iii pair<ii, ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl;
#define rep(x, start, end) \
for (auto x = (start) - ((start) > (end)); x != (end) - ((start) > (end)); \
((start) < (end) ? x++ : x--))
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
ll MAX(ll a) { return a; }
ll MIN(ll a) { return a; }
template <typename... Args> ll MAX(ll a, Args... args) {
return max(a, MAX(args...));
}
template <typename... Args> ll MIN(ll a, Args... args) {
return min(a, MIN(args...));
}
#define indexed_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
string s;
long long qexp(long long b, long long p, int m) {
long long res = 1;
while (p) {
if (p & 1)
res = (res * b) % m;
b = (b * b) % m;
p >>= 1;
}
return res;
}
int arr[2500];
int cnt[2500];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> s;
int val = 0;
int pow = 1;
rep(x, s.size(), 0) {
val += pow * (s[x] - '0');
val %= 2019;
pow *= 10;
pow %= 2019;
cnt[val]++;
arr[x] = val;
// cout<<val<<endl;
}
ll ans = 0;
val = 0;
pow = 1;
rep(x, s.size(), 0) {
// cout<<val<<endl;
ans += cnt[val];
val += pow * (s[x] - '0');
val %= 2019;
pow *= 10;
pow %= 2019;
cnt[arr[x]]--;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll, ll>
#define iii pair<ii, ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl;
#define rep(x, start, end) \
for (auto x = (start) - ((start) > (end)); x != (end) - ((start) > (end)); \
((start) < (end) ? x++ : x--))
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
ll MAX(ll a) { return a; }
ll MIN(ll a) { return a; }
template <typename... Args> ll MAX(ll a, Args... args) {
return max(a, MAX(args...));
}
template <typename... Args> ll MIN(ll a, Args... args) {
return min(a, MIN(args...));
}
#define indexed_set \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
string s;
long long qexp(long long b, long long p, int m) {
long long res = 1;
while (p) {
if (p & 1)
res = (res * b) % m;
b = (b * b) % m;
p >>= 1;
}
return res;
}
int arr[200005];
int cnt[2500];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> s;
int val = 0;
int pow = 1;
rep(x, s.size(), 0) {
val += pow * (s[x] - '0');
val %= 2019;
pow *= 10;
pow %= 2019;
cnt[val]++;
arr[x] = val;
// cout<<val<<endl;
}
ll ans = 0;
val = 0;
pow = 1;
rep(x, s.size(), 0) {
// cout<<val<<endl;
ans += cnt[val];
val += pow * (s[x] - '0');
val %= 2019;
pow *= 10;
pow %= 2019;
cnt[arr[x]]--;
}
cout << ans << endl;
}
| replace | 46 | 47 | 46 | 47 | 0 | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int modpow(int a, int n, int mod) {
int res = 1;
while (n > 0) {
if (n & 1)
res *= a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
const static int mod = 2019;
int cnt_bin[2019] = {};
string S;
cin >> S;
int size = S.size();
int tmp = 0;
for (int i = size - 1; i >= 0; --i) {
int d = S.at(i) - '0';
tmp += d * modpow(10, size - 1 - i, mod) % mod;
tmp %= mod;
++cnt_bin[tmp];
}
int64_t sum = 0;
sum += (cnt_bin[0] + 1) * cnt_bin[0] / 2;
for (int i = 1; i < mod; ++i) {
sum += (cnt_bin[i] - 1) * cnt_bin[i] / 2;
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int modpow(int a, int n, int mod) {
int res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
const static int mod = 2019;
int cnt_bin[2019] = {};
string S;
cin >> S;
int size = S.size();
int tmp = 0;
for (int i = size - 1; i >= 0; --i) {
int d = S.at(i) - '0';
tmp += d * modpow(10, size - 1 - i, mod) % mod;
tmp %= mod;
++cnt_bin[tmp];
}
int64_t sum = 0;
sum += (cnt_bin[0] + 1) * cnt_bin[0] / 2;
for (int i = 1; i < mod; ++i) {
sum += (cnt_bin[i] - 1) * cnt_bin[i] / 2;
}
cout << sum << endl;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
int A[123456];
signed main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
for (int i = 0, t = 1; i < s.size(); i++) {
int a = s[i] - '0';
A[i + 1] = (A[i] + a * t) % 2019;
(t *= 10) %= 2019;
}
map<int, int> m;
for (int i = 0; i <= s.size(); i++)
m[A[i]]++;
int ans = 0;
for (auto p : m)
ans += p.second * (p.second - 1) / 2;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
int A[223456];
signed main() {
string s;
cin >> s;
reverse(s.begin(), s.end());
for (int i = 0, t = 1; i < s.size(); i++) {
int a = s[i] - '0';
A[i + 1] = (A[i] + a * t) % 2019;
(t *= 10) %= 2019;
}
map<int, int> m;
for (int i = 0; i <= s.size(); i++)
m[A[i]]++;
int ans = 0;
for (auto p : m)
ans += p.second * (p.second - 1) / 2;
cout << ans << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
ll cnt[2050];
ll to[2050];
ll a[2050];
ll ans;
void shift() {
ll cntt[2050] = {};
for (int i = 0; i < 2019; i++) {
cntt[to[i]] = cnt[i];
}
for (int i = 0; i < 2019; i++) {
cnt[i] = cntt[i];
}
}
int main() {
string s;
cin >> s;
cnt[0] = 1;
for (int i = 0; i < 2019; i++) {
to[i] = i * 10 % 2019;
}
for (int i = 0; i < s.size(); i++) {
ll num = s[i] - '0';
if (i != 0) {
a[i] = a[i - 1] * 10 + num;
a[i] %= 2019;
} else {
a[i] = num;
}
shift();
ans += cnt[a[i]];
// if (cnt[a[i]] != 0) cout << i << endl;
cnt[a[i]]++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
ll cnt[2050];
ll to[2050];
ll a[200050];
ll ans;
void shift() {
ll cntt[2050] = {};
for (int i = 0; i < 2019; i++) {
cntt[to[i]] = cnt[i];
}
for (int i = 0; i < 2019; i++) {
cnt[i] = cntt[i];
}
}
int main() {
string s;
cin >> s;
cnt[0] = 1;
for (int i = 0; i < 2019; i++) {
to[i] = i * 10 % 2019;
}
for (int i = 0; i < s.size(); i++) {
ll num = s[i] - '0';
if (i != 0) {
a[i] = a[i - 1] * 10 + num;
a[i] %= 2019;
} else {
a[i] = num;
}
shift();
ans += cnt[a[i]];
// if (cnt[a[i]] != 0) cout << i << endl;
cnt[a[i]]++;
}
cout << ans << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <climits>
#include <sstream>
using namespace std;
int main() {
string S;
cin >> S;
map<long long, long long> mp;
mp[0] = 1;
for (int i = 1; i <= S.size(); i++) {
string s = S.substr(S.size() - i, i);
// cout << s << endl;
long long n = stoll(s);
mp[n % 2019]++;
}
long long ans = 0;
for (auto m : mp) {
ans += m.second * (m.second - 1) / 2;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <climits>
#include <sstream>
using namespace std;
int main() {
string S;
cin >> S;
map<long long, long long> mp;
mp[0] = 1;
long long now = 0, ten = 1;
for (int i = S.size() - 1; i >= 0; i--) {
now = (now + (S[i] - '0') * ten) % 2019;
ten *= 10;
ten %= 2019;
mp[now]++;
}
long long ans = 0;
for (auto m : mp) {
ans += m.second * (m.second - 1) / 2;
}
cout << ans << endl;
}
| replace | 10 | 16 | 10 | 16 | 0 | |
p02702 | Python | Time Limit Exceeded | S = input()
N = len(S)
cnt = 0
for i in range(N - 3):
for j in range(i + 4, N + 1):
if int(S[i:j]) % 2019 == 0:
# print(i, j)
cnt += 1
print(cnt)
| S = input()
N = len(S)
num = [0] * 2019
num[0] = 1
now, ans = 0, 0
_10 = 1
for i in range(N - 1, -1, -1):
now = (now + int(S[i]) * _10) % 2019
_10 *= 10
_10 %= 2019
ans += num[now]
num[now] += 1
print(ans)
| replace | 3 | 10 | 3 | 16 | TLE | |
p02702 | Python | Time Limit Exceeded | from collections import defaultdict
S = input()
n = len(S)
mod = 2019
d = defaultdict(int)
d[0] = 1
num = 0
for i in reversed(range(n)):
num += int(S[i]) * 10 ** (n - i - 1)
num %= mod
d[num] += 1
ans = 0
for v in d.values():
ans += v * (v - 1) // 2
print(ans)
| from collections import defaultdict
S = input()
n = len(S)
mod = 2019
d = defaultdict(int)
d[0] = 1
num = 0
for i in reversed(range(n)):
num += int(S[i]) * pow(10, n - i - 1, mod)
num %= mod
d[num] += 1
ans = 0
for v in d.values():
ans += v * (v - 1) // 2
print(ans)
| replace | 10 | 11 | 10 | 11 | TLE | |
p02702 | Python | Time Limit Exceeded | S = input()
N = len(S)
map_ = [-1] * 2019
map_[0] = 0
ans = 0
now = 0
for i in range(0, N + 1):
now += (int(S[N - i - 1]) * (10**i)) % 2019
map_[now % 2019] += 1
ans += map_[now % 2019]
print(ans)
| S = input()
N = len(S)
map_ = [-1] * 2019
map_[0] = 0
ans = 0
now = 0
for i in range(0, N):
now = (now + int(S[N - i - 1]) * pow(10, i, 2019)) % 2019
map_[now] += 1
ans += map_[now]
print(ans)
| replace | 7 | 11 | 7 | 11 | TLE | |
p02702 | Python | Time Limit Exceeded | S = str(input())
# 余りのリスト
counts = [0] * 2019
n, d = 0, 1
for s in S[::-1]:
n += int(s) * d
d *= 10
n %= 2019
counts[n] += 1
ans = counts[0]
for count in counts:
ans += count * (count - 1) // 2
print(ans)
| S = str(input())
# 余りのリスト
counts = [0] * 2019
n, d = 0, 1
for s in S[::-1]:
n += int(s) * d
d *= 10
n %= 2019
d %= 2019
counts[n] += 1
ans = counts[0]
for count in counts:
ans += count * (count - 1) // 2
print(ans)
| insert | 9 | 9 | 9 | 10 | TLE | |
p02702 | Python | Time Limit Exceeded | from collections import Counter
S = input()
N = len(S)
L = [0] * (N + 1)
s = 0
for i in range(N):
s += int(S[N - 1 - i]) * pow(10, i)
L[i + 1] = s % 2019
C = Counter(L)
cnt = 0
for key in list(C.keys()):
k = C[key]
cnt += (k * (k - 1)) // 2
print(cnt)
| from collections import Counter
S = input()
N = len(S)
L = [0] * (N + 1)
s = 0
for i in range(N):
s += int(S[N - 1 - i]) * pow(10, i, 2019)
L[i + 1] = s % 2019
C = Counter(L)
cnt = 0
for key in list(C.keys()):
k = C[key]
cnt += (k * (k - 1)) // 2
print(cnt)
| replace | 9 | 10 | 9 | 10 | TLE | |
p02702 | Python | Time Limit Exceeded | import sys
sys.setrecursionlimit(10**7)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
S = list(input())
L = len(S)
c = 0
t = 0
md = [0] * 2019
md[0] += 1
for i in range(L - 1, -1, -1):
t += int(S[i]) * pow(10, c)
c += 1
md[t % 2019] += 1
ans = 0
for i in range(2019):
m = md[i]
if m == 0:
continue
ans += m * (m - 1) // 2
print(ans)
| import sys
sys.setrecursionlimit(10**7)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
S = list(input())
L = len(S)
c = 0
t = 0
md = [0] * 2019
md[0] += 1
for i in range(L - 1, -1, -1):
t += int(S[i]) * pow(10, c, 2019)
c += 1
md[t % 2019] += 1
ans = 0
for i in range(2019):
m = md[i]
if m == 0:
continue
ans += m * (m - 1) // 2
print(ans)
| replace | 16 | 17 | 16 | 17 | TLE | |
p02702 | Python | Time Limit Exceeded | from collections import defaultdict
S = input()
ans = 0
N = len(S)
mod = 2019
dp = defaultdict(int)
cur = 0
for i in range(N, -1, -1):
if i == N:
dp[0] += 1
else:
cur += ((10 ** (N - i - 1)) * int(S[i])) % mod
cur %= mod
dp[cur] += 1
for v in dp.values():
if v > 1:
ans += v * (v - 1) // 2
print(ans)
| from collections import defaultdict
def solve(input_s: str):
ans = 0
n = len(input_s)
mod = 2019
dp = defaultdict(int)
cur = 0
for i in range(n, -1, -1):
if i == n:
dp[0] += 1
else:
# cur += ((10 ** (n - i - 1)) * int(input_s[i])) % mod これはnがでかくなるとめちゃめちゃ遅い
cur += pow(10, n - i - 1, 2019) * int(input_s[i]) % mod
cur %= mod
dp[cur] += 1
for v in dp.values():
if v > 1:
ans += v * (v - 1) // 2
return ans
if __name__ == "__main__":
S = input()
print(solve(S))
| replace | 2 | 19 | 2 | 26 | TLE | |
p02702 | Python | Time Limit Exceeded | def main():
s = input()
rem = [0] * 2019 # the count of the each remainder: 0 ~ 2018
rem[0] = 1 # why? can't understand.
temp = 0
digit = 1
for i, c in enumerate(s[::-1]):
# No time to pow.
temp += int(c) * digit
rem[temp % 2019] += 1
digit *= 10
return sum(c * (c - 1) // 2 for c in rem)
if __name__ == "__main__":
print(main())
| def main():
s = input()
rem = [0] * 2019 # the count of the each remainder: 0 ~ 2018
rem[0] = 1 # why? can't understand.
temp = 0
digit = 1
for i, c in enumerate(s[::-1]):
# No time to pow.
temp += int(c) * digit
rem[temp % 2019] += 1
digit *= 10
digit %= 2019
return sum(c * (c - 1) // 2 for c in rem)
if __name__ == "__main__":
print(main())
| insert | 12 | 12 | 12 | 13 | TLE | |
p02702 | Python | Time Limit Exceeded | s = list(input())
s.reverse()
n = len(s)
now = 0
mods = [0] * 2019
mods[0] += 1
for i in range(n):
now += pow(10, i) * int(s[i])
now %= 2019
mods[now] += 1
ans = 0
for i in mods:
ans += (i * (i - 1)) // 2
print(ans)
| if __name__ == "__main__":
s = list(input())
s.reverse()
n = len(s)
now = 0
mods = [0] * 2019
mods[0] += 1
ten = 1
for i in range(n):
now += ten * int(s[i])
now %= 2019
ten *= 10
ten %= 2019
mods[now] += 1
ans = 0
for i in mods:
ans += (i * (i - 1)) // 2
print(ans)
| replace | 0 | 14 | 0 | 18 | TLE | |
p02702 | Python | Time Limit Exceeded | def main():
s = input()
mod = 2019
n = 0
R = [0] * mod
R[0] += 1
for i in range(len(s)):
n += int(s[-i - 1]) * (10**i) % mod
R[n % mod] += 1
print(sum([r * (r - 1) // 2 for r in R]))
if __name__ == "__main__":
main()
| def main():
s = input()
mod = 2019
n = 0
R = [0] * mod
R[0] += 1
for i in range(len(s)):
n += int(s[-i - 1]) * pow(10, i, mod)
R[n % mod] += 1
print(sum([r * (r - 1) // 2 for r in R]))
if __name__ == "__main__":
main()
| replace | 8 | 9 | 8 | 9 | TLE | |
p02702 | Python | Time Limit Exceeded | def main():
s = list(input())
s.reverse()
MOD = 2019
tot = 0
ans = 0
d = [0 for _ in range(MOD)]
for i in range(len(s)):
d[tot] += 1
x = (10**i) % MOD
p = int(s[i]) * x
p %= MOD
tot = (tot + p) % MOD
ans += d[tot]
return ans
if __name__ == "__main__":
print(main())
| def main():
s = list(input())
s.reverse()
MOD = 2019
tot = 0
ans = 0
d = [0 for _ in range(MOD)]
for i in range(len(s)):
d[tot] += 1
x = pow(10, i, MOD)
p = int(s[i]) * x
p %= MOD
tot = (tot + p) % MOD
ans += d[tot]
return ans
if __name__ == "__main__":
print(main())
| replace | 9 | 10 | 9 | 10 | TLE | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LLI long long int
#define pii pair<int, int>
#define fst first
#define sec second
#define ULTRA 2134567890
#define de(x) if (x != 0 && MODE == x)
#define MODE 0
using namespace std;
char S[107];
int cnt[2019] = {};
int main() {
int i, j;
scanf("%s", S);
int N = strlen(S);
LLI ans = 0;
int r = 0;
int mul = 1;
for (i = N - 1; i >= 0; i--) {
r = (r + mul * (S[i] - '0')) % 2019;
mul = mul * 10 % 2019;
de(1) printf("r = %d\n", r);
if (r == 0) {
ans += cnt[r] + 1;
} else {
ans += cnt[r];
}
cnt[r]++;
}
printf("%lld\n", ans);
return 0;
}
//
// ___ ___ __________ __________
// /////\ \/\ ______\/\\\\\\\\\\\ Code by ~Ice Tea~ of
// //// \ \ \ \ \_____/\ \\\\_____/ New Empire of CHSH ...
// //// \ \ \ \ \ \ \\\\\\\\\\\
// ////__ \ \ \ \ \ \ \\\\_____/
// ///////\ \ \ \ \ \______\ \\\\_______ ________
// ////____/ \ \__\ \___ ___\ \\\\\\\\\\\ _\ ___ \_
// /__/ \/__/\/__/\ \__/\ \\\\_____//\ .\_/\_ \
// \ \ \ \ \\\\\\\\\\\\ \_\/_\ \
// ... with the AC Power of \ \ \ \ \\\\_____/ \ _____ \
// The Great Tsundere Doggy. \ \ \ \ \\\\ \ \ \ \ \ \
// \ \__\ \ \\\\\\\\\\ \__\ \ \__\
// \/__/ \/________/\/__/ \/__/
//
| #include <bits/stdc++.h>
#define LLI long long int
#define pii pair<int, int>
#define fst first
#define sec second
#define ULTRA 2134567890
#define de(x) if (x != 0 && MODE == x)
#define MODE 0
using namespace std;
char S[200007];
int cnt[2019] = {};
int main() {
int i, j;
scanf("%s", S);
int N = strlen(S);
LLI ans = 0;
int r = 0;
int mul = 1;
for (i = N - 1; i >= 0; i--) {
r = (r + mul * (S[i] - '0')) % 2019;
mul = mul * 10 % 2019;
de(1) printf("r = %d\n", r);
if (r == 0) {
ans += cnt[r] + 1;
} else {
ans += cnt[r];
}
cnt[r]++;
}
printf("%lld\n", ans);
return 0;
}
//
// ___ ___ __________ __________
// /////\ \/\ ______\/\\\\\\\\\\\ Code by ~Ice Tea~ of
// //// \ \ \ \ \_____/\ \\\\_____/ New Empire of CHSH ...
// //// \ \ \ \ \ \ \\\\\\\\\\\
// ////__ \ \ \ \ \ \ \\\\_____/
// ///////\ \ \ \ \ \______\ \\\\_______ ________
// ////____/ \ \__\ \___ ___\ \\\\\\\\\\\ _\ ___ \_
// /__/ \/__/\/__/\ \__/\ \\\\_____//\ .\_/\_ \
// \ \ \ \ \\\\\\\\\\\\ \_\/_\ \
// ... with the AC Power of \ \ \ \ \\\\_____/ \ _____ \
// The Great Tsundere Doggy. \ \ \ \ \\\\ \ \ \ \ \ \
// \ \__\ \ \\\\\\\\\\ \__\ \ \__\
// \/__/ \/________/\/__/ \/__/
//
| replace | 10 | 11 | 10 | 11 | 0 | |
p02702 | Python | Time Limit Exceeded | S = input()
cnt = 0
for i in range(len(S)):
for j in range(i + 4, len(S)):
if int(S[i : j + 1]) % 2019 == 0:
cnt += 1
print(cnt)
| import bisect, collections, copy, heapq, itertools, math, string
import sys
def I():
return int(sys.stdin.readline().rstrip())
def MI():
return map(int, sys.stdin.readline().rstrip().split())
def LI():
return list(map(int, sys.stdin.readline().rstrip().split()))
def S():
return sys.stdin.readline().rstrip()
def LS():
return list(sys.stdin.readline().rstrip().split())
from collections import deque
from collections import defaultdict
def main():
S_ = S()
mod_list = defaultdict(int)
ans = 0
num = 0
point = 1
for i in S_[::-1]:
num += int(i) * point
mod = int(num) % 2019
mod_list[mod] += 1
point *= 10
point %= 2019
values_ = mod_list.values()
ans += mod_list[0]
for value in values_:
ans += (value - 1) * value // 2
print(ans)
if __name__ == "__main__":
main()
| replace | 0 | 7 | 0 | 50 | TLE | |
p02702 | Python | Runtime Error | S = list(map(int, list(input())))
mod = 2019
ss = [0]
tmp = 0
for i, s in enumerate(S[::-1]):
tmp += s * pow(10, i, mod)
tmp %= mod
ss.append(tmp)
cnts = [0] * 2018
ans = 0
for s in ss:
ans += cnts[s]
cnts[s] += 1
print(ans)
| S = list(map(int, list(input())))
mod = 2019
ss = [0]
tmp = 0
for i, s in enumerate(S[::-1]):
tmp += s * pow(10, i, mod)
tmp %= mod
ss.append(tmp)
cnts = [0] * 2019
ans = 0
for s in ss:
ans += cnts[s]
cnts[s] += 1
print(ans)
| replace | 10 | 11 | 10 | 11 | 0 | |
p02702 | Python | Time Limit Exceeded | def main():
A = input()[::-1]
A = "0" + A
# lis_num = [int(s) for s in A]
# print(lis_num)
# S = [0] * len(lis_num)
S = [0] * len(A)
cnt = [0] * 2019
cnt[0] = 1
for i in range(len(A) - 1):
S[i + 1] = (S[i] + int(A[i + 1]) * pow(10, i)) % 2019
cnt[S[i + 1] % 2019] += 1
# print(S)
# for i in S:
# cnt[i % 2019] += 1
ans = 0
for i in cnt:
ans += i * (i - 1) // 2
print(ans)
if __name__ == "__main__":
main()
| def main():
A = input()[::-1]
A = "0" + A
# lis_num = [int(s) for s in A]
# print(lis_num)
# S = [0] * len(lis_num)
S = [0] * len(A)
cnt = [0] * 2019
cnt[0] = 1
for i in range(len(A) - 1):
S[i + 1] = (S[i] + int(A[i + 1]) * pow(10, i, 2019)) % 2019
cnt[S[i + 1] % 2019] += 1
# print(S)
# for i in S:
# cnt[i % 2019] += 1
ans = 0
for i in cnt:
ans += i * (i - 1) // 2
print(ans)
if __name__ == "__main__":
main()
| replace | 13 | 14 | 13 | 14 | TLE | |
p02702 | Python | Time Limit Exceeded | from collections import Counter
# forを逆から回して下から素直にmodを取るとTLEだった
# 累積和的な計算で高速化、やりやすくするためにreverse
S = input()[::-1]
# ex. 1817181712114 → 4112171817181
# print(S)
# 0桁目までのMODを0とすることで、
# 1桁目を含む数が2019の倍数の時に都合が良くなる
X = [0]
# 4,14,114,2114,12114,...のmod2019を計算
for i, s in enumerate(S):
X.append((X[-1] + int(s) * 10**i) % 2019)
# print(X)
C = Counter(X)
# print(C)
ans = 0
# Xが同じになったところを2つ選べば題意を満たす
# v_C_2の計算
for v in C.values():
ans += v * (v - 1) // 2
print(ans)
| from collections import Counter
# forを逆から回して下から素直にmodを取るとTLEだった
# 累積和的な計算で高速化、やりやすくするためにreverse
S = input()[::-1]
# ex. 1817181712114 → 4112171817181
# print(S)
# 0桁目までのMODを0とすることで、
# 1桁目を含む数が2019の倍数の時に都合が良くなる
X = [0]
# 4,14,114,2114,12114,...のmod2019を計算
for i, s in enumerate(S):
X.append((X[-1] + int(s) * pow(10, i, 2019)) % 2019)
# print(X)
C = Counter(X)
# print(C)
ans = 0
# Xが同じになったところを2つ選べば題意を満たす
# v_C_2の計算
for v in C.values():
ans += v * (v - 1) // 2
print(ans)
| replace | 15 | 16 | 15 | 16 | TLE | |
p02702 | Python | Time Limit Exceeded | s = str(input())
num = [int(s[-1])]
for i in range(1, len(s)):
num.append(num[-1] + pow(10, i) * int(s[-i - 1]))
mod = [1] + [0] * 2018
ans = 0
for i in num:
m = i % 2019
ans += mod[m]
mod[m] += 1
print(ans)
| s = str(input())
num = [int(s[-1])]
for i in range(1, len(s)):
tmp = num[-1] + pow(10, i, 2019) * int(s[-i - 1])
num.append(tmp % 2019)
mod = [1] + [0] * 2018
ans = 0
for i in num:
m = i % 2019
ans += mod[m]
mod[m] += 1
print(ans)
| replace | 4 | 5 | 4 | 6 | TLE | |
p02702 | Python | Time Limit Exceeded | def solve(s):
dp = [0] * 2019
dp[0] = 1
r = 0
for i in range(1, len(s) + 1):
r += int(s[-i]) * (10 ** (i - 1))
r %= 2019
dp[r] += 1
res = 0
for r in range(2019):
res += dp[r] * (dp[r] - 1) // 2
return res
def main():
s = input()
res = solve(s)
print(res)
def test():
assert solve("1817181712114") == 3
assert solve("14282668646") == 2
assert solve("2119") == 0
if __name__ == "__main__":
test()
main()
| def solve(s):
dp = [0] * 2019
dp[0] = 1
r = 0
for i in range(1, len(s) + 1):
r += int(s[-i]) * pow(10, i - 1, 2019)
r %= 2019
dp[r] += 1
res = 0
for r in range(2019):
res += dp[r] * (dp[r] - 1) // 2
return res
def main():
s = input()
res = solve(s)
print(res)
def test():
assert solve("1817181712114") == 3
assert solve("14282668646") == 2
assert solve("2119") == 0
if __name__ == "__main__":
test()
main()
| replace | 5 | 6 | 5 | 6 | TLE | |
p02702 | Python | Time Limit Exceeded | import sys
from collections import Counter
input = sys.stdin.readline
sys.setrecursionlimit(2 * 10**6)
def inpl():
return list(map(int, input().split()))
def main():
S = input().strip()[::-1]
MOD = 2019
T = [0, int(S[0])]
for d, s in enumerate(S):
if d == 0:
continue
tmp = int(s) * (10**d)
T.append((T[-1] + tmp) % MOD)
# print(T)
cT = Counter(T)
# print(cT)
ans = 0
for k in T:
cT[k] -= 1
ans += cT[k]
print(ans)
if __name__ == "__main__":
main()
| import sys
from collections import Counter
input = sys.stdin.readline
sys.setrecursionlimit(2 * 10**6)
def inpl():
return list(map(int, input().split()))
def main():
S = input().strip()[::-1]
MOD = 2019
T = [0, int(S[0])]
t10 = 1
for s in S[1:]:
t10 *= 10
t10 %= MOD
T.append((T[-1] + int(s) * t10) % MOD)
# print(T)
cT = Counter(T)
# print(cT)
ans = 0
for k in T:
cT[k] -= 1
ans += cT[k]
print(ans)
if __name__ == "__main__":
main()
| replace | 15 | 20 | 15 | 20 | TLE | |
p02702 | Python | Time Limit Exceeded | S = input()
M = 2019
dp = [0] * M
dp[0] = 1
t = 0
for i, s in enumerate(S[::-1]):
t = (t + int(s) * (10**i)) % M
dp[t] += 1
r = 0
for d in dp:
r += d * (d - 1) // 2
print(r)
| S = input()
M = 2019
dp = [0] * M
dp[0] = 1
t = 0
for i, s in enumerate(S[::-1]):
t = (t + int(s) * (pow(10, i, M))) % M
dp[t] += 1
r = 0
for d in dp:
r += d * (d - 1) // 2
print(r)
| replace | 6 | 7 | 6 | 7 | TLE | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.rbegin()) x = c.rbegin(); x != c.rend(); x++)
#define setp(n) fixed << setprecision(n)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define pi pair<int, int>
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ins insert
using namespace std;
//-------------------------------------------------
//--Range Set Counter
//-------------------------------------------------
template <typename T> class RangeSet {
private:
::std::vector<int> v;
::std::unordered_map<T, int> Map;
::std::vector<::std::vector<int>> data;
int kind;
public:
RangeSet(const ::std::vector<T> &v_) : v(v_.size()) {
int sz = v_.size();
kind = 0;
for (int i = 0; i < sz; i++) {
T t = v_[i];
if (Map.count(t)) {
data[Map[t]].push_back(i);
} else {
Map[t] = kind++;
data.push_back(::std::vector<int>());
data.back().push_back(i);
}
v[i] = Map[t];
}
}
// query for all elements
int query(T x) {
if (!Map.count(x))
return 0;
return data[Map[x]].size();
}
// query for [a, b]
int query(int a, int b, T x) {
if (a > b)
return 0;
if (!Map.count(x))
return 0;
int xi = Map[x];
auto right = ::std::upper_bound(data[xi].begin(), data[xi].end(), b);
auto left = ::std::lower_bound(data[xi].begin(), data[xi].end(), a);
return right - left;
}
// search x for [k, tail]
int find(int k, T x) {
if (!Map.count(x))
return -1;
int xi = Map[x];
auto itr = ::std::lower_bound(data[xi].begin(), data[xi].end(), k);
if (itr != data[xi].end()) {
return *itr;
} else {
return -1;
}
}
};
const int MOD = 2019;
//-------------------------------------------------
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
vi dp(n + 1), d10;
d10.pb(1);
rep(i, n) dp[i + 1] = (dp[i] * 10 + (s[i] - '0')) % MOD;
do {
d10.pb(d10.back() * 10 % MOD);
} while (d10.back() != 1);
int C = d10.size() - 1;
rep(i, n + 1) dp[i] = dp[i] * d10[C - i] % MOD;
RangeSet<int> rs(dp);
ll ans = 0;
rep(i, n) { ans += rs.query(i + 1, n, dp[i]); }
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.rbegin()) x = c.rbegin(); x != c.rend(); x++)
#define setp(n) fixed << setprecision(n)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define pi pair<int, int>
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ins insert
using namespace std;
//-------------------------------------------------
//--Range Set Counter
//-------------------------------------------------
template <typename T> class RangeSet {
private:
::std::vector<int> v;
::std::unordered_map<T, int> Map;
::std::vector<::std::vector<int>> data;
int kind;
public:
RangeSet(const ::std::vector<T> &v_) : v(v_.size()) {
int sz = v_.size();
kind = 0;
for (int i = 0; i < sz; i++) {
T t = v_[i];
if (Map.count(t)) {
data[Map[t]].push_back(i);
} else {
Map[t] = kind++;
data.push_back(::std::vector<int>());
data.back().push_back(i);
}
v[i] = Map[t];
}
}
// query for all elements
int query(T x) {
if (!Map.count(x))
return 0;
return data[Map[x]].size();
}
// query for [a, b]
int query(int a, int b, T x) {
if (a > b)
return 0;
if (!Map.count(x))
return 0;
int xi = Map[x];
auto right = ::std::upper_bound(data[xi].begin(), data[xi].end(), b);
auto left = ::std::lower_bound(data[xi].begin(), data[xi].end(), a);
return right - left;
}
// search x for [k, tail]
int find(int k, T x) {
if (!Map.count(x))
return -1;
int xi = Map[x];
auto itr = ::std::lower_bound(data[xi].begin(), data[xi].end(), k);
if (itr != data[xi].end()) {
return *itr;
} else {
return -1;
}
}
};
const int MOD = 2019;
//-------------------------------------------------
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = s.size();
vi dp(n + 1), d10;
d10.pb(1);
rep(i, n) dp[i + 1] = (dp[i] * 10 + (s[i] - '0')) % MOD;
do {
d10.pb(d10.back() * 10 % MOD);
} while (d10.back() != 1);
int C = d10.size() - 1;
rep(i, n + 1) dp[i] = dp[i] * d10[C - i % C] % MOD;
RangeSet<int> rs(dp);
ll ans = 0;
rep(i, n) { ans += rs.query(i + 1, n, dp[i]); }
cout << ans << "\n";
return 0;
}
| replace | 114 | 115 | 114 | 115 | 0 | |
p02702 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef tuple<ll, ll, ll> ti;
ll mod = 1E9 + 7;
#define REP(a, b, c) for (ll a = (b); a < (c); a++)
#define PER(a, b, c) for (ll a = (b); a >= (c); a--)
ll ii() {
ll x;
cin >> x;
return x;
}
string is() {
string x;
cin >> x;
return x;
}
double id() {
double x;
cin >> x;
return x;
}
void oi(ll x) { cout << x; }
void od(ld x) { cout << fixed << setprecision(10) << x; }
void os(string x) { cout << x; }
void oe() { cout << endl; }
void oie(ll x) {
oi(x);
oe();
}
void ode(ld x) {
od(x);
oe();
}
void ose(string x) {
os(x);
oe();
}
int memo[202020][2020];
int main() {
string S = is();
ll ret = 0;
REP(i, 0, S.length()) memo[i][0]++;
REP(i, 0, S.length()) {
ll a = (S[i] - '0');
REP(j, 0, 2019) {
if (memo[i][j] > 0) {
ll y = (j * 10 + a) % 2019;
if (y == 0) {
ret += memo[i][j];
}
memo[i + 1][y] += memo[i][j];
}
}
}
oie(ret);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef tuple<ll, ll, ll> ti;
ll mod = 1E9 + 7;
#define REP(a, b, c) for (ll a = (b); a < (c); a++)
#define PER(a, b, c) for (ll a = (b); a >= (c); a--)
ll ii() {
ll x;
cin >> x;
return x;
}
string is() {
string x;
cin >> x;
return x;
}
double id() {
double x;
cin >> x;
return x;
}
void oi(ll x) { cout << x; }
void od(ld x) { cout << fixed << setprecision(10) << x; }
void os(string x) { cout << x; }
void oe() { cout << endl; }
void oie(ll x) {
oi(x);
oe();
}
void ode(ld x) {
od(x);
oe();
}
void ose(string x) {
os(x);
oe();
}
short memo[202020][2020];
int main() {
string S = is();
ll ret = 0;
REP(i, 0, S.length()) memo[i][0]++;
REP(i, 0, S.length()) {
ll a = (S[i] - '0');
REP(j, 0, 2019) {
if (memo[i][j] > 0) {
ll y = (j * 10 + a) % 2019;
if (y == 0) {
ret += memo[i][j];
}
memo[i + 1][y] += memo[i][j];
}
}
}
oie(ret);
return 0;
} | replace | 45 | 46 | 45 | 46 | MLE | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
ll cnt[3000];
int main() {
string s;
cin >> s;
reverse(all(s));
for (int i = 1; i <= s.size(); i++) {
string t = s.substr(0, i);
reverse(all(t));
ll x = stoll(t);
// cout<<x<<endl;
// cout<<x%2019<<endl;
cnt[x % 2019]++;
}
ll ans = 0;
rep(i, 2019) {
if (cnt[i] >= 2)
ans += (cnt[i] * (cnt[i] - 1)) / 2;
}
ans += cnt[0];
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
#define INF 1LL << 30
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
ll cnt[3000];
int main() {
string s;
cin >> s;
int tot = 0;
int p = 1;
int n = s.size();
for (int i = n - 1; i >= 0; i--) {
tot = (tot + (s[i] - '0') * p) % 2019;
cnt[tot]++;
p = (p * 10) % 2019;
}
ll ans = 0;
rep(i, 2019) {
if (cnt[i] >= 2)
ans += (cnt[i] * (cnt[i] - 1)) / 2;
}
ans += cnt[0];
cout << ans << endl;
}
| replace | 14 | 22 | 14 | 21 | 0 | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long N;
string S;
int P;
long long solve() {
vector<long long> val(P, 0);
long long tenfactor = 1;
long long cur = 0;
val[cur]++;
for (int i = 0; i < N; ++i) {
cur = (cur + (S[N - i - 1] - '0') * tenfactor) % P;
tenfactor = (tenfactor * 10) % P;
val[cur]++;
}
long long res = 0;
for (int p = 0; p < P; ++p)
res += val[p] * (val[p] - 1) / 2;
return res;
}
int main() {
cin >> N >> S;
P = 2019;
cout << solve() << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long N;
string S;
int P;
long long solve() {
vector<long long> val(P, 0);
long long tenfactor = 1;
long long cur = 0;
val[cur]++;
for (int i = 0; i < N; ++i) {
cur = (cur + (S[N - i - 1] - '0') * tenfactor) % P;
tenfactor = (tenfactor * 10) % P;
val[cur]++;
}
long long res = 0;
for (int p = 0; p < P; ++p)
res += val[p] * (val[p] - 1) / 2;
return res;
}
int main() {
cin >> S;
N = S.length();
P = 2019;
cout << solve() << endl;
} | replace | 24 | 25 | 24 | 26 | -11 | |
p02702 | C++ | Memory Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <limits>
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
#define ll long long
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define int_INF 2147483647
#define pint_INF 2000000000
#define ll_INF 9223372036854775807
#define MOD 1000000007
#define vi vector<int>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vll vector<long long>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define sysp system("PAUSE")
using namespace std;
#define M 2019
ll mpow(ll x, ll n) {
for (int i = 0; i < n; i++) {
x *= n;
x %= M;
}
return M;
}
int ctoi(char c) { return c - '0'; }
int main() {
string S;
cin >> S;
vvi dp(S.size(), vi(2019));
vi temp(2019), curr(2019);
int x = ctoi(S[0]);
temp[x]++;
ll ans = 0;
for (int i = 1; i < S.size(); i++) {
vi curr(2019);
int u = ctoi(S[i]);
for (int j = 0; j < 2019; j++) {
int v = (10 * j + u) % M;
curr[v] = temp[j];
}
curr[u]++;
ans += curr[0];
temp = curr;
}
cout << ans << endl;
} | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <limits>
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
#define ll long long
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define int_INF 2147483647
#define pint_INF 2000000000
#define ll_INF 9223372036854775807
#define MOD 1000000007
#define vi vector<int>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vll vector<long long>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define sysp system("PAUSE")
using namespace std;
#define M 2019
ll mpow(ll x, ll n) {
for (int i = 0; i < n; i++) {
x *= n;
x %= M;
}
return M;
}
int ctoi(char c) { return c - '0'; }
int main() {
string S;
cin >> S;
vi temp(2019), curr(2019);
int x = ctoi(S[0]);
temp[x]++;
ll ans = 0;
for (int i = 1; i < S.size(); i++) {
vi curr(2019);
int u = ctoi(S[i]);
for (int j = 0; j < 2019; j++) {
int v = (10 * j + u) % M;
curr[v] = temp[j];
}
curr[u]++;
ans += curr[0];
temp = curr;
}
cout << ans << endl;
} | delete | 49 | 51 | 49 | 49 | MLE | |
p02702 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
vector<int> mods(2019, 0);
mods[0] = 1;
for (int i = 0; i < (int)S.size(); i++) {
mods[stoll(S.substr(i)) % 2019]++;
}
int result = 0;
for (int j : mods) {
if (j >= 2) {
result += j * (j - 1) / 2;
}
}
cout << result << endl;
}
| #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string S;
cin >> S;
vector<int> mods(2019, 0);
mods[0] = 1;
int current = 0;
int keta = 1;
for (int i = (int)S.size() - 1; i >= 0; i--) {
current = (stoi(S.substr(i, 1)) * keta + current) % 2019;
mods[current]++;
keta = keta * 10 % 2019;
}
int result = 0;
for (int j : mods) {
if (j >= 2) {
result += j * (j - 1) / 2;
}
}
cout << result << endl;
}
| replace | 11 | 13 | 11 | 17 | 0 | |
p02702 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int L = S.size();
vector<int> M(L + 1);
M.at(L) = 0;
M.at(L - 1) = (S.at(L - 1) - '0') % 2019;
int Mod = 1;
for (int i = 0; i < L - 1; i++) {
Mod = (Mod * 10) % 2019;
M.at(L - 2 - i) = (S.at(L - 2 - i) - '0') * Mod + M.at(L - 1 - i);
M.at(L - 2 - i) %= 2019;
}
int Ans = 0;
for (int i = 4; i <= L; i++) {
for (int j = 0; j < L - i + 1; j++) {
if (M.at(j) == M.at(j + i)) {
Ans++;
}
}
}
cout << Ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int L = S.size();
vector<int> M(L + 1);
M.at(L) = 0;
M.at(L - 1) = (S.at(L - 1) - '0') % 2019;
int Mod = 1;
for (int i = 0; i < L - 1; i++) {
Mod = (Mod * 10) % 2019;
M.at(L - 2 - i) = (S.at(L - 2 - i) - '0') * Mod + M.at(L - 1 - i);
M.at(L - 2 - i) %= 2019;
}
int Ans = 0;
vector<int> No(2019);
for (int i = 0; i <= L; i++) {
No.at(M.at(i))++;
}
for (int i = 0; i < 2019; i++) {
Ans += No.at(i) * (No.at(i) - 1) / 2;
}
cout << Ans << endl;
} | replace | 17 | 23 | 17 | 23 | TLE | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
const int maxn = 10000;
const int INF32 = 1'050'000'000;
const long long INF64 = 4'000'000'000'000'000'000;
const int MOD7 = 1'000'000'007;
const int MOD9 = 1'000'000'009;
const int mod = MOD7;
void ERROR(int num) { printf("ERROR%d!\n", num); }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int dx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
int dy[8] = {0, -1, 0, 1, 1, -1, 1, -1};
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
string S;
cin >> S;
int l = S.length();
reverse(S.begin(), S.end());
vector<ll> sum;
sum.resize(l + 1, 0);
vector<ll> cnt;
cnt.resize(2019, 0);
ll total = 0;
ll ten = 1;
cnt[0] = 1;
for (int i = 0; i <= l; i++) {
sum[i + 1] = (sum[i] + (S[i] - '0') * ten % 2019 + 2019) % 2019;
// cout << "sum[i+1]: " << sum[i+1] << " , total=" << total << endl;
total += cnt[sum[i + 1]];
cnt[sum[i + 1]]++;
ten = ten * 10 % 2019;
}
cout << total << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
const int maxn = 10000;
const int INF32 = 1'050'000'000;
const long long INF64 = 4'000'000'000'000'000'000;
const int MOD7 = 1'000'000'007;
const int MOD9 = 1'000'000'009;
const int mod = MOD7;
void ERROR(int num) { printf("ERROR%d!\n", num); }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int dx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
int dy[8] = {0, -1, 0, 1, 1, -1, 1, -1};
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
string S;
cin >> S;
int l = S.length();
reverse(S.begin(), S.end());
vector<ll> sum;
sum.resize(l + 1, 0);
vector<ll> cnt;
cnt.resize(2019, 0);
ll total = 0;
ll ten = 1;
cnt[0] = 1;
for (int i = 0; i < l; i++) {
sum[i + 1] = (sum[i] + (S[i] - '0') * ten % 2019 + 2019) % 2019;
// cout << "sum[i+1]: " << sum[i+1] << " , total=" << total << endl;
total += cnt[sum[i + 1]];
cnt[sum[i + 1]]++;
ten = ten * 10 % 2019;
}
cout << total << endl;
} | replace | 34 | 35 | 34 | 35 | 0 | |
p02702 | C++ | Memory Limit Exceeded | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define LOOP(i) while (i--)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto pitr = c.begin(); pitr != c.end(); ++pitr) { \
cout << *pitr; \
if (next(pitr, 1) != c.end()) \
cout << ' '; \
} \
cout << endl;
#define PAIRCOMP(c, comp) \
[](const pair<ll, ll> &lhs, const pair<ll, ll> &rhs) { \
return lhs.c comp rhs.c; \
}
using namespace std;
using ll = long long;
constexpr ll atcoder_mod = 1e9 + 7;
template <typename T = int> T in() {
T x;
cin >> x;
return (x);
}
template <typename T = int, typename C = vector<T>> C vecin(int N) {
C x(N);
REP(i, N) { x[i] = in<T>(); }
return move(x);
}
void vout() { cout << endl; }
template <typename Head, typename... Tail> void vout(Head &&h, Tail &&...t) {
cout << ' ' << h;
vout(forward<Tail>(t)...);
}
void out() { cout << endl; }
template <typename Head, typename... Tail> void out(Head &&h, Tail &&...t) {
cout << h;
vout(forward<Tail>(t)...);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
string S = in<string>();
int N = S.size();
vector<vector<int>> dp(N + 1, vector<int>(2019, 0));
dp[0][0] = 0;
REP(i, N) {
int M = S[i] - '0';
dp[i + 1][M] += 1;
REP(j, 2019) {
int V = j * 10 + (S[i] - '0');
M = V % 2019;
dp[i + 1][M] += dp[i][j];
}
}
int sum = 0;
REP(i, N + 1) { sum += dp[i][0]; }
out(sum);
return 0;
}
| #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define LOOP(i) while (i--)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto pitr = c.begin(); pitr != c.end(); ++pitr) { \
cout << *pitr; \
if (next(pitr, 1) != c.end()) \
cout << ' '; \
} \
cout << endl;
#define PAIRCOMP(c, comp) \
[](const pair<ll, ll> &lhs, const pair<ll, ll> &rhs) { \
return lhs.c comp rhs.c; \
}
using namespace std;
using ll = long long;
constexpr ll atcoder_mod = 1e9 + 7;
template <typename T = int> T in() {
T x;
cin >> x;
return (x);
}
template <typename T = int, typename C = vector<T>> C vecin(int N) {
C x(N);
REP(i, N) { x[i] = in<T>(); }
return move(x);
}
void vout() { cout << endl; }
template <typename Head, typename... Tail> void vout(Head &&h, Tail &&...t) {
cout << ' ' << h;
vout(forward<Tail>(t)...);
}
void out() { cout << endl; }
template <typename Head, typename... Tail> void out(Head &&h, Tail &&...t) {
cout << h;
vout(forward<Tail>(t)...);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
string S = in<string>();
int N = S.size();
vector<vector<short>> dp(N + 1, vector<short>(2019, 0));
dp[0][0] = 0;
REP(i, N) {
int M = S[i] - '0';
dp[i + 1][M] += 1;
REP(j, 2019) {
int V = j * 10 + (S[i] - '0');
M = V % 2019;
dp[i + 1][M] += dp[i][j];
}
}
int sum = 0;
REP(i, N + 1) { sum += dp[i][0]; }
out(sum);
return 0;
}
| replace | 52 | 53 | 52 | 53 | MLE | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define MOD = 998244353;
#define int long long int
#define double long double
#define inf (int)(1e15)
#define all(x) (x).begin(), (x).end()
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define isYes(x) printf("%s\n", (x) ? "Yes" : "No")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define isIn(x, y, h, w) (x >= 0 && x < h && y >= 0 && y < w)
#define pair pair<int, int>
typedef vector<int> vi; // Vector of long long
typedef vector<vi> vvi; // Vector of vi
typedef vector<pair> vii; // Vector of pairs
typedef vector<vii> vvii; // Vector of Vector of pairs
typedef vector<bool> vb; // Vector of bool
#define pq \
priority_queue // Max heap (To convert to min heap, use negative sign before
// every value)
#define ff first // For pairs
#define ss second
const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, -1, 0, 1};
const int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1},
dy8[] = {1, -1, 1, 0, -1, 1, -0, -1};
#define testcases(t) \
int(t); \
cin >> (t); \
while ((t)--)
#define range(c, r) (c).begin(), (c).begin() + (r) // Mainly used in sorting
#define present(c, x) ((c).find(x) != (c).end()) // for sets, maps, multi-maps
#define cpresent(c, x) (find(all(c), x) != (c).end()) // for vectors
#define run(x, c) for ((x) = (c).begin(); (x) != (c).end(); (x)++)
#define fo0(i, n) for (i = 0; i < n; i++)
#define fo1 (i, n) for (i = 1; i <= n; i++)
#define rfo(i, n) for (i = n - 1; i >= 0; i--)
#define rfor(i, n) for (i = n; i > 0; i--)
signed main() {
string s;
cin >> s;
int n = s.length(), i, current = 0, ans = 0;
vi prefix_mod(100005, 0);
prefix_mod[0] = 1;
for (int i = 1; i <= n; i++) {
prefix_mod[i] = (prefix_mod[i - 1] * 10) % 2019;
}
vi rem(2019, 0);
rfo(i, n) {
current = (current + ((s[i] - '0') * prefix_mod[n - i - 1]) % 2019) % 2019;
rem[current]++;
}
ans += rem[0];
fo0(i, 2019) { ans += (((rem[i]) * (rem[i] - 1)) / 2); }
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define MOD = 998244353;
#define int long long int
#define double long double
#define inf (int)(1e15)
#define all(x) (x).begin(), (x).end()
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define isYes(x) printf("%s\n", (x) ? "Yes" : "No")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define isIn(x, y, h, w) (x >= 0 && x < h && y >= 0 && y < w)
#define pair pair<int, int>
typedef vector<int> vi; // Vector of long long
typedef vector<vi> vvi; // Vector of vi
typedef vector<pair> vii; // Vector of pairs
typedef vector<vii> vvii; // Vector of Vector of pairs
typedef vector<bool> vb; // Vector of bool
#define pq \
priority_queue // Max heap (To convert to min heap, use negative sign before
// every value)
#define ff first // For pairs
#define ss second
const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, -1, 0, 1};
const int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1},
dy8[] = {1, -1, 1, 0, -1, 1, -0, -1};
#define testcases(t) \
int(t); \
cin >> (t); \
while ((t)--)
#define range(c, r) (c).begin(), (c).begin() + (r) // Mainly used in sorting
#define present(c, x) ((c).find(x) != (c).end()) // for sets, maps, multi-maps
#define cpresent(c, x) (find(all(c), x) != (c).end()) // for vectors
#define run(x, c) for ((x) = (c).begin(); (x) != (c).end(); (x)++)
#define fo0(i, n) for (i = 0; i < n; i++)
#define fo1 (i, n) for (i = 1; i <= n; i++)
#define rfo(i, n) for (i = n - 1; i >= 0; i--)
#define rfor(i, n) for (i = n; i > 0; i--)
signed main() {
string s;
cin >> s;
int n = s.length(), i, current = 0, ans = 0;
vi prefix_mod(200005, 0);
prefix_mod[0] = 1;
for (int i = 1; i <= n; i++) {
prefix_mod[i] = (prefix_mod[i - 1] * 10) % 2019;
}
vi rem(2019, 0);
rfo(i, n) {
current = (current + ((s[i] - '0') * prefix_mod[n - i - 1]) % 2019) % 2019;
rem[current]++;
}
ans += rem[0];
fo0(i, 2019) { ans += (((rem[i]) * (rem[i] - 1)) / 2); }
cout << ans << endl;
return 0;
} | replace | 47 | 48 | 47 | 48 | 0 | |
p02702 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int dp[200009][2020];
int main() {
string s;
cin >> s;
memset(dp, 0, sizeof(dp));
dp[0][s[0] - '0']++;
for (int i = 1; i < s.length(); i++) {
dp[i][s[i] - '0']++;
for (int j = 0; j < 2019; j++) {
dp[i][(j * 10 + s[i] - '0') % 2019] += dp[i - 1][j];
}
}
int ans = 0;
for (int i = 0; i < s.length(); i++) {
ans += dp[i][0];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
short dp[200009][2020];
int main() {
string s;
cin >> s;
memset(dp, 0, sizeof(dp));
dp[0][s[0] - '0']++;
for (int i = 1; i < s.length(); i++) {
dp[i][s[i] - '0']++;
for (int j = 0; j < 2019; j++) {
dp[i][(j * 10 + s[i] - '0') % 2019] += dp[i - 1][j];
}
}
int ans = 0;
for (int i = 0; i < s.length(); i++) {
ans += dp[i][0];
}
cout << ans << endl;
}
| replace | 4 | 5 | 4 | 5 | MLE | |
p02702 | C++ | Runtime Error | #include <bits/stdc++.h>
#define mod 1e+7
#define int long long
#define garou \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using namespace std;
int dp[2019];
signed main() {
garou;
string s;
cin >> s;
int n = s.length();
dp[0] = 1;
int c = 1;
int l = 0;
for (int i = n - 1; i >= 0; i--) {
l += ((s[i] - '0') * c);
l %= 2019;
c *= 10;
dp[l]++;
}
int ans = 0;
for (int i = 0; i < 2019; i++) {
ans += (dp[i] * (dp[i] - 1)) / 2;
}
cout << ans;
} | #include <bits/stdc++.h>
#define mod 1e+7
#define int long long
#define garou \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using namespace std;
int dp[2019];
signed main() {
garou;
string s;
cin >> s;
int n = s.length();
dp[0] = 1;
int c = 1;
int l = 0;
for (int i = n - 1; i >= 0; i--) {
l += ((s[i] - '0') * c);
l %= 2019;
c = (c * 10) % 2019;
dp[l]++;
}
int ans = 0;
for (int i = 0; i < 2019; i++) {
ans += (dp[i] * (dp[i] - 1)) / 2;
}
cout << ans;
} | replace | 19 | 20 | 19 | 20 | 0 | |
p02702 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
typedef long double LD;
using namespace std;
const int INF = 2147483647;
const int INF2 = 0x3f3f3f3f;
const ll INF64 = 1e18;
const double INFD = 1e30;
const double EPS = 1e-9;
const double PI = acos(-1);
const int MOD = 998244353;
template <typename T> inline T read() {
T X = 0, w = 0;
char ch = 0;
while (!isdigit(ch)) {
w |= ch == '-';
ch = getchar();
}
while (isdigit(ch))
X = (X << 3) + (X << 1) + (ch ^ 48), ch = getchar();
return w ? -X : X;
}
const int MAXN = 600;
int n, m, k;
int dr[4] = {1, 0, -1, 0};
int dc[4] = {0, 1, 0, -1};
int dr2[8] = {1, 1, 1, -1, -1, -1, 0, 0};
int dc2[8] = {1, 0, -1, 1, 0, -1, 1, -1};
int CASE = 1;
char str[MAXN];
int pref[MAXN];
int tens[MAXN];
void extgcd(ll a, ll b, ll &d, ll &x, ll &y) {
if (!b) {
d = a;
x = 1;
y = 0;
} else {
extgcd(b, a % b, d, y, x);
y -= x * (a / b);
}
}
inline ll getInv(ll x, ll mod) {
ll g, a, b;
extgcd(x, mod, g, a, b);
return (a % mod + mod) % mod;
}
int main() {
#ifdef LOCALLL
freopen("in", "r", stdin);
freopen("out", "w", stdout);
#endif
scanf("%s", str + 1);
n = strlen(str + 1);
map<int, int> moddd;
moddd[0] = 1;
ll ans = 0;
tens[0] = 1;
for (int i = 1; i <= n; i++)
tens[i] = tens[i - 1] * 10 % 2019;
for (int i = 1; i <= n; i++) {
pref[i] = (pref[i - 1] * 10 + str[i] - '0') % 2019;
}
for (int i = 1; i <= n; i++)
pref[i] = pref[i] * getInv(tens[i], 2019) % 2019;
for (int i = 1; i <= n; i++) {
ans += moddd[pref[i]];
moddd[pref[i]]++;
}
printf("%lld", ans);
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
typedef long double LD;
using namespace std;
const int INF = 2147483647;
const int INF2 = 0x3f3f3f3f;
const ll INF64 = 1e18;
const double INFD = 1e30;
const double EPS = 1e-9;
const double PI = acos(-1);
const int MOD = 998244353;
template <typename T> inline T read() {
T X = 0, w = 0;
char ch = 0;
while (!isdigit(ch)) {
w |= ch == '-';
ch = getchar();
}
while (isdigit(ch))
X = (X << 3) + (X << 1) + (ch ^ 48), ch = getchar();
return w ? -X : X;
}
const int MAXN = 500005;
int n, m, k;
int dr[4] = {1, 0, -1, 0};
int dc[4] = {0, 1, 0, -1};
int dr2[8] = {1, 1, 1, -1, -1, -1, 0, 0};
int dc2[8] = {1, 0, -1, 1, 0, -1, 1, -1};
int CASE = 1;
char str[MAXN];
int pref[MAXN];
int tens[MAXN];
void extgcd(ll a, ll b, ll &d, ll &x, ll &y) {
if (!b) {
d = a;
x = 1;
y = 0;
} else {
extgcd(b, a % b, d, y, x);
y -= x * (a / b);
}
}
inline ll getInv(ll x, ll mod) {
ll g, a, b;
extgcd(x, mod, g, a, b);
return (a % mod + mod) % mod;
}
int main() {
#ifdef LOCALLL
freopen("in", "r", stdin);
freopen("out", "w", stdout);
#endif
scanf("%s", str + 1);
n = strlen(str + 1);
map<int, int> moddd;
moddd[0] = 1;
ll ans = 0;
tens[0] = 1;
for (int i = 1; i <= n; i++)
tens[i] = tens[i - 1] * 10 % 2019;
for (int i = 1; i <= n; i++) {
pref[i] = (pref[i - 1] * 10 + str[i] - '0') % 2019;
}
for (int i = 1; i <= n; i++)
pref[i] = pref[i] * getInv(tens[i], 2019) % 2019;
for (int i = 1; i <= n; i++) {
ans += moddd[pref[i]];
moddd[pref[i]]++;
}
printf("%lld", ans);
return 0;
} | replace | 33 | 34 | 33 | 34 | 0 | |
p02702 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll ten(ll x) {
if (x == 0) {
return 1;
} else {
ll res = 1;
for (int i = 0; i < x; i++) {
res *= 10;
res %= 2019;
}
return res;
}
}
int main() {
string S;
cin >> S;
ll lon = (ll)(S.length());
ll Am[2019] = {0};
Am[0]++;
ll back = 0;
ll ans = 0;
for (ll i = lon - 1; i >= 0; i--) {
ll X = S[i] - 48;
ll ag = ((X * ten(lon - 1 - i)) % 2019 + back) % 2019;
Am[ag]++;
back = ag;
}
for (int i = 0; i < 2019; i++) {
if (Am[i] >= 2) {
ans += (Am[i] * (Am[i] - 1)) / 2;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll ten(ll x) {
if (x == 0) {
return 1;
} else {
x %= 672;
ll res = 1;
for (int i = 0; i < x; i++) {
res *= 10;
res %= 2019;
}
return res;
}
}
int main() {
string S;
cin >> S;
ll lon = (ll)(S.length());
ll Am[2019] = {0};
Am[0]++;
ll back = 0;
ll ans = 0;
for (ll i = lon - 1; i >= 0; i--) {
ll X = S[i] - 48;
ll ag = ((X * ten(lon - 1 - i)) % 2019 + back) % 2019;
Am[ag]++;
back = ag;
}
for (int i = 0; i < 2019; i++) {
if (Am[i] >= 2) {
ans += (Am[i] * (Am[i] - 1)) / 2;
}
}
cout << ans << endl;
return 0;
} | insert | 8 | 8 | 8 | 9 | TLE | |
p02702 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define fi first
#define se second
using namespace std;
const ll INF = 1LL << 60;
const int inf = 1 << 30;
inline void fastio() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
const int maxn = 2e5 + 5;
char s[maxn];
int f[maxn][2020];
int main() {
fastio();
cin >> s + 1;
int n = strlen(s + 1);
for (int i = 1; i <= n; i++)
s[i] = s[i] - '0';
for (int i = 1; i <= n; i++)
f[i][s[i]] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2019; j++) {
f[i + 1][(10 * j + s[i + 1]) % 2019] += f[i][j];
}
}
ll ans = 0;
for (int i = 4; i <= n; i++)
ans += f[i][0];
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define fi first
#define se second
using namespace std;
const ll INF = 1LL << 60;
const int inf = 1 << 30;
inline void fastio() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
const int maxn = 2e5 + 5;
char s[maxn];
unsigned short f[maxn][2020];
int main() {
fastio();
cin >> s + 1;
int n = strlen(s + 1);
for (int i = 1; i <= n; i++)
s[i] = s[i] - '0';
for (int i = 1; i <= n; i++)
f[i][s[i]] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2019; j++) {
f[i + 1][(10 * j + s[i + 1]) % 2019] += f[i][j];
}
}
ll ans = 0;
for (int i = 4; i <= n; i++)
ans += f[i][0];
cout << ans << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | MLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.