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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02924 | Python | Time Limit Exceeded | N = int(input())
res = 0
for i in range(N):
res += i
print(res)
| N = int(input())
res = (N - 1) * N // 2
print(res)
| replace | 2 | 5 | 2 | 3 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
sum = 0
for i in range(N):
sum += i
print(sum)
| N = int(input())
print(N * (N - 1) // 2)
| replace | 1 | 7 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
print(sum([i for i in range(1, N)]))
| N = int(input())
print(N * (N - 1) // 2)
| replace | 1 | 2 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
sum = 0
for i in range(N):
sum += i
print(sum)
| N = int(input())
if N % 2 == 1:
print(N * (N - 1) // 2)
else:
print(N * (N // 2 - 1) + N // 2)
| replace | 2 | 6 | 2 | 6 | TLE | |
p02924 | Python | Time Limit Exceeded | # -*- coding: utf-8 -*-
N = int(input())
sum = 0
for i in range(N):
sum += i
print(sum)
| # -*- coding: utf-8 -*-
import math
N = int(input()) - 1
M = 0
x = int(math.ceil((N) / 2))
if N % 2 == 0:
M = x * (N + 1)
else:
M = (x - 1) * (N + 1) + x
print(M)
| replace | 1 | 6 | 1 | 11 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
n = 0
for m in range(N - 1, 0, -1):
n = n + m
print(n)
| N = int(input())
print((N * (N - 1)) // 2)
| replace | 1 | 5 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | def main():
n = int(input())
print(sum(range(n)))
main()
| def main():
n = int(input())
print((n - 1) * n // 2)
main()
| replace | 2 | 3 | 2 | 3 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
print(sum(x for x in range(n)))
| n = int(input())
print(n * (n - 1) // 2)
| replace | 1 | 2 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
ans = 0
for i in range(N):
ans += i
print(ans)
| N = int(input())
print(N * (N - 1) // 2)
| replace | 1 | 7 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
print(sum(range(n)))
| n = int(input())
if n % 2:
print(n * (n - 1) // 2)
else:
print(n * (n // 2 - 1) + n // 2)
| replace | 1 | 2 | 1 | 6 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
res = 0
for i in range(N):
res += i
print(res)
| N = int(input())
res = int(N * (N - 1) // 2)
print(res)
| replace | 1 | 4 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
ans = 0
for n in range(1, N):
ans += n
print(ans)
| N = int(input())
print((N - 1) * (1 + N - 1) // 2)
| replace | 2 | 6 | 2 | 3 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
ans = 0
for i in range(1, n):
ans += i
print(ans)
| n = int(input())
print(n * (n - 1) // 2)
| replace | 2 | 7 | 2 | 3 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
ans = 0
for i in range(n):
ans += i
print(ans)
| n = int(input())
ans = ((n - 1) * n) // 2
print(ans)
| replace | 1 | 5 | 1 | 2 | TLE | |
p02924 | Python | Runtime Error | N = int(input())
list = list(range(N))
print(sum(list))
| N = int(input())
print(N * (N - 1) // 2)
| replace | 2 | 5 | 2 | 3 | 0 | |
p02924 | Python | Time Limit Exceeded | n = int(input())
ans = 0
for i in range(1, n):
ans += i
print(ans)
| n = int(input())
print(n * (n - 1) // 2)
| replace | 1 | 5 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
nums = [i for i in range(1, N + 1)]
if (N - 1) % 2 == 0:
print(N * ((N - 1) // 2))
else:
# 12 =>
print(N * ((N - 1) // 2) + (N // 2))
| N = int(input())
# nums = [i for i in range(1, N + 1)]
if (N - 1) % 2 == 0:
print(N * ((N - 1) // 2))
else:
# 12 =>
print(N * ((N - 1) // 2) + (N // 2))
| replace | 1 | 2 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
sum = 0
for i in range(1, n):
sum += i
print(sum)
| n = int(input())
print(sum(range(1, n)))
| replace | 1 | 7 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
print(sum(range(n)))
| n = int(input())
print(((n * (n + 1)) // 2) - n)
| replace | 1 | 2 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
ans = 0
for i in range(1, n):
ans += i
print(ans)
| n = int(input())
n = n - 1
if n % 2 == 1:
ans = ((n + 1) // 2) * n
else:
ans = n + (n // 2) * (n - 1)
print(ans)
| replace | 1 | 4 | 1 | 6 | TLE | |
p02924 | Python | Time Limit Exceeded | print(sum(range(1, int(input()))))
| N = int(input())
print((1 + (N - 1)) * (N - 1) // 2)
| replace | 0 | 1 | 0 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
ans = 0
for i in range(N):
ans += i
print(ans)
| N = int(input())
ans = N * (N - 1) // 2
print(ans)
| replace | 2 | 5 | 2 | 4 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
r = 0
for i in range(n):
r += i
print(r)
| n = int(input())
print(n * (n - 1) // 2)
| replace | 1 | 5 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
print(sum([i for i in range(N)]))
| N = int(input())
# print(sum([i for i in range(N)]))
print(N * (0 + N - 1) // 2)
| replace | 1 | 2 | 1 | 3 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
r = 0
for i in range(n):
r += i
print(r)
| n = int(input())
print(n * (n - 1) // 2)
| replace | 1 | 5 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
ans = 0
for i in range(n):
ans += i
print(ans)
| n = int(input())
print((1 + (n - 1)) * (n - 1) // 2)
| replace | 2 | 6 | 2 | 3 | TLE | |
p02924 | Python | Time Limit Exceeded | # -*- coding: utf-8 -*-
N = int(input())
ans = 0
for y in range(1, N):
ans += y
print(ans)
| # -*- coding: utf-8 -*-
N = int(input())
ans = ((N + 1) * N) // 2
ans -= N
print(ans)
| replace | 4 | 7 | 4 | 6 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
print(sum([i for i in range(1, n)]))
| n = int(input())
ans = n * (n // 2)
if (n - 1) % 2 == 0:
print(ans)
else:
print(ans - int(n / 2))
| replace | 2 | 3 | 2 | 7 | TLE | |
p02924 | Python | Time Limit Exceeded | print(sum(range(1, int(input()))))
| N = int(input())
print(((N - 1) * N // 2))
| replace | 0 | 1 | 0 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | N = int(input())
print(sum(i for i in range(N)))
| N = int(input())
print((N - 1) * N // 2)
| replace | 1 | 2 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
print(sum(i for i in range(1, n)))
| n = int(input())
print(n * (n - 1) // 2)
| replace | 1 | 2 | 1 | 2 | TLE | |
p02924 | Python | Runtime Error | def solve(n):
n = list(range(1, n))
return sum(n)
N = int(input())
print(solve(N))
| def solve(n):
return n * (n - 1) // 2
N = int(input())
print(solve(N))
| replace | 1 | 3 | 1 | 2 | 0 | |
p02924 | Python | Runtime Error | N = int(input())
print(sum(list(range(N))))
| N = int(input())
print(sum(range(N)))
| replace | 1 | 2 | 1 | 2 | 0 | |
p02924 | Python | Time Limit Exceeded | n = int(input())
m = [i for i in range(n)]
print(sum(m))
| n = int(input())
print((n * (n - 1)) // 2)
| replace | 1 | 3 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | print(sum(range(int(input()))))
| n = int(input())
print((n - 1) * n // 2)
| replace | 0 | 1 | 0 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
ans = 0
for i in range(n):
ans += i
print(ans)
| n = int(input())
print((n * (n - 1)) // 2)
| replace | 1 | 5 | 1 | 2 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
ans = 0
for i in range(n):
ans += i
print(ans)
| n = int(input())
ans = 0
print((n * (n - 1)) // 2)
| replace | 3 | 6 | 3 | 4 | TLE | |
p02924 | Python | Time Limit Exceeded | n = int(input())
print(sum(range(1, n)))
| n = int(input())
ans = n * (n - 1) // 2
print(ans)
| replace | 1 | 2 | 1 | 3 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <iostream>
#define lli long long int
using namespace std;
int main() {
lli n;
cin >> n;
lli sum = 0;
if (n == 1)
cout << 0 << endl;
else if (n == 2) {
cout << 1 << endl;
} else {
for (lli i = 1; i < n; i++) {
sum += i % (i + 1);
}
cout << sum << endl;
}
return 0;
}
| #include <iostream>
#define lli long long int
using namespace std;
int main() {
lli n;
cin >> n;
lli sum = 0;
if (n == 1)
cout << 0 << endl;
else if (n == 2) {
cout << 1 << endl;
} else {
cout << n * (n - 1) / 2 << endl;
}
return 0;
}
| replace | 12 | 16 | 12 | 14 | TLE | |
p02924 | C++ | Time Limit Exceeded | //
// main.cpp
// temp
//
// Created by tolemy on 2019/08/04.
// Copyright © 2019 tolemy. All rights reserved.
//
#include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
unsigned long long sum = 0;
for (int i = n - 1; i > 0; i--) {
sum += i % (i + 1);
}
... | //
// main.cpp
// temp
//
// Created by tolemy on 2019/08/04.
// Copyright © 2019 tolemy. All rights reserved.
//
#include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
unsigned long sum = 0;
// 1からn-1までの和
if (n > 1) {
unsigned long a = 0;
unsigned... | replace | 17 | 20 | 17 | 32 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j) for (int i = 0; i < j; i++)
#define REP(i, j, z) for (int i = j; i < z; i++)
int main() {
ll N;
ll i = 1;
ll ans = 0;
cin >> N;
while (N != i) {
ans += i % N;
i++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j) for (int i = 0; i < j; i++)
#define REP(i, j, z) for (int i = j; i < z; i++)
int main() {
ll N;
ll i = 1;
ll ans = 0;
cin >> N;
N--;
cout << N * (N + 1) / 2 << endl;
}
| replace | 10 | 15 | 10 | 12 | TLE | |
p02924 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define all(v) v.begin(), v.end()
#define sz(v) int(v.size())
#define ll long long
#define fi first
#define se second
#define FOR(i, a, b) for (ll int i = a; i < b; i++)
#define FORR(i, a, b) for (ll int i = a; i >= b; i--)
using ... | #include <algorithm>
#include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define all(v) v.begin(), v.end()
#define sz(v) int(v.size())
#define ll long long
#define fi first
#define se second
#define FOR(i, a, b) for (ll int i = a; i < b; i++)
#define FORR(i, a, b) for (ll int i = a; i >= b; i--)
using ... | replace | 31 | 52 | 31 | 34 | 0 | |
p02924 | C++ | Time Limit Exceeded | /*
Rohit645
Rohit Kumar
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using pll = pair<ll, ll>;
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std ... | /*
Rohit645
Rohit Kumar
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using pll = pair<ll, ll>;
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std ... | replace | 42 | 46 | 42 | 43 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(type, i, a, b) for (type i = a; i < b; i++)
typedef long long ll;
using namespace std;
int main(void) {
ll N, ans;
scanf("%lld", &N);
// vector<ll> A(N),B(N);
ans = 0LL;
REP(ll, i, 0, N - 1) { ans += (i + 1) % (i + 2); }
printf("%lld\n", ans);
return 0;
} | #include <bits/stdc++.h>
#define REP(type, i, a, b) for (type i = a; i < b; i++)
typedef long long ll;
using namespace std;
int main(void) {
ll N, ans;
scanf("%lld", &N);
// vector<ll> A(N),B(N);
ans = (N - 1) * N / 2LL;
printf("%lld\n", ans);
return 0;
} | replace | 11 | 13 | 11 | 12 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long N, sum;
cin >> N;
sum = 0;
for (int i = 1; i < N; i++) {
sum += i % (i + 1);
}
cout << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long N, sum;
cin >> N;
sum = 0;
for (int i = 1; i < N; i++) {
sum += i;
}
cout << sum << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02924 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <bits/stdint-intn.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int64_t n;
std::cin >> n;
std::vector<int64_t> v(n);
int64_t ans = 0;
rep(i, n) { ans += (n - i - 1) % (n - i); }
std::cout << ans << std::... | #include <algorithm>
#include <bits/stdc++.h>
#include <bits/stdint-intn.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int64_t n;
std::cin >> n;
std::cout << n * (n - 1) / 2 << std::endl;
return 0;
}
| replace | 12 | 18 | 12 | 13 | 0 | |
p02924 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> P(N);
int ans = 0;
for (int i = 0; i < N; i++)
ans += i;
cout << ans << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
long long int ans = 0;
for (int i = 0; i < N; i++)
ans += i;
cout << ans << endl;
}
| replace | 7 | 10 | 7 | 8 | 0 | |
p02924 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0,... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0,... | replace | 39 | 44 | 39 | 40 | TLE | |
p02924 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>>
vec_p; // vector<pair<ll, ll>> pairs(n) ,pairs.at(i) = make_pair(i*i, i)
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define R... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>>
vec_p; // vector<pair<ll, ll>> pairs(n) ,pairs.at(i) = make_pair(i*i, i)
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define R... | delete | 28 | 30 | 28 | 28 | 0 | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long n;
long long solve();
int main() {
cin >> n;
cout << solve() << endl;
return 0;
}
long long solve() {
long long ans = 0;
for (long long i = 1; i < n; ++i) {
ans += i % (i + 1);
}
return ans;
}
| #include <bits/stdc++.h>
using namespace std;
long long n;
long long solve();
int main() {
cin >> n;
cout << solve() << endl;
return 0;
}
long long solve() {
long long ans = 0;
ans = n * (n - 1) / 2;
return ans;
}
| replace | 15 | 18 | 15 | 16 | TLE | |
p02924 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> f(n);
rep(i, n) f[i] = i - 1;
long long sum;
sum = 0;
f[0] = n;
for (long long i = 1; i < n; i++) {
f[i] = i;
}
for (long long i = 0; i < n; i++) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long n;
cin >> n;
cout << n * (n - 1) / 2;
}
| replace | 7 | 19 | 7 | 8 | 0 | |
p02924 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long n;
std::cin >> n;
long long sum = 0;
for (long long i = 1; i < n; i++) {
sum += i % (i + 1);
}
std::cout << sum << '\n';
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long n;
std::cin >> n;
std::cout << (n - 1) * n / 2 << '\n';
return 0;
}
| replace | 6 | 11 | 6 | 7 | TLE | |
p02924 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
void solve() {
in... | #include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repd(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
void solve() {
in... | replace | 21 | 25 | 21 | 25 | 0 | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long i = cc; i < n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)
int main() {
long N;
cin >> N;
long ans = 0;
lrep(i, 0, N) {
long a = i + 1;
ans += i % (i + 1);
}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long i = cc; i < n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)
int main() {
long N;
cin >> N;
long ans = 0;
ans += N * (N - 1) / 2;
cout << ans << endl;
} | replace | 10 | 14 | 10 | 11 | TLE | |
p02924 | C++ | Runtime Error | ///////////////////////////////////////////////////////////
#include <algorithm>
#include <array>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
///////////////////////////////////////////////////////////
#define ll long long
#define ull unsigned lon long
///////////////... | ///////////////////////////////////////////////////////////
#include <algorithm>
#include <array>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
///////////////////////////////////////////////////////////
#define ll long long
#define ull unsigned lon long
///////////////... | replace | 29 | 34 | 29 | 31 | 0 | |
p02924 | C++ | Time Limit Exceeded | // D
#include <bits/stdc++.h>
using namespace std;
#define DB(x) cout << #x << " = " << x << endl;
#define LEFT(n) (2 * (n))
#define RIGHT(n) (2 * (n) + 1)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> node;
// typedef vector <vector <ll>> matrix;
const ll INF = 1e16;
const double EPS... | // D
#include <bits/stdc++.h>
using namespace std;
#define DB(x) cout << #x << " = " << x << endl;
#define LEFT(n) (2 * (n))
#define RIGHT(n) (2 * (n) + 1)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> node;
// typedef vector <vector <ll>> matrix;
const ll INF = 1e16;
const double EPS... | replace | 28 | 37 | 28 | 29 | TLE | |
p02924 | C++ | Runtime Error | // abc139_d
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include... | // abc139_d
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include... | replace | 75 | 76 | 75 | 76 | 0 | |
p02924 | C++ | Time Limit Exceeded | // {{{
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using n... | // {{{
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using n... | replace | 58 | 59 | 58 | 62 | TLE | |
p02924 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#define lli unsigned long long int
using namespace std;
#define S second
#define F first
#define pb push_back
#define M1 1000000007
#define M2 998244353
#define pint pair<int, int>
#define setit set<int>::iterator seti
#define mapit map<int, int>::iterator mapi
#define MP ma... | #include <bits/stdc++.h>
#include <iostream>
#define lli unsigned long long int
using namespace std;
#define S second
#define F first
#define pb push_back
#define M1 1000000007
#define M2 998244353
#define pint pair<int, int>
#define setit set<int>::iterator seti
#define mapit map<int, int>::iterator mapi
#define MP ma... | replace | 43 | 50 | 43 | 51 | 0 | |
p02924 | C++ | Runtime Error | /*
The Island Was Silent before.
.....
And One day again it became Silent.
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define modd(a, b) ((a + 2 * b) % b)
#define debug(a) cout << #a << ": " << (a) << "\n"
#define ioso ios_base::sync_with_stdio(0), cin.tie(0), cout.ti... | /*
The Island Was Silent before.
.....
And One day again it became Silent.
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define modd(a, b) ((a + 2 * b) % b)
#define debug(a) cout << #a << ": " << (a) << "\n"
#define ioso ios_base::sync_with_stdio(0), cin.tie(0), cout.ti... | replace | 19 | 20 | 19 | 20 | 0 | |
p02924 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
#define pi 3.14159... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
typedef long long ll;
#define pi 3.14159... | replace | 131 | 134 | 131 | 135 | TLE | |
p02924 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define PI 3.141592653589793238462643383279
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
typedef long long int ll;
typedef unsigned long long... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define PI 3.141592653589793238462643383279
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
typedef long long int ll;
typedef unsigned long long... | replace | 32 | 34 | 32 | 33 | 0 | |
p02924 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long n, a[100100], h = 0, ans = 0;
cin >> n;
for (int i = 1; i < n; i++)
ans += i % (i + 1);
/*a[n]=1;
for(int i=1;i<=n;i++)
ans+=i%a[i];*/
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main() {
long long n, a[100100], h = 0, ans = 0;
cin >> n;
cout << (n - 1) * n / 2 << endl;
} | replace | 5 | 11 | 5 | 6 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long sum = 0;
for (long long i = 1; i < N; i++) {
sum = sum + i % (i + 1);
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
cout << N * (N - 1) / 2 << endl;
} | replace | 5 | 10 | 5 | 6 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0;
cin >> n;
for (int i = 1; i < n; i++) {
ans += i % (i + 1);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0;
cin >> n;
ans = ((n) * (n - 1)) / 2;
cout << ans << endl;
}
| replace | 6 | 9 | 6 | 7 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
int main(void) {
ll N;
cin >> N;
vector<int> P;
for (int i = 0; i < N - 1; i++) {
P.push_back(i + 2);
}
P.push_back(1);
ll sum = 0;
for (int i = 1; i <= N; i++) {
sum += (i % P[i - 1]);
}
cout << sum ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
int main(void) {
ll N;
cin >> N;
ll sum = (N - 1) * N / 2;
cout << sum << endl;
} | replace | 10 | 20 | 10 | 11 | TLE | |
p02924 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define Rep(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
#define rever(vec) reverse(all... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
#define low lower_bound
#define upp upper_bound
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define Rep(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
#define rever(vec) reverse(all... | replace | 109 | 110 | 109 | 110 | 0 | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long int t, ans;
int main() {
// ios::sync_with_stdio(0), cin.tie(0);
// cout<< fixed<< setprecision(10) << x << endl;
cin >> t;
ans += t % 1;
for (int a = 1; a <= t; a++) {
ans += (a - 1) % a;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
long long int t, ans;
int main() {
// ios::sync_with_stdio(0), cin.tie(0);
// cout<< fixed<< setprecision(10) << x << endl;
cin >> t;
for (int a = 1; a < t; a++) {
ans += a;
}
cout << ans << endl;
}
| replace | 7 | 10 | 7 | 9 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> N;
ll ans = 0;
for (ll i = 1; i <= N; i++) {
ll mod = i + 1;
if (mod > N)
mod = 1;
ans += i % mod;
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> N;
cout << (N) * (N - 1) / 2 << "\n";
return 0;
} | replace | 11 | 20 | 11 | 12 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
// typedef pair<long long,long long> P;
// typedef pair<long long,P> P1;
// typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi firs... | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
// typedef pair<long long,long long> P;
// typedef pair<long long,P> P1;
// typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi firs... | replace | 54 | 59 | 54 | 56 | TLE | |
p02924 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ALL(v)... |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ALL(v)... | replace | 35 | 39 | 35 | 36 | TLE | |
p02924 | C++ | Runtime Error | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include... | replace | 314 | 327 | 314 | 315 | 0 | |
p02924 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int sum = 0;
for (long long int i = 1; i <= n; i++) {
if (i != n) {
sum = sum + i % (i + 1);
}
}
cout << sum;
return 0;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int sum = 0;
for (long long int i = 1; i < n; i++) {
sum = sum + i;
}
cout << sum;
return 0;
} | replace | 10 | 14 | 10 | 12 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using lint = long long;
int main(void) {
lint N;
cin >> N;
lint ans = 0;
for (int i = 1; i < N; i++) {
an... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using lint = long long;
int main(void) {
lint N;
cin >> N;
lint ans = 0;
ans = (N) * (N - 1) / 2;
cout << an... | replace | 16 | 21 | 16 | 17 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define big ((ll)(1e9) + 7)
int main() {
ll n;
cin >> n;
ll a = 2;
ll ans = 0;
for (ll i = 1; i < n; i++) {
ans += i % a;
// cout... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define big ((ll)(1e9) + 7)
int main() {
ll n;
cin >> n;
ll ans = n * (n - 1) / 2;
cout << ans << endl;
}
| replace | 16 | 23 | 16 | 17 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n;
void solve() {
cin >> n;
ll sum;
sum = 0LL;
for (int i = 1; i < n; i++) {
sum += i;
}
cout << sum << endl;
}
signed main() {
while (1)
solve();
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n;
void solve() {
cin >> n;
ll sum;
sum = 0LL;
for (int i = 1; i < n; i++) {
sum += i;
}
cout << sum << endl;
}
signed main() {
// while(1)
solve();
} | replace | 18 | 20 | 18 | 20 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long long sum = 0;
for (int i = 1; i <= n - 1; i++) {
sum += i % (i + 1);
}
cout << sum << endl;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
long long sum = 0;
for (int i = 1; i < n; i++) {
sum += i;
}
cout << sum << endl;
} | replace | 13 | 15 | 13 | 15 | TLE | |
p02924 | C++ | Time Limit Exceeded | /// __Macro's__
// #pragma GCC optimize("-O2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define II pair<int, int>
#define III pair<int, II>
#define VL vector<ll>
#define VI vector<int>
#define VII vector<II>
#define VIII vector<III>
#define VVI vector<vector<int>>
#define VVII vector<vector<II... | /// __Macro's__
// #pragma GCC optimize("-O2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define II pair<int, int>
#define III pair<int, II>
#define VL vector<ll>
#define VI vector<int>
#define VII vector<II>
#define VIII vector<III>
#define VVI vector<vector<int>>
#define VVII vector<vector<II... | replace | 93 | 97 | 93 | 95 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, a, b) for (signed i = a; i < (b); ++i)
#define erep(i, a, b) for (signed i = a; i <= (b); ++i)
#define per(i, a, b) for (signed i = (a); i > (b); --i)
#define eper(i, a, b) for (signed i = (a); i >= b; --i)
#define fore(i, x, a) for (aut... | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, a, b) for (signed i = a; i < (b); ++i)
#define erep(i, a, b) for (signed i = a; i <= (b); ++i)
#define per(i, a, b) for (signed i = (a); i > (b); --i)
#define eper(i, a, b) for (signed i = (a); i >= b; --i)
#define fore(i, x, a) for (aut... | replace | 74 | 82 | 74 | 75 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
ll sum = n % 1;
for (ll j = 1; j < n; ++j) {
sum += j % (j + 1);
}
cout << sum;
return 0;
}
| #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
int main() {
ll n;
cin >> n;
ll k = n - 1;
ll ans = ((1 + k) * k) / 2;
cout << ans;
return 0;
}
| replace | 9 | 15 | 9 | 12 | TLE | |
p02924 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define INF 100100100
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
ll n;
cin >> n;
vector<ll> sum(n);
sum[0] = 0;
rep(i, n) sum[i + 1] = sum[i] + i;
cout << sum[n] ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define INF 100100100
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| replace | 11 | 15 | 11 | 12 | 0 | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, c, sum = 0, i;
cin >> n;
c = n;
for (i = n - 1; i >= 1; i--) {
sum = sum + (i % c);
c--;
}
cout << sum;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, c, sum = 0, i;
cin >> n;
c = n;
for (i = n - 1; i >= 1; i--) {
sum = sum + i;
c--;
}
cout << sum;
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p02924 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef vector<pii> vii;
typedef vector<pl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef vector<pii> vii;
typedef vector<pl... | replace | 48 | 64 | 48 | 49 | 0 | |
p02924 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
unsigned long long N;
cin >> N;
unsigned long long ans = 0;
vector<long long> P(N);
if (N == 1) {
cout << 0;
} else {
for (unsigned l... | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
unsigned long long N;
cin >> N;
unsigned long long ans = N * (N - 1) / 2;
cout << ans;
} | replace | 13 | 26 | 13 | 15 | 0 | |
p02924 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define SaveTime \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#define mx *max_element
#def... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define SaveTime \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#define mx *max_element
#def... | replace | 54 | 72 | 54 | 56 | 0 | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, h) for (int i = 0; i < h; ++i)
#define rep1(i, h) for (int i = 0; i <= h; ++i)
#define rep2(i, k, h) for (int i = k; i < h; ++i)
#define rep3(i, k, h) for (int i = k; i <= h; ++i)
#define INF LONG_LONG_MAX // long ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, h) for (int i = 0; i < h; ++i)
#define rep1(i, h) for (int i = 0; i <= h; ++i)
#define rep2(i, k, h) for (int i = k; i < h; ++i)
#define rep3(i, k, h) for (int i = k; i <= h; ++i)
#define INF LONG_LONG_MAX // long ... | replace | 19 | 20 | 19 | 20 | TLE | |
p02924 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, c, m = 0;
cin >> n;
int ar[n + 1], j = 1;
ar[1] = n;
for (int i = 2; i <= n; i++) {
ar[i] = i - 1;
}
for (int k = 1; k <= n; k++)
m = m + ar[k] % k - 1;
cout << m;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, c, m = 0;
cin >> n;
/* int ar[n],j=1;
ar[1]=n;
for(int i=2;i<=n;i++){
ar[i]=j;
j++;
}
for(int k=1;k<=n;k++)
m=m+ar[k]%k;*/
m = n * (n - 1) / 2;
cout << m;
}
| replace | 6 | 13 | 6 | 15 | 0 | |
p02924 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// 0~nの範囲操作
#define rep(i, n) for (ll i = 0; i < (n); ++i)
// 1~nの範囲操作
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
// n~0を後ろから範囲操作
#define drep(i, n) for (ll i = (n)-1; i >= 0; --i)
// 出力後改行を
#define fin(ans) cout << (ans) << endl;
// 出力後空白を
#define blank(ans) cout <... | #include <bits/stdc++.h>
using namespace std;
// 0~nの範囲操作
#define rep(i, n) for (ll i = 0; i < (n); ++i)
// 1~nの範囲操作
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
// n~0を後ろから範囲操作
#define drep(i, n) for (ll i = (n)-1; i >= 0; --i)
// 出力後改行を
#define fin(ans) cout << (ans) << endl;
// 出力後空白を
#define blank(ans) cout <... | replace | 367 | 376 | 367 | 368 | 0 | |
p02924 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, sum = 0;
cin >> n;
while (n != 1) {
sum = sum + (n - 1) % (n);
n--;
}
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, sum = 0;
cin >> n;
for (int i = 1; i < n; i++) {
sum = sum + i;
}
cout << sum;
return 0;
}
| replace | 8 | 11 | 8 | 10 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long int ans = 0;
for (int i = 1; i <= N - 1; i++) {
ans += i % (i + 1);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long int ans = 0;
for (int i = 1; i <= N - 1; i++) {
ans += i;
}
cout << ans << endl;
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p02924 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define N... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
// output
#define SPBR(w, n) std::cout << (w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define N... | replace | 44 | 85 | 44 | 45 | 0 | |
p02924 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
typedef long long int ll;
using namespace std;
int main() {
ll N;
cin >> N;
vector<ll> P(N);
ll ans = 0;
for (int i = 0; i < N; i++) {
P.at(i) = i;
ans += ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
typedef long long int ll;
using namespace std;
int main() {
ll N;
cin >> N;
ll ans = (N * (N - 1)) / 2;
cout << ans << endl;
}
| replace | 14 | 20 | 14 | 15 | 0 | |
p02924 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i, a, n) for (int i = a; i < (int)n; ++i)
#define SZ(x) ((int)(x).size()) // size() unsigned -> int
#define descSort(a) sort(a.begin(), a.end(), std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
ll gcd(ll x, ll y) {
... |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i, a, n) for (int i = a; i < (int)n; ++i)
#define SZ(x) ((int)(x).size()) // size() unsigned -> int
#define descSort(a) sort(a.begin(), a.end(), std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
ll gcd(ll x, ll y) {
... | replace | 20 | 22 | 20 | 21 | TLE | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define dump(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define dump(... | replace | 27 | 36 | 27 | 28 | TLE | |
p02924 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 60;
const double eps = 1e-9;
int main() {
ll n;
cin >> n;
cout << n / (n - 1) / 2 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 60;
const double eps = 1e-9;
int main() {
ll n;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p02924 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 998244353
#define INF 10000000000000001
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define vc vector
#define vll vector<long long>
#define pll pair<long long, long long>
#define pb push_back
#define ll long long
#define all(v) v.begin(), v.end()
#... | #include <bits/stdc++.h>
#define MOD 998244353
#define INF 10000000000000001
#define F first
#define S second
#define LB lower_bound
#define UB upper_bound
#define vc vector
#define vll vector<long long>
#define pll pair<long long, long long>
#define pb push_back
#define ll long long
#define all(v) v.begin(), v.end()
#... | replace | 24 | 30 | 24 | 27 | 0 | |
p02924 | C++ | Runtime Error | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(long long n); // 数字の桁数を取得する。
string up... | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(long long n); // 数字の桁数を取得する。
string up... | delete | 41 | 42 | 41 | 41 | 0 | |
p02924 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
int main() {
ll n, m, i, j, k;
cin >> n;
vector<ll> v(n);
for (i = 1; i < n; i++) {
v[i - 1] = i + 1;
}
v[n - 1] = 1;
ll sum = 0;
for (i = 1; i <= n; i++) {
sum += i % v[i - 1];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
int main() {
ll n, m, i, j, k;
cin >> n;
cout << n * (n - 1) / 2 << endl;
return 0;
} | replace | 11 | 21 | 11 | 12 | 0 | |
p02924 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << '\n'
#define Int int64_t
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
Int INF = 1e18;
int inf = 1e9;
Int mod = 1e9 + 7;
int main() {
Int n;
cin >> n;
Int res = 0;
for (Int i = 1; i <= n; i++) {
res +=... | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << '\n'
#define Int int64_t
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
Int INF = 1e18;
int inf = 1e9;
Int mod = 1e9 + 7;
int main() {
Int n;
cin >> n;
dump(n * (n - 1) / 2);
return 0;
} | replace | 16 | 21 | 16 | 17 | TLE | |
p02924 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (decltype(n) i = 0; i < n; i++)
#define ALL(c) c.begin(), c.end()
#define SORT(c) std::sort(ALL(c))
#define RSORT(c) std::sort(ALL(c), std::greater<decltype(c)::value_type>())
using namespace std;
using ll = long long;
const int MOD = (int)1e9 + 7;
const int INF = (int... | #include <bits/stdc++.h>
#define REP(i, n) for (decltype(n) i = 0; i < n; i++)
#define ALL(c) c.begin(), c.end()
#define SORT(c) std::sort(ALL(c))
#define RSORT(c) std::sort(ALL(c), std::greater<decltype(c)::value_type>())
using namespace std;
using ll = long long;
const int MOD = (int)1e9 + 7;
const int INF = (int... | replace | 21 | 30 | 21 | 22 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.