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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p00090 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | replace | 44 | 47 | 44 | 45 | TLE | |
p00090 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | replace | 36 | 37 | 36 | 37 | TLE | |
p00091 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int n;
int a[10][10];
int res[3][12][2];
int ii, jj, kk;
int dy1[] = {-2, -1, -1, -1, 0, 0, 0, 0, 0, 1, 1, 1, 2};
int dx1[] = {0, -1, 0, 1, -2, -1, 0, 1, 2, -1, 0, 1, 0};
int dy2[] = {-1, -1, -1, 0, 0, 0, 1, ... | #include <cmath>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
int n;
int a[10][10];
int res[3][12][2];
int ii, jj, kk;
int dy1[] = {-2, -1, -1, -1, 0, 0, 0, 0, 0, 1, 1, 1, 2};
int dx1[] = {0, -1, 0, 1, -2, -1, 0, 1, 2, -1, 0, 1, 0};
int dy2[] = {-1, -1, -1, 0, 0, 0, 1, ... | insert | 31 | 31 | 31 | 33 | TLE | |
p00091 | C++ | Time Limit Exceeded | #include <iostream>
#include <numeric>
using namespace std;
int Y[12], X[12], S[12];
int g[10][10];
const int W = 13 * 12 + 1;
bool dp[13][W] = {true};
bool dfs(int y, int x, int s, int n) {
int sum = accumulate(g[0], g[10], 0);
if (!dp[n][sum])
return false;
if (n == 0)
return true;
for (int i = s; ... | #include <iostream>
#include <numeric>
using namespace std;
int Y[12], X[12], S[12];
int g[10][10];
const int W = 13 * 12 + 1;
bool dp[13][W] = {true};
bool dfs(int y, int x, int s, int n) {
int sum = accumulate(g[0], g[10], 0);
if (!dp[n][sum])
return false;
if (n == 0)
return true;
for (int i = s; ... | insert | 53 | 53 | 53 | 55 | TLE | |
p00091 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
//{{{ uf.hpp
#ifndef INCLUDE_UF_HPP
#define INCLUDE_UF_HPP
#include <algorithm>
#include <vector>
namespace orislib {
namespace ds {
//{{{ UF merge, same, root, size, count
struct UF {
std::vector<int> data;
int cnt;
UF(int n) : data(n, -1), cnt(n) {}
bool merge(int a, int b) {
a =... | #include <bits/stdc++.h>
//{{{ uf.hpp
#ifndef INCLUDE_UF_HPP
#define INCLUDE_UF_HPP
#include <algorithm>
#include <vector>
namespace orislib {
namespace ds {
//{{{ UF merge, same, root, size, count
struct UF {
std::vector<int> data;
int cnt;
UF(int n) : data(n, -1), cnt(n) {}
bool merge(int a, int b) {
a =... | replace | 237 | 248 | 237 | 258 | TLE | |
p00091 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
vector<vector<char>> S;
int n;
bool dp[13][160];
int LIM2 = 0;
int _size = 0;
int CC = 0;
vector<vector<char>> solve(vector<vector<char>> p, int x, int y, int r) {
if (... | #include <algorithm>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
vector<vector<char>> S;
int n;
bool dp[13][160];
int LIM2 = 0;
int _size = 0;
int CC = 0;
vector<vector<char>> solve(vector<vector<char>> p, int x, int y, int r) {
if (... | replace | 97 | 98 | 97 | 98 | TLE | |
p00091 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
using namespace std;
struct aa {
int x;
int y;
int t;
aa(int a, int b, int c) {
x = a;
y = b;
t = c;
}
};
int inks[3][5][5] = {
{
{0, 0, 0, 0, 0},
{0, 0, 1, 0, 0},
{0, 1, 1, 1, 0},
{0, ... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
using namespace std;
struct aa {
int x;
int y;
int t;
aa(int a, int b, int c) {
x = a;
y = b;
t = c;
}
};
int inks[3][5][5] = {
{
{0, 0, 0, 0, 0},
{0, 0, 1, 0, 0},
{0, 1, 1, 1, 0},
{0, ... | insert | 75 | 75 | 75 | 83 | TLE | |
p00092 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define PB push_back
#define INF INT_MAX / 3
#define ALL(a) (a).begin(), (a).end()
#... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define PB push_back
#define INF INT_MAX / 3
#define ALL(a) (a).begin(), (a).end()
#... | insert | 40 | 40 | 40 | 43 | TLE | |
p00092 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0) {
break;
}
vector<vector<char>> d(n, vector<char>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> d[i][j];
}
}
v... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0) {
break;
}
vector<vector<char>> d(n, vector<char>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> d[i][j];
}
}
v... | replace | 37 | 38 | 37 | 38 | TLE | |
p00092 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
const int INF... | #include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
const int INF... | replace | 34 | 35 | 34 | 35 | TLE | |
p00092 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int dp[1001][1001];
int latte(int i, int j, int k) {
return dp[i + k][j + k] - dp[i + k][j - 1] - dp[i - 1][j + k] +
dp[i - 1][j - 1];
}
int main() {
int n;
while (cin >> n, n) {
fill(dp[0], dp[0] + 1001... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int dp[1001][1001];
int latte(int i, int j, int k) {
return dp[i + k][j + k] - dp[i + k][j - 1] - dp[i - 1][j + k] +
dp[i - 1][j - 1];
}
int main() {
int n;
while (cin >> n, n) {
fill(dp[0], dp[0] + 1001... | replace | 28 | 29 | 28 | 29 | 0 | |
p00092 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
#define MAX 504
int hseq[MAX][MAX];
int vseq[MAX][MAX];
int sq[MAX][MAX];
char f[MAX][MAX];
int main() {
while (true) {
int n;
scanf("%d", &n);
if (n == 0)
break;
int ans = 0;
for (int y = 1; y <= n; ++y) {
scanf("%s", &f[y]... | #include <algorithm>
#include <cstdio>
using namespace std;
#define MAX 1004
int hseq[MAX][MAX];
int vseq[MAX][MAX];
int sq[MAX][MAX];
char f[MAX][MAX];
int main() {
while (true) {
int n;
scanf("%d", &n);
if (n == 0)
break;
int ans = 0;
for (int y = 1; y <= n; ++y) {
scanf("%s", &f[y... | replace | 3 | 4 | 3 | 4 | 0 | |
p00092 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int n, ans = 0;
int dp[110][110];
char field;
while (scanf("%d", &n), n) {
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
scanf(" %c", &field);
dp[j + 1][i + 1] = 0;
if (field == '*')
... | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int n, ans = 0;
int dp[1100][1100];
char field;
while (scanf("%d", &n), n) {
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
scanf(" %c", &field);
dp[j + 1][i + 1] = 0;
if (field == '*')
... | replace | 5 | 6 | 5 | 6 | 0 | |
p00092 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
using namespace std;
int n;
int ans;
int dp[10000][10000];
int main() {
while (1) {
scanf("%d", &n);
if (n == 0)
return 0;
ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
char c;
scanf("%c ", &c);
if (c ... | #include <algorithm>
#include <cstdio>
using namespace std;
int n;
int ans;
int dp[10000][10000];
int main() {
while (1) {
scanf("%d", &n);
if (n == 0)
return 0;
ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
char c;
scanf(" %c", &c);
if (c ... | replace | 18 | 19 | 18 | 19 | TLE | |
p00092 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int w[1005][1005];
int main() {
string s[1005];
int n;
while (cin >> n && n) {
memset(w, 0, siz... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#define REP(i, k, n) for (int i = k; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int w[1005][1005];
int main() {
string s[1005];
int n;
while (cin >> n && n) {
memset(w, 0, siz... | replace | 29 | 31 | 29 | 31 | 0 | |
p00092 | C++ | Runtime Error | #include <cctype>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repi(i, l, n) for (int(i) = (int)(l); (i) < (int)(n); (i)++... | #include <cctype>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repi(i, l, n) for (int(i) = (int)(l); (i) < (int)(n); (i)++... | replace | 40 | 42 | 40 | 42 | 0 | |
p00092 | C++ | Time Limit Exceeded | // 23
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
for (int n; cin >> n, n;) {
int c[1000] = {};
int ans = 0;
for (int i = 0; i < n; i++) {
char l[1001];
cin >> l;
int cl[1000];
for (int j = 0; j < n; j++) {
cl[j] = (l[j] =... | // 23
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
for (int n; cin >> n, n;) {
int c[1000] = {};
int ans = 0;
for (int i = 0; i < n; i++) {
char l[1001];
cin >> l;
int cl[1000];
for (int j = 0; j < n; j++) {
cl[j] = (l[j] =... | replace | 18 | 19 | 18 | 19 | TLE | |
p00092 | C++ | Runtime Error | #include <algorithm> // require sort next_permutation count __gcd reverse etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath> // require fabs
#include <cstdio> // require scanf printf
#include <cstdlib> // require abs exit atof atoi
#include <cstring> // requir... | #include <algorithm> // require sort next_permutation count __gcd reverse etc.
#include <cctype> // require tolower, toupper
#include <cfloat>
#include <climits>
#include <cmath> // require fabs
#include <cstdio> // require scanf printf
#include <cstdlib> // require abs exit atof atoi
#include <cstring> // requir... | replace | 30 | 32 | 30 | 32 | 0 | |
p00092 | C++ | Time Limit Exceeded | // Name: Square Searching
// Level: 2
// Category: 動的計画法,DP,累積和
// Note:
/*
* 座標(0,0)と(r,c)をそれぞれ左上，右下に持つ矩形を考えて，その中の*の数を記憶しておく．
* これを使うと任意の矩形内の*の数がO(1)で求められる．
* 正方形の左上は任意に決められるのでN^2通り存在し，それに対応する右下の決め方は高々N通りである．
* (正方形であることに注意)．
* したがって，ナイーブに探索するとO(N^3)個の正方形について内部の*の数を数え，0個のもののサイズを覚えればよい．
*/
#include <algorithm>
#... | // Name: Square Searching
// Level: 2
// Category: 動的計画法,DP,累積和
// Note:
/*
* 座標(0,0)と(r,c)をそれぞれ左上，右下に持つ矩形を考えて，その中の*の数を記憶しておく．
* これを使うと任意の矩形内の*の数がO(1)で求められる．
* 正方形の左上は任意に決められるのでN^2通り存在し，それに対応する右下の決め方は高々N通りである．
* (正方形であることに注意)．
* したがって，ナイーブに探索するとO(N^3)個の正方形について内部の*の数を数え，0個のもののサイズを覚えればよい．
*/
#include <algorithm>
#... | replace | 45 | 46 | 45 | 46 | TLE | |
p00092 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#define INF 2100000000
using namespace std;
int minix(int a, int b, int c) {
if (b >= a && c >= a) {
return a;
}
if (a >= b && c >= b) {
return b;
}
if (b >= c && a >= c) {
return c;
}
}
int main() {
int n;
int masu[102][102];
int ura[102][102];
... | #include <cstdio>
#include <iostream>
#define INF 2100000000
using namespace std;
int minix(int a, int b, int c) {
if (b >= a && c >= a) {
return a;
}
if (a >= b && c >= b) {
return b;
}
if (b >= c && a >= c) {
return c;
}
}
int main() {
int n;
int masu[1002][1002];
int ura[1002][1002]... | replace | 21 | 23 | 21 | 23 | 0 | |
p00092 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int isSquare(string map[], int x, int y, int size) {
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
int nx = x + j, ny = y + i;
if (nx >= map[0].length() || ny >= map[0].length())
return 0;
if (map[ny][nx] == ... | #include <iostream>
#include <string>
using namespace std;
int isSquare(string map[], int x, int y, int size) {
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
int nx = x + j, ny = y + i;
if (nx >= map[0].length() || ny >= map[0].length())
return 0;
if (map[ny][nx] == ... | replace | 24 | 25 | 24 | 25 | 0 | |
p00092 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <stdio.h>
int n;
using namespace std;
/*
int main(){
n=1000;
box = new int*[n];
for(int i=0; i<n; i++)box[i] = new int[n];
while(cin>>n){
if(n==0)break;
char c;
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
... | #include <algorithm>
#include <iostream>
#include <stdio.h>
int n;
using namespace std;
/*
int main(){
n=1000;
box = new int*[n];
for(int i=0; i<n; i++)box[i] = new int[n];
while(cin>>n){
if(n==0)break;
char c;
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
... | replace | 176 | 177 | 176 | 177 | TLE | |
p00092 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
for (; cin >> n, n;) {
string map[n];
int sum[n][n];
for (int i = 0; i < n; i++) {
cin >> map[i];
for (int j = 0; j < n; j++) {
int tmp = 0;
if (j > 0)
tmp += sum[i]... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
for (; cin >> n, n;) {
string map[n];
int sum[n][n];
for (int i = 0; i < n; i++) {
cin >> map[i];
for (int j = 0; j < n; j++) {
int tmp = 0;
if (j > 0)
tmp += sum[i]... | replace | 32 | 33 | 32 | 33 | TLE | |
p00092 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int dp[1002][1002];
int main() {
int n;
while (scanf("%d", &n), n) {
int ret = 0;
char line[101];
for (int i = 1; i <= n; ++i) {
scanf("%s", line);
for (int j = 0; j < n; ++j) {
if (line[j] == '.') {
... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int dp[1002][1002];
int main() {
int n;
while (scanf("%d", &n), n) {
int ret = 0;
char line[1001];
for (int i = 1; i <= n; ++i) {
scanf("%s", line);
for (int j = 0; j < n; ++j) {
if (line[j] == '.') {
... | replace | 11 | 12 | 11 | 12 | 0 | |
p00093 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int x[10000], y[10000][10000], a, b, cnt2;
void uruu(int s) {
for (int i = 0; i < s; i++) {
if ((i % 4 == 0 && i % 100 != 0) || i % 400 == 0) {
x[i] = 1;
}
}
}
void hantei(int start, int end) {
int cnt = 0;
for (int i = start; i <= end; i++) {
if (x[i... | #include <iostream>
using namespace std;
int x[10000], y[10000][10000], a, b, cnt2;
void uruu(int s) {
for (int i = 0; i < s; i++) {
if ((i % 4 == 0 && i % 100 != 0) || i % 400 == 0) {
x[i] = 1;
}
}
}
void hantei(int start, int end) {
int cnt = 0;
for (int i = start; i <= end; i++) {
if (x[i... | insert | 29 | 29 | 29 | 32 | TLE | |
p00094 | C++ | Time Limit Exceeded | #include <cstdio>
int main() {
int a, b;
for (; scanf("%d%d", &a, &b);)
printf("%f", (double)a * b / 3.305785);
} | #include <cstdio>
int main() {
int a, b;
for (; ~scanf("%d%d", &a, &b);)
printf("%f", (double)a * b / 3.305785);
} | replace | 3 | 4 | 3 | 4 | TLE | |
p00095 | C++ | Time Limit Exceeded | #include <stdio.h>
int main() {
int x, y, n;
int X = 0, Y = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d %d", &x, &y);
if (i = 0) {
Y = y;
X = x;
}
if (Y == y && x < X) {
X = x;
Y = y;
} else if (Y < y) {
X = x;
Y = y;
}
}
print... | #include <stdio.h>
int main() {
int x, y, n;
int X = 0, Y = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d %d", &x, &y);
if (i == 0) {
Y = y;
X = x;
}
if (Y == y && x < X) {
X = x;
Y = y;
} else if (Y < y) {
X = x;
Y = y;
}
}
prin... | replace | 11 | 12 | 11 | 12 | TLE | |
p00096 | C++ | Runtime Error | #include <iostream>
using namespace std;
int ab[2001];
int main() {
int n;
while (cin >> n) {
int ans = 0;
for (int i = 0; i < 2001; i++)
ab[i] = 0;
for (int a = 0; a <= 1000; a++)
for (int b = 0; b <= 1000; b++)
ab[a + b]++;
for (int c = 0; c <= 1000; c++)
for (int ... | #include <iostream>
using namespace std;
int ab[2001];
int main() {
int n;
while (cin >> n) {
int ans = 0;
for (int i = 0; i < 2001; i++)
ab[i] = 0;
for (int a = 0; a <= 1000; a++)
for (int b = 0; b <= 1000; b++)
ab[a + b]++;
for (int c = 0; c <= 1000; c++)
for (int ... | replace | 21 | 22 | 21 | 22 | 0 | |
p00096 | C++ | Time Limit Exceeded | #define _crt_secure_no_warnings
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cs... | #define _crt_secure_no_warnings
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cs... | replace | 99 | 101 | 99 | 102 | TLE | |
p00096 | C++ | Time Limit Exceeded | #include <iostream>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int main() {
int n;
while (cin >> n) {
int ans = 0;
int x = 0;
if (n > 3000)
x = n - 3000;
for (int i = x; i < 1001 && i <= n; i++) {
// cout<<i<<"-"<<endl;
... | #include <iostream>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int main() {
int n;
while (cin >> n) {
int ans = 0;
int x = 0;
if (n > 3000)
x = n - 3000;
for (int i = x; i < 1001 && i <= n; i++) {
// cout<<i<<"-"<<endl;
... | replace | 25 | 29 | 25 | 30 | TLE | |
p00096 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int num[2001] = {0};
for (int i = 0; i <= 1000; i++) {
for (int j = 0; j <= 1000; j++) {
num[i + j]++;
}
}
int n;
while (cin >> n, n) {
int res = 0;
for (int i = 0; i <= n; i++) {
if (i > 2000 || n - i > 2000... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int num[2001] = {0};
for (int i = 0; i <= 1000; i++) {
for (int j = 0; j <= 1000; j++) {
num[i + j]++;
}
}
int n;
while (cin >> n) {
int res = 0;
for (int i = 0; i <= n; i++) {
if (i > 2000 || n - i > 2000)
... | replace | 13 | 14 | 13 | 14 | TLE | |
p00096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#defin... | replace | 25 | 26 | 25 | 26 | 0 | |
p00096 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
int dp[2000];
int main() {
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= 1000; i++) {
for (int j = 0; j <= 1000; j++) {
dp[i + j]++;
}
}
int n;
while (cin >> n) {
int ans = 0;
for (int i = 0; i <= n; i++) {
ans += dp[... | #include <cstring>
#include <iostream>
using namespace std;
int dp[4000];
int main() {
memset(dp, 0, sizeof(dp));
for (int i = 0; i <= 1000; i++) {
for (int j = 0; j <= 1000; j++) {
dp[i + j]++;
}
}
int n;
while (cin >> n) {
int ans = 0;
for (int i = 0; i <= n; i++) {
ans += dp[... | replace | 5 | 6 | 5 | 6 | 0 | |
p00096 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long r;
while (cin >> n) {
r = 0;
for (int a = 0; a <= 1000; a++) {
for (int b = 0; b <= 1000; b++) {
for (int c = 0; c <= 1000; c++) {
int d = n - a - b - c;
if (d >= 0 && d <= 1000)
r++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long r;
while (cin >> n) {
r = 0;
for (int a = 0; a <= 1000; a++) {
for (int b = 0; b <= 1000; b++) {
int s = n - a - b;
if (s <= 1000 && s >= 0) {
r += s + 1;
} else if (s <= 2000 && s > 1000) {
... | replace | 10 | 14 | 10 | 15 | TLE | |
p00096 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define mp make_pair
#define ... | #include <algorithm>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define mp make_pair
#define ... | replace | 28 | 29 | 28 | 29 | 0 | |
p00096 | C++ | Runtime Error | #include <cstring>
#include <iostream>
int half[2001]; // 0<=a, b<=1000 として a+b となる組み合わせの数
void makeSet() {
memset(half, 0, sizeof(half));
// 半分全列挙
for (int i = 0; i <= 1000; ++i) {
for (int j = 0; j <= 1000; ++j) {
int k = i + j;
++half[k];
}
}
}
int solve(int n) {
int num = 0;
int m... | #include <cstring>
#include <iostream>
int half[2001]; // 0<=a, b<=1000 として a+b となる組み合わせの数
void makeSet() {
memset(half, 0, sizeof(half));
// 半分全列挙
for (int i = 0; i <= 1000; ++i) {
for (int j = 0; j <= 1000; ++j) {
int k = i + j;
++half[k];
}
}
}
int solve(int n) {
int num = 0;
int m... | replace | 21 | 24 | 21 | 25 | 0 | |
p00096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i <= (n); i++)
int dp[2020];
int main() {
int n;
rep(i, 1000) rep(j, 1000) { dp[i + j]++; }
while (cin >> n) {
int ans = 0;
rep(i, n) ans += dp[i] * dp[n - i];
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i <= (n); i++)
int dp[4040];
int main() {
int n;
rep(i, 1000) rep(j, 1000) { dp[i + j]++; }
while (cin >> n) {
int ans = 0;
rep(i, n) ans += dp[i] * dp[n - i];
cout << ans << endl;
}
} | replace | 5 | 6 | 5 | 6 | 0 | |
p00096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<int> v;
int a[2001];
int main() {
for (int i = 0; i <= 1000; i++) {
for (int j = 0; j <= 1000; j++) {
a[i + j]++;
}
}
int n;
while (~scanf("%d", &n)) {
int res = 0;
for (int i = 0; i <= n; i++) {
res += a[i] * a[n - i];
}
... | #include <bits/stdc++.h>
using namespace std;
vector<int> v;
int a[10001];
int main() {
for (int i = 0; i <= 1000; i++) {
for (int j = 0; j <= 1000; j++) {
a[i + j]++;
}
}
int n;
while (~scanf("%d", &n)) {
int res = 0;
for (int i = 0; i <= n; i++) {
res += a[i] * a[n - i];
}
... | replace | 4 | 5 | 4 | 5 | 0 | |
p00096 | C++ | Runtime Error | #include <cstring>
#include <iostream>
using namespace std;
int n;
int cnt[2020];
void setcnt() {
memset(cnt, 0, sizeof(cnt));
for (int i = 0; i <= 1000; i++)
for (int j = 0; j <= 1000; j++)
cnt[i + j]++;
}
void solve() {
int ans = 0;
for (int ab = 0; ab <= n; ab++) {
ans += cnt[ab] * cnt[n - ... | #include <cstring>
#include <iostream>
using namespace std;
int n;
int cnt[4040];
void setcnt() {
memset(cnt, 0, sizeof(cnt));
for (int i = 0; i <= 1000; i++)
for (int j = 0; j <= 1000; j++)
cnt[i + j]++;
}
void solve() {
int ans = 0;
for (int ab = 0; ab <= n; ab++) {
ans += cnt[ab] * cnt[n - ... | replace | 6 | 7 | 6 | 7 | 0 | |
p00096 | C++ | Runtime Error | #include <iostream>
using namespace std;
int sum[2001];
int main() {
for (int i = 0; i < 1001; ++i) {
for (int j = 0; j < 1001; ++j) {
sum[i + j]++;
}
}
int n;
while (cin >> n) {
int ans = 0;
for (int i = 0; i <= n; ++i) {
for (int j = 0; i + j <= n; ++j) {
ans += sum[n - i -... | #include <iostream>
using namespace std;
int sum[2001];
int main() {
for (int i = 0; i < 1001; ++i) {
for (int j = 0; j < 1001; ++j) {
sum[i + j]++;
}
}
int n;
while (cin >> n) {
long long ans = 0;
for (int i = 0; i <= 1000; ++i) {
for (int j = 0; j <= 1000; ++j) {
if (n - i ... | replace | 11 | 14 | 11 | 18 | 0 | |
p00096 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inclu... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inclu... | replace | 65 | 66 | 65 | 67 | 0 | |
p00096 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int ab[2050];
int main(void) {
int n;
for (int a = 0; a <= 1000; a++) {
for (int b = 0; b <= 1000; b++) {
ab[a + b]++;
}
}
while (cin >> n) {
if (cin.eof())
break;
int ret = 0;
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int ab[2050];
int main(void) {
int n;
for (int a = 0; a <= 1000; a++) {
for (int b = 0; b <= 1000; b++) {
ab[a + b]++;
}
}
while (cin >> n) {
if (cin.eof())
break;
int ret = 0;
... | replace | 24 | 25 | 24 | 25 | 0 | |
p00096 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
using namespace std;
int main() {
int n;
while (cin >> n) {
long long cnt = 0;
for (int i = max(0, n - 3000); i <= min(1000, n); i++) {
for (int j = max(0, n - i - 2000); j <= min(10... | #include <cmath>
#include <iostream>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
using namespace std;
int main() {
int n;
while (cin >> n) {
long long cnt = 0;
for (int i = max(0, n - 3000); i <= min(1000, n); i++) {
for (int j = max(0, n - i - 2000); j <= min(10... | replace | 11 | 16 | 11 | 13 | TLE | |
p00096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int AB[2001] = {0};
for (int i = 0; i <= 1000; i++) {
for (int j = 0; j <= 1000; j++) {
AB[i + j]++;
}
}
while (cin >> n) {
int ans = 0;
for (int i = 0; i <= 2000; i++) {
if (n - i >= 0)
ans += AB[i] * AB[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int AB[2001] = {0};
for (int i = 0; i <= 1000; i++) {
for (int j = 0; j <= 1000; j++) {
AB[i + j]++;
}
}
while (cin >> n) {
int ans = 0;
for (int i = 0; i <= 2000; i++) {
if (n - i > 2000)
continue;
... | insert | 16 | 16 | 16 | 18 | 0 | |
p00096 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int a[2001] = {};
for (int i = 0; i <= 1000; i++) {
for (int j = 0; j <= 1000; j++) {
a[i + j]++;
}
}
int n;
while (cin >> n) {
long long int all = 0;
for (int i = 0; i <= 1000; i++) {
for (int j = 0; j <= 1000 && j <= n - i; j+... | #include <iostream>
using namespace std;
int main() {
int a[4001] = {};
for (int i = 0; i <= 1000; i++) {
for (int j = 0; j <= 1000; j++) {
a[i + j]++;
}
}
int n;
while (cin >> n) {
long long int all = 0;
for (int i = 0; i <= 1000; i++) {
for (int j = 0; j <= 1000 && j <= n - i; j+... | replace | 3 | 4 | 3 | 4 | 0 | |
p00096 | C++ | Runtime Error | #include <iostream>
using namespace std;
int t[2001];
int n, sum;
int main() {
for (int i = 0; i < 2001; i++) {
if (i < 1001)
t[i] = i + 1;
else
t[i] = 2001 - i;
}
while (cin >> n) {
sum = 0;
for (int i = 0; i < 2001; i++) {
if (n - i >= 0)
sum += t[i] * t[n - i];
}
... | #include <iostream>
using namespace std;
int t[2001];
int n, sum;
int main() {
for (int i = 0; i < 2001; i++) {
if (i < 1001)
t[i] = i + 1;
else
t[i] = 2001 - i;
}
while (cin >> n) {
sum = 0;
for (int i = 0; i < 2001; i++) {
if (n - i >= 0 && n - i <= 2000) {
sum = sum + ... | replace | 14 | 16 | 14 | 17 | 0 | |
p00096 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int n;
int a_add_b[2001] = {0};
for (int i = 0; i <= 1000; i++) {
for (int j = 0; j <= 1000; j++) {
a_add_b[i + j]++;
}
}
while (scanf("%d", &n) != EOF) {
long long int ans = 0;
for (int i = ... | #include <cstdio>
#include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int n;
int a_add_b[2001] = {0};
for (int i = 0; i <= 1000; i++) {
for (int j = 0; j <= 1000; j++) {
a_add_b[i + j]++;
}
}
while (scanf("%d", &n) != EOF) {
long long int ans = 0;
for (int i = ... | replace | 16 | 18 | 16 | 19 | 0 | |
p00097 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
lint n, s;
lint dp[1001][101][101];
lint dfs(int sum = 0, int num = 0, int cnt = 0) {
if (cnt == n)
return sum == s;
if (num > 100 || sum > s)
return 0;
lint &ret = dp[sum][num][cnt];
if (~ret)
return ret;
ret = dfs(sum, nu... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
lint n, s;
lint dp[1001][101][11];
lint dfs(int sum = 0, int num = 0, int cnt = 0) {
if (cnt == n)
return sum == s;
if (num > 100 || sum > s)
return 0;
lint &ret = dp[sum][num][cnt];
if (~ret)
return ret;
ret = dfs(sum, num... | replace | 6 | 7 | 6 | 7 | MLE | |
p00097 | C++ | Runtime Error | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
// const int INF = 1e8;
using namespace std;
int main() {
int n, s;
while (cin >> n >> s, n) {
... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
// const int INF = 1e8;
using namespace std;
int main() {
int n, s;
while (cin >> n >> s, n) {
... | replace | 11 | 12 | 11 | 12 | 0 | |
p00097 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
long long n, s, dp[102][11][1001];
for (int i = 0; i < 101; i++)
for (int j = 0; j < 10; j++)
for (int k = 0; k < 1001; k++)
dp[i][j][k] = 0;
dp[0][0][0] = 1;
for (int i = 0; i < 101; i++) {
for (int j = 0; j < 10; j++) {
... | #include <iostream>
using namespace std;
int main(void) {
static long long n, s, dp[102][11][1001];
for (int i = 0; i < 101; i++)
for (int j = 0; j < 10; j++)
for (int k = 0; k < 1001; k++)
dp[i][j][k] = 0;
dp[0][0][0] = 1;
for (int i = 0; i < 101; i++) {
for (int j = 0; j < 10; j++) ... | replace | 5 | 6 | 5 | 6 | -11 | |
p00097 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
long long int a[101][11][1100];
int main() {
int n, s;
a[0][0][0] = 1;
a[0][1][0] = 1;
for (int i = 0; i <= 100; i++) {
for (int j = 0; j <= 9; j++) {
for (int k = 0; k <= 1000; k++) {
a[i + 1][j][k] += a[i][j][k];
a[i + 1][j ... | #include <iostream>
#include <string>
using namespace std;
long long int a[102][11][1100];
int main() {
int n, s;
a[0][0][0] = 1;
a[0][1][0] = 1;
for (int i = 0; i <= 100; i++) {
for (int j = 0; j <= 9; j++) {
for (int k = 0; k <= 1000; k++) {
a[i + 1][j][k] += a[i][j][k];
a[i + 1][j ... | replace | 3 | 4 | 3 | 4 | -11 | |
p00098 | C++ | Runtime Error | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, a[100][100], rs[100][100], sum[100][100];
cin >> n;
rep(i, n) rep(j, n) cin >> a[i][j];
rep(i, n) rs[0][i] = 0;
rep(i, n) {
rs[i + 1][0] = 0;
rep(j, n) { rs[i + 1][j + 1] = rs[i + 1][j] + a[i][... | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, a[110][110], rs[110][110], sum[110][110];
cin >> n;
rep(i, n) rep(j, n) cin >> a[i][j];
rep(i, n) rs[0][i] = 0;
rep(i, n) {
rs[i + 1][0] = 0;
rep(j, n) { rs[i + 1][j + 1] = rs[i + 1][j] + a[i][... | replace | 5 | 6 | 5 | 6 | 0 | |
p00098 | C++ | Time Limit Exceeded | #include <iostream>
#define rep(i, N) for (i = 1; i <= N; i++)
using namespace std;
int n;
int data[102][102];
int rui[102][102]; // rui[i][j] = (1,1)を左上とするi*j行列の要素和
int main() {
int i, j, k, l;
cin >> n;
rep(i, n) {
rep(j, n) { cin >> data[i][j]; }
}
// 左→右
rep(i, n) {
rep(j, n) { rui[i][j] = ru... | #include <iostream>
#define rep(i, N) for (i = 1; i <= N; i++)
using namespace std;
int n;
int data[102][102];
int rui[102][102]; // rui[i][j] = (1,1)を左上とするi*j行列の要素和
int main() {
int i, j, k, l;
cin >> n;
rep(i, n) {
rep(j, n) { cin >> data[i][j]; }
}
// 左→右
rep(i, n) {
rep(j, n) { rui[i][j] = ru... | replace | 27 | 29 | 27 | 29 | TLE | |
p00099 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#incl... | replace | 170 | 171 | 170 | 171 | 0 | |
p00099 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | replace | 40 | 41 | 40 | 41 | 0 | |
p00099 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
struct DATA {
int player, wakasagi;
};
int n, q, a, v, top_player, cnt = 0;
int wakasagi_sum[1000001];
DATA data[1000001];
void heep_in(int);
int heep_out(void);
int main() {
cin >> n >> q;
for (int i = 0; i < 1000001; i++) {
data[i].wakasagi... | #include <algorithm>
#include <iostream>
using namespace std;
struct DATA {
int player, wakasagi;
};
int n, q, a, v, top_player, cnt = 0;
int wakasagi_sum[1000001];
DATA data[1000001];
void heep_in(int);
int heep_out(void);
int main() {
cin >> n >> q;
for (int i = 0; i < 1000001; i++) {
data[i].wakasagi... | replace | 93 | 94 | 93 | 95 | TLE | |
p00099 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define INF -(1 << 29)
#define F first
#define S second
#define T P
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 1000010;
bool cmp(const P &a, const P &b) {
if (a.first == b.first)
return a.second > b.second;
return a.first < b.firs... | #include <algorithm>
#include <iostream>
#include <vector>
#define INF -(1 << 29)
#define F first
#define S second
#define T P
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 1000010;
bool cmp(const P &a, const P &b) {
if (a.first == b.first)
return a.second > b.second;
return a.first < b.firs... | replace | 18 | 19 | 18 | 19 | 0 | |
p00099 | C++ | Runtime Error | #include <cstdio>
#include <set>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, q;
scanf("%d%d", &n, &q);
static int num[100001];
multiset<pair<int, int>> S;
S.insert(make_pair(0, 0));
rep(_, q) {
int a, v;
scanf("%d%d", &a, &v);
if (num[a] > 0)
... | #include <cstdio>
#include <set>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, q;
scanf("%d%d", &n, &q);
static int num[1000001];
set<pair<int, int>> S;
S.insert(make_pair(0, 1));
rep(_, q) {
int a, v;
scanf("%d%d", &a, &v);
if (num[a] > 0)
S.e... | replace | 10 | 13 | 10 | 13 | 0 | |
p00099 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repb(i, a, b) for (int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
type... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repb(i, a, b) for (int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
// #define int long long
#define fi first
#define se second
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
t... | replace | 5 | 6 | 5 | 6 | MLE | |
p00099 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define PB push_back
#define INF INT_MAX / 3
#define ALL(a) (a).begin(), (a).end()
#... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define PB push_back
#define INF INT_MAX / 3
#define ALL(a) (a).begin(), (a).end()
#... | replace | 16 | 17 | 16 | 17 | 0 | |
p00099 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string... | replace | 25 | 26 | 25 | 26 | 0 | |
p00099 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct P {
int a, v;
bool operator<(const P &t) const {
if (v == t.v)
return a > t.a;
return v < t.v;
}
};
int n;
P dat[2000000];
void update(int i, int x) {
i += n - 1;
dat[i].v += x;
while (i > 0) {
i = (i - 1) / 2;
dat[i] = max(dat[i ... | #include <bits/stdc++.h>
using namespace std;
struct P {
int a, v;
bool operator<(const P &t) const {
if (v == t.v)
return a > t.a;
return v < t.v;
}
};
int n;
P dat[10000000];
void update(int i, int x) {
i += n - 1;
dat[i].v += x;
while (i > 0) {
i = (i - 1) / 2;
dat[i] = max(dat[i... | replace | 13 | 14 | 13 | 14 | 0 | |
p00099 | C++ | Memory Limit Exceeded | #include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, q, fig, value;
cin >> n >> q;
vector<int> memo(n + 1);
fill(memo.begin(), memo.end(), 0);
priority_queue<pair<int, int>> que;
que.push(make_pair(0, -1));
while (q--) {
cin >> fig >> value;
... | #include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, q, fig, value;
cin >> n >> q;
vector<int> memo(n + 1);
fill(memo.begin(), memo.end(), 0);
priority_queue<pair<int, int>> que;
que.push(make_pair(0, -1));
while (q--) {
cin >> fig >> value;
... | replace | 16 | 18 | 16 | 17 | MLE | |
p00099 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | replace | 84 | 85 | 84 | 85 | -6 | malloc(): corrupted top size
|
p00099 | C++ | Time Limit Exceeded | #include <cstdio>
#include <queue>
#pragma warning(disable : 4996)
using namespace std;
int n, q, c[1000000], a, v;
int main() {
scanf("%d", &n);
scanf("%d", &q);
priority_queue<pair<int, int>> que;
for (int i = 0; i < q; i++) {
scanf("%d", &a);
scanf("%d", &v);
c[a - 1] += v;
que.push(ma... | #include <cstdio>
#include <queue>
#pragma warning(disable : 4996)
using namespace std;
int n, q, c[1000000], a, v;
int main() {
scanf("%d", &n);
scanf("%d", &q);
priority_queue<pair<int, int>> que;
for (int i = 0; i < q; i++) {
scanf("%d", &a);
scanf("%d", &v);
c[a - 1] += v;
que.push(ma... | replace | 27 | 28 | 27 | 28 | TLE | |
p00099 | C++ | Runtime Error | #include <cstdio>
#include <map>
#define INF 2000000000
#define fi first
#define sec second
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 1 << 15;
int n, q;
P dat[2 * MAX_N - 1];
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++) {
dat[i].fi = i - n ... | #include <cstdio>
#include <map>
#define INF 2000000000
#define fi first
#define sec second
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 1 << 21;
int n, q;
P dat[2 * MAX_N - 1];
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++) {
dat[i].fi = i - n ... | replace | 7 | 8 | 7 | 8 | 0 | |
p00099 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
/*
const int INF = 1 << 29;
const int MAX_N = 1000001;
// Segment Tree
// (数列のサイズ N に対してSegment Treeの頂点は 2*N-1 となる)
struct Seg_tree{
int n;
vector<int> dat;
// コンストラクタで初期化
Seg_tree(int n_){... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
/*
const int INF = 1 << 29;
const int MAX_N = 1000001;
// Segment Tree
// (数列のサイズ N に対してSegment Treeの頂点は 2*N-1 となる)
struct Seg_tree{
int n;
vector<int> dat;
// コンストラクタで初期化
Seg_tree(int n_){... | replace | 56 | 57 | 56 | 57 | MLE | |
p00099 | C++ | Runtime Error | // RMQ問題：次の２つのクエリがたくさん与えられる,高速に答えよ。
// 1.区間[i,j]内の要素ai〜ajの最大値をこたえる。2.要素aiにxを追加する。
// ただし、0 <= i,j <= Nとする。最初はa0〜ajは全てINF(= -1e+8)である。
// 単純に配列でシュミレーションすると、常にO(NQ),累積和を使うと、クエリ1はO(1),クエリ2はO(N)かかるので、最悪O(NQ)
// 領域を2分割,2分割していって、塊で答えを覚えておけばクエリ1は木の深さ分でできる。
// 葉ノードの区間長が1ならば、葉ノードを変える→根まで木の深さ分更新(O(logN))でできる。
// ということで、セグメントツリー... | // RMQ問題：次の２つのクエリがたくさん与えられる,高速に答えよ。
// 1.区間[i,j]内の要素ai〜ajの最大値をこたえる。2.要素aiにxを追加する。
// ただし、0 <= i,j <= Nとする。最初はa0〜ajは全てINF(= -1e+8)である。
// 単純に配列でシュミレーションすると、常にO(NQ),累積和を使うと、クエリ1はO(1),クエリ2はO(N)かかるので、最悪O(NQ)
// 領域を2分割,2分割していって、塊で答えを覚えておけばクエリ1は木の深さ分でできる。
// 葉ノードの区間長が1ならば、葉ノードを変える→根まで木の深さ分更新(O(logN))でできる。
// ということで、セグメントツリー... | replace | 92 | 94 | 92 | 94 | 0 | |
p00099 | C++ | Runtime Error | #include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
int main() {
int a, n, q, v, m_a = 0;
cin >> n >> q;
vector<int> fish(n, 0);
priority_queue<P> pq;
pq.push(P(1, 0));
for (int i = 0; i < q; i++) {
cin >> a >> v;
fish[a] += v;
pq.push(P(fish[a], -a));
while... | #include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;
int main() {
int a, n, q, v, m_a = 0;
cin >> n >> q;
vector<int> fish(n + 1, 0);
priority_queue<P> pq;
pq.push(P(1, 0));
for (int i = 0; i < q; i++) {
cin >> a >> v;
fish[a] += v;
pq.push(P(fish[a], -a));
w... | replace | 9 | 10 | 9 | 10 | 0 | |
p00100 | C++ | Runtime Error | #include <memory.h>
#include <stdio.h>
int main() {
int n, i, j, k, e[100], p[100], q[100];
int c[100], count = 0, count2 = 0;
int gokei = 0;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d %d %d", &e[i], &p[i], &q[i]);
gokei = p[i] * q[i];
... | #include <memory.h>
#include <stdio.h>
int main() {
int n, i, j, k, e[1000], p[1000], q[1000];
int c[1000], count = 0, count2 = 0;
int gokei = 0;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d %d %d", &e[i], &p[i], &q[i]);
gokei = p[i] * q[i];
... | replace | 3 | 5 | 3 | 5 | 0 | |
p00100 | C++ | Runtime Error | // 2011/01/12 Tazoe
#include <iostream>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int emp[4000][3];
for (int i = 0; i < 4000; i++) {
emp[i][0] = i + 1;
emp[i][1] = 0;
emp[i][2] = 5000;
}
int ord = 1;
for (int i = 0;... | // 2011/01/12 Tazoe
#include <iostream>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int emp[4000][3];
for (int i = 0; i < 4000; i++) {
emp[i][0] = i + 1;
emp[i][1] = 0;
emp[i][2] = 5000;
}
int ord = 1;
for (int i = 0;... | replace | 23 | 24 | 23 | 24 | 0 | |
p00100 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
ll n;
while (scanf("%d\n", &n), n) {
vector<pair<ll, ll>> v;
rep(i, n) {
ll x, y, z;
cin >> x >> y >> z;
bool f... | #include <cstdio>
#include <iostream>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
while (scanf("%d\n", &n), n) {
vector<pair<ll, ll>> v;
rep(i, n) {
ll x, y, z;
cin >> x >> y >> z;
bool ... | replace | 8 | 9 | 8 | 9 | TLE | |
p00101 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
int n;
cin >> n;
getline(cin, str);
for (int i = 0; i < n; i++) {
getline(cin, str);
for (int j = 0; j < str.size() - 6; j++) {
if (str[j] == 'H') {
if (str.substr(j + 1, 6) == "oshino")
str.re... | #include <iostream>
#include <string>
using namespace std;
int main() {
string str;
int n;
cin >> n;
getline(cin, str);
for (int i = 0; i < n; i++) {
getline(cin, str);
for (int j = 0; j < int(str.size()) - 6; j++) {
if (str.substr(j, 7) == "Hoshino")
str.replace(j, 7, "Hoshina");
}... | replace | 11 | 18 | 11 | 14 | 0 | |
p00101 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <vector>
#define INF 100000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <vector>
#define INF 100000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
... | replace | 24 | 25 | 24 | 25 | 0 | |
p00101 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
void solve() {
int n;
scanf("%d\n", &n);
string name = "Hoshino";
while (n--) {
string s;
getline(cin, s);
for (int i = 0; i < s.length() - name.length() + 1; ++i) {
bool flag = true;
for (int j = 0; j < name... | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
void solve() {
int n;
scanf("%d\n", &n);
string name = "Hoshino";
while (n--) {
string s;
getline(cin, s);
int length = s.length() - name.length() + 1;
for (int i = 0; i < length; ++i) {
bool flag = true;
... | replace | 13 | 14 | 13 | 15 | 0 | |
p00101 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int n;
cin >> n;
cin.ignore();
while (n--) {
getline(cin, str);
for (int j = 0; j < (int)str.size(); j++) {
string key = str.substr(j, 7), repl;
if (key == "Hoshino") {
repl = "Hoshina";
for (int k = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int n;
cin >> n;
cin.ignore();
while (n--) {
getline(cin, str);
for (int j = 0; j < (int)str.size(); j++) {
string key = str.substr(j, 7), repl;
if (key == "Hoshino") {
repl = "Hoshina";
for (int k = ... | replace | 16 | 17 | 16 | 17 | 0 | |
p00101 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define reep(i, a, b) for (int i = (a); i < (b); ++i)
#define... | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define reep(i, a, b) for (int i = (a); i < (b); ++i)
#define... | insert | 46 | 46 | 46 | 50 | 0 | |
p00101 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
scanf("%d%*c", &n);
for (int i = 0; i < n; ++i) {
string s;
getline(cin, s);
regex re("Hoshino");
cout << regex_replace(s, re, "Hoshina") << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
scanf("%d%*c", &n);
for (int i = 0; i < n; ++i) {
string s;
getline(cin, s);
regex re("Hoshino");
cout << regex_replace(s, re, "Hoshina") << endl;
}
return 0;
} | delete | 2 | 4 | 2 | 2 | TLE | |
p00101 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const double EPS = 1e-9;
con... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const double EPS = 1e-9;
con... | replace | 34 | 35 | 34 | 36 | 0 | |
p00101 | C++ | Runtime Error | #include <iostream>
#include <string>
int main() {
const std::string str_false = "Hoshino";
const std::string str_true = "Hoshina";
u_int num_of_data;
std::string text;
std::cin >> num_of_data;
std::cin.ignore();
for (u_int i = 0; i < num_of_data; ++i) {
getline(std::cin, text);
u_int index = 0... | #include <iostream>
#include <string>
int main() {
const std::string str_false = "Hoshino";
const std::string str_true = "Hoshina";
u_int num_of_data;
std::string text;
std::cin >> num_of_data;
std::cin.ignore();
for (u_int i = 0; i < num_of_data; ++i) {
getline(std::cin, text);
int index = 0;
... | replace | 14 | 15 | 14 | 15 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::replace: __pos (which is 4294967295) > this->size() (which is 7)
|
p00101 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define INF 100000000
#define MOD 1000000007
#... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define INF 100000000
#define MOD 1000000007
#... | insert | 44 | 44 | 44 | 48 | 0 | |
p00101 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
cin.get();
for (int i = 0; i < n; i++) {
string s;
getline(cin, s);
for (int j = 0; j <= s.size() - 7; j++) {
if (s.substr(j, 7) == "Hoshino")
s[j + 6] = 'a';
}
cout << s << endl;
}
re... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
cin.get();
for (int i = 0; i < n; i++) {
string s;
getline(cin, s);
for (int j = 0; j < s.size(); j++) {
if (s.substr(j, 7) == "Hoshino")
s[j + 6] = 'a';
}
cout << s << endl;
}
return ... | replace | 11 | 12 | 11 | 12 | 0 | |
p00101 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string check = "Hoshino";
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string str;
if (i == 0)
cin.ignore();
getline(cin, str);
for (int j = 0; j < str.length() - 6; j++) {
for (int k = 0; k < 7; k++) {
// pri... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string check = "Hoshino";
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string str;
if (i == 0)
cin.ignore();
getline(cin, str);
if (str.length() < 7) {
cout << str << endl;
continue;
}
for (int j = 0; j ... | insert | 13 | 13 | 13 | 17 | 0 | |
p00101 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#define vl vector<ll>
#def... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#define vl vector<ll>
#def... | replace | 41 | 43 | 41 | 43 | 0 | |
p00101 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n;
string str;
cin >> n;
cin.ignore();
while (n--) {
getline(cin, str);
for (int i = 0; i < str.size() - 6; i++) {
if (str.substr(i, 7) == "Hoshino")
str[i + 6] = 'a';
}
cout << str << endl;
}
... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n;
string str;
cin >> n;
cin.ignore();
while (n--) {
getline(cin, str);
for (int i = 0; i < str.size(); i++) {
if (str.substr(i, 7) == "Hoshino")
str[i + 6] = 'a';
}
cout << str << endl;
}
retu... | replace | 12 | 13 | 12 | 13 | 0 | |
p00101 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
char ho[8] = {'H', 'o', 's', 'h', 'i', 'n', 'o'};
int n;
string s;
cin >> n;
cin.ignore();
while (n--) {
getline(cin, s);
rep(i, s.size() - 6) {
// cout<<i<<endl;
bool f = true;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
char ho[8] = {'H', 'o', 's', 'h', 'i', 'n', 'o'};
int n;
string s;
cin >> n;
cin.ignore();
while (n--) {
getline(cin, s);
int a = s.length();
rep(i, a - 6) {
if (s[i] == 'H' && s[i + ... | replace | 11 | 22 | 11 | 18 | 0 | |
p00101 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <string.h>
int main(void) {
char sentence[1050];
int n;
scanf("%d\n", &n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < 1050; j++) {
sentence[j] = getchar();
if (sentence[j] == '\n') {
sentence[j] = 0;
break;
}
}
for (int j = 0; j <... | #include <stdio.h>
#include <string.h>
int main(void) {
char sentence[1050];
int n;
scanf("%d\n", &n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < 1050; j++) {
sentence[j] = getchar();
if (sentence[j] == '\n') {
sentence[j] = 0;
break;
}
}
for (int j = 0; j <... | replace | 15 | 16 | 15 | 16 | TLE | |
p00101 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
cin.ignore();
while (n--) {
string s;
getline(cin, s);
for (int i = 0; i < s.length() - 6; i++) {
if (s.substr(i, 7) == "Hoshino")
s.replace(i, 7, "Hoshina");
}
cout << s << endl;
}
r... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
cin.ignore();
while (n--) {
string s;
getline(cin, s);
if (s.length() >= 7) {
for (int i = 0; i < s.length() - 6; i++) {
if (s.substr(i, 7) == "Hoshino")
s.replace(i, 7, "Hoshina");
... | replace | 12 | 15 | 12 | 17 | 0 | |
p00101 | C++ | Runtime Error | #include <iostream>
#include <string>
int main() {
const std::string str_false = "Hoshino";
const std::string str_true = "Hoshina";
u_int num_of_data;
std::cin >> num_of_data;
std::cin.ignore();
for (u_int i = 0; i < num_of_data; ++i) {
std::string text;
getline(std::cin, text);
u_int index ... | #include <iostream>
#include <string>
int main() {
const std::string str_false = "Hoshino";
const std::string str_true = "Hoshina";
u_int num_of_data;
std::cin >> num_of_data;
std::cin.ignore();
for (u_int i = 0; i < num_of_data; ++i) {
std::string text;
getline(std::cin, text);
int index = ... | replace | 15 | 16 | 15 | 16 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::replace: __pos (which is 4294967295) > this->size() (which is 7)
|
p00101 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main(void) {
int n;
string h = "Hoshino";
string s;
cin >> n;
getline(cin, s);
stringstream ss(s);
ss >> n;
rep(loop, n) {
getline(cin, s);
rep(i, s.size() - h.size() + 1) {
bool same = true;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main(void) {
int n;
string h = "Hoshino";
string s;
cin >> n;
getline(cin, s);
stringstream ss(s);
ss >> n;
rep(loop, n) {
getline(cin, s);
rep(i, s.size()) {
if (i + h.size() - 1 >= s.size()... | replace | 14 | 15 | 14 | 17 | 0 | |
p00101 | C++ | Runtime Error | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int n, i, j;
ios::sync_with_stdio();
string s;
scanf("%d", &n);
cin.get();
for (i = 0; i < n; i++) {
getline(cin, s);
for (j = 0; s[j + 6] != '\0'; j++) {
if (s.substr(j, 7) == "Hoshino")
s[j + 6] = 'a';
... | #include <iostream>
#include <string.h>
using namespace std;
int main() {
int n, i, j;
ios::sync_with_stdio();
string s;
scanf("%d", &n);
cin.get();
for (i = 0; i < n; i++) {
getline(cin, s);
for (j = 0; j + 6 < s.size(); j++) {
if (s.substr(j, 7) == "Hoshino")
s[j + 6] = 'a';
... | replace | 15 | 16 | 15 | 16 | 0 | |
p00101 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
string s;
string d = "Hoshina";
cin >> n;
cin.ignore();
while (n--) {
getline(cin, s);
whil... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
string s;
string d = "Hoshina";
cin >> n;
cin.ignore();
while (n--) {
getline(cin, s);
for ... | replace | 19 | 25 | 19 | 22 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::replace: __pos (which is 4294967295) > this->size() (which is 7)
|
p00101 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(i... | replace | 25 | 28 | 25 | 28 | 0 | |
p00102 | C++ | Time Limit Exceeded | #include <stdio.h>
int main(void) {
int matrix[10][10], i, j, dataset;
while (scanf("%d", &dataset)) {
if (dataset == 0)
break;
// init add total norm
for (i = 0; i < dataset + 1; i++) {
matrix[dataset][i] = 0;
matrix[i][dataset] = 0;
}
// input and calc
for (i = 0; i <... | #include <stdio.h>
int main(void) {
int matrix[11][11], i, j, dataset;
while (scanf("%d", &dataset)) {
if (dataset == 0)
break;
// init add total norm
for (i = 0; i < dataset + 1; i++) {
matrix[dataset][i] = 0;
matrix[i][dataset] = 0;
}
// input and calc
for (i = 0; i <... | replace | 3 | 4 | 3 | 4 | TLE | |
p00102 | C++ | Time Limit Exceeded | #include <cstring>
#include <iomanip>
#include <iostream>
int main() {
int n;
while (std::cin >> n, n) {
int data[10][10];
memset(data, 0, sizeof(data));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
std::cin >> data[i][j];
data[i][n] += data[i][j];
data[n][j... | #include <cstring>
#include <iomanip>
#include <iostream>
int main() {
int n;
while (std::cin >> n, n) {
int data[11][11];
memset(data, 0, sizeof(data));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
std::cin >> data[i][j];
data[i][n] += data[i][j];
data[n][j... | replace | 7 | 8 | 7 | 8 | TLE | |
p00102 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int N = 10000;
int n, a[N][N];
signed main(void) {
ios::sync_with_stdio(false);
while (cin >> n && n) {
memset(a, 0, sizeof(a));
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
cin >> a[i][j];
for (int i = 1, sum; i <= n; i++) {... | #include <bits/stdc++.h>
using namespace std;
const int N = 1000;
int n, a[N][N];
signed main(void) {
ios::sync_with_stdio(false);
while (cin >> n && n) {
memset(a, 0, sizeof(a));
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
cin >> a[i][j];
for (int i = 1, sum; i <= n; i++) {
... | replace | 2 | 3 | 2 | 3 | MLE | |
p00102 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
void Solution() {
int n;
int a[10][10];
while (true) {
cin >> n;
if (n == 0) {
break;
}
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
void Solution() {
int n;
int a[11][11];
while (true) {
cin >> n;
if (n == 0) {
break;
}
... | replace | 15 | 16 | 15 | 16 | 0 | |
p00103 | C++ | Time Limit Exceeded | #include <fstream>
#include <iostream>
#include <string>
int main() {
int hit, out, score, data_set_num;
std::string event, str;
std::getline(std::cin, str);
sscanf(str.c_str(), "%d ", &data_set_num);
while (data_set_num) {
std::cin >> event;
if (event == "HIT") {
++hit;
if (hit == 4) {
... | #include <fstream>
#include <iostream>
#include <string>
int main() {
int hit, out, score, data_set_num;
std::string event, str;
std::getline(std::cin, str);
sscanf(str.c_str(), "%d ", &data_set_num);
while (data_set_num) {
std::cin >> event;
if (event == "HIT") {
++hit;
if (hit == 4) {
... | insert | 29 | 29 | 29 | 30 | TLE | |
p00103 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ini = 0, out = 0, hit = 0, cnt = 0;
while (ini <= n) {
string s;
cin >> s;
if (s == "OUT") {
out++;
if (out == 3) {
cout << cnt << endl;
cnt = 0;
hit = 0;
out = 0;
ini... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ini = 0, out = 0, hit = 0, cnt = 0;
while (ini < n) {
string s;
cin >> s;
if (s == "OUT") {
out++;
if (out == 3) {
cout << cnt << endl;
cnt = 0;
hit = 0;
out = 0;
ini+... | replace | 7 | 8 | 7 | 8 | TLE | |
p00103 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int o, i, out = 0, b = 0, p[10];
string ev;
cin >> o;
for (i = 0; i < o; i++) {
p[i] = 0;
while (1) {
cin >> ev;
if (ev == "HIT") {
b++;
if (b == 4) {
b--;
p[i]++;
}
... | #include <iostream>
#include <string>
using namespace std;
int main() {
int o, i, out = 0, b = 0, p[100];
string ev;
cin >> o;
for (i = 0; i < o; i++) {
p[i] = 0;
while (1) {
cin >> ev;
if (ev == "HIT") {
b++;
if (b == 4) {
b--;
p[i]++;
}
... | replace | 5 | 6 | 5 | 6 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.