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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02265 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
list<int> l;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string comm;
int x;
cin >> comm;
if (comm == "insert") {
cin >> x;
l.push_front(x);
} else if (comm == "d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
list<int> l;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string comm;
int x;
cin >> comm;
if (comm == "insert") {
cin >> x;
... | insert | 7 | 7 | 7 | 10 | TLE | |
p02265 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
class Linked_list {
struct Item {
int num;
Item *next;
Item *prev;
};
Item *first, *last;
public:
Linked_list() {
first = NULL;
last = NULL;
}
void insert(int x) {
Item *item = new Item();
item->num = x;
item->pre... | #include <iostream>
#include <string>
using namespace std;
class Linked_list {
struct Item {
int num;
Item *next;
Item *prev;
};
Item *first, *last;
public:
Linked_list() {
first = NULL;
last = NULL;
}
void insert(int x) {
Item *item = new Item();
item->num = x;
item->pre... | replace | 59 | 60 | 59 | 61 | 0 | |
p02265 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | insert | 75 | 75 | 75 | 76 | TLE | |
p02265 | C++ | Time Limit Exceeded | ///
// File: alds1_3_c.cpp
// Author: ymiyamoto
//
// Created on Sat Oct 7 15:06:49 2017
//
#include <cstdint>
#include <cstring>
#include <iostream>
using namespace std;
struct linked_list_t {
linked_list_t *prev;
linked_list_t *next;
int64_t val;
};
static void delete_list(linked_list_t *list) {
linked_... | ///
// File: alds1_3_c.cpp
// Author: ymiyamoto
//
// Created on Sat Oct 7 15:06:49 2017
//
#include <cstdint>
#include <cstring>
#include <iostream>
using namespace std;
struct linked_list_t {
linked_list_t *prev;
linked_list_t *next;
int64_t val;
};
static void delete_list(linked_list_t *list) {
linked_... | insert | 63 | 63 | 63 | 65 | TLE | |
p02265 | C++ | Time Limit Exceeded | #include <cstdio>
#include <cstdlib>
typedef struct Node {
int key;
struct Node *prev;
struct Node *next;
} Node;
Node *head;
void initNode() {
head = (Node *)malloc(sizeof(Node));
head->prev = head;
head->next = head;
}
void insertFirst(int key) {
Node *x = (Node *)malloc(sizeof(Node));
x->key = key... | #include <cstdio>
#include <cstdlib>
typedef struct Node {
int key;
struct Node *prev;
struct Node *next;
} Node;
Node *head;
void initNode() {
head = (Node *)malloc(sizeof(Node));
head->prev = head;
head->next = head;
}
void insertFirst(int key) {
Node *x = (Node *)malloc(sizeof(Node));
x->key = key... | insert | 49 | 49 | 49 | 51 | TLE | |
p02265 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
deque<int> d;
int n;
string cmd;
cin >> n;
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
deque<int> d;
int n;
string cmd;
... | insert | 15 | 15 | 15 | 18 | TLE | |
p02266 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
stack<int> S1;
stack<pair<int, int>> S2;
char ch;
int sum = 0;
for (int i = 0; cin >> ch; ++i) {
if (ch == '\\')
S1.push(i);
else if (ch == '/' && S1.size() > 0) {
... | #include <algorithm>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
stack<int> S1;
stack<pair<int, int>> S2;
char ch;
int sum = 0;
for (int i = 0; cin >> ch; ++i) {
if (ch == '\\')
S1.push(i);
else if (ch == '/' && S1.size() > 0) {
... | replace | 32 | 33 | 32 | 33 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02266 | C++ | Runtime Error | #include <cstdio>
#include <stack>
using namespace std;
int main() {
int total_area = 0;
stack<int> s1;
stack<pair<int, int>> s2;
char c;
int i = 0;
int ip, area;
for (scanf("%c", &c); c != '\n'; scanf("%c", &c), ++i) {
switch (c) {
case '\\':
s1.push(i);
break;
case '_':
... | #include <cstdio>
#include <stack>
using namespace std;
int main() {
int total_area = 0;
stack<int> s1;
stack<pair<int, int>> s2;
char c;
int i = 0;
int ip, area;
for (scanf("%c", &c); c != '\n'; scanf("%c", &c), ++i) {
switch (c) {
case '\\':
s1.push(i);
break;
case '_':
... | insert | 21 | 21 | 21 | 23 | 0 | |
p02266 | C++ | Runtime Error | #include <iostream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
int main(void) {
std::string Input;
std::cin >> Input;
std::stack<int> PlaceBackSlash;
std::stack<std::pair<int, int>> Puddle_Place_Quantity;
for (unsigned int i = 0; i < Input.size(); ++i) {
if (Input[i] == '\\') ... | #include <iostream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
int main(void) {
std::string Input;
std::cin >> Input;
std::stack<int> PlaceBackSlash;
std::stack<std::pair<int, int>> Puddle_Place_Quantity;
for (unsigned int i = 0; i < Input.size(); ++i) {
if (Input[i] == '\\') ... | replace | 40 | 41 | 40 | 41 | -11 | |
p02266 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define UP '/'
#define DOWN '\\'
#define FLAT '_'
#define END 20001
int calc_area(int i, int j, const string *input) {
int area = 0, d = 0;
while (i < j) {
if ((*input)[i] == UP)
area += d--;
else if ((*i... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define UP '/'
#define DOWN '\\'
#define FLAT '_'
#define END 20001
int calc_area(int i, int j, const string *input) {
int area = 0, d = 0;
while (i < j) {
if ((*input)[i] == UP)
area += d--;
else if ((*i... | replace | 59 | 63 | 59 | 64 | 0 | |
p02266 | C++ | Runtime Error | #include <iostream>
#include <stack>
using namespace std;
int main() {
stack<char> sc;
int lim, m = 0, ds = 0, i = 0, k = 0, SS = 0;
int s[1000];
int rs[1000];
char c;
while (cin >> c) {
sc.push(c);
if (m == 0) {
if (c == '\\')
m++;
} else {
if (c == '/')
m--;
... | #include <iostream>
#include <stack>
using namespace std;
int main() {
stack<char> sc;
int lim, m = 0, ds = 0, i = 0, k = 0, SS = 0;
int s[10000];
int rs[10000];
char c;
while (cin >> c) {
sc.push(c);
if (m == 0) {
if (c == '\\')
m++;
} else {
if (c == '/')
m--;
... | replace | 7 | 9 | 7 | 9 | 0 | |
p02266 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
// #include<cmath>
using namespace std;
int main(void) {
int i = 0, sum = 0, k = 0, a, b;
string s;
stack<int> S;
stack<pair<int... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
// #include<cmath>
using namespace std;
int main(void) {
int i = 0, sum = 0, k = 0, a, b;
string s;
stack<int> S;
stack<pair<int... | replace | 54 | 60 | 54 | 63 | 0 | |
p02266 | C++ | Runtime Error | #include <iostream>
#include <stack>
#include <stdio.h>
#define BUF_SIZE 20000
using namespace std;
stack<int> ST;
void calcS() {}
int main() {
char buf[BUF_SIZE];
int heightTable[BUF_SIZE], maxHeightTable[BUF_SIZE], height = 0,
maxHeight = 0, i;
fgets... | #include <iostream>
#include <stack>
#include <stdio.h>
#define BUF_SIZE 20008
using namespace std;
stack<int> ST;
void calcS() {}
int main() {
char buf[BUF_SIZE];
int heightTable[BUF_SIZE], maxHeightTable[BUF_SIZE], height = 0,
maxHeight = 0, i;
fgets... | replace | 4 | 5 | 4 | 5 | 0 | |
p02266 | C++ | Time Limit Exceeded | #include <cstdio>
#include <cstdlib>
#include <cstring>
struct Node {
int x;
int y;
int type;
int S;
Node *next, *prev;
};
Node *nil;
Node *listSearch(int key_y, int type) {
Node *cur = nil->prev;
while (cur != nil && ((cur->y != key_y || cur->type != type))) {
cur = cur->prev;
}
return cur;
}
... | #include <cstdio>
#include <cstdlib>
#include <cstring>
struct Node {
int x;
int y;
int type;
int S;
Node *next, *prev;
};
Node *nil;
Node *listSearch(int key_y, int type) {
Node *cur = nil->prev;
while (cur != nil && ((cur->y != key_y || cur->type != type))) {
cur = cur->prev;
}
return cur;
}
... | replace | 96 | 97 | 96 | 97 | TLE | |
p02266 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <numeric>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
char ss[20010];
scanf("%s", ss);
const string s = ss;
auto f = [&s](int start) {
vector<pair<char, int>> st;
vector<int> v;
int depth ... | #include <algorithm>
#include <cstdio>
#include <numeric>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
char ss[20010];
scanf("%s", ss);
const string s = ss;
auto f = [&s](int start) {
vector<pair<char, int>> st;
vector<int> v;
int depth ... | insert | 61 | 61 | 61 | 66 | TLE | |
p02266 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int top = 0, c[10000], area[10000][2] = {};
void push(int x) {
top++;
c[top] = x;
}
int pop() {
top--;
return c[top + 1];
}
int main() {
int sum = 0, cnt = 0;
char ch;
for (int i = 0; cin >> ch; i++) {
if (ch == '\\... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int top = 0, c[20000], area[20000][2] = {};
void push(int x) {
top++;
c[top] = x;
}
int pop() {
top--;
return c[top + 1];
}
int main() {
int sum = 0, cnt = 0;
char ch;
for (int i = 0; cin >> ch; i++) {
if (ch == '\\... | replace | 6 | 7 | 6 | 7 | 0 | |
p02266 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <stack>
using namespace std;
int main() {
char s;
int N;
stack<int> S1;
stack<pair<int, int>> S2;
int sum = 0;
int ans[1000];
for (int i = 0; cin >> s; i++) {
if (s == '\\') {
S1.push(i);
} else if (s == '/' && S1.size() >... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <stack>
using namespace std;
int main() {
char s;
int N;
stack<int> S1;
stack<pair<int, int>> S2;
int sum = 0;
int ans[20000];
for (int i = 0; cin >> s; i++) {
if (s == '\\') {
S1.push(i);
} else if (s == '/' && S1.size() ... | replace | 13 | 14 | 13 | 14 | 0 | |
p02266 | C++ | Runtime Error | #include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int out(vector<int> &A, int n) {
int i;
for (i = 0; i <= n - 2; i++) {
cout << A[i] << " ";
}
cout << A[n - 1] << endl;
}
int main() {
ios::sync_with_stdio(false);
vector<char> C_list;
char c;
while (ci... | #include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int out(vector<int> &A, int n) {
int i;
for (i = 0; i <= n - 2; i++) {
cout << A[i] << " ";
}
cout << A[n - 1] << endl;
}
int main() {
ios::sync_with_stdio(false);
vector<char> C_list;
char c;
while (ci... | replace | 56 | 60 | 56 | 63 | 0 | |
p02266 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int main() {
stack<int> S1;
stack<pair<int, int>> S2;
char ch;
int sum = 0;
for (int i = 0; cin >> ch; ++i) {
if (ch == '\\')
S1.push(i);
else if (ch == '/' && S1.size() > 0) {
int j = S1.top();
S1.pop();
sum += i - j;
int a ... | #include "bits/stdc++.h"
using namespace std;
int main() {
stack<int> S1;
stack<pair<int, int>> S2;
char ch;
int sum = 0;
for (int i = 0; cin >> ch; ++i) {
if (ch == '\\')
S1.push(i);
else if (ch == '/' && S1.size() > 0) {
int j = S1.top();
S1.pop();
sum += i - j;
int a ... | replace | 27 | 28 | 27 | 28 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02266 | C++ | Runtime Error | /*
** 本题使用两个stack，一个用来统计总积水，一个用来统计单独的积水面积。
*/
#include <cstdio>
#include <stack>
#include <vector>
using namespace std;
static const int maxn = 20000 + 10;
char buff[maxn];
int main() {
// freopen("data.in", "r", stdin);
// freopen("data.out", "w", stdout);
while (scanf("%s", buff) != EOF) {
/*
** ts用... | /*
** 本题使用两个stack，一个用来统计总积水，一个用来统计单独的积水面积。
*/
#include <cstdio>
#include <stack>
#include <vector>
using namespace std;
static const int maxn = 20000 + 10;
char buff[maxn];
int main() {
// freopen("data.in", "r", stdin);
// freopen("data.out", "w", stdout);
while (scanf("%s", buff) != EOF) {
/*
** ts用... | replace | 47 | 51 | 47 | 55 | 0 | |
p02266 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
struct mountain {
int top = 0;
int topn;
int dis = 0;
};
string s;
mountain m[100];
int area[100] = {0}, ff = 1, wind = 0;
int disp(int num) {
int aa = 0, fff = 0, j = 0;
for (int i = 0; i < num; i++)
aa += area[i];
if (!area[num - 1])
nu... | #include <iostream>
#include <string>
using namespace std;
struct mountain {
int top = 0;
int topn;
int dis = 0;
};
string s;
mountain m[10000];
int area[10000] = {0}, ff = 1, wind = 0;
int disp(int num) {
int aa = 0, fff = 0, j = 0;
for (int i = 0; i < num; i++)
aa += area[i];
if (!area[num - 1])
... | replace | 11 | 13 | 11 | 13 | 0 | |
p02266 | C++ | Runtime Error | #include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
stack<int> sa;
string m;
int cnt = 0, result = 0, high = 0, tmp = 0, h[20000], i;
vector<int> amo;
cin >> m;
for (i = m.size() - 1; i != -1; i--) {
if (m[i] == '\\')
tmp++;
if (m[i] == ... | #include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
stack<int> sa;
string m;
int cnt = 0, result = 0, high = 0, tmp = 0, h[20000], i;
vector<int> amo;
cin >> m;
for (i = m.size() - 1; i != -1; i--) {
if (m[i] == '\\')
tmp++;
if (m[i] == ... | replace | 50 | 55 | 50 | 58 | 0 | |
p02266 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
stack<int> S1;
stack<pair<int, int>> S2;
char slope;
int i = 0;
int sum = 0;
while (scanf("%s", slope) != EOF) {
if (slope == '\\') {
... | #include <algorithm>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
stack<int> S1;
stack<pair<int, int>> S2;
char slope;
int i = 0;
int sum = 0;
while (cin >> slope) {
if (slope == '\\') {
S1.push(i... | replace | 15 | 16 | 15 | 16 | TLE | |
p02267 | C++ | Runtime Error | #include <iostream>
using namespace std;
bool t[10005];
signed main() {
int n, q;
int ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
t[tmp] = 1;
}
cin >> q;
for (int i = 0; i < q; i++) {
int tmp;
cin >> tmp;
if (t[tmp] == 1) {
ans++;
t[tmp] = ... | #include <iostream>
using namespace std;
const int MAX = 1e9 + 5;
bool t[MAX];
signed main() {
int n, q;
int ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
t[tmp] = 1;
}
cin >> q;
for (int i = 0; i < q; i++) {
int tmp;
cin >> tmp;
if (t[tmp] == 1) {
... | replace | 3 | 4 | 3 | 5 | 0 | |
p02267 | C++ | Runtime Error | #include <iostream>
using namespace std;
bool linearSearch(int A[], int key, int size) {
int i = 0;
A[size] = key;
while (A[i] != key)
i++;
return i != size;
}
int main() {
int size, query, queryNum, count = 0;
cin >> size;
int *A = new int[size];
for (int i = 0; i < size; i++)
scanf("%d", &A... | #include <iostream>
using namespace std;
bool linearSearch(int A[], int key, int size) {
int i = 0;
A[size] = key;
while (A[i] != key)
i++;
return i != size;
}
int main() {
int size, query, queryNum, count = 0;
cin >> size;
int *A = new int[size + 1];
for (int i = 0; i < size; i++)
scanf("%d"... | replace | 15 | 16 | 15 | 16 | 0 | |
p02267 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int i, j, n, q, S[10001], T[100], C;
cin >> n;
for (i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (i = 0; i < q; i++)
cin >> T[i];
C = 0;
for (i = 0; i < q; i++) {
j = 0;
S[n] = T[i];
while (S[j] != S[n])
j++;
if (j < n)... | #include <iostream>
using namespace std;
int main() {
int i, j, n, q, S[10001], T[500], C;
cin >> n;
for (i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (i = 0; i < q; i++)
cin >> T[i];
C = 0;
for (i = 0; i < q; i++) {
j = 0;
S[n] = T[i];
while (S[j] != S[n])
j++;
if (j < n)... | replace | 4 | 5 | 4 | 5 | 0 | |
p02267 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
long long n, q, s[1000000001], t, k;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
k = 0;
for (long long i = 0; i < q; i++) {
cin >> t;
for (long long j = 0; j < n; j++) {
if (s[j] == t) {
k++;
... | #include <iostream>
using namespace std;
int main() {
long long n, q, s[10001], t, k;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
k = 0;
for (long long i = 0; i < q; i++) {
cin >> t;
for (long long j = 0; j < n; j++) {
if (s[j] == t) {
k++;
bre... | replace | 4 | 5 | 4 | 5 | -11 | |
p02267 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, p;
int s[1000];
int t[1000];
int i, j;
int c = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
}
cin >> p;
for (i = 0; i < p; i++) {
cin >> t[i];
}
for (i = 0; i < n; i++) {
for (j = 0; j < p; j++) {
if (s[i] == t... | #include <iostream>
using namespace std;
int main() {
int n, p;
int s[1000000];
int t[1000000];
int i, j;
int c = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
}
cin >> p;
for (i = 0; i < p; i++) {
cin >> t[i];
}
for (i = 0; i < n; i++) {
for (j = 0; j < p; j++) {
if (s[i... | replace | 4 | 6 | 4 | 6 | 0 | |
p02267 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int q;
cin >> q;
vector<int> t(q);
for (int i = 0; i < q; i++) {
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int q;
cin >> q;
vector<int> t(q);
for (int i = 0; i < q; i++) {
... | replace | 22 | 30 | 22 | 29 | 0 | |
p02267 | C++ | Runtime Error | #include <iostream>
using namespace std;
int linear(int a[], int key, int n);
int main() {
int i, j, n, q, c = 0;
int s[1000], t[1000];
cin >> n;
for (i = 0; i < n; i++)
cin >> s[i];
cin >> q;
for (i = 0; i < q; i++)
cin >> t[i];
for (i = 0; i < q; i++) {
c = c + linear(s, t[i], n);
}
... | #include <iostream>
using namespace std;
int linear(int a[], int key, int n);
int main() {
int i, j, n, q, c = 0;
int s[100000], t[100000];
cin >> n;
for (i = 0; i < n; i++)
cin >> s[i];
cin >> q;
for (i = 0; i < q; i++)
cin >> t[i];
for (i = 0; i < q; i++) {
c = c + linear(s, t[i], n);
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02267 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <vector>
#define rep(i, N) for (int i = 0; i < N; ++i)
using namespace std;
bool linerSearch(vector<int> vec, int key) {
for (int &v : vec)
if (v == key)
return true;
return false;
}
int main() {
int n, q, key;
scanf("%d", &n);
vector<int> S(n);
... | #include <algorithm>
#include <cstdio>
#include <vector>
#define rep(i, N) for (int i = 0; i < N; ++i)
using namespace std;
bool linerSearch(vector<int> vec, int key) {
auto itr = std::find(vec.begin(), vec.end(), key);
size_t index = std::distance(vec.begin(), itr);
return index != vec.size();
}
int main() {... | replace | 9 | 13 | 9 | 12 | 0 | |
p02267 | C++ | Runtime Error | #include <iostream>
using namespace std;
int LSearch(int A[], unsigned int q, int x) {
A[q] = x;
for (int i = 0;; i++) {
if (A[i] == x)
if (i != q)
return 0;
else
return -1;
}
}
int main() {
unsigned int n, q;
unsigned int counter = 0;
int S[1000000000], T;
cin >> n;
for... | #include <iostream>
using namespace std;
int LSearch(int A[], unsigned int q, int x) {
A[q] = x;
for (int i = 0;; i++) {
if (A[i] == x)
if (i != q)
return 0;
else
return -1;
}
}
int main() {
unsigned int n, q;
unsigned int counter = 0;
int S[10000000], T;
cin >> n;
for (... | replace | 16 | 17 | 16 | 17 | -11 | |
p02267 | C++ | Time Limit Exceeded | #include <stdio.h>
int search(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return (i != n);
}
int main() {
int A[10000 + 1], n, i, q, sum = 0, key;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++) {
scan... | #include <stdio.h>
int search(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return (i != n);
}
int main() {
int A[10000 + 1], n, i, q, sum = 0, key;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++) {
scan... | replace | 20 | 21 | 20 | 21 | TLE | |
p02267 | C++ | Runtime Error | #include <iostream>
using namespace std;
int Linear_Search(int S[], int T[], int n, int q) {
int result = 0;
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (T[i] == S[j]) {
result++;
break;
}
}
}
return result;
}
int main() {
int S[1000], T[1000];
int n... | #include <iostream>
using namespace std;
int Linear_Search(int S[], int T[], int n, int q) {
int result = 0;
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (T[i] == S[j]) {
result++;
break;
}
}
}
return result;
}
int main() {
int S[10000], T[1000];
int ... | replace | 18 | 19 | 18 | 19 | 0 | |
p02267 | C++ | Runtime Error | #include <stdio.h>
int search(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return i != n;
}
int main() {
int i, n, A[1000 + 1], q, key, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("... | #include <stdio.h>
int search(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return i != n;
}
int main() {
int i, n, A[10000 + 1], q, key, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf(... | replace | 11 | 12 | 11 | 12 | 0 | |
p02267 | C++ | Runtime Error | //
// main.cpp
// ALDS1_4_A
//
// Created by ptyuan on 2018/10/22.
// Copyright © 2018 YY. All rights reserved.
//
#include <cstdio>
#include <iostream>
using namespace std;
int linearSearch(int *array, int n, int key) {
*(array + n) = key;
int i = 0;
while (array[i] != key) {
i++;
}
return i == n ?... | //
// main.cpp
// ALDS1_4_A
//
// Created by ptyuan on 2018/10/22.
// Copyright © 2018 YY. All rights reserved.
//
#include <cstdio>
#include <iostream>
using namespace std;
int linearSearch(int *array, int n, int key) {
*(array + n) = key;
int i = 0;
while (array[i] != key) {
i++;
}
return i == n ?... | replace | 23 | 24 | 23 | 24 | 0 | |
p02267 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
void fnInput(vector<int> &a_rvoTarget, vector<int> &a_rvoSearch) {
int iTargetCnt;
cin >> iTargetCnt;
a_rvoTarget.resize(iTargetCnt + 1);
for (int i = 0; i < iTargetCnt; i++)
cin >> a_rvoTarget[i];
int iSearchCnt;
cin >> iSearchCnt;
a_rvoS... | #include <iostream>
#include <vector>
using namespace std;
void fnInput(vector<int> &a_rvoTarget, vector<int> &a_rvoSearch) {
int iTargetCnt;
cin >> iTargetCnt;
a_rvoTarget.resize(iTargetCnt + 1);
for (int i = 0; i < iTargetCnt; i++)
cin >> a_rvoTarget[i];
int iSearchCnt;
cin >> iSearchCnt;
a_rvoS... | replace | 26 | 27 | 26 | 27 | -11 | |
p02267 | C++ | Runtime Error | #include <iostream>
using namespace std;
int searcher(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return (i != n);
}
int main() {
int A[1000 + 1], key, q, n;
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
cin >> q;
for (int i = 0; i < q; i++... | #include <iostream>
using namespace std;
int searcher(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return (i != n);
}
int main() {
int A[10000 + 10], key, q, n;
int sum = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
cin >> q;
for (int i = 0; i < q; i... | replace | 13 | 14 | 13 | 14 | 0 | |
p02267 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
bool flag[10000];
int main() {
int n, m;
cin >> n;
int s[10000], t[10000];
rep(i, n) cin >> s[i];
cin >> m;
int cnt = 0;
rep(i, m) cin >> t[i];
rep(i, n) {
rep(j, m) {
if (s[i] == t[j] && flag[s[i]] == ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
bool flag[1000000000];
signed main() {
int n, m;
cin >> n;
int s[10000], t[10000];
rep(i, n) cin >> s[i];
cin >> m;
int cnt = 0;
rep(i, m) cin >> t[i];
rep(i, n) {
rep(j, m) {
if (s[i] == t[j] && flag[s... | replace | 3 | 5 | 3 | 5 | 0 | |
p02267 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
typedef long long int lli;
lli s[20000], t[2000];
int main(void) {
int n, q;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%lld", &s[i]);
scanf("%d", &q);
for (int i = 0; i < q; i++)
scanf("%lld", &t[i]);
std::sort(s, s + n);
std::sort(t, t + q);
... | #include <algorithm>
#include <cstdio>
typedef long long int lli;
lli s[20000], t[2000];
int main(void) {
int n, q;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%lld", &s[i]);
scanf("%d", &q);
for (int i = 0; i < q; i++)
scanf("%lld", &t[i]);
std::sort(s, s + n);
std::sort(t, t + q);
... | replace | 20 | 21 | 20 | 21 | 0 | |
p02267 | C++ | Runtime Error | #include <cstdio>
using namespace std;
int a[1005];
bool Find(int n, int key) {
int i = 0;
a[n] = key;
while (a[i] != key)
i++;
if (i != n)
return true;
else
return false;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
int q, key, cnt = 0;
sca... | #include <cstdio>
using namespace std;
int a[10005];
bool Find(int n, int key) {
int i = 0;
a[n] = key;
while (a[i] != key)
i++;
if (i != n)
return true;
else
return false;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
int q, key, cnt = 0;
sc... | replace | 3 | 4 | 3 | 4 | 0 | |
p02268 | C++ | Runtime Error | #include <iostream>
using namespace std;
int A[10001], n;
int binarySearch(int key) {
int left = 0;
int right = n;
int i = 0;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid]) {
return 1;
}
if (key > A[mid])
left = mid + 1;
else if (key < A[mid])
... | #include <iostream>
using namespace std;
int A[100000], n;
int binarySearch(int key) {
int left = 0;
int right = n;
int i = 0;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid]) {
return 1;
}
if (key > A[mid])
left = mid + 1;
else if (key < A[mid])
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02268 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int binarySearch(int A[], int n, int key) {
size_t left = 0;
size_t right = n;
size_t mid = (left + right) / 2;
while (left < right) {
if (A[mid] == key)
return 1;
if (A[mid] < key)
left = mid + 1;
else if (A[mid] > key)
... | #include <algorithm>
#include <iostream>
using namespace std;
int binarySearch(int A[], int n, int key) {
size_t left = 0;
size_t right = n;
size_t mid = (left + right) / 2;
while (left < right) {
mid = (left + right) / 2;
if (A[mid] == key)
return 1;
if (A[mid] < key)
left = mid + 1;
... | insert | 9 | 9 | 9 | 10 | TLE | |
p02268 | C++ | Runtime Error | #include <iostream>
using namespace std;
int b[10 ^ 9 + 1];
int main() {
int n, q, s, t;
int ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
b[s]++;
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> t;
if (b[t] >= 1)
ans++;
}
cout << ans << endl;
return (0);
} | #include <iostream>
using namespace std;
int b[1000000010];
int main() {
int n, q, s, t;
int ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> s;
b[s]++;
}
cin >> q;
for (int i = 0; i < q; i++) {
cin >> t;
if (b[t] >= 1)
ans++;
}
cout << ans << endl;
return (0);
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02268 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int A[10000], B[10000], NA, NB;
int binarysearch(int key) {
int left = 0, right = NA - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (A[mid] == key)
return 1;
else if (A[mid] < key)
left = mid + 1;
else
righ... | #include <cstdio>
#include <iostream>
using namespace std;
int A[100000], B[100000], NA, NB;
int binarysearch(int key) {
int left = 0, right = NA - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (A[mid] == key)
return 1;
else if (A[mid] < key)
left = mid + 1;
else
ri... | replace | 4 | 5 | 4 | 5 | 0 | |
p02268 | C++ | Time Limit Exceeded | #include <stdio.h>
bool FindByBinarySearch(int x, int A[], int left, int right) {
int mid = (left + right) / 2;
if (x == A[mid])
return true;
if (x >= A[left] && x < A[mid])
return FindByBinarySearch(x, A, left, mid);
if (x > A[mid] && x <= A[right])
return FindByBinarySearch(x, A, mid + 1, right);... | #include <stdio.h>
bool FindByBinarySearch(int x, int A[], int left, int right) {
int mid = (left + right) / 2;
if (x == A[mid])
return true;
if (x >= A[left] && x < A[mid])
return FindByBinarySearch(x, A, left, mid);
if (x > A[mid] && x <= A[right])
return FindByBinarySearch(x, A, mid + 1, right);... | replace | 29 | 34 | 29 | 31 | TLE | |
p02268 | C++ | Time Limit Exceeded | #include <stdio.h>
#define N 100000
int count = 0;
void BinarySearch(int array[], int right, int left, int key) {
int mid = (right + left) / 2;
if (left > right) {
return;
}
if (array[mid] == key) {
count++;
return;
} else if (array[mid] < key) {
BinarySearch(array, right, mid + 1, key);
} ... | #include <stdio.h>
#define N 100000
int count = 0;
void BinarySearch(int array[], int right, int left, int key) {
while (left < right) {
int mid = (left + right) / 2;
if (array[mid] == key) {
count++;
break;
} else if (array[mid] < key) {
left = mid + 1;
} else {
right = mid;
... | replace | 4 | 16 | 4 | 14 | TLE | |
p02268 | C++ | Runtime Error | #include <iostream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
// 常に心してかかれ
// 簡単なことを簡単にできるように練習する
int main() {
int n;
int q;
int tmp;
int C = 0;
int num_to_check;
int S[10001];
int head;
int tail;
int mid; // 中央値
stack<int> T;
cin >> n;
for (int i = 0; i < n; ... | #include <iostream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
// 常に心してかかれ
// 簡単なことを簡単にできるように練習する
int main() {
int n;
int q;
int tmp;
int C = 0;
int num_to_check;
int S[100001];
int head;
int tail;
int mid; // 中央値
stack<int> T;
cin >> n;
for (int i = 0; i < n;... | replace | 13 | 14 | 13 | 14 | 0 | |
p02268 | C++ | Runtime Error | #include <stdio.h>
#define N 10000
int S[N], T[N];
int n, m;
int binary() {
int l, r, mid, i;
int count = 0;
for (i = 0; i < m; i++) {
l = 0;
r = n;
while (l < r) {
mid = (l + r) / 2;
if (S[mid] == T[i]) {
count++;
l = r;
} else if (T[i] < S[mid]) {
r = mid... | #include <stdio.h>
#define N 100000
int S[N], T[N];
int n, m;
int binary() {
int l, r, mid, i;
int count = 0;
for (i = 0; i < m; i++) {
l = 0;
r = n;
while (l < r) {
mid = (l + r) / 2;
if (S[mid] == T[i]) {
count++;
l = r;
} else if (T[i] < S[mid]) {
r = mi... | replace | 2 | 3 | 2 | 3 | 0 | |
p02268 | Python | Runtime Error | # -*- coding: utf-8 -*-
input()
s = set(input().split())
input()
t = set(input().split())
print(int(s & t))
| # -*- coding: utf-8 -*-
input()
s = set(input().split())
input()
t = set(input().split())
print(len(s & t))
| replace | 6 | 7 | 6 | 7 | TypeError: int() argument must be a string, a bytes-like object or a real number, not 'set' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02268/Python/s343168177.py", line 7, in <module>
print(int(s & t))
TypeError: int() argument must be a string, a bytes-like object or a real number, not 'set'
|
p02268 | Python | Runtime Error | def binarySearch(array, key):
left = 0
right = len(array)
while left < right:
mid = (left + right) / 2
if key == array[mid]:
return True
elif key > array[mid]:
left = mid + 1
elif key < array[mid]:
right = mid
else:
prin... | def binarySearch(array, key):
left = 0
right = len(array)
while left < right:
mid = int((left + right) / 2)
if key == array[mid]:
return True
elif key > array[mid]:
left = mid + 1
elif key < array[mid]:
right = mid
else:
... | replace | 4 | 5 | 4 | 5 | TypeError: list indices must be integers or slices, not float | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02268/Python/s716545650.py", line 21, in <module>
a = [x for x in t if binarySearch(s, x)]
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02268/Python/s716545650.py", line 21, in <listco... |
p02268 | C++ | Runtime Error | #include <iostream>
int n, S[100000];
int search(int T) {
int l = 0, r = n;
int mid;
while (l < r) {
mid = (l + r) / 2;
if (T == S[mid])
return 1;
if (T > S[mid])
l = mid + 1;
else if (T < S[mid])
r = mid;
}
return 0;
}
int main() {
int i, q;
int T[5000];
int count ... | #include <iostream>
int n, S[100000];
int search(int T) {
int l = 0, r = n;
int mid;
while (l < r) {
mid = (l + r) / 2;
if (T == S[mid])
return 1;
if (T > S[mid])
l = mid + 1;
else if (T < S[mid])
r = mid;
}
return 0;
}
int main() {
int i, q;
int T[50000];
int count... | replace | 22 | 23 | 22 | 23 | 0 | |
p02268 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, q;
cin >> n;
int S[n];
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
int T[q];
for (int i = 0; i < q; i++)
cin >> T[i];
int x = 0;
int mid;
int left = 0;
int right = n;
for (int j = 0; j < q; j++) {
left = 0;
rig... | #include <iostream>
using namespace std;
int main() {
int n, q;
cin >> n;
int S[n];
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
int T[q];
for (int i = 0; i < q; i++)
cin >> T[i];
int x = 0;
int mid;
int left = 0;
int right = n;
for (int j = 0; j < q; j++) {
left = 0;
rig... | replace | 29 | 30 | 29 | 30 | TLE | |
p02268 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[10000], b, c[10000], i, k = 0, j;
for (cin >> n, i = 0; i < n; i++)
cin >> a[i];
for (cin >> b, i = 0; i < b; i++)
cin >> c[i];
for (i = 0; i < b; i++)
if (binary_search(a, a + n, c[i]))
k++;
cout << k << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a[100000], b, c[50000], i, k = 0, j;
for (cin >> n, i = 0; i < n; i++)
cin >> a[i];
for (cin >> b, i = 0; i < b; i++)
cin >> c[i];
for (i = 0; i < b; i++)
if (binary_search(a, a + n, c[i]))
k++;
cout << k << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02268 | C++ | Runtime Error | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int A[10000], n;
int Search(int key) {
int l = 0;
int r = n;
int m;
while (l < r) {
m = (l + r) / 2;
if (A[m] < key)
l = m + 1;
if (A[m] > key)
r = m;
else if (A[m] == key)
return 1;
}
return 0;
... | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int A[100000], n;
int Search(int key) {
int l = 0;
int r = n;
int m;
while (l < r) {
m = (l + r) / 2;
if (A[m] < key)
l = m + 1;
if (A[m] > key)
r = m;
else if (A[m] == key)
return 1;
}
return 0;... | replace | 5 | 6 | 5 | 6 | 0 | |
p02268 | C++ | Runtime Error | // 含有标记的线性搜索可以将算法效率提高常数倍
// for(int i=0;i<n;i++)
// s[n]==key;while(s[i]!=key)i++;if(i!=n)
// 区别在于主循环中比较运算的次数
#include <cstdio>
#include <iostream>
using namespace std;
int s[10004];
int cnt, n;
/*void LinearSearch(int s[],int num)
{
for(int i=0;i<n;i++)
{
if(s[i]==num)
{... | // 含有标记的线性搜索可以将算法效率提高常数倍
// for(int i=0;i<n;i++)
// s[n]==key;while(s[i]!=key)i++;if(i!=n)
// 区别在于主循环中比较运算的次数
#include <cstdio>
#include <iostream>
using namespace std;
int s[100005];
int cnt, n;
/*void LinearSearch(int s[],int num)
{
for(int i=0;i<n;i++)
{
if(s[i]==num)
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02268 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
bool binSearch(int *s, int n, int target) {
int lo = 0;
int hi = n - 1;
while (lo <= hi) {
int mid = lo + (hi - lo) / 2;
if (s[mid] == target)
return true;
else if (target > s[mid])
lo = mid + 1;
else
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
bool binSearch(int *s, int n, int target) {
int lo = 0;
int hi = n - 1;
while (lo <= hi) {
int mid = lo + (hi - lo) / 2;
if (s[mid] == target)
return true;
else if (target > s[mid])
lo = mid + 1;
else
... | replace | 23 | 24 | 23 | 24 | 0 | |
p02268 | C++ | Runtime Error | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int S[10010];
int s, q;
bool binarySearch(int A[], int key) {
int left = 0;
int right = s - 1;
int mid;
while (left <= right) {
mid = (left + right) / 2;
if (A[mid] > key) {
right = mid - 1;
} else if (A[mid] <... | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int S[100100];
int s, q;
bool binarySearch(int A[], int key) {
int left = 0;
int right = s - 1;
int mid;
while (left <= right) {
mid = (left + right) / 2;
if (A[mid] > key) {
right = mid - 1;
} else if (A[mid] ... | replace | 7 | 8 | 7 | 8 | 0 | |
p02268 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
using namespace std;
int n, S[10000 + 1];
bool binarySearch(int key) {
int left = 0, right = n - 1, mid;
while (left <= right) {
mid = (left + right) / 2;
// printf("L, R, M, S[mid]: %d %d %d %d\n", left, right, mid, S[mid]);
if (key == S[mid])
return true... | #include <iostream>
#include <stdio.h>
using namespace std;
int n, S[100000 + 1];
bool binarySearch(int key) {
int left = 0, right = n - 1, mid;
while (left <= right) {
mid = (left + right) / 2;
// printf("L, R, M, S[mid]: %d %d %d %d\n", left, right, mid, S[mid]);
if (key == S[mid])
return tru... | replace | 4 | 5 | 4 | 5 | 0 | |
p02268 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
// returns the index of the element which value equals to key.
// if no elements matched, it returns -1.
int search(const vector<int> &x, int key) {
int left = 0, right = x.size();
while (left < right) {
int mid = (left + right) / 2;
if (x[mid] == ... | #include <iostream>
#include <vector>
using namespace std;
// returns the index of the element which value equals to key.
// if no elements matched, it returns -1.
int search(const vector<int> &x, int key) {
int left = 0, right = x.size();
while (left < right) {
int mid = (left + right) / 2;
if (x[mid] == ... | replace | 24 | 25 | 24 | 25 | -11 | |
p02268 | C++ | Time Limit Exceeded | //
// main.cpp
// binary_search
//
// Created by ???????????? on 2017/10/06.
// Copyright ?? 2017 ????????????. All rights reserved.
//
#include <iostream>
#include <stdio.h>
using namespace std;
bool binary_search(int A[], int n, int key) {
int left, mid, right;
left = 0;
right = n;
while (left < right)... | //
// main.cpp
// binary_search
//
// Created by ???????????? on 2017/10/06.
// Copyright ?? 2017 ????????????. All rights reserved.
//
#include <iostream>
#include <stdio.h>
using namespace std;
bool binary_search(int A[], int n, int key) {
int left, mid, right;
left = 0;
right = n;
while (left < right)... | replace | 24 | 25 | 24 | 25 | TLE | |
p02268 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | replace | 38 | 39 | 38 | 39 | TLE | |
p02268 | C++ | Time Limit Exceeded | #include <stdio.h>
int main(void) {
int n, S[10000], i, j, q, T[500], t, C, L, R, M;
scanf("%d", &n);
for (i = 0; i != n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (j = 0; j != q; j++) {
scanf("%d", &T[j]);
}
C = 0;
for (i = 0; i != q; i++) {
L = 0;
R = n;
while (L < R) {
... | #include <stdio.h>
int main(void) {
int n, S[100000], i, j, q, T[50000], t, C, L, R, M;
scanf("%d", &n);
for (i = 0; i != n; i++) {
scanf("%d", &S[i]);
}
scanf("%d", &q);
for (j = 0; j != q; j++) {
scanf("%d", &T[j]);
}
C = 0;
for (i = 0; i != q; i++) {
L = 0;
R = n;
while (L < R)... | replace | 2 | 3 | 2 | 3 | TLE | |
p02268 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
bool binSearch(int A[], int target, int size) {
int left = 0, right = size - 1, mid;
while (left <= right) {
mid = (left + right) / 2;
// cout << "left : " << left << ", right : " << right << ", mid : " << mid
// << endl;
if (A[mid] == target) {
// co... | #include <iostream>
using namespace std;
bool binSearch(int A[], int target, int size) {
int left = 0, right = size, mid;
while (left < right) {
mid = (left + right) / 2;
// cout << "left : " << left << ", right : " << right << ", mid : " << mid
// << endl;
if (A[mid] == target) {
// cout <<... | replace | 4 | 6 | 4 | 6 | TLE | |
p02268 | C++ | Runtime Error | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
int binarysearch(int a[], int n, int key) {
int left = 0;
int right = n;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (key == a[mid])
return 1;
if (key > a[mid])
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
int binarysearch(int a[], int n, int key) {
int left = 0;
int right = n;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (key == a[mid])
return 1;
if (key > a[mid])
... | replace | 24 | 25 | 24 | 25 | 0 | |
p02268 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, s[100000], q, t[50000], i, j, l, r, m, count = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
for (i = 0; i < q; i++) {
cin >> t[i];
}
// Binary Search
for (i = 0; i < q; i++) {
l = 0;
r = n;
while (l ... | #include <iostream>
using namespace std;
int main() {
int n, s[100000], q, t[50000], i, j, l, r, m, count = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
}
cin >> q;
for (i = 0; i < q; i++) {
cin >> t[i];
}
// Binary Search
for (i = 0; i < q; i++) {
l = 0;
r = n;
while (l ... | replace | 24 | 25 | 24 | 25 | TLE | |
p02268 | C++ | Runtime Error | #include <stdio.h>
int A[1000000], n;
int binarySearch(int key) {
int left = 0;
int right = n;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (A[mid] == key)
return 1;
if (key < A[mid])
right = mid;
else if (key > A[mid])
left = mid + 1;
}
return 0;
}
int m... | #include <stdio.h>
int A[1000000], n;
int binarySearch(int key) {
int left = 0;
int right = n;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (A[mid] == key)
return 1;
if (key < A[mid])
right = mid;
else if (key > A[mid])
left = mid + 1;
}
return 0;
}
int m... | replace | 25 | 26 | 25 | 26 | -11 | |
p02268 | C++ | Runtime Error | #include <stdio.h>
int A[1000000], n;
int binarySearch(int key) {
int left = 0;
int right = n;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (A[mid] == key)
return 1;
if (key < A[mid])
right = mid;
else if (key > A[mid])
left = mid + 1;
}
return 0;
}
int m... | #include <stdio.h>
int A[1000000], n;
int binarySearch(int key) {
int left = 0;
int right = n;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (A[mid] == key)
return 1;
if (key < A[mid])
right = mid;
else if (key > A[mid])
left = mid + 1;
}
return 0;
}
int m... | replace | 25 | 26 | 25 | 26 | -11 | |
p02268 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#define int long long
using namespace std;
int S[100100];
int n, q;
int T;
signed main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
int L = 0;
int R = n;
int cnt = 0;
int mid;
for (int i = 0; i < q; i++) {
cin... | #include <algorithm>
#include <cmath>
#include <iostream>
#define int long long
using namespace std;
int S[100100];
int n, q;
int T;
signed main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
cin >> q;
int L = 0;
int R = n;
int cnt = 0;
int mid;
for (int i = 0; i < q; i++) {
cin... | replace | 25 | 26 | 25 | 26 | TLE | |
p02268 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
ios_base::sync_with_stdio(false);
unsigned int list[100000];
int numOfList;
cin >> numOfList;
rep(i, numOfList) cin >> list[i];
int val;
int counter = 0;
cin >> val;
while (cin >> val) {
int... | #include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
ios_base::sync_with_stdio(false);
unsigned int list[100000];
int numOfList;
cin >> numOfList;
rep(i, numOfList) cin >> list[i];
int val;
int counter = 0;
cin >> val;
while (cin >> val) {
int... | insert | 24 | 24 | 24 | 25 | TLE | |
p02268 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
// ?????§????´¢
bool BinarySearch(int A[], int n, int key) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid])
return true;
if (key > A[mid])
left = mid + 1;
if (key < A[mid])
... | #include <cstdio>
#include <iostream>
using namespace std;
// ?????§????´¢
bool BinarySearch(int A[], int n, int key) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid])
return true;
if (key > A[mid])
left = mid + 1;
if (key < A[mid])
... | replace | 23 | 24 | 23 | 24 | 0 | |
p02268 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
constexpr int Nmax = 100'000;
bool binarySearch(int *array, int value, int n) {
int left = 0;
int right = n - 1;
int center = (left + right) / 2;
while (array[center] != value) {
if (left == right) {
return false;
}... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
constexpr int Nmax = 100'000;
bool binarySearch(int *array, int value, int n) {
int left = 0;
int right = n - 1;
int center = (left + right) / 2;
while (array[center] != value) {
if (left >= right) {
return false;
}... | replace | 13 | 14 | 13 | 14 | TLE | |
p02268 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int ans = 0;
bool answer(int n, long num[], int p) {
if (n == num[p]) {
ans++;
return true;
}
return false;
}
int main() {
int s, t, n;
cin >> s;
long num[s];
for (int i = 0; i < s; i++)
cin >> num[i];
cin >> t;
for (int i = 0; i < t; i++) {
... | #include <iostream>
using namespace std;
int ans = 0;
bool answer(int n, long num[], int p) {
if (n == num[p]) {
ans++;
return true;
}
return false;
}
int main() {
int s, t, n;
cin >> s;
long num[s];
for (int i = 0; i < s; i++)
cin >> num[i];
cin >> t;
for (int i = 0; i < t; i++) {
... | replace | 35 | 37 | 35 | 37 | TLE | |
p02268 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
long long S[10000], T;
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
int count = 0;
for (int j = 0; j < q; j++) {
cin >> T;
int left = 0;
int right = n;
int mid = (left + right) / 2;
while (lef... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, q;
long long S[1000000], T;
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
int count = 0;
for (int j = 0; j < q; j++) {
cin >> T;
int left = 0;
int right = n;
int mid = (left + right) / 2;
while (l... | replace | 7 | 8 | 7 | 8 | 0 | |
p02268 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
static const size_t n_max = 10000;
static int S[n_max];
int main() {
size_t n, q;
scanf("%zu", &n);
for (size_t i = 0; i < n; i++)
scanf("%d", S + i);
scanf("%zu", &q);
int c = 0;
for (size_t i = 0; i < q; i++) {
int t;
scanf("%d", &t);
if (std::binar... | #include <algorithm>
#include <cstdio>
static const size_t n_max = 100000;
static int S[n_max];
int main() {
size_t n, q;
scanf("%zu", &n);
for (size_t i = 0; i < n; i++)
scanf("%d", S + i);
scanf("%zu", &q);
int c = 0;
for (size_t i = 0; i < q; i++) {
int t;
scanf("%d", &t);
if (std::bina... | replace | 3 | 4 | 3 | 4 | 0 | |
p02268 | C++ | Time Limit Exceeded | #include <cstdio>
int A[1000000], n;
int binarySearch(int key) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid])
return 1;
else if (key < A[mid])
right = mid;
else if (key > A[mid])
left = mid;
}
return 0;
}
int main() {
... | #include <cstdio>
int A[1000000], n;
int binarySearch(int key) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid])
return 1;
else if (key < A[mid])
right = mid;
else if (key > A[mid])
left = mid + 1;
}
return 0;
}
int main() ... | replace | 14 | 15 | 14 | 15 | TLE | |
p02268 | C++ | Runtime Error | #include <stdio.h>
int main() {
int i, n, j, k, o, count = 0;
int a[10001];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
int left = 0, right = n - 1;
int cur = n / 2;
scanf("%d", &k);
for (i = 0; i < k; i++) {
scanf("%d", &o);
left = 0, right = n - 1;
while (1) {
if... | #include <stdio.h>
int main() {
int i, n, j, k, o, count = 0;
int a[1000001];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
int left = 0, right = n - 1;
int cur = n / 2;
scanf("%d", &k);
for (i = 0; i < k; i++) {
scanf("%d", &o);
left = 0, right = n - 1;
while (1) {
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02268 | C++ | Runtime Error | #include <cstdio>
int main(int argc, char const *argv[]) {
int n, q, target;
int findCount = 0; // ???????????£?????°????????°
int inputSequence[10000];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &inputSequence[i]);
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", ... | #include <cstdio>
int main(int argc, char const *argv[]) {
int n, q, target;
int findCount = 0; // ???????????£?????°????????°
int inputSequence[100000];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &inputSequence[i]);
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d",... | replace | 5 | 6 | 5 | 6 | 0 | |
p02268 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, a[10000], m, b, result = 0, i, j;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
cin >> m;
for (i = 0; i < m; i++) {
cin >> b;
for (j = 0; j < n; j++)
if (b == a[j]) {
result++;
break;
}
}
cout << resul... | #include <iostream>
using namespace std;
int main() {
int n, a[100000], m, b, result = 0, i, j;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
cin >> m;
for (i = 0; i < m; i++) {
cin >> b;
for (j = 0; j < n; j++)
if (b == a[j]) {
result++;
break;
}
}
cout << resu... | replace | 4 | 5 | 4 | 5 | 0 | |
p02268 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int search(int);
int n, S[100000];
int main() {
int q, T[50000], counter = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (int i = 0; i < q; i++)
cin >> T[i];
sort(S, S + n);
for (int i = 0; i < q; i++)
... | #include <algorithm>
#include <iostream>
using namespace std;
int search(int);
int n, S[100000];
int main() {
int q, T[50000], counter = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> S[i];
cin >> q;
for (int i = 0; i < q; i++)
cin >> T[i];
sort(S, S + n);
for (int i = 0; i < q; i++)
... | replace | 35 | 36 | 35 | 36 | TLE | |
p02268 | C++ | Runtime Error | #include <iostream>
using namespace std;
int a[10000], b[10000];
int binary(int l, int r, int c) {
while (l <= r) {
int p = (l + r) / 2, x, y;
if (a[p] == c)
return 1;
else if (c < a[p])
r = p - 1;
else
l = p + 1;
}
return 0;
}
int ar(int n) {
for (int i = 0; i < n; i++) {
... | #include <iostream>
using namespace std;
int a[100000], b[100000];
int binary(int l, int r, int c) {
while (l <= r) {
int p = (l + r) / 2, x, y;
if (a[p] == c)
return 1;
else if (c < a[p])
r = p - 1;
else
l = p + 1;
}
return 0;
}
int ar(int n) {
for (int i = 0; i < n; i++) {
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02268 | C++ | Runtime Error | #include <iostream>
using namespace std;
int n, S[10010], q, key, cnt = 0;
int search() {
int left = 0, right = n, med;
while (left < right) {
med = (left + right) / 2;
if (S[med] == key)
return 1;
else if (S[med] < key)
left = med + 1;
else
right = med;
}
return 0;
}
int ma... | #include <iostream>
using namespace std;
int n, S[100010], q, key, cnt = 0;
int search() {
int left = 0, right = n, med;
while (left < right) {
med = (left + right) / 2;
if (S[med] == key)
return 1;
else if (S[med] < key)
left = med + 1;
else
right = med;
}
return 0;
}
int m... | replace | 3 | 4 | 3 | 4 | 0 | |
p02268 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int binSearch(int A[], int n, int key) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (A[mid] == key)
return 1;
else if (A[mid] < key)
left = mid + 1; //+1???????????¨??????????... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int binSearch(int A[], int n, int key) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (A[mid] == key)
return 1;
else if (A[mid] < key)
left = mid + 1; //+1???????????¨??????????... | replace | 20 | 21 | 20 | 21 | 0 | |
p02268 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int binSearch(int A[], int n, int key) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid])
return 1;
if (key < A[mid])
right = mid;
if (key > A[mid])
left = mid + 1;
}
r... | #include <cstdio>
#include <iostream>
using namespace std;
int binSearch(int A[], int n, int key) {
int left = 0, right = n, mid;
while (left < right) {
mid = (left + right) / 2;
if (key == A[mid])
return 1;
if (key < A[mid])
right = mid;
if (key > A[mid])
left = mid + 1;
}
r... | replace | 20 | 21 | 20 | 21 | 0 | |
p02268 | C++ | Time Limit Exceeded | #include <iostream>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
int n, p, S[100000], T[100000];
bool exist;
cin >> n;
rep(i, n) cin >> S[i];
cin >> p;
rep(i, p) cin >> T[i];
int h;
rep(i, n) {
int ch = i;
REP(j, i, n) {
... | #include <iostream>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
int main() {
int n, p, S[100000], T[100000];
bool exist;
cin >> n;
rep(i, n) cin >> S[i];
cin >> p;
rep(i, p) cin >> T[i];
int count = 0;
rep(i, p) {
int lef = 0, rig = n;
... | delete | 12 | 24 | 12 | 12 | TLE | |
p02268 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int BSearch(int x, int A[], int N) {
int left = 0;
int right = N;
while (left <= right) {
int mid = (left + right) / 2;
if (A[mid] == x) {
return mid;
} else if (x < A[mid]) {
right = mid;
} else {
left = mid + 1;
}
}
return -1;... | #include <iostream>
using namespace std;
int BSearch(int x, int A[], int N) {
int left = 0;
int right = N;
while (left < right) {
int mid = (left + right) / 2;
if (A[mid] == x) {
return mid;
} else if (x < A[mid]) {
right = mid;
} else {
left = mid + 1;
}
}
return -1;
... | replace | 7 | 8 | 7 | 8 | TLE | |
p02268 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool binarySearch(vector<int> vi, int t) {
int right = vi.size() - 1;
int left = 0;
bool flg = true;
while (flg) {
if (right == left)
flg = false;
int center = (left + right) / 2;
if (vi[center] < t) {
left... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool binarySearch(vector<int> vi, int t) {
int right = vi.size() - 1;
int left = 0;
bool flg = true;
while (flg) {
if (right == left)
flg = false;
int center = (left + right) / 2;
if (vi[center] < t) {
left... | replace | 15 | 16 | 15 | 16 | TLE | |
p02268 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int s[100000], n;
int binsearch(int key) {
int left = 0, right = n, mid = (left + right) / 2;
while (left < right) {
if (s[mi... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int s[100000], n;
int binsearch(int key) {
int left = 0, right = n, mid = (left + right) / 2;
while (left < right) {
if (s[mi... | replace | 22 | 23 | 22 | 23 | TLE | |
p02268 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, q;
cin >> n;
int *S = new int[n];
int number;
for (int i; i < n; ++i) {
cin >> number;
S[i] = number;
}
cin >> q;
int *T = new int[q];
for (int i = 0; i < q; ++i) {
cin >> number;
T[i] = number;
}
int cnt = 0;
for (in... | #include <iostream>
using namespace std;
int main() {
int n, q;
cin >> n;
int *S = new int[n];
int number;
for (int i; i < n; ++i) {
cin >> number;
S[i] = number;
}
cin >> q;
int *T = new int[q];
for (int i = 0; i < q; ++i) {
cin >> number;
T[i] = number;
}
int cnt = 0;
for (in... | replace | 30 | 31 | 30 | 31 | TLE | |
p02268 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define fori(i, k, n) for (int i = k; i < (int)n; i++)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define fori(i, k, n) for (int i = k; i < (int)n; i++)... | replace | 43 | 53 | 43 | 44 | TLE | |
p02268 | C++ | Runtime Error | //
// main.cpp
// ALDS1_4_B
//
// Created by ptyuan on 2018/10/23.
// Copyright © 2018 YY. All rights reserved.
//
#include <cstdio>
#include <iostream>
static const int kNotFound = -1;
int binarySearch(int *array, int n, int key) {
int low = 0;
int hight = n - 1;
while (low <= hight) {
int middle = (l... | //
// main.cpp
// ALDS1_4_B
//
// Created by ptyuan on 2018/10/23.
// Copyright © 2018 YY. All rights reserved.
//
#include <cstdio>
#include <iostream>
static const int kNotFound = -1;
int binarySearch(int *array, int n, int key) {
int low = 0;
int hight = n - 1;
while (low <= hight) {
int middle = (l... | replace | 33 | 34 | 33 | 34 | 0 | |
p02268 | C++ | Time Limit Exceeded | #include <cstdio>
#include <cstdlib>
#include <iostream>
int main() {
int n, q;
std::cin >> n;
int *S = new int[n];
for (int i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
std::cin >> q;
int *T = new int[q];
for (int i = 0; i < q; i++) {
scanf("%d", &T[i]);
}
int cnt = 0;
for (int i = 0; i <... | #include <cstdio>
#include <cstdlib>
#include <iostream>
int main() {
int n, q;
std::cin >> n;
int *S = new int[n];
for (int i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
std::cin >> q;
int *T = new int[q];
for (int i = 0; i < q; i++) {
scanf("%d", &T[i]);
}
int cnt = 0;
for (int i = 0; i <... | replace | 26 | 27 | 26 | 30 | TLE | |
p02268 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int s[10000];
int main() {
int n;
scanf("%d", &n);
rep(i, n) scanf("%d", &s[i]);
int q;
scanf("%d", &q);
int cnt = 0;
rep(i, q) {
int t;
scanf("%d", &t);
if (binary_search(s, s + n, t))
cnt++;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int s[100000];
int main() {
int n;
scanf("%d", &n);
rep(i, n) scanf("%d", &s[i]);
int q;
scanf("%d", &q);
int cnt = 0;
rep(i, q) {
int t;
scanf("%d", &t);
if (binary_search(s, s + n, t))
cnt++;
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02268 | C++ | Time Limit Exceeded | #include <cstdio>
using namespace std;
int S[1000000], n;
int serch(int key) {
int left = 0, right, mid;
right = n;
while (left < right) {
mid = (left + right) / 2;
if (key == S[mid])
return 1;
if (key > S[mid])
left = mid;
else if (key < S[mid])
right = mid;
}
return 0;
}
in... | #include <cstdio>
using namespace std;
int S[1000000], n;
int serch(int key) {
int left = 0, right, mid;
right = n;
while (left < right) {
mid = (left + right) / 2;
if (key == S[mid])
return 1;
if (key > S[mid])
left = mid + 1;
else if (key < S[mid])
right = mid;
}
return 0;
... | replace | 11 | 12 | 11 | 12 | TLE | |
p02268 | C++ | Time Limit Exceeded | #include <cstdio>
#include <vector>
using namespace std;
bool binary_search(int target, int low, int high, vector<int> &S) {
int mid = low + (high - low) / 2;
if (S.at(mid) == target) {
return true;
}
if (low == high)
return false;
if (S.at(mid) > target) {
return binary_search(target, low, mid -... | #include <cstdio>
#include <vector>
using namespace std;
bool binary_search(int target, int low, int high, vector<int> &S) {
int mid = low + (high - low) / 2;
if (S.at(mid) == target) {
return true;
}
if (low >= high)
return false;
if (S.at(mid) > target) {
return binary_search(target, low, mid -... | replace | 9 | 10 | 9 | 10 | TLE | |
p02268 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, q, s[100001], t, ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> t;
int l = 0, r = n, m;
while (l < r) {
m = (l + r) / 2;
if (t < s[m])
r = m;
else ... | #include <iostream>
using namespace std;
int main() {
int n, q, s[100001], t, ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> s[i];
cin >> q;
for (int i = 0; i < q; i++) {
cin >> t;
int l = 0, r = n, m;
while (l < r) {
m = (l + r) / 2;
if (t < s[m])
r = m;
else ... | replace | 16 | 17 | 16 | 17 | TLE | |
p02268 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int S[n];
for (int i = 0; i < n; i++) {
cin >> S[i];
}
int q;
cin >> q;
int T[q];
for (int i = 0; i < q; i++) {
cin >> T[i];
}
int cnt = 0;
for (int ti = 0; ti < q; ti++) {
int left = 0, right = n, mid;
whi... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int S[n];
for (int i = 0; i < n; i++) {
cin >> S[i];
}
int q;
cin >> q;
int T[q];
for (int i = 0; i < q; i++) {
cin >> T[i];
}
int cnt = 0;
for (int ti = 0; ti < q; ti++) {
int left = 0, right = n, mid;
whi... | replace | 29 | 30 | 29 | 30 | TLE | |
p02268 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdio.h>
using namespace std;
int search(int A[], int n, int key) {
int i = 0;
A[n] = key;
while (A[i] != key)
i++;
return i != n;
}
int main() {
int n;
scanf("%d", &n);
int S[n];
for (int i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
int q;
scanf("%d", &q);
... | #include <iostream>
#include <stdio.h>
using namespace std;
int search(int A[], int n, int key) {
int left = 0;
int right = n;
while (left < right) {
int mid = (left + right) / 2;
if (A[mid] == key) {
return 1;
} else if (key < A[mid]) {
right = mid;
} else {
left = mid + 1;
... | replace | 5 | 10 | 5 | 18 | TLE | |
p02268 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
bool binarySearch(vector<int> vec, int target) {
int l = 0;
int r = vec.size();
while (l < r) {
int mid = (l + r) / 2;
if (vec[mid] == target) {
return (true);
} else if (vec[mid] < target) {
l = mid + 1;
} else {
r = m... | #include <iostream>
#include <vector>
using namespace std;
bool binarySearch(vector<int> vec, int target) {
int l = 0;
int r = vec.size();
while (l < r) {
int mid = (l + r) / 2;
if (vec[mid] == target) {
return (true);
} else if (vec[mid] < target) {
l = mid + 1;
} else {
r = m... | replace | 36 | 41 | 36 | 38 | TLE | |
p02268 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
using ll = long long;
using ld = long double;
#define int ll
#define INF 1e9
#define EPS 0.0000000001
#define rep... | #include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
using ll = long long;
using ld = long double;
#define int ll
#define INF 1e9
#define EPS 0.0000000001
#define rep... | replace | 48 | 49 | 48 | 49 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.