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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02628 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long int
#define pb push_back
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pii pair<int, int>
#define vvi vector<vector<int>>
#define vi... | #include <bits/stdc++.h>
#define int long long int
#define pb push_back
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define pii pair<int, int>
#define vvi vector<vector<int>>
#define vi... | replace | 54 | 55 | 54 | 55 | 0 | |
p02628 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> lol;
for (int i = 0; i < n; i++) {
cin >> lol[i];
}
sort(lol.begin(), lol.end());
int sum = 0;
for (int i = 0; i < k; i++) {
sum += lol[i];
}
cout << sum;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> lol(n);
for (int i = 0; i < n; i++) {
cin >> lol[i];
}
sort(lol.begin(), lol.end());
int sum = 0;
for (int i = 0; i < k; i++) {
sum += lol[i];
}
cout << sum;
} | replace | 8 | 9 | 8 | 9 | -11 | |
p02628 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
int main() {
int n, k, sum, vec[n];
sum = 0;
std::cin >> n >> k;
for (int i = 0; i < n; i++) {
std::cin >> vec[i];
}
std::sort(vec, vec + n);
for (int i = 0; i < k; i++) {
sum = sum + vec[i];
}
std::cout << sum;
}
| #include <bits/stdc++.h>
#include <iostream>
int main() {
int n, k, sum, vec[1000];
sum = 0;
std::cin >> n >> k;
for (int i = 0; i < n; i++) {
std::cin >> vec[i];
}
std::sort(vec, vec + n);
for (int i = 0; i < k; i++) {
sum = sum + vec[i];
}
std::cout << sum;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02629 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MAX 500000000
// Function to print Excel column name for a given column number
void printString(long long int n) {
char str[MAX]; // To store result (Excel column name)
long long int i = 0; // To store current index in str which is result
while (n > ... | #include <bits/stdc++.h>
using namespace std;
#define MAX 50
// Function to print Excel column name for a given column number
void printString(long long int n) {
char str[MAX]; // To store result (Excel column name)
long long int i = 0; // To store current index in str which is result
while (n > 0) {
... | replace | 4 | 5 | 4 | 5 | -11 | |
p02629 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
long n;
cin >> n;
int digit[10] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
int idx = 0;
while (n > 0) {
digit[idx] = n % 26;
if (digit[idx] == 0) {
digit[idx] = 26;
n -= 26;
}
n /= 26;
idx++;
}
for (; digit[idx] == 0; idx--)
... | #include <iostream>
using namespace std;
int main() {
long n;
cin >> n;
int digit[12] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
int idx = 0;
while (n > 0) {
digit[idx] = n % 26;
if (digit[idx] == 0) {
digit[idx] = 26;
n -= 26;
}
n /= 26;
idx++;
}
for (; digit[idx] == 0; idx-... | replace | 5 | 6 | 5 | 6 | 0 | |
p02629 | C++ | Runtime Error | #include <cassert>
#include <cmath>
#include <iostream>
#include <stdexcept>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
assert(N >= 1);
const string alphabets = "abcdefghijklmnopqrstuvwxyz";
const long long MAX_N = 1000000000000001;
const int M = 26;
in... | #include <cassert>
#include <cmath>
#include <iostream>
#include <stdexcept>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
assert(N >= 1);
const string alphabets = "abcdefghijklmnopqrstuvwxyz";
const long long MAX_N = 1000000000000001;
const int M = 26;
in... | replace | 20 | 21 | 20 | 21 | 0 | |
p02629 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
string ans;
int n, now = 1, cnt = 26, num = 26;
int main() {
cin >> n;
while (cnt < n) {
num *= 26;
cnt += num, now++;
}
cnt -= num, num /= 26, n -= cnt + 1;
// cout<<n<<" "<<num<<"\n";
for (int i = 0; i < now; i++) {
putchar(n / num + 'a');
n %... | #include <bits/stdc++.h>
using namespace std;
long long n, now = 1, cnt = 26, num = 26;
int main() {
cin >> n;
while (cnt < n) {
num *= 26;
cnt += num, now++;
}
cnt -= num, num /= 26, n -= cnt + 1;
// cout<<n<<" "<<num<<"\n";
for (int i = 0; i < now; i++) {
putchar(n / num + 'a');
n %= num,... | replace | 2 | 4 | 2 | 3 | 0 | |
p02629 | Python | Runtime Error | N = int(input())
ans = ""
while N > 0:
N -= 1
ans += chr(ord("a" + N % 26))
N //= 26
print(ans[::-1])
| N = int(input())
ans = ""
while N > 0:
N -= 1
ans += chr(ord("a") + N % 26)
N //= 26
print(ans[::-1])
| replace | 4 | 5 | 4 | 5 | TypeError: can only concatenate str (not "int") to str | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02629/Python/s736604146.py", line 5, in <module>
ans += chr(ord('a' + N % 26))
TypeError: can only concatenate str (not "int") to str
|
p02629 | Python | Runtime Error | import string
s = string.ascii_lowercase
def f(x, tmp):
if x == 0:
return ""
x -= 1
if x <= 26:
return s[x] + tmp
else:
return f(x // 26, s[x % 26] + tmp)
n = int(input())
r = f(n, "")
print(r)
| import string
s = string.ascii_lowercase
def f(x, tmp):
if x == 0:
return ""
x -= 1
if x < 26:
return s[x] + tmp
else:
return f(x // 26, s[x % 26] + tmp)
n = int(input())
r = f(n, "")
print(r)
| replace | 9 | 10 | 9 | 10 | 0 | |
p02629 | Python | Runtime Error | a = int(input())
c = ""
while a >= 26:
b = a % 26
c += chr(ord("a") + b - 1)
a /= 26
c += chr(ord("a") + int(a) - 1)
print(c[::-1])
| a = int(input())
c = ""
while a > 26:
b = int(a) % 26
c += chr(ord("a") + (25 if b == 0 else int(b) - 1))
a = int(a / 26 - 1 if a % 26 == 0 else a / 26)
c += chr(ord("a") + int(a) - 1)
print(c[::-1])
| replace | 2 | 6 | 2 | 6 | 0 | |
p02629 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<int> bits(n);
int p = 0;
while (n > 0) {
bits[p++] = (--n) % 26;
n /= 26;
}
for (int i = p - 1; i >= 0; i--) {
cout << char(bits[i] + 'a');
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<int> bits(100);
int p = 0;
while (n > 0) {
bits[p++] = (--n) % 26;
n /= 26;
}
for (int i = p - 1; i >= 0; i--) {
cout << char(bits[i] + 'a');
}
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02629 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
string s;
long long N;
long long d = 1;
int result[7] = {0};
int i = 0;
int l;
cin >> N;
while (N >= 0) {
N -= d;
d *= 26;
result[i]++;
i++;
}
i--;
l = i;
d /= 26;
N... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
string s;
long long N;
long long d = 1;
int result[15] = {0};
int i = 0;
int l;
cin >> N;
while (N >= 0) {
N -= d;
d *= 26;
result[i]++;
i++;
}
i--;
l = i;
d /= 26;
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02629 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define orep(i, n) for (long long i = 1; i <= (n); ++i) // one rep
#define drep(i, n) for (long long i = (n)-1; i >= 0; --i) // down rep
#define srep(i, s, t) for (long long i = (s); i < (t); ++i) // set rep
#define rng(x) (x).begin(),... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define orep(i, n) for (long long i = 1; i <= (n); ++i) // one rep
#define drep(i, n) for (long long i = (n)-1; i >= 0; --i) // down rep
#define srep(i, s, t) for (long long i = (s); i < (t); ++i) // set rep
#define rng(x) (x).begin(),... | replace | 70 | 71 | 70 | 71 | TLE | |
p02629 | C++ | Time Limit Exceeded | /// Coded by Dhiman Sarker Bappi (Dhimanda) - RMSTU
#include <bits/stdc++.h>
using namespace std;
#define in_file freopen("input.txt", "r", stdin)
#define out_file freopen("output.txt", "w", stdout)
#define fast ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define F first
#define S second
#define pb push_bac... | /// Coded by Dhiman Sarker Bappi (Dhimanda) - RMSTU
#include <bits/stdc++.h>
using namespace std;
#define in_file freopen("input.txt", "r", stdin)
#define out_file freopen("output.txt", "w", stdout)
#define fast ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define F first
#define S second
#define pb push_bac... | replace | 74 | 75 | 74 | 75 | TLE | |
p02629 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, x = 26, pre = 1;
cin >> n;
string s;
while (n > 0) {
int c = n % x;
if (!c)
c = x;
n -= c;
s += ((c / pre - 1) + 'a');
x *= 26;
pre *= 26;
}
reverse(s.begin(), s.end());
cout << s << endl;
}
int main... | #include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, x = 26, pre = 1;
cin >> n;
string s;
while (n > 0) {
long long c = n % x;
if (!c)
c = x;
n -= c;
s += ((c / pre - 1) + 'a');
x *= 26;
pre *= 26;
}
reverse(s.begin(), s.end());
cout << s << endl;
}
in... | replace | 9 | 10 | 9 | 10 | 0 | |
p02629 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const ll INF = MOD * MOD;
const long double EPS = 1e-12;
struct mint {
ll x;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const ll INF = MOD * MOD;
const long double EPS = 1e-12;
struct mint {
ll x;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }... | replace | 1,500 | 1,501 | 1,500 | 1,501 | -6 | 6541dc06-9b26-4209-a8db-31f23b18cd11.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02629/C++/s136965132.cpp:1343: vl base_converter(ll, ll, ll): Assertion `cur + 2 <= sz' failed.
|
p02629 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
// cout << fixed << setprecision(8) << a << endl;
#define Fast_Input \
ios_base ::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define pb push_back
#define mem(a, b) memset(a, b, s... | #include <bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
// cout << fixed << setprecision(8) << a << endl;
#define Fast_Input \
ios_base ::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define pb push_back
#define mem(a, b) memset(a, b, s... | replace | 50 | 51 | 50 | 51 | -11 | |
p02629 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
string ans = "";
string abc = "abcdefghijklmnopqrstuvwxyz";
int rem;
while (n >= 0) {
n -= 1;
rem = n % 26;
ans += abc[rem];
n /= 26;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
string ans = "";
string abc = "abcdefghijklmnopqrstuvwxyz";
int rem;
while (n > 0) {
n -= 1;
rem = n % 26;
ans += abc[rem];
n /= 26;
}
... | replace | 13 | 14 | 13 | 14 | TLE | |
p02629 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
const long long MAX = 1000000000000001;
long long ruijyo(int a, int n) {
long long res = 1;
while (n) {
if (n & 1)
res = res * a;
a = a * a;
n = n >> 1;
}
return res;
}
int main() {
string alph = "abcdefghijklmnopqrstuvwxyz";
vector<long long>... | #include "bits/stdc++.h"
using namespace std;
const long long MAX = 1000000000000001;
long long ruijyo(long long a, long long n) {
long long res = 1;
while (n) {
if (n & 1)
res = res * a;
a = a * a;
n = n >> 1;
}
return res;
}
int main() {
string alph = "abcdefghijklmnopqrstuvwxyz";
vecto... | replace | 3 | 4 | 3 | 4 | 0 | |
p02629 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1e15;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
string alfa = "abcdefghijklmnopqrstuvwxyz";
string ans = "";
while (N > 0) {
ans += alfa.at(... | #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1e15;
using Graph = vector<vector<int>>;
signed main() {
int N;
cin >> N;
string alfa = "abcdefghijklmnopqrstuvwxyz";
string ans = "";
while (N > 0) {
int A = N % 26;... | replace | 14 | 15 | 14 | 21 | 0 | |
p02629 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <typename T> T ipow(T b, long long e) {
if (e == 0) {
return 1;
} else if (e % 2 == 0) {
return ipow(b * b, e / 2);
} else {
return ipow(b * b, e / 2) * b;
}
}
// aを1番目、zを26番目としてx番目のcharを返す
char get_char(int x) { return 'a' - 1 + x; }
int mai... | #include <bits/stdc++.h>
using namespace std;
template <typename T> T ipow(T b, long long e) {
if (e == 0) {
return 1;
} else if (e % 2 == 0) {
return ipow(b * b, e / 2);
} else {
return ipow(b * b, e / 2) * b;
}
}
// aを1番目、zを26番目としてx番目のcharを返す
char get_char(int x) { return 'a' - 1 + x; }
int mai... | replace | 28 | 30 | 28 | 30 | TLE | |
p02629 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define pr pair<int, int>
#define mod 1000000007
#define endl "\n"
int power(int a, int b, int m = mod) {
if (b == 0)
return 1;
if (b == 1)
return a;
int res = power(a, b / 2, m);
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define pr pair<int, int>
#define mod 1000000007
#define endl "\n"
int power(int a, int b, int m = mod) {
if (b == 0)
return 1;
if (b == 1)
return a;
int res = power(a, b / 2, m);
... | replace | 39 | 48 | 39 | 50 | 0 | |
p02629 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<char> word;
void remainder(long long int n) {
if (n != 0) {
if (n / 26 < 1) {
word.push_back('a' + n % 26 - 1);
} else if (n / 26 >= 1) {
if ((n % 26) == 0) {
word.push_back('z');
if (n > 26)
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<char> word;
void remainder(long long int n) {
if (n != 0) {
if (n / 26 < 1) {
word.push_back('a' + n % 26 - 1);
} else if (n / 26 >= 1) {
if ((n % 26) == 0) {
word.push_back('z');
if (n > 26)
... | replace | 30 | 40 | 30 | 35 | TLE | |
p02629 | C++ | Time Limit Exceeded | #line 2 "codes/header.hpp"
//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H
// template version 2.0
using namespace std;
#include <bits/stdc++.h>
// varibable settings
const long long INF = 1e18;
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;
#define _overload3(_1... | #line 2 "codes/header.hpp"
//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H
// template version 2.0
using namespace std;
#include <bits/stdc++.h>
// varibable settings
const long long INF = 1e18;
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;
#define _overload3(_1... | replace | 94 | 95 | 94 | 95 | TLE | |
p02629 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stat... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stat... | replace | 96 | 97 | 96 | 97 | TLE | |
p02629 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, x, n) for (int i = x; i < n; i++)
#define repr(i, x, n) for (int i = x; i > n; i--)
#define pii pair<int, int>
#define ll long long
const long long iinf = 1e18;
const int inf = 1e9;
const int MOD = (1e6 + 3);
int dir4[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int knight[8][2] =... | #include <bits/stdc++.h>
#define rep(i, x, n) for (int i = x; i < n; i++)
#define repr(i, x, n) for (int i = x; i > n; i--)
#define pii pair<int, int>
#define ll long long
const long long iinf = 1e18;
const int inf = 1e9;
const int MOD = (1e6 + 3);
int dir4[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int knight[8][2] =... | replace | 19 | 25 | 19 | 25 | 0 | |
p02629 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const int mod = 1e9 + 7;
const int nax = 1e7;
const ll inf = 1e10 + 17;
vector<int> prime(nax, -1);
ll pow1(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b % 2)
res = (res * 1LL * a);
a = (a * 1LL * a);
b /= 2;... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
const int mod = 1e9 + 7;
const int nax = 1e7;
const ll inf = 1e10 + 17;
vector<int> prime(nax, -1);
ll pow1(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b % 2)
res = (res * 1LL * a);
a = (a * 1LL * a);
b /= 2;... | replace | 19 | 20 | 19 | 23 | TLE | |
p02629 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
int64_t P = N / 26;
vector<char> namae(P + 1);
int64_t i = 0;
// cout << N << " " << i << endl ;
while (N != 0) {
N--;
int M = N % 26;
namae.at(i) = 'a' + M;
N /= 26;
i++;
// cout << N << " " << i <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
int P = N / 26;
vector<char> namae(100);
int i = 0;
// cout << N << " " << i << endl ;
while (N != 0) {
N--;
int M = N % 26;
namae.at(i) = 'a' + M;
N /= 26;
i++;
// cout << N << " " << i << endl ;
... | replace | 6 | 9 | 6 | 9 | 0 | |
p02629 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long i64;
i64 N, Len;
string ans;
inline void pre() {
i64 l = 1, Bas = 26, Ans = 26;
while (Ans < N) {
Ans += (Bas *= 26);
l++;
}
ans = string(l, 'a');
N -= Ans - Bas;
Len = l;
}
inline void work() {
pre();
N--;
int Bas = 1, Cur = 0;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long i64;
i64 N, Len;
string ans;
inline void pre() {
i64 l = 1, Bas = 26, Ans = 26;
while (Ans < N) {
Ans += (Bas *= 26);
l++;
}
ans = string(l, 'a');
N -= Ans - Bas;
Len = l;
}
inline void work() {
pre();
N--;
i64 Bas = 1, Cur = 0;
... | replace | 18 | 19 | 18 | 19 | TLE | |
p02629 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
long N;
cin >> N;
N--;
string a_to_z = "abcdefghijklmnopqrstuvwxyz";
string name = "";
int max = 0;
long x = 1;
long M = N;
do {
name = a_to_z.substr(N % 26, 1) + name;
N = (N - 26) / 26;
x *= 26;
max += x;
} w... | #include <iostream>
#include <string>
using namespace std;
int main() {
long N;
cin >> N;
N--;
string a_to_z = "abcdefghijklmnopqrstuvwxyz";
string name = "";
long max = 0;
long x = 1;
long M = N;
do {
name = a_to_z.substr(N % 26, 1) + name;
N = (N - 26) / 26;
x *= 26;
max += x;
} ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02629 | C++ | Runtime Error | #pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#includ... | #pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#includ... | replace | 208 | 209 | 208 | 209 | 0 | |
p02629 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
#define dump(x) cerr << #x << "=" << x << endl
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
vector<char> alpha;
alpha.push_back('z');
for (char i = 'a'; i <= 'z'; i++) {
alpha.push_... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
#define dump(x) cerr << #x << "=" << x << endl
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
vector<char> alpha;
alpha.push_back('z');
for (char i = 'a'; i <= 'z'; i++) {
alpha.push_... | replace | 25 | 26 | 25 | 26 | 0 | |
p02629 | 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 p... | #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 p... | replace | 351 | 361 | 351 | 366 | 0 | |
p02629 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a = 26, k = 1;
long long N;
cin >> N;
while (N > a) {
N -= a;
a *= 26;
k++;
}
N--;
for (int i = 0; i < k; i++) {
a /= 26;
int b = N / a;
cout << (char)('a' + b);
N %= a;
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, a = 26, k = 1;
cin >> N;
while (N > a) {
N -= a;
a *= 26;
k++;
}
N--;
for (int i = 0; i < k; i++) {
a /= 26;
int b = N / a;
cout << (char)('a' + b);
N %= a;
}
cout << endl;
} | replace | 4 | 6 | 4 | 5 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(n) begin(n), end(n)
#define IN(a, x, b)... | replace | 28 | 29 | 28 | 29 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n + 1);
vec[0] = 0;
vector<int> a(n + 1, 0);
int sum = 0;
for (int i = 1; i <= n; i++) {
cin >> vec[i];
a[vec[i]]++;
sum += vec[i];
}
int q;
cin >> q;
for (int i = 1; i <= q; i++) {
vector... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n + 1);
vec[0] = 0;
vector<int> a(100001, 0);
long long sum = 0;
for (int i = 1; i <= n; i++) {
cin >> vec[i];
a[vec[i]]++;
sum += vec[i];
}
int q;
cin >> q;
for (int i = 1; i <= q; i++) {
... | replace | 8 | 10 | 8 | 10 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, 1, -1};
int main() {
int n;
cin >> n;
ll a[10005] = {}, s = 0;
for (int i = 0; i < n; i++) {
ll ai;
cin >> ai;
a[ai]++;
s += ai;
}
int q;
cin >> q;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, 1, -1};
int main() {
int n;
cin >> n;
ll a[100005] = {}, s = 0;
for (int i = 0; i < n; i++) {
ll ai;
cin >> ai;
a[ai]++;
s += ai;
}
int q;
cin >> q;
... | replace | 11 | 12 | 11 | 12 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef... | replace | 67 | 68 | 67 | 68 | 0 | |
p02630 | 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;
using P = pair<int, int>;
const int MX = 10005;
int main() {
int n, q, b, c;
ll ans;
cin >> n;
vector<ll> k(MX);
rep(i, n) {
int a;
cin >> a;
k[a]++;
}
ans = 0;
rep(i, MX) ans... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MX = 100005;
int main() {
int n, q, b, c;
ll ans;
cin >> n;
vector<ll> k(MX);
rep(i, n) {
int a;
cin >> a;
k[a]++;
}
ans = 0;
rep(i, MX) an... | replace | 5 | 6 | 5 | 6 | 0 | |
p02630 | C++ | Runtime Error | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#in... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#in... | replace | 197 | 198 | 197 | 198 | 0 | |
p02630 | 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 ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#defi... | #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 ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#defi... | replace | 24 | 25 | 24 | 25 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
#define N 100010
int has[N];
int long long n;
int main() {
int n, q, b, c;
long long sum, a;
while (scanf("%d", &n) != EOF) {
sum = 0;
for (int i = 0; i <= 100000; i++)
... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
#define N 100010
int has[N];
int long long n;
int main() {
int n, q, a, b, c;
long long sum;
while (scanf("%d", &n) != EOF) {
sum = 0;
for (int i = 0; i <= 100000; i++)
... | replace | 11 | 13 | 11 | 13 | -11 | |
p02630 | C++ | Time Limit Exceeded | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | replace | 35 | 41 | 35 | 50 | TLE | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> P1;
typedef pair<P, P> P2;
#define pu ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> P1;
typedef pair<P, P> P2;
#define pu ... | replace | 40 | 42 | 40 | 42 | 0 | |
p02630 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n + 1, 0);
long long sum = 0;
for (int i = 0; i < n; ++i) {
int t;
cin >> t;
a[t]++;
sum += t;
}
int q;
cin >> q;
while (q--) {
int b, c;
cin >> b >> c;
a[c] += a[... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(100005, 0);
long long sum = 0;
for (int i = 0; i < n; ++i) {
int t;
cin >> t;
a[t]++;
sum += t;
}
int q;
cin >> q;
while (q--) {
int b, c;
cin >> b >> c;
a[c] += a... | replace | 8 | 9 | 8 | 9 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define vi vector<long long>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
usin... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define vi vector<long long>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
usin... | replace | 165 | 166 | 165 | 166 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi = 3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF = 1e18;
int main() {
ull n, sum = 0, q;
cin >> n;
vector<ull> a(100000);
fill(a.begin(), a.end(), 0);
for (int i = 0; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi = 3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF = 1e18;
int main() {
ull n, sum = 0, q;
cin >> n;
vector<ull> a(100001);
fill(a.begin(), a.end(), 0);
for (int i = 0; i < n; i++) ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int seive[10000];
int main() {
int t;
cin >> t;
ll sum = 0;
for (int i = 0; i < t; i++) {
ll k;
cin >> k;
sum += k;
seive[k]++;
}
int k;
cin >> k;
while (k--) {
ll a, b;
cin >> a >> b;
sum += ((ll)seive[a... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll seive[(int)2e5];
int main() {
int t;
cin >> t;
ll sum = 0;
for (int i = 0; i < t; i++) {
ll k;
cin >> k;
sum += k;
seive[k]++;
}
int k;
cin >> k;
while (k--) {
ll a, b;
cin >> a >> b;
sum += ((ll)seive... | replace | 3 | 4 | 3 | 4 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, q;
cin >> n;
ll ans = 0;
vector<ll> cnt(11000, 0);
for (ll i = 0; i < n; i++) {
ll tmp;
cin >> tmp;
ans += tmp;
cnt[tmp]++;
}
cin >> q;
for (ll i = 0; i < q; i++) {
ll x, y;
cin >> x >> y;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, q;
cin >> n;
ll ans = 0;
vector<ll> cnt(110000, 0);
for (ll i = 0; i < n; i++) {
ll tmp;
cin >> tmp;
ans += tmp;
cnt[tmp]++;
}
cin >> q;
for (ll i = 0; i < q; i++) {
ll x, y;
cin >> x >> y;
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> backet(N, 0);
long long sum = 0LL;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
sum += A;
backet.at(A - 1)++;
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int B, C;
cin >> B >> C;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> backet(100000, 0);
long long sum = 0LL;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
sum += A;
backet.at(A - 1)++;
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int B, C;
cin >> B >> C... | replace | 6 | 7 | 6 | 7 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0)
using namespace std;
int main()... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0)
using namespace std;
int main()... | replace | 18 | 19 | 18 | 19 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> mp;
long long sum = 0;
vector<int> a(10001, 0);
for (int i = 0; i < n; i++) {
int b;
cin >> b;
a[b]++;
sum += b;
}
int q;
cin >> q;
vector<long long> ans;
for (int i = 0; i < q; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> mp;
long long sum = 0;
vector<long long> a(100001, 0);
for (int i = 0; i < n; i++) {
int b;
cin >> b;
a[b]++;
sum += b;
}
int q;
cin >> q;
vector<long long> ans;
for (int i = 0; i < q; i++)... | replace | 8 | 9 | 8 | 9 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
i64 table[10001];
int main() {
i64 n, q, sum{};
cin >> n;
for (i64 i = 0; i < n; i++) {
i64 a;
cin >> a;
sum += a;
table[a]++;
}
cin >> q;
i64 ans[q];
for (i64 i = 0; i < q; i++) {
i64 b, c;
cin >> b >> c;
... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
i64 table[100001];
int main() {
i64 n, q, sum{};
cin >> n;
for (i64 i = 0; i < n; i++) {
i64 a;
cin >> a;
sum += a;
table[a]++;
}
cin >> q;
i64 ans[q];
for (i64 i = 0; i < q; i++) {
i64 b, c;
cin >> b >> c;
... | replace | 5 | 6 | 5 | 6 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define all(x) (x).begin(), (x).end()
#define dump(x) cout << #x << " = " << (x) << endl
using namespace std;
using ll = long long;
int main() {
const int MAX = 1000;
vector<int> cnt(MAX, 0);
int n;
cin >> n;
vector<int> a(n);
r... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define all(x) (x).begin(), (x).end()
#define dump(x) cout << #x << " = " << (x) << endl
using namespace std;
using ll = long long;
int main() {
const int MAX = 100100;
vector<int> cnt(MAX, 0);
int n;
cin >> n;
vector<int> a(n);
... | replace | 9 | 10 | 9 | 10 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(10010, 0);
int long long sum = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A[a] += 1;
sum += a;
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int b, c;
cin >> b >> c;
sum +=... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(100010, 0);
int long long sum = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A[a] += 1;
sum += a;
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int b, c;
cin >> b >> c;
sum +... | replace | 6 | 7 | 6 | 7 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 998244353
#define ff first
#define ss second
typedef long long ll;
ll power(ll a, ll b) { // a^b
ll res = 1;
a = a % MOD;
while (b > 0) {
if (b & 1) {
res = (res * a) % MOD;
b--;
}
a = (a * a) % MOD;
b >>= 1;
}
return res;
}... | #include <bits/stdc++.h>
using namespace std;
#define MOD 998244353
#define ff first
#define ss second
typedef long long ll;
ll power(ll a, ll b) { // a^b
ll res = 1;
a = a % MOD;
while (b > 0) {
if (b & 1) {
res = (res * a) % MOD;
b--;
}
a = (a * a) % MOD;
b >>= 1;
}
return res;
}... | replace | 29 | 30 | 29 | 30 | 0 | |
p02630 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(var, start, stop, step) \
for (long long var = start; var < stop; var += step)
#define vi vector<int>
#define vl vector<long long>
#define fio ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(var, start, stop, step) \
for (long long var = start; var < stop; var += step)
#define vi vector<int>
#define vl vector<long long>
#define fio ... | delete | 29 | 30 | 29 | 29 | TLE | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define fi first
#define se second
#de... | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define fi first
#define se second
#de... | replace | 32 | 33 | 32 | 33 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> d(10001);
ll sum = 0;
REP(i, n) {
cin >> a[i];
sum += a[i];
d[a[i]]++;
}
ll q;
cin >> q;
ll b, c;
REP(i, q) {
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> d(100001);
ll sum = 0;
REP(i, n) {
cin >> a[i];
sum += a[i];
d[a[i]]++;
}
ll q;
cin >> q;
ll b, c;
REP(i, q) {... | replace | 11 | 12 | 11 | 12 | 0 | |
p02630 | C++ | Runtime Error | #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;
using ll = long long;
using p = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> A(100000);
ll sum = 0;
rep(i, N) {
int tmp;
cin >> tmp;
A.at(tmp)++;
sum +... | #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;
using ll = long long;
using p = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> A(1000000);
ll sum = 0;
rep(i, N) {
int tmp;
cin >> tmp;
A.at(tmp)++;
sum ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
int main() {
int N, Q, a;
cin >> N;
vector<int> A(N), count(N);
rep(i, N) {
cin >> a;
A[i] = a;
++count[a];
}
cin >> Q;
vector<ll> B(Q), C(Q);
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
int main() {
int N, Q, a;
cin >> N;
vector<int> A(N), count(100001);
rep(i, N) {
cin >> a;
A[i] = a;
++count[a];
}
cin >> Q;
vector<ll> B(Q), C(... | replace | 11 | 12 | 11 | 12 | 0 | |
p02630 | C++ | Runtime Error | #pragma target("avx")
#pragma optimize("O3")
#include <bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll, ll>;
using PP = std::pair<ll, P>;
using V = std::vector<ll>;
template <typename T> using pq = std::priority_queue<T>;
template <typename T>
using rpq = std::priority_queue<T, std::vector<T>, std::great... | #pragma target("avx")
#pragma optimize("O3")
#include <bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll, ll>;
using PP = std::pair<ll, P>;
using V = std::vector<ll>;
template <typename T> using pq = std::priority_queue<T>;
template <typename T>
using rpq = std::priority_queue<T, std::vector<T>, std::great... | replace | 31 | 32 | 31 | 32 | 0 | |
p02630 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long i, j, n, k = 0, x, y, q;
cin >> n;
long long a[n];
unordered_map<long long, long long> mp;
for (i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
k += a[i];
}
cin >> q;
while (q--) {
cin >> x >> y;
if (mp.find(x) != mp... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long i, j, n, k = 0, x, y, q;
cin >> n;
long long a[n];
unordered_map<long long, long long> mp;
for (i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
k += a[i];
}
cin >> q;
while (q--) {
cin >> x >> y;
if (mp.find(x) != mp... | replace | 18 | 20 | 18 | 20 | TLE | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> D(100000);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
D.at(A.at(i))++;
}
long S = 0;
for (int i = 0; i < N; i++) {
S = S + A.at(i);
}
int Q;
cin >> Q;
// int sw=0;
vec... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<int> D(200000);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
D.at(A.at(i))++;
}
long S = 0;
for (int i = 0; i < N; i++) {
S = S + A.at(i);
}
int Q;
cin >> Q;
// int sw=0;
vec... | replace | 8 | 9 | 8 | 9 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 100000000... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 100000000... | replace | 22 | 23 | 22 | 23 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int n;
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int n;
c... | replace | 16 | 17 | 16 | 17 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int Q;
cin >> Q;
vector<int> B(Q), C(Q);
for (int i = 0; i < Q; ++i) {
cin >> B[i]... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int Q;
cin >> Q;
vector<int> B(Q), C(Q);
for (int i = 0; i < Q; ++i) {
cin >> B[i]... | replace | 25 | 26 | 25 | 26 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
ll N, Q, s = 0;
cin >> N;
map<ll, ll> m;
rep(i, N) {
ll t;
cin >> t;
if (m.count(t))
++m.at(t);
else
m[t] = 1;
s += t;
}
cin >> Q;
rep(i, Q) {... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
ll N, Q, s = 0;
cin >> N;
map<ll, ll> m;
rep(i, N) {
ll t;
cin >> t;
if (m.count(t))
++m.at(t);
else
m[t] = 1;
s += t;
}
cin >> Q;
rep(i, Q) {... | replace | 24 | 30 | 24 | 33 | 0 | |
p02630 | C++ | Time Limit Exceeded |
// Problem : D - Replacing
// Contest : AtCoder - AtCoder Beginner Contest 171
// URL : https://atcoder.jp/contests/abc171/tasks/abc171_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
/* ID: vqt
LANG: C++14
PROB: namenum
*/
#pragma GCC target("avx2")... |
// Problem : D - Replacing
// Contest : AtCoder - AtCoder Beginner Contest 171
// URL : https://atcoder.jp/contests/abc171/tasks/abc171_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
/* ID: vqt
LANG: C++14
PROB: namenum
*/
#pragma GCC target("avx2")... | replace | 229 | 230 | 229 | 230 | TLE | |
p02630 | 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;
using P = pair<int, int>;
int main() {
ll n, q, b, c, w, ans = 0;
cin >> n;
vector<int> a(n);
rep(i, n) {
cin >> w;
a[w]++;
ans += w;
}
cin >> q;
rep(i, q) {
cin >> b >> c;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, q, b, c, w, ans = 0;
cin >> n;
vector<int> a(500010);
rep(i, n) {
cin >> w;
a[w]++;
ans += w;
}
cin >> q;
rep(i, q) {
cin >> b >... | replace | 9 | 10 | 9 | 10 | 0 | |
p02630 | C++ | Runtime Error | // abc171_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... | // abc171_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 | |
p02630 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
const int MOD = 1e9 + 7;
typedef long long lint;
typedef pair<int, int> P;
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define rep(i, n) for (lint i = 0; i < (n); i++)
#define INF LLONG_MAX
#define all(x) (x).begin(), (x).end()
#define pb push_back
int main()... | #include "bits/stdc++.h"
using namespace std;
const int MOD = 1e9 + 7;
typedef long long lint;
typedef pair<int, int> P;
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define rep(i, n) for (lint i = 0; i < (n); i++)
#define INF LLONG_MAX
#define all(x) (x).begin(), (x).end()
#define pb push_back
int main()... | replace | 15 | 16 | 15 | 16 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> cou(n, 0);
ll sum = 0;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> cou(100001, 0);
ll sum = 0;
for (int i = 0; i < n; ++i) {
int a;
cin >>... | replace | 15 | 16 | 15 | 16 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using PP = pair<int, pair<int, int>>;
using T = tuple<string, int, int>;
const string EMP = " ";
const ll INF = 1LL << 60;
const ll MOD = 10000000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using PP = pair<int, pair<int, int>>;
using T = tuple<string, int, int>;
const string EMP = " ";
const ll INF = 1LL << 60;
const ll MOD = 10000000... | replace | 15 | 16 | 15 | 16 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0... | replace | 28 | 29 | 28 | 29 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
map<long long, long long> h;
long long N;
cin >> N;
long long sum = 0;
for (int i = 0; i < N; i++) {
long long a;
cin >> a;
sum += a;
h[a]++;
}
int Q;
cin >> Q;
long long BC[N][2];
for (int i = 0; i < Q; i++) {
cin >> B... | #include <bits/stdc++.h>
using namespace std;
int main() {
map<long long, long long> h;
long long N;
cin >> N;
long long sum = 0;
for (int i = 0; i < N; i++) {
long long a;
cin >> a;
sum += a;
h[a]++;
}
int Q;
cin >> Q;
long long BC[Q][2];
for (int i = 0; i < Q; i++) {
cin >> BC... | replace | 16 | 18 | 16 | 17 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
long long int a[10005] = {};
long long int n;
cin >> n;
long long int temp;
long long int ans = 0;
for (int i = 0; i < n; i++) {
cin >> temp;
a[temp]++;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
long long int a[100005] = {};
long long int n;
cin >> n;
long long int temp;
long long int ans = 0;
for (int i = 0; i < n; i++) {
cin >> temp;
a[temp]++;
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
#define pi 3.1415926535
int main() {
int n;
cin >> n;
vector<int> a(10001, 0);
int tmp;
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> tmp;
a[tmp]++;
sum += tmp;
}
int q;
cin >> q;
vector<ll>... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
#define pi 3.1415926535
int main() {
int n;
cin >> n;
vector<int> a(100001, 0);
int tmp;
ll sum = 0;
for (int i = 0; i < n; i++) {
cin >> tmp;
a[tmp]++;
sum += tmp;
}
int q;
cin >> q;
vector<ll... | replace | 11 | 12 | 11 | 12 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define all(A) A.begin(), A.end()
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> buc(10101);
ll ans = 0;
rep(i, n) {
ll x;
cin >> x;
buc[x... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define all(A) A.begin(), A.end()
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> buc(101010);
ll ans = 0;
rep(i, n) {
ll x;
cin >> x;
buc[... | replace | 10 | 11 | 10 | 11 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> num(n + 1);
long long int sum = 0;
for (int i = 0; i < n; i++) {
int a;
std::cin >> a;
sum += a;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> num(100000);
long long int sum = 0;
for (int i = 0; i < n; i++) {
int a;
std::cin >> a;
sum += a;
... | replace | 12 | 13 | 12 | 13 | 0 | |
p02630 | C++ | Time Limit Exceeded | #include <iostream>
#include <unordered_map>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
unordered_map<ll, ll> mp;
ll ans = 0;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
mp[A]++;
ans += A;
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int B, C;
... | #include <iostream>
#include <unordered_map>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
unordered_map<ll, ll> mp;
ll ans = 0;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
mp[A]++;
ans += A;
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int B, C;
... | replace | 22 | 27 | 22 | 23 | TLE | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#define Maxn 5001
#define ll long long
using namespace std;
ll sum;
int num[Maxn];
int a[Maxn];
int mai... | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#define Maxn 100005
#define ll long long
using namespace std;
ll sum;
int num[Maxn];
int a[Maxn];
int m... | replace | 11 | 12 | 11 | 12 | 0 | |
p02630 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define speedX \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define speedX \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | replace | 96 | 97 | 96 | 97 | TLE | |
p02630 | C++ | Runtime Error | /**
* Bismillahir Rahmanir Rahim.
* Imtiaz_rafi
* PCIU, CHITTAGONG
**/
#include <bits/stdc++.h>
using namespace std;
#define speed \
ios::sync_with_stdio(0); \
cin.tie(0);
#define filein fr... | /**
* Bismillahir Rahmanir Rahim.
* Imtiaz_rafi
* PCIU, CHITTAGONG
**/
#include <bits/stdc++.h>
using namespace std;
#define speed \
ios::sync_with_stdio(0); \
cin.tie(0);
#define filein fr... | replace | 43 | 44 | 43 | 44 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), memo(100000);
int64_t ans = 0;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
memo.at(A.at(i))++;
ans += A.at(i);
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int64_t B, C;
cin >> B >>... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), memo(100001);
int64_t ans = 0;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
memo.at(A.at(i))++;
ans += A.at(i);
}
int Q;
cin >> Q;
for (int i = 0; i < Q; i++) {
int64_t B, C;
cin >> B >>... | replace | 6 | 7 | 6 | 7 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int n;
cin >> n;
ll tot = 0;
vector<ll> cnt(n);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
cnt[a]++;
tot += a;
}
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int b, c;
cin >> b >> c;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void) {
int n;
cin >> n;
ll tot = 0;
vector<ll> cnt(100005);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
cnt[a]++;
tot += a;
}
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int b, c;
cin >> b >> ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); (i) < (n); i++)
#define repe(i, f, n) for (ll i = (f); (i) <= (n); i++)
using namespace std;
using ll = long long;
ll INF = 1LL << 60;
using G = vector<map<int, int>>;
int main() {
int N;
cin >> N;
vector<ll> num(10);
ll acum = 0;
rep(i, 0, N) {... | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); (i) < (n); i++)
#define repe(i, f, n) for (ll i = (f); (i) <= (n); i++)
using namespace std;
using ll = long long;
ll INF = 1LL << 60;
using G = vector<map<int, int>>;
int main() {
int N;
cin >> N;
vector<ll> num(100001);
ll acum = 0;
rep(i, 0, ... | replace | 12 | 13 | 12 | 13 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
int a;
vector<int> t(n, 0);
ll s = 0;
rep(i, n) {
cin >> a;
t[a]++;
s += a;
}
int q;
cin >> q;
int b, c;
rep(i, q) {
cin >> b >> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
int a;
int t[100010];
rep(i, 100010) { t[i] = 0; }
ll s = 0;
rep(i, n) {
cin >> a;
t[a]++;
s += a;
}
int q;
cin >> q;
int b, c;
rep... | replace | 9 | 10 | 9 | 11 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
vector<int> num(10001, 0);
vector<long long> ans;
int n, k, q, b, c;
long long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> k;
num[k]++;
sum += k;
}
cin >> q;
for (i... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
vector<int> num(100001, 0);
vector<long long> ans;
int n, k, q, b, c;
long long sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> k;
num[k]++;
sum += k;
}
cin >> q;
for (... | replace | 8 | 9 | 8 | 9 | 0 | |
p02630 | C++ | Runtime Error | // By Zank100
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define mod 1000000007
#define din(t) \
long long t; \
cin >> t;
#define in(... | // By Zank100
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define mod 1000000007
#define din(t) \
long long t; \
cin >> t;
#define in(... | replace | 45 | 46 | 45 | 46 | 0 | |
p02630 | C++ | Runtime Error | #include <iostream>
#include <memory.h>
using namespace std;
int a[10001];
int main() {
memset(a, 0, sizeof(a));
int n;
cin >> n;
long long int count = 0;
for (int i = 0; i < n; i++) {
int b;
cin >> b;
count += b;
a[b]++;
}
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int m, n;
... | #include <iostream>
#include <memory.h>
using namespace std;
int a[1000001];
int main() {
memset(a, 0, sizeof(a));
int n;
cin >> n;
long long int count = 0;
for (int i = 0; i < n; i++) {
int b;
cin >> b;
count += b;
a[b]++;
}
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int m, n;... | replace | 3 | 4 | 3 | 4 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> a(n, 0);
for (ll i = 0; i < n; i++)
cin >> a[i];
ll sum = 0;
sum = accumulate(a.begin(), a.end(), 0LL);
ll q;
cin >> q;
vector<ll> b(n, 0), c(n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> a(n, 0);
for (ll i = 0; i < n; i++)
cin >> a[i];
ll sum = 0;
sum = accumulate(a.begin(), a.end(), 0LL);
ll q;
cin >> q;
vector<ll> b(q, 0), c(q... | replace | 17 | 18 | 17 | 18 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, n) for (int i = 1; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define Sort(x) sort((x).begin(), (x).end())
#define Sort2(x) sort((x).begin(), (x).end(), greater<int>())
#define pb push_back
using namespace std;
using ll =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, n) for (int i = 1; i <= (n); ++i)
#define all(x) (x).begin(), (x).end()
#define Sort(x) sort((x).begin(), (x).end())
#define Sort2(x) sort((x).begin(), (x).end(), greater<int>())
#define pb push_back
using namespace std;
using ll =... | replace | 21 | 22 | 21 | 22 | 0 | |
p02630 | 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;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> num(100005);
ll sum = 0;
rep(i, n) {
cin >> a[i];
sum += a[i];
num[a[i]]++;
}
int q;
ci... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> num(100005);
ll sum = 0;
rep(i, n) {
cin >> a[i];
sum += a[i];
num[a[i]]++;
}
int q;
ci... | replace | 19 | 20 | 19 | 20 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<boo... | #include <bits/stdc++.h>
#include <cmath>
#include <math.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<boo... | replace | 135 | 136 | 135 | 136 | 0 | |
p02630 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
using ll = long long;
int main() {
int N;
scanf("%d", &N);
static ll dat[100001];
ll ans = 0;
for (int i = 0; i < N; i++) {
int A;
scanf("%lld", &A);
dat[A]++;
ans += A;
}
int Q;
scanf("%d", &Q);
for (int q = 0; q < Q; q++) {
int B, C;
... | #include <stdio.h>
#include <string.h>
using ll = long long;
int main() {
int N;
scanf("%d", &N);
static ll dat[100001];
ll ans = 0;
for (int i = 0; i < N; i++) {
ll A;
scanf("%lld", &A);
dat[A]++;
ans += A;
}
int Q;
scanf("%d", &Q);
for (int q = 0; q < Q; q++) {
int B, C;
s... | replace | 11 | 12 | 11 | 12 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, Q, B, C, T;
long long Sum = 0;
cin >> N;
vector<int> A(100000, 0);
rep(i, N) {
cin >> T;
A.at(T)++;
Sum += T;
}
cin >> Q;
rep(i, Q) {
cin >> B >> C;
Sum += A.at(B) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, Q, B, C, T;
long long Sum = 0;
cin >> N;
vector<int> A(100001, 0);
rep(i, N) {
cin >> T;
A.at(T)++;
Sum += T;
}
cin >> Q;
rep(i, Q) {
cin >> B >> C;
Sum += A.at(B) ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02630 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
long long n;
cin >> n;
vector<int> count(10001, 0);
vector<int> v(n);
long long sum = 0;
for (auto i : v) {
cin >> i;
sum += i;
count[i]++;
}
int q;
cin >> q;
for (int i = 0; i < q; i++) {... | #include <algorithm>
#include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
long long n;
cin >> n;
vector<int> count(100001, 0);
vector<int> v(n);
long long sum = 0;
for (auto i : v) {
cin >> i;
sum += i;
count[i]++;
}
int q;
cin >> q;
for (int i = 0; i < q; i++) ... | replace | 9 | 10 | 9 | 10 | 0 | |
p02630 | C++ | Runtime Error | #include <bits/stdc++.h>
#define drep(i, cc, n) for (int i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define drrep(i, cc, n) for (int i = (cc); i >= (n); --i)
#define rrep(i, n) drrep(i, 0, n - 1)
#define sz(s) (int)(s.size())
#define vecprint(v) ... | #include <bits/stdc++.h>
#define drep(i, cc, n) for (int i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define drrep(i, cc, n) for (int i = (cc); i >= (n); --i)
#define rrep(i, n) drrep(i, 0, n - 1)
#define sz(s) (int)(s.size())
#define vecprint(v) ... | replace | 39 | 40 | 39 | 40 | 0 | |
p02630 | C++ | Time Limit Exceeded | /*
------------------------------------------CAUTIOUS WARNING
------------------------------------------ This is a personalised Template for
Nitin under MIT Licence Act 1840 : Do not use it for own use. */
// AUTHOR Nitin
// TASK : Practice
//--------------------------------HEADERS------------------------------------... | /*
------------------------------------------CAUTIOUS WARNING
------------------------------------------ This is a personalised Template for
Nitin under MIT Licence Act 1840 : Do not use it for own use. */
// AUTHOR Nitin
// TASK : Practice
//--------------------------------HEADERS------------------------------------... | replace | 350 | 364 | 350 | 368 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.