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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02847 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const string S[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
int main() {
string s;
cin >> s;
int res = 0;
for (int i = 1; i <= 7; i++)
if (s == S[i])
res = i;
cout << 7 - res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const string S[] = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
int main() {
string s;
cin >> s;
int res = 0;
for (int i = 0; i < 7; i++)
if (s == S[i])
res = i;
cout << 7 - res << endl;
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02847 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// ----------------------R00TDADA------------------------------
#define rep(i, a, b) for (__typeof((b)) i = (a); i < (b); i++)
#define nrep(i, a, b) for (__typeof((b)) i = (a); i > (b); i--)
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pp... | #include <bits/stdc++.h>
using namespace std;
// ----------------------R00TDADA------------------------------
#define rep(i, a, b) for (__typeof((b)) i = (a); i < (b); i++)
#define nrep(i, a, b) for (__typeof((b)) i = (a); i > (b); i--)
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pp... | replace | 21 | 27 | 21 | 22 | 0 | |
p02847 | Python | Runtime Error | W = ["SUM", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
S = input()
print(len(W) - W.index(S))
| W = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
S = input()
print(len(W) - W.index(S))
| replace | 0 | 1 | 0 | 1 | 0 | |
p02847 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF (ll)2e9
#define MOD ((ll)1e9 + 7)
#define ALL(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF (ll)2e9
#define MOD ((ll)1e9 + 7)
#define ALL(... | replace | 178 | 179 | 178 | 179 | 0 | |
p02847 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define debug(x) cerr << #x " = " << (x) << endl;
#define P(x) cerr << #x << endl;
#define int long long
typedef pair<int, int> pii;
const int mod = 1000000007;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setpr... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define debug(x) cerr << #x " = " << (x) << endl;
#define P(x) cerr << #x << endl;
#define int long long
typedef pair<int, int> pii;
const int mod = 1000000007;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setpr... | replace | 14 | 16 | 14 | 16 | 0 | |
p02847 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
vector<string> s = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
string today;
cin >> today;
rep(i, 8) if (today == s[i]) cout << 7 - i << endl;
return ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
vector<string> s = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
string today;
cin >> today;
rep(i, 7) if (today == s[i]) cout << 7 - i << endl;
return ... | replace | 10 | 11 | 10 | 11 | 0 | |
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int i, j, k, n, m, l, count1 = 0;
void ABC140(void);
void ABC141(void);
void ABC142(void);
void ABC143(void);
void ABC144(void);
void ABC145(void);
void ABC146(void);
void ABC147(void);
void ABC148(void);
void ABC149(void);
int main(void) { ABC146(); }
v... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int i, j, k, n, m, l, count1 = 0;
void ABC140(void);
void ABC141(void);
void ABC142(void);
void ABC143(void);
void ABC144(void);
void ABC145(void);
void ABC146(void);
void ABC147(void);
void ABC148(void);
void ABC149(void);
int main(void) { ABC146(); }
v... | replace | 21 | 22 | 21 | 27 | 0 | |
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 1e9 + 7
#define PI 3.141592653589793238
#define pb push_back
#define ALL(V) (V).begin(), (V).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long long int lint;
typedef vector<ll> VL;
typed... | #include <bits/stdc++.h>
#define MOD 1e9 + 7
#define PI 3.141592653589793238
#define pb push_back
#define ALL(V) (V).begin(), (V).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long long int lint;
typedef vector<ll> VL;
typed... | replace | 31 | 32 | 31 | 32 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 0) >= this->size() (which is 0)
|
p02848 | C++ | Runtime Error | #include <iostream>
#include <string.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
i... | #include <iostream>
#include <string.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
i... | replace | 27 | 28 | 27 | 28 | 0 | |
p02848 | C++ | Runtime Error | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int N, i, len;
char S[100];
cin >> N;
cin >> S;
len = strlen(S);
for (i = 0; i < len; i++) {
S[i] += N;
if (S[i] > 'Z')
S[i] -= 26;
}
cout << S << endl;
return 0;
}
| #include <iostream>
#include <string.h>
using namespace std;
int main() {
int N, i, len;
char S[10000];
cin >> N;
cin >> S;
len = strlen(S);
for (i = 0; i < len; i++) {
S[i] += N;
if (S[i] > 'Z')
S[i] -= 26;
}
cout << S << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02848 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define se second
#define mp make_pair
#define fi first
#define del(a, vec) \
vec.erase(std::remove(vec.begin(), vec.end(), a), vec.end());
#define search(f, l, v) binary_search(f, l, v)
#defi... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define se second
#define mp make_pair
#define fi first
#define del(a, vec) \
vec.erase(std::remove(vec.begin(), vec.end(), a), vec.end());
#define search(f, l, v) binary_search(f, l, v)
#defi... | replace | 66 | 68 | 66 | 68 | TLE | |
p02848 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
int main() {
int n;
char s[1000];
scanf("%d\n %s", &n, s);
int len = strlen(s);
for (int i = 0; len > i; i++) {
int x = s[i] - 'A';
x = (x + n) % 26;
putchar('A' + x);
}
putchar('\n');
} | #include <stdio.h>
#include <string.h>
int main() {
int n;
char s[10000];
scanf("%d\n %s", &n, s);
int len = strlen(s);
for (int i = 0; len > i; i++) {
int x = s[i] - 'A';
x = (x + n) % 26;
putchar('A' + x);
}
putchar('\n');
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pair<ll, ll>> vpl;
typedef vector<vl> vvl;
typedef vector<vs> vvs;
#define f(i, start, end) for (i = start; i < end; i++)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pair<ll, ll>> vpl;
typedef vector<vl> vvl;
typedef vector<vs> vvs;
#define f(i, start, end) for (i = start; i < end; i++)... | replace | 19 | 23 | 19 | 20 | 0 | |
p02848 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int main() {
int a;
char b[1000];
scanf("%d", &a);
scanf("%s", b);
int lena = strlen(b);
for (int i = 0; i < lena; i++) {
int e = (int)(b[i]);
// printf("%d",e);
if ((e + a) > 90)
printf("%c", e + a - 90 + 64);
... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int main() {
int a;
char b[10000000];
scanf("%d", &a);
scanf("%s", b);
int lena = strlen(b);
for (int i = 0; i < lena; i++) {
int e = (int)(b[i]);
// printf("%d",e);
if ((e + a) > 90)
printf("%c", e + a - 90 + 6... | replace | 6 | 7 | 6 | 7 | 0 | |
p02848 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#include <vector>
#de... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#include <vector>
#de... | replace | 72 | 74 | 72 | 74 | 0 | |
p02848 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int mojisu(char s[]) {
int i = 0;
while (s[i]) {
i++;
}
return i;
}
int main() {
char s[26];
int n;
cin >> n;
cin >> s;
f... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int mojisu(char s[]) {
int i = 0;
while (s[i]) {
i++;
}
return i;
}
int main() {
char s[10000];
int n;
cin >> n;
cin >> s;
... | replace | 19 | 20 | 19 | 20 | 0 | |
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
char S[1000];
int N, dem;
scanf("%d%s", &N, &S);
dem = strlen(S);
for (int i = 0; i < dem; i++) {
if ((int)S[i] + N > 90)
printf("%c", S[i] + N - 26);
else
printf("%c", S[i] + N);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
char S[10001];
int N, dem;
scanf("%d%s", &N, &S);
dem = strlen(S);
for (int i = 0; i < dem; i++) {
if ((int)S[i] + N > 90)
printf("%c", S[i] + N - 26);
else
printf("%c", S[i] + N);
}
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
for (int j = 0; j < 26; j++) {
if (alphabet.at(i) == S.at(j)) {
cout << alphabet.at((j + N) % 26);
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
for (int j = 0; j < 26; j++) {
if (alphabet.at(j) == S.at(i)) {
cout << alphabet.at((j + N) % 26);
}
... | replace | 12 | 13 | 12 | 13 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 6) >= this->size() (which is 6)
|
p02848 | C++ | Runtime Error | #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
char str[1002];
scanf("%s", str);
for (int i = 0; str[i] != '\0'; i++) {
int temp = n;
if (str[i] + n > 'Z') {
temp = temp - ('Z' - str[i]);
str[i] = 'A' + (temp - 1);
} else {
str[i] = str[i] + n;
}
}
printf("%s", ... | #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
char str[10002];
scanf("%s", str);
for (int i = 0; str[i] != '\0'; i++) {
int temp = n;
if (str[i] + n > 'Z') {
temp = temp - ('Z' - str[i]);
str[i] = 'A' + (temp - 1);
} else {
str[i] = str[i] + n;
}
}
printf("%s",... | replace | 5 | 6 | 5 | 6 | 0 | |
p02848 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
int main() {
int n;
char str[1005];
scanf("%d", &n);
scanf("%s", str);
int len = strlen(str);
for (int i = 0; i < len; i++) {
if (str[i] + n > 'Z') {
str[i] -= 26 - n;
} else {
str[i] += n;
}
}
printf("%s", str);
return 0;
} | #include <stdio.h>
#include <string.h>
int main() {
int n;
char str[100005];
scanf("%d", &n);
scanf("%s", str);
int len = strlen(str);
for (int i = 0; i < len; i++) {
if (str[i] + n > 'Z') {
str[i] -= 26 - n;
} else {
str[i] += n;
}
}
printf("%s", str);
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02848 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define per(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define pb push_back
#define bg begin()
#define en end()
#define DEBUG_INT(var) printf("the value of " #var " is %d... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define per(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define pb push_back
#define bg begin()
#define en end()
#define DEBUG_INT(var) printf("the value of " #var " is %d... | replace | 36 | 37 | 36 | 37 | 0 | |
p02848 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string a;
for (int i = 0; i < 10000; i++) {
cin >> a[i];
a[i] = a[i] + n;
if (a[i] > 90)
a[i] -= 26;
cout << a[i];
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
string a;
cin >> a;
for (int i = 0; i < a.size(); i++) {
a[i] = a[i] + n;
if (a[i] > 90)
a[i] -= 26;
cout << a[i];
}
return 0;
} | replace | 6 | 8 | 6 | 9 | -11 | |
p02848 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int n;
string s;
int c(char ch, int a) {
if (a == 1) {
if (ch == 'Z')
return 'A';
return ch + 1;
}
return c(c(ch, 1), a - 1);
}
int main() {
cin >> n >> s;
for (int i = 0; i < s.size(); ++i) {
s[i] = c(s[i], n);
cout << s[i];
... | #include <iostream>
#include <string>
using namespace std;
int n;
string s;
int c(char ch, int a) {
if (a == 1) {
if (ch == 'Z')
return 'A';
return ch + 1;
}
if (a == 0)
return ch;
return c(c(ch, 1), a - 1);
}
int main() {
cin >> n >> s;
for (int i = 0; i < s.size(); ++i) {
s[i] = c(... | insert | 12 | 12 | 12 | 14 | TLE | |
p02848 | C++ | Runtime Error | #include <stdio.h>
int main() {
char s[50];
int n, c = 0, m;
scanf("%d", &n);
scanf("%s", s);
while (1) {
if (s[c] == '\0') {
break;
}
c++;
}
for (int i = 0; i < c; i++) {
m = (int)(s[i] + n);
if (m <= 90) {
printf("%c", s[i] + n);
} else {
printf("%c", 64 + (m -... | #include <stdio.h>
int main() {
char s[100000];
int n, c = 0, m;
scanf("%d", &n);
scanf("%s", s);
while (1) {
if (s[c] == '\0') {
break;
}
c++;
}
for (int i = 0; i < c; i++) {
m = (int)(s[i] + n);
if (m <= 90) {
printf("%c", s[i] + n);
} else {
printf("%c", 64 + ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
char c[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ", s[1024];
int main() {
int i, n;
scanf("%d", &n);
scanf("%s", s);
for (i = 0; i < strlen(s); i++) {
printf("%c", c[(s[i] - 'A' + n) % 26]);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
char c[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ", s[10010];
int main() {
int i, n;
scanf("%d", &n);
scanf("%s", s);
for (i = 0; i < strlen(s); i++) {
printf("%c", c[(s[i] - 'A' + n) % 26]);
}
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02848 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
s.at(i) += n;
if (s.at(i) > 90) {
s.at(i) = s.at(i % 90 + 65);
}
}
cout << s << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
s.at(i) += n;
if (s.at(i) > 90) {
s.at(i) = (char)s.at(i) % 90 + 64;
}
}
cout << s << endl;
return 0;
} | replace | 11 | 12 | 11 | 12 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 69) >= this->size() (which is 6)
|
p02848 | Python | Runtime Error | N = int(input())
S = input()
ans = ""
a = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
for i in range(len(S)):
if a.index(S[i]) + N > 26:
ans += a[a.index(S[i]) + N - 26]
else:
ans += a[a.index(S[i]) + N]
print(ans)
| N = int(input())
S = input()
ans = ""
a = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
for i in range(len(S)):
if a.index(S[i]) + N > 25:
ans += a[a.index(S[i]) + N - 26]
else:
ans += a[a.index(S[i]) + N]
print(ans)
| replace | 6 | 7 | 6 | 7 | IndexError: string index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02848/Python/s484935538.py", line 10, in <module>
ans += a[a.index(S[i]) + N]
IndexError: string index out of range
|
p02848 | Python | Runtime Error | def solve(n: int, s: str) -> str:
def inc(c: str, n: int) -> str:
tbl = {
0: "A",
1: "B",
2: "C",
3: "D",
4: "E",
5: "F",
6: "G",
7: "H",
8: "I",
9: "J",
10: "K",
1... | def solve(n: int, s: str) -> str:
def inc(c: str, n: int) -> str:
tbl = {
0: "A",
1: "B",
2: "C",
3: "D",
4: "E",
5: "F",
6: "G",
7: "H",
8: "I",
9: "J",
10: "K",
1... | replace | 25 | 29 | 25 | 29 | 0 | |
p02848 | Python | Runtime Error | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from EmurateInput import input
N, S = int(input()), input()
def rot_encode(n):
from string import ascii_lowercase as lc, ascii_uppercase as uc
lookup = str.maketrans(lc + uc, lc[n:] + lc[:n] + uc[n:] + uc[:n])
return lambda s: s.translate(lookup)
print(r... | N, S = int(input()), input()
def rot_encode(n):
from string import ascii_lowercase as lc, ascii_uppercase as uc
lookup = str.maketrans(lc + uc, lc[n:] + lc[:n] + uc[n:] + uc[:n])
return lambda s: s.translate(lookup)
print(rot_encode(N)(S))
| delete | 0 | 5 | 0 | 0 | ModuleNotFoundError: No module named 'EmurateInput' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02848/Python/s073748704.py", line 4, in <module>
from EmurateInput import input
ModuleNotFoundError: No module named 'EmurateInput'
|
p02848 | Python | Runtime Error | def main(n: int, s: str):
ans = ""
for _s in s:
ans += ascii[(ascii.index(_s) + n) % 26]
print(ans)
if __name__ == "__main__":
n = int(input())
s = input()
main(n, s)
| from string import ascii_uppercase as ascii
def main(n: int, s: str):
ans = ""
for _s in s:
ans += ascii[(ascii.index(_s) + n) % 26]
print(ans)
if __name__ == "__main__":
n = int(input())
s = input()
main(n, s)
| insert | 0 | 0 | 0 | 3 | AttributeError: 'builtin_function_or_method' object has no attribute 'index' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02848/Python/s884988719.py", line 13, in <module>
main(n, s)
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02848/Python/s884988719.py", line 4, in main
ans += ascii[(ascii.index(_s)... |
p02848 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
using namespace std;
int main() {
int n, l;
char a[26], s[1010];
scanf("%d", &n);
scanf("%s", s);
l = strlen(s);
for (int i = 0; i < 26; i++) {
a[i] = 'A' + (i + n) % 26;
}
for (int i = 0; i < l; i++) {
printf("%c", a[s[i] - 'A']);
}
printf("\n");
} | #include <cstdio>
#include <cstring>
using namespace std;
int main() {
int n, l;
char a[26], s[10010];
scanf("%d", &n);
scanf("%s", s);
l = strlen(s);
for (int i = 0; i < 26; i++) {
a[i] = 'A' + (i + n) % 26;
}
for (int i = 0; i < l; i++) {
printf("%c", a[s[i] - 'A']);
}
printf("\n");
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02848 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
int main() {
int n, a, i, x = 0;
char s[26];
scanf("%d %s", &n, s);
a = strlen(s);
for (i = 0; i < a; i++) {
x = s[i] - 'A';
x = (x + n) % 26;
printf("%c", x + 'A');
}
printf("\n");
return 0;
}
| #include <stdio.h>
#include <string.h>
int main() {
int n, a, i, x = 0;
char s[10000];
scanf("%d %s", &n, s);
a = strlen(s);
for (i = 0; i < a; i++) {
x = s[i] - 'A';
x = (x + n) % 26;
printf("%c", x + 'A');
}
printf("\n");
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02848 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#in... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#in... | replace | 46 | 47 | 46 | 47 | 0 | |
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<P>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<P>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template ... | replace | 32 | 33 | 32 | 33 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string MOMI = "ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ";
int N;
cin >> N;
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
for (int j = 0; j < 27; j++) {
if (S.at(i) == MOMI.at(j)) {
S.at(i) = MOMI.at(j + N);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string MOMI = "ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ";
int N;
cin >> N;
string S;
cin >> S;
for (int i = 0; i < S.size(); i++) {
for (int j = 0; j < 27; j++) {
if (S.at(i) == MOMI.at(j)) {
S.at(i) = MOMI.at(j + N);
... | insert | 13 | 13 | 13 | 14 | 0 | |
p02848 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
char s[100001];
cin >> n >> s;
int q = strlen(s);
for (int i = 0; i < n; i++) {
for (int j = 0; j < q; i++) {
if (s[j] == 'Z') {
s[j] = 'A';
} else {
s[j]++;
}
}
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
char s[100001];
cin >> n >> s;
int q = strlen(s);
for (int i = 0; i < n; i++) {
for (int j = 0; j < q; j++) {
if (s[j] == 'Z') {
s[j] = 'A';
} else {
s[j]++;
}
}
}
cout << s << endl;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i = 0;
char s[100];
string rot;
rot = "ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ";
cin >> n >> s;
while (s[i] != '\0') {
s[i] = rot[s[i] - 'A' + n];
i++;
}
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i = 0;
char s[100000];
string rot;
rot = "ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ";
cin >> n >> s;
while (s[i] != '\0') {
s[i] = rot[s[i] - 'A' + n];
i++;
}
cout << s << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02848 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
#include <string.h>
#include <vector>
typedef long long ll;
using namespace std;
char S[10];
int main() {
int c;
scanf("%d%s", &c, S);
int len = strlen(S);
for (int i = 0; i < len; i++) {
int x = (S[i] - 'A' + c) % 26;
S[i] = x + 'A';
}
printf("%s", S);
ret... | #include <algorithm>
#include <stdio.h>
#include <string.h>
#include <vector>
typedef long long ll;
using namespace std;
char S[10010];
int main() {
int c;
scanf("%d%s", &c, S);
int len = strlen(S);
for (int i = 0; i < len; i++) {
int x = (S[i] - 'A' + c) % 26;
S[i] = x + 'A';
}
printf("%s", S);
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define MOD 1000000007
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
string s;
cin >> s;
for (int i = 0; i... | #include <bits/stdc++.h>
#define int long long
#define MOD 1000000007
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
s[i] = (s[i] - 65 + n) % 26 + 65;
}
cout << s;
} | delete | 7 | 11 | 7 | 7 | 0 | |
p02848 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
int main() {
char s[101];
int N, i, j;
scanf("%d", &N);
scanf("%s", s);
j = strlen(s);
for (i = 0; i < j; i++) {
if (s[i] + N > 'Z')
s[i] = s[i] + N - 26;
else
s[i] = s[i] + N;
}
printf("%s", s);
return 0;
}
| #include <stdio.h>
#include <string.h>
int main() {
char s[15000];
int N, i, j;
scanf("%d", &N);
scanf("%s", s);
j = strlen(s);
for (i = 0; i < j; i++) {
if (s[i] + N > 'Z')
s[i] = s[i] + N - 26;
else
s[i] = s[i] + N;
}
printf("%s", s);
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02848 | 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;
string s;
rep(i, n) s[i] = s[i] + '0' + n;
cout << s << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main() {
int n;
cin >> n;
string s;
cin >> s;
rep(i, s.size()) { s[i] = (s[i] + 'A' + n) % 26 + 'A'; }
cout << s << endl;
return 0;
}
| replace | 10 | 12 | 10 | 12 | 0 | |
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
int key = 0;
int t = 0;
cin >> N >> S;
string base;
base = "ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ";
for (int i = 0; i < 26; i++) {
if (S.at(t) == base.at(i)) {
key = i;
t++;
cout << base.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
int key = 0;
int t = 0;
cin >> N >> S;
string base;
base = "ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ";
for (int t = 0; t < S.size(); t++) {
for (int i = 0; i < 26; i++) {
if (S.at(t) == base.at(i)) {
... | replace | 13 | 20 | 13 | 19 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 6) >= this->size() (which is 6)
|
p02848 | C++ | Runtime Error | #include <algorithm>
#include <stack>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
char a[1000];
scanf("%s", a);
int m;
m = strlen(a);
for (int i = 0; i < m; i++) {
if (a[i] + n <= 'Z')
printf("%c", a[i] + n);
else
printf("%c", a[i] +... | #include <algorithm>
#include <stack>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
char a[100000];
scanf("%s", a);
int m;
m = strlen(a);
for (int i = 0; i < m; i++) {
if (a[i] + n <= 'Z')
printf("%c", a[i] + n);
else
printf("%c", a[i]... | replace | 8 | 9 | 8 | 9 | 0 | |
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
char a[30];
int n, lenc;
char c[1004];
int main() {
for (int i = 0; i < 26; i++) {
a[i] = i + 65;
}
cin >> n;
cin >> c;
lenc = strlen(c);
for (int i = 0; i < lenc; i++) {
cout << a[(c[i] - 65 + n) % 26];
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
char a[30];
int n, lenc;
char c[10004];
int main() {
for (int i = 0; i < 26; i++) {
a[i] = i + 65;
}
cin >> n;
cin >> c;
lenc = strlen(c);
for (int i = 0; i < lenc; i++) {
cout << a[(c[i] - 65 + n) % 26];
}
cout << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02848 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n); i++)
#define dunk(n) cout << n << endl
#define all(a) (a).begin(), (a).end()
typedef pair<int, int> P;
typedef long long ll;
int main() {
int n;
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n); i++)
#define dunk(n) cout << n << endl
#define all(a) (a).begin(), (a).end()
typedef pair<int, int> P;
typedef long long ll;
int main() {
int n;
... | replace | 15 | 16 | 15 | 16 | 0 | |
p02848 | C++ | Runtime Error | /*
Author: Satya R Samal, NIT Sringar
"Everything in this world is magic, except to the magician"
*/
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define faster ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
using namespace std;
int mai... | /*
Author: Satya R Samal, NIT Sringar
"Everything in this world is magic, except to the magician"
*/
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define faster ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
using namespace std;
int mai... | delete | 13 | 18 | 13 | 13 | 0 | |
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
for (int i = 0; i < N; i++) {
S.at(i) = char((S.at(i) - 65 + N) % 26 + 65);
}
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
for (int i = 0; i < S.size(); i++) {
S.at(i) = char((S.at(i) - 65 + N) % 26 + 65);
}
cout << S << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
// 整数の入力
int n;
cin >> n;
// 文字列の入力
char s[1000];
cin >> s;
for (int i = 0; s[i] != 0x00; i++) {
s[i] += n;
if (s[i] > 0x5a)
s[i] -= 26;
}
cout << string(s) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// 整数の入力
int n;
cin >> n;
// 文字列の入力
char s[100000];
cin >> s;
for (int i = 0; s[i] != 0x00; i++) {
s[i] += n;
if (s[i] > 0x5a)
s[i] -= 26;
}
cout << string(s) << endl;
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02848 | C++ | Runtime Error | #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
char s[2000];
scanf("%s", s);
for (int i = 0; s[i] != '\0'; i++) {
int oldChar = s[i] - 'A';
int newChar = (oldChar + n) % 26;
printf("%c", newChar + 'A');
}
printf("\n");
}
| #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
char s[10000];
scanf("%s", s);
for (int i = 0; s[i] != '\0'; i++) {
int oldChar = s[i] - 'A';
int newChar = (oldChar + n) % 26;
printf("%c", newChar + 'A');
}
printf("\n");
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02848 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int n;
cin >> n;
string s;
cin >> s;
rep(i, n) s[i] += n;
cout << s << endl;
}
| #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
int main() {
int n;
cin >> n;
string s;
cin >> s;
rep(i, s.size()) { s[i] = (s[i] - 'A' + n) % 26 + 'A'; }
cout << s << endl;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02848 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int main() {
int i, n, value;
char c;
char b[27];
cin >> n;
cin >> b;
for (i = 0; b[i] != '\0'; i++) {
if (n == 0)
printf("%c", b[i]);
else if (b[i] + n > 90) {
printf("%c", 64 + (b[i] + n - 90));
} else
printf("%c", b[i] + n);
... | #include "bits/stdc++.h"
using namespace std;
int main() {
int i, n, value;
char c;
char b[99999];
cin >> n;
cin >> b;
for (i = 0; b[i] != '\0'; i++) {
if (n == 0)
printf("%c", b[i]);
else if (b[i] + n > 90) {
printf("%c", 64 + (b[i] + n - 90));
} else
printf("%c", b[i] + n);... | replace | 6 | 7 | 6 | 7 | 0 | |
p02848 | C++ | Runtime Error | #include <stdio.h>
#include <string.h>
char a[110];
int n;
int len;
int main(void) {
scanf("%d", &n);
scanf("%s", a);
len = strlen(a);
for (int i = 0; i < len; i++) {
a[i] += n;
if (a[i] > 'Z')
a[i] -= 26;
printf("%c", a[i]);
}
return 0;
} | #include <stdio.h>
#include <string.h>
char a[10010];
int n;
int len;
int main(void) {
scanf("%d", &n);
scanf("%s", a);
len = strlen(a);
for (int i = 0; i < len; i++) {
a[i] += n;
if (a[i] > 'Z')
a[i] -= 26;
printf("%c", a[i]);
}
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02848 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n, m;
int main() {
char s[100];
int i, j, k;
cin >> n;
cin >> s;
for (i = 0; i < strlen(s); ++i) {
int x = s[i] + n;
if (x > 'Z')
x -= 26;
s[i] = x;
}
cout << s << endl;
return 0;
} | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n, m;
int main() {
char s[100010];
int i, j, k;
cin >> n;
cin >> s;
for (i = 0; i < strlen(s); ++i) {
int x = s[i] + n;
if (x > 'Z')
x -= 26;
s[i] = x;
}
cout << s << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
char s[1005] = {};
cin >> n >> s;
int lung = strlen(s);
for (int i = 0; i < lung; ++i) {
s[i] = s[i] + n;
if (s[i] > 'Z')
s[i] = 'A' + s[i] - 'Z' - 1;
}
cout << s;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
char s[10001] = {};
cin >> n >> s;
int lung = strlen(s);
for (int i = 0; i < lung; ++i) {
s[i] = s[i] + n;
if (s[i] > 'Z')
s[i] = 'A' + s[i] - 'Z' - 1;
}
cout << s;
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02848 | C++ | Runtime Error | /*
我的心脏怦怦跳，监管者就在附近
*/
#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unistd.h>
#define random(a, b) (rand() % (b - a + 1) + a)
using namespace std;... | /*
我的心脏怦怦跳，监管者就在附近
*/
#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <unistd.h>
#define random(a, b) (rand() % (b - a + 1) + a)
using namespace std;... | replace | 27 | 28 | 27 | 28 | 0 | |
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
//
int num;
string str;
vector<string> vec(26);
vec = {"A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M",
"N", "O", "P", "Q", "R", "S", "T", "U", "V", "W", "X", "Y", "Z"};
cin >> num >> str;
for (int i = 0; i < str.size()... | #include <bits/stdc++.h>
using namespace std;
int main() {
//
int num;
string str;
vector<string> vec(26);
vec = {"A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M",
"N", "O", "P", "Q", "R", "S", "T", "U", "V", "W", "X", "Y", "Z"};
cin >> num >> str;
for (int i = 0; i < str.size()... | replace | 15 | 16 | 15 | 16 | 0 | |
p02848 | C++ | Runtime Error | #include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < sizeof(s); i++) {
s[i] = s[i] + n;
if (s[i] > 'Z') {
s[i] = 64 + (s[i] - 'Z');
}
}
cout << s << endl;
... | #include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
s[i] = s[i] + n;
if (s[i] > 'Z') {
s[i] = 64 + (s[i] - 'Z');
}
}
cout << s << endl;
... | replace | 13 | 14 | 13 | 14 | -6 | *** stack smashing detected ***: terminated
|
p02848 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define FORr(i, m, n) for (ll i = n; i >= (ll)m; i--)
#define FORm(i, m) for (auto i = m.begin(); i != m.end... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define FORr(i, m, n) for (ll i = n; i >= (ll)m; i--)
#define FORm(i, m) for (auto i = m.begin(); i != m.end... | replace | 24 | 25 | 24 | 25 | 0 | |
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[1001];
int n;
cin >> n;
cin >> s;
for (int i = 0; i < strlen(s); i++) {
int diff = s[i] - 'A';
putchar('A' + (diff + n) % 26);
}
putchar('\n');
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char s[10010];
int n;
cin >> n;
cin >> s;
for (int i = 0; i < strlen(s); i++) {
int diff = s[i] - 'A';
putchar('A' + (diff + n) % 26);
}
putchar('\n');
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02848 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S,
T = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',
'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',
'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S,
T = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',
'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',
'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',... | replace | 10 | 11 | 10 | 11 | 0 | |
p02850 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#includ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#includ... | replace | 99 | 100 | 99 | 100 | 0 | |
p02850 | Python | Runtime Error | n = int(input())
ki = [[] for _ in range(n)]
for i in range(n - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
ki[a].append([b, i])
ans = [-1] * (n - 1)
# print(ki)
def d(index, color):
cnt = 1
for t, jid in ki[index]:
if cnt == color:
cnt += 1
ans[jid] = cnt
... | import sys
sys.setrecursionlimit(10**7)
n = int(input())
ki = [[] for _ in range(n)]
for i in range(n - 1):
a, b = map(int, input().split())
a -= 1
b -= 1
ki[a].append([b, i])
ans = [-1] * (n - 1)
# print(ki)
def d(index, color):
cnt = 1
for t, jid in ki[index]:
if cnt == color:
... | insert | 0 | 0 | 0 | 4 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | replace | 64 | 65 | 64 | 65 | 0 | |
p02850 | 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;
struct Edge {
int to, id;
};
vector<vector<Edge>> g;
vector<int> ans;
void dfs(int v, int c = -1, int p = -1) {
int k = 1;
rep(i, g[v].size()) {
int u = g[v][i].to, ei = g[v][i].id;
if (u... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
struct Edge {
int to, id;
};
vector<vector<Edge>> g;
vector<int> ans;
void dfs(int v, int c = -1, int p = -1) {
int k = 1;
rep(i, g[v].size()) {
int u = g[v][i].to, ei = g[v][i].id;
if (u... | insert | 29 | 29 | 29 | 31 | -11 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> way[10010], way2[10010];
int way_num[10010], point[10010], max_c;
bool v[10010];
void dfs(int now, int colour) {
v[now] = 1;
int n_c = 1;
for (int i = 0; i < way[now].size(); i++) {
if (v[way[now][i]] == 0) {
if (n_c == colour)
n... | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> way[100010], way2[100010];
int way_num[100010], point[100010], max_c;
bool v[100010];
void dfs(int now, int colour) {
v[now] = 1;
int n_c = 1;
for (int i = 0; i < way[now].size(); i++) {
if (v[way[now][i]] == 0) {
if (n_c == colour)
... | replace | 4 | 7 | 4 | 7 | 0 | |
p02850 | C++ | Runtime Error | // ----- + ------ + + ------ JAI SHREE RAM ----- +------ + ------ + ------ +
// ------
/* ＿人人人人人人人人人人人人人人人＿
＞ S H U B H A M A N A N D ＜
￣Y^Y^Y^Y^Y^Y^Y^Y^Y^Y^Y^Y^Y^Y^Y￣ */
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::s... | // ----- + ------ + + ------ JAI SHREE RAM ----- +------ + ------ + ------ +
// ------
/* ＿人人人人人人人人人人人人人人人＿
＞ S H U B H A M A N A N D ＜
￣Y^Y^Y^Y^Y^Y^Y^Y^Y^Y^Y^Y^Y^Y^Y￣ */
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::s... | replace | 13 | 14 | 13 | 14 | 0 | |
p02850 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <... | insert | 82 | 82 | 82 | 83 | -11 | |
p02850 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
template <class Read> void in(Read &x) {
x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9'... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
template <class Read> void in(Read &x) {
x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9'... | replace | 31 | 32 | 31 | 32 | 0 | |
p02850 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n;
cin >> n;
vector<vector<int>> G(n);
vector<pair<int, int>> vp;
rep(i, n) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].emplace_back(b);
G[b].emplace_bac... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n;
cin >> n;
vector<vector<int>> G(n);
vector<pair<int, int>> vp;
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].emplace_back(b);
G[b].emplace... | replace | 11 | 12 | 11 | 12 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100000;
pair<int, int> edge_color[N];
vector<int> tree[N];
int maxc = 0;
void dfs(pair<int, int> now) {
int next_color = 1;
for (auto i : tree[now.first]) {
if (edge_color[i].second)
continue;
if (next_color == now.secon... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100001;
pair<int, int> edge_color[N];
vector<int> tree[N];
int maxc = 0;
void dfs(pair<int, int> now) {
int next_color = 1;
for (auto i : tree[now.first]) {
if (edge_color[i].second)
continue;
if (next_color == now.secon... | replace | 3 | 4 | 3 | 4 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> G(N);
vector<pair<int, int>> vp;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
a--, b--;
G[a].emplace_back(b);
G[b].emplace_back(a);
vp.emplace_back(a, b);
}
int K = 0;
map<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> G(N);
vector<pair<int, int>> vp;
for (int i = 1; i < N; i++) {
int a, b;
cin >> a >> b;
a--, b--;
G[a].emplace_back(b);
G[b].emplace_back(a);
vp.emplace_back(a, b);
}
int K = 0;
map<... | replace | 8 | 9 | 8 | 9 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
#define debug(...)
#include <complex.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
vvi g;
int n;
template <typename T> class Queue {
int head, tail, capacity;
T *a;
public:
Queue() {
head = 0, tail = 0, capacity ... | #include <bits/stdc++.h>
#define debug(...)
#include <complex.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
vvi g;
int n;
template <typename T> class Queue {
int head, tail, capacity;
T *a;
public:
Queue() {
head = 0, tail = 0, capacity ... | insert | 23 | 23 | 23 | 24 | 0 | |
p02850 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define int ll
const ll MOD = 1000000007;
const ll INF_LL = (ll)1000000007 * 1000000007;
const int INF_INT = (int)1000000007;
const double PI = 3.14159265358979323846;
const int dx[4] = {1, 0, -1, 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define int ll
const ll MOD = 1000000007;
const ll INF_LL = (ll)1000000007 * 1000000007;
const int INF_INT = (int)1000000007;
const double PI = 3.14159265358979323846;
const int dx[4] = {1, 0, -1, 0... | insert | 120 | 120 | 120 | 122 | TLE | |
p02850 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (ll i = (begin), i##_end_ = (end); i < i##_end_... | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (ll i = (begin), i##_end_ = (end); i < i##_end_... | replace | 53 | 58 | 53 | 54 | TLE | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int N = 1e5 + 5;
vector<pii> a[N];
int visited[N];
int mincolor;
int color[N];
void dfs(int cur, int col) {
vector<int> used(a[cur].size() + 1);
int st = 1;
for (auto branch : a[cur]) {
if (!visited[branch.first]) {
visited... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int N = 1e5 + 5;
vector<pii> a[N];
int visited[N];
int mincolor;
int color[N];
void dfs(int cur, int col) {
vector<int> used(mincolor + 1);
int st = 1;
for (auto branch : a[cur]) {
if (!visited[branch.first]) {
visited[bran... | replace | 10 | 11 | 10 | 11 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int ans[N], k;
vector<pair<int, int>> adj[N];
int dfs(int node, int par, int col) {
int nxt = 1;
for (auto &c : adj[node]) {
if (c.first == par)
continue;
nxt += nxt == col;
k = max(k, nxt);
ans[c.second] = nxt;
dfs(c.... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int ans[N], k;
vector<pair<int, int>> adj[N];
void dfs(int node, int par, int col) {
int nxt = 1;
for (auto &c : adj[node]) {
if (c.first == par)
continue;
nxt += nxt == col;
k = max(k, nxt);
ans[c.second] = nxt;
dfs(c... | replace | 8 | 9 | 8 | 9 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define P pair<int, int>
#define MAX_N 1000010
using namespace std;
// 辺の塗り分けの最小値 = 出次数の最大値 = max(k,G[u].size())
// 節点uに対し時節点vの色は 1,2,~,G[u].size()
// ただし、節点uの色以外 if(c[u] == cur(=c[v])) cur++;
// 組み合わせ(辺) (u,v)の色(cur)を保存 map<P,int> ec
// c[v = 0~G[u].size()] = cur++;
// た... | #include <bits/stdc++.h>
#define ll long long
#define P pair<int, int>
#define MAX_N 1000010
using namespace std;
// 辺の塗り分けの最小値 = 出次数の最大値 = max(k,G[u].size())
// 節点uに対し時節点vの色は 1,2,~,G[u].size()
// ただし、節点uの色以外 if(c[u] == cur(=c[v])) cur++;
// 組み合わせ(辺) (u,v)の色(cur)を保存 map<P,int> ec
// c[v = 0~G[u].size()] = cur++;
// た... | replace | 18 | 19 | 18 | 19 | -11 | |
p02850 | C++ | Time Limit Exceeded | #pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
/*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#includ... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>... | delete | 0 | 3 | 0 | 0 | TLE | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void dfs(vector<int> &c, vector<vector<pair<int, int>>> &E, int v = 0) {
int cnt = E[v].size();
set<int> st;
for (int i = 1; i <= cnt; i++) {
st.insert(cnt);
}
for (auto P : E[v]) {
int id = P.second;
if (c[id] != -1) {
st.erase(c[id]);
}
}... | #include <bits/stdc++.h>
using namespace std;
void dfs(vector<int> &c, vector<vector<pair<int, int>>> &E, int v = 0) {
int cnt = E[v].size();
set<int> st;
for (int i = 1; i <= cnt; i++) {
st.insert(i);
}
for (auto P : E[v]) {
int id = P.second;
if (c[id] != -1) {
st.erase(c[id]);
}
}
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02850 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using na... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using na... | insert | 39 | 39 | 39 | 40 | 0 | |
p02850 | 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;
struct Edge {
int to, id;
};
vector<vector<Edge>> g;
vector<int> ans;
void dfs(int v, int c = -1, int p = -1) {
int k = 1;
rep(i, g[v].size()) {
int u = g[v][i].to, ei = g[v][i].id;
if (u... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
struct Edge {
int to, id;
};
vector<vector<Edge>> g;
vector<int> ans;
void dfs(int v, int c = -1, int p = -1) {
int k = 1;
rep(i, g[v].size()) {
int u = g[v][i].to, ei = g[v][i].id;
if (u... | insert | 30 | 30 | 30 | 31 | -11 | |
p02850 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
const int maxn = 1e5 + 10;
map<pair<int, int>, int> ans;
vector<int> edge[maxn];
priority_queue<int, vector<int>, greater<int>> q[maxn];
priority_queue<int, vector<int>, le... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
const int maxn = 1e5 + 10;
map<pair<int, int>, int> ans;
vector<int> edge[maxn];
priority_queue<int, vector<int>, greater<int>> q[maxn];
priority_queue<int, vector<int>, le... | insert | 21 | 21 | 21 | 23 | -11 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll siz = 1e5;
const ll mod = 1e9;
const ll MAXX = 1e18;
map<pair<ll, ll>, ll> col;
vector<ll> graph[siz];
ll ma = 0;
void dfs(ll node, ll par) {
ll color = 1;
if (color == col[make_pair(node, par)]) {
color++;
}
for (ll i = 0; i < g... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll siz = 1e5;
const ll mod = 1e9;
const ll MAXX = 1e18;
map<pair<ll, ll>, ll> col;
vector<ll> graph[siz + 10];
ll ma = 0;
void dfs(ll node, ll par) {
ll color = 1;
if (color == col[make_pair(node, par)]) {
color++;
}
for (ll i = 0; ... | replace | 9 | 10 | 9 | 10 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1145141919810893364
// #define INF 810114514
// #define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1145141919810893364
// #define INF 810114514
// #define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++... | replace | 42 | 43 | 42 | 43 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
/// Typedef
typedef long long ll;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb push_back
#define ppb pop_back
#define MP m... | #include <bits/stdc++.h>
using namespace std;
/// Typedef
typedef long long ll;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb push_back
#define ppb pop_back
#define MP m... | replace | 126 | 127 | 126 | 127 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 5;
int n;
vector<int> g[N];
vector<pair<int, int>> edge;
map<pair<int, int>, int> colorEdge;
bool used[N];
int c[N];
int main() {
#define TASK "test"
#ifndef ONLINE_JUDGE
freopen(TASK ".inp", "r", stdin);
freopen(TASK ".out", "w", stdout);
#e... | #include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 5;
int n;
vector<int> g[N];
vector<pair<int, int>> edge;
map<pair<int, int>, int> colorEdge;
bool used[N];
int c[N];
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 1; i < n; i++) {
int u, v;
... | delete | 13 | 18 | 13 | 13 | 0 | |
p02850 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pa... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pa... | delete | 21 | 29 | 21 | 21 | TLE | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
int fill_color(vector<vector<int>> &tree,
unordered_map<int, unordered_map<int, int>> &color, int parent,
int parent_color) {
int max_color = 0;
for (int i = 0; i < tree[parent].size(); i++) {
int current... | #include <bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
int fill_color(vector<vector<int>> &tree,
unordered_map<int, unordered_map<int, int>> &color, int parent,
int parent_color) {
int max_color = 0;
for (int i = 0; i < tree[parent].size(); i++) {
int current... | replace | 38 | 39 | 38 | 39 | 0 | |
p02850 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (ll i = (n)-1; i >= (e); i--)
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (ll i = (n)-1; i >= (e); i--)
#defin... | insert | 41 | 41 | 41 | 42 | TLE | |
p02850 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<set<int>>;
int main() {
int N;
cin >> N;
vector<int> A(N), B(N);
map<pa... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<set<int>>;
int main() {
int N;
cin >> N;
vector<int> A(N), B(N);
map<pa... | replace | 41 | 42 | 41 | 42 | TLE | |
p02850 | 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>;
struct Edge {
int to, id;
};
vector<vector<Edge>> g;
vector<int> ans;
void dfs(int v, int c = -1, int p = -1) {
int k = 1;
rep(i, g[v].size()) {
int u = g[v][i].to, ... | #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>;
struct Edge {
int to, id;
};
vector<vector<Edge>> g;
vector<int> ans;
void dfs(int v, int c = -1, int p = -1) {
int k = 1;
rep(i, g[v].size()) {
int u = g[v][i].to, ... | insert | 30 | 30 | 30 | 31 | -11 | |
p02850 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | #include <bits/stdc++.h>
#define GET_REP(_1, _2, _3, NAME, ...) NAME
#define rep(...) GET_REP(__VA_ARGS__, irep, _rep)(__VA_ARGS__)
#define rep1(...) GET_REP(__VA_ARGS__, irep1, _rep1)(__VA_ARGS__)
#define _rep(i, n) irep(i, 0, n)
#define _rep1(i, n) irep1(i, 1, n)
#define irep(i, a, n) for (int i = a; i < (int)(n); ++... | replace | 38 | 39 | 38 | 39 | TLE | |
p02850 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#incl... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#incl... | replace | 125 | 126 | 125 | 126 | 0 | |
p02850 | C++ | Runtime Error | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int N;
int a[150000];
int b[150000];
int i, j;
queue<pair<int, int>> que;
pair<int, int> p;
int main() {
vector<int> v[100000];
int cnt[100000];
int c[100000];
int s = 1;
cin >> N;
for (i = 0; i < N; i++) {
cnt[i] = 0;
c[i... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
int N;
int a[150000];
int b[150000];
int i, j;
queue<pair<int, int>> que;
pair<int, int> p;
int main() {
vector<int> v[100005];
int cnt[100000];
int c[100000];
int s = 1;
cin >> N;
for (i = 0; i < N; i++) {
cnt[i] = 0;
c[i... | replace | 13 | 14 | 13 | 14 | 0 | |
p02850 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n - 1), b(n - 1);
vector<queue<int>> edge(n);
for (int i = 0; i < n - 1; i++) {
cin >> a[i] >> b[i];
--a[i];
--b[i];
edge[a[i]].push(i);
edge[b[i]].push(i);
}
int ans = 0; // 塗られた色の種類数
vector... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n - 1), b(n - 1);
vector<queue<int>> edge(n);
for (int i = 0; i < n - 1; i++) {
cin >> a[i] >> b[i];
--a[i];
--b[i];
edge[a[i]].push(i);
edge[b[i]].push(i);
}
int ans = 0; // 塗られた色の種類数
vector... | insert | 43 | 43 | 43 | 50 | TLE | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct Edge {
int next;
int to;
int color;
} edge[100005];
int head[100005], cnt, m[100005], ans, n;
void add(int u, int v) {
edge[++cnt].next = head[u];
edge[cnt].to = v;
head[u] = cnt;
}
void dfs(int x, int fa) {
// cout<<x<<endl;
int us = 1, ban = 0;
f... | #include <bits/stdc++.h>
using namespace std;
struct Edge {
int next;
int to;
int color;
} edge[200005];
int head[100005], cnt, m[100005], ans, n;
void add(int u, int v) {
edge[++cnt].next = head[u];
edge[cnt].to = v;
head[u] = cnt;
}
void dfs(int x, int fa) {
// cout<<x<<endl;
int us = 1, ban = 0;
f... | replace | 6 | 7 | 6 | 7 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using Edge = pair<int, int>; // (隣接頂点, 辺番号)
using Graph =... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using Edge = pair<int, int>; // (隣接頂点, 辺番号)
using Graph =... | replace | 28 | 30 | 28 | 30 | -6 | double free or corruption (out)
|
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n;
cin >> n;
vector<vector<int>> G(n);
vector<pii> vp;
rep(i, n) {
int a, b;
cin >> a >> b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n;
cin >> n;
vector<vector<int>> G(n);
vector<pii> vp;
for (int i = 1; i < n; i++) {
int a, b;... | replace | 13 | 14 | 13 | 14 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ty... | replace | 41 | 42 | 41 | 42 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/numeric>
using namespace std;
// using namespace __gnu_cxx;
const int MAXN = (int)1e5 + 5;
vector<int> adjList[MAXN];
int mx = 0;
map<pair<int, int>, int> mp;
int getColor(int u, int v) {
if (u > v)
swap(u, v);
return mp[{u, v}];
}
int setColor(int u, int v, int col... | #include <bits/stdc++.h>
// #include <ext/numeric>
using namespace std;
// using namespace __gnu_cxx;
const int MAXN = (int)1e5 + 5;
vector<int> adjList[MAXN];
int mx = 0;
map<pair<int, int>, int> mp;
int getColor(int u, int v) {
if (u > v)
swap(u, v);
return mp[{u, v}];
}
void setColor(int u, int v, int co... | replace | 17 | 18 | 17 | 18 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.