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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a = 100;
int64_t x;
cin >> x;
int count = 0;
while (a < x) {
a = a * 101 / 100;
count++;
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a = 100;
int64_t x;
cin >> x;
int count = 0;
while (a < x) {
a += a / 100;
count++;
}
cout << count << endl;
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int t = 100;
int count = 0;
cin >> n;
while (n > t) {
count++;
t *= 1.01;
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
uint64_t n;
uint64_t t = 100;
uint64_t count = 0;
cin >> n;
while (n > t) {
count++;
t *= 1.01;
}
cout << count << endl;
} | replace | 4 | 7 | 4 | 7 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
long long a = 100;
for (long long i = 0; i < X; i++) {
a = a * 101 / 100;
if (a >= X) {
cout << i + 1 << endl;
return 0;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
long long a = 100;
for (int i = 0; i < 100000; i++) {
a = a + a / 100;
if (a >= X) {
cout << i + 1 << endl;
return 0;
}
}
}
| replace | 7 | 9 | 7 | 9 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long int
#define F first
#define S second
const ll mod = 1e9 + 7;
const ll INF = 10000000000000;
#define pb push_back
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define fastio \
ios_base::sync_with_stdi... | #include <bits/stdc++.h>
#define ll long long int
#define F first
#define S second
const ll mod = 1e9 + 7;
const ll INF = 10000000000000;
#define pb push_back
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define fastio \
ios_base::sync_with_stdi... | replace | 19 | 21 | 19 | 21 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <cstdio>
int main() {
long int x;
scanf("%ld", &x);
long int moto = 100;
long int ans = 0;
while (moto < x) {
ans++;
moto = moto * 101 / 100;
}
printf("%ld", ans);
return 0;
} | #include <cstdio>
int main() {
long int x;
scanf("%ld", &x);
long int moto = 100;
long int ans = 0;
while (moto < x) {
ans++;
double motof = (double)moto;
moto = (long int)motof * 1.01;
}
printf("%ld", ans);
return 0;
}
| replace | 9 | 10 | 9 | 11 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll x;
cin >> x;
ll w = 100;
ll cnt = 0;
while (w < x) {
cnt++;
w = w * 101;
w = w / 100;
// cout << w << endl;
}
cout << cnt << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll x;
cin >> x;
ll w = 100;
ll cnt = 0;
while (w < x) {
cnt++;
w += w / 100;
// cout << w << endl;
}
cout << cnt << "\n";
return 0;
}
| replace | 12 | 14 | 12 | 13 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
long long p = 100LL;
long long num = 0LL;
while (p < x) {
num++;
p *= 101;
p /= 100;
}
cout << num;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
long long p = 100LL;
long long num = 0LL;
while (p < x) {
num++;
p += p / 100;
}
cout << num;
} | replace | 9 | 11 | 9 | 10 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long s = 100, x = 0;
do {
s = s * 1.01 / 1;
x++;
} while (s != n);
cout << x;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
long long F = 100;
long long year = 0;
while (F < X) {
year++;
F = F * 1.01 / 1;
}
cout << year;
} | replace | 3 | 11 | 3 | 12 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long s;
int t = 100;
int c = 0;
cin >> s;
while (t < s) {
t += t / 100;
c++;
}
cout << c << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long s;
long t = 100;
long c = 0;
cin >> s;
while (t < s) {
t += t / 100;
c++;
}
cout << c << endl;
return 0;
} | replace | 5 | 7 | 5 | 7 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
#define f first
#define s second
using namespace std;
const int inf = 1e18;
int32_t main() {
ios::sync_with_stdio(0), cin.tie(0);
int x, p = 100, c = 0;
cin >> x;
while (p < x) {
p = (p * 101) / 100;
c++;
}
cout << c;
} | #include <bits/stdc++.h>
#define int long long
#define f first
#define s second
using namespace std;
const int inf = 1e18;
int32_t main() {
ios::sync_with_stdio(0), cin.tie(0);
int x, p = 100, c = 0;
cin >> x;
while (p < x) {
p += p / 100;
c++;
}
cout << c;
} | replace | 11 | 12 | 11 | 12 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, num = 100, h = 0;
cin >> x;
while (x > num) {
num += num / 100;
h++;
}
cout << h << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, num = 100, h = 0;
cin >> x;
while (x > num) {
num += num / 100;
h++;
}
cout << h << endl;
}
| replace | 4 | 5 | 4 | 5 | TLE | |
p02694 | C++ | Time Limit Exceeded | // #pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
// #pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>... | // #pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
// #pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>... | replace | 60 | 61 | 60 | 63 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t x;
cin >> x;
int h = 100;
int ans = 0;
while (h < x) {
h *= 1.01;
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t x;
cin >> x;
int64_t h = 100;
int64_t ans = 0;
while (h < x) {
h *= 1.01;
ans++;
}
cout << ans << endl;
} | replace | 7 | 9 | 7 | 9 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long X, n = 0;
int yen = 100;
cin >> X;
while (++n) {
yen = yen + yen * 0.01;
if (yen >= X)
break;
}
cout << n << endl;
// cout << round(log((double) X/100) / log(1.01)) << endl;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
long long X, n = 0;
long long yen = 100;
cin >> X;
while (++n) {
yen = yen + yen * 0.01;
if (yen >= X)
break;
}
cout << n << endl;
// cout << round(log((double) X/100) / log(1.01)) << endl;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll x;
cin >> x;
int a = 100;
int ans = 0;
while (a < x) {
a *= 1.01;
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll x;
cin >> x;
ll a = 100;
int ans = 0;
while (a < x) {
a *= 1.01;
ans++;
}
cout << ans << endl;
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll r = 0;
ll x;
cin >> x;
ll i = 100;
while (i < x) {
i = i * 101 / 100;
r++;
}
cout << r;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll r = 0;
ll x;
cin >> x;
ll i = 100;
while (i < x) {
i = i + i / 100;
r++;
}
cout << r;
return 0;
}
| replace | 10 | 11 | 10 | 11 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll X;
cin >> X;
ll sum = 100;
ll n = 0;
while (sum < X) {
sum = sum * 101 / 100;
n++;
}
cout << n << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll X;
cin >> X;
ll sum = 100;
ll n = 0;
while (sum < X) {
sum = sum + sum / 100;
n++;
}
cout << n << endl;
} | replace | 12 | 13 | 12 | 13 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, as = 100;
cin >> n;
for (int64_t i = 1;; i++) {
as += (int)as * 0.01;
if (as >= n) {
cout << i << endl;
break;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, as = 100;
cin >> n;
for (int64_t i = 1;; i++) {
as += (int64_t)as * 1 / 100;
if (as >= n) {
cout << i << endl;
break;
}
}
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll x;
cin >> x;
ll ans = 0;
ll yen = 100;
while (1) {
if (yen >= x)
break;
yen *= 101;
yen /= 100;
ans++;
}
cout << ans <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll x;
cin >> x;
ll ans = 0;
ll yen = 100;
while (1) {
if (yen >= x)
break;
yen += yen / 100;
ans++;
}
cout << ans << endl;
} | replace | 15 | 17 | 15 | 16 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long X;
cin >> X;
long long a = 0;
long long i = 100;
while (i < X) {
i = i + int(i * 0.01);
a += 1;
}
cout << a << endl;
}
| #include <iostream>
using namespace std;
int main() {
long long X;
cin >> X;
long long a = 0;
long long i = 100;
while (i < X) {
i *= 1.01;
a += 1;
}
cout << a << endl;
}
| replace | 10 | 11 | 10 | 11 | TLE | |
p02694 | C++ | Time Limit Exceeded | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
//------------------------------- Type Names -------------------------------//
using i64 = int_fast64_t;
using seika = string;
//{akari : 1D, yukari : 2D, maki : 3D} vector
template <class kizuna> using akari = vector<kizuna>;
template <class y... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
//------------------------------- Type Names -------------------------------//
using i64 = int_fast64_t;
using seika = string;
//{akari : 1D, yukari : 2D, maki : 3D} vector
template <class kizuna> using akari = vector<kizuna>;
template <class y... | replace | 37 | 38 | 37 | 38 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long x;
cin >> x;
long long m = 100;
int i;
for (i = 0; m < x; i++) {
m = m * 101 / 100;
}
cout << i << endl;
} | #include <iostream>
using namespace std;
int main() {
long long x;
cin >> x;
long long m = 100;
int i;
for (i = 0; m < x; i++) {
m = m + m / 100;
}
cout << i << endl;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
long long x;
cin >> x;
long long money = 100;
int i;
for (i = 0; money < x; i++) {
money = money * 101 / 100;
}
cout << i << endl;
} | #include <iostream>
using namespace std;
int main() {
long long x;
cin >> x;
long long money = 100;
int i;
for (i = 0; money < x; i++) {
money = money + money / 100;
}
cout << i << endl;
} | replace | 8 | 9 | 8 | 9 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long i = cc; i < n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)
int main() {
long X;
cin >> X;
long a = 100;
long ans = 0;
while (a < X) {
a = (a * 101) / 100;
an... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#define lrep(i, cc, n) for (long i = cc; i < n; ++i)
#define rrep(i, cc, n) for (long i = cc; i > n; --i)
int main() {
long X;
cin >> X;
long a = 100;
long ans = 0;
while (a < X) {
a += a / 100;
ans++;
... | replace | 12 | 13 | 12 | 13 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cstdio>
#include <fstream>
using namespace std;
// vector<pair<int,int> > v;
// cin.ignore();//twice getline(cin,s);
// g++ iterator.cpp -std=c++17
// cout<<(A + B == C ? "YES" : "NO")<<endl;
// __gcd(a,b)
// string s=to_string(i);
// sort(arr, arr+n, greater<int>());
// const long do... | #include <bits/stdc++.h>
#include <cstdio>
#include <fstream>
using namespace std;
// vector<pair<int,int> > v;
// cin.ignore();//twice getline(cin,s);
// g++ iterator.cpp -std=c++17
// cout<<(A + B == C ? "YES" : "NO")<<endl;
// __gcd(a,b)
// string s=to_string(i);
// sort(arr, arr+n, greater<int>());
// const long do... | replace | 37 | 38 | 37 | 39 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, year = 0, i = 100;
cin >> x;
while (i < x) {
i = i * 1.01;
year++;
}
cout << year << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin >> X;
long long i = 100, year = 0;
while (i < X) {
i = i * 1.01;
year++;
}
cout << year << endl;
} | replace | 3 | 6 | 3 | 7 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, i, tt = 0;
cin >> x;
while (i < x) {
i += i / 100;
tt++;
}
cout << tt;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long x, i = 100, tt = 0;
cin >> x;
while (i < x) {
i += i / 100;
tt++;
}
cout << tt;
return 0;
} | replace | 3 | 4 | 3 | 4 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t X;
cin >> X;
int i = 0;
int money = 100;
while (true) {
i++;
money *= 1.01;
if (money >= X)
break;
}
cout << i << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t X;
cin >> X;
int i = 0;
int64_t money = 100;
while (true) {
i++;
money *= 1.01;
if (money >= X)
break;
}
cout << i << endl;
return 0;
}
| replace | 8 | 9 | 8 | 9 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll x;
cin >> x;
ll val = 100;
int i;
for (i = 0; val < x; i++)
val = (int)(val * 1.01);
cout << i << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll x;
cin >> x;
ll val = 100;
int i;
for (i = 0; val < x; i++)
val = (ll)(val * 1.01);
cout << i << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02694 | C++ | Time Limit Exceeded | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using vi = vector<int>;
using vvi = vector<vi>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_elemen... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
using vi = vector<int>;
using vvi = vector<vi>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_elemen... | replace | 70 | 71 | 70 | 71 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
ll solve() {
ll t = 0, a = 0, x;
cin >> x;
while (a < x) {
a += a / 100;
t++;
}
cout << t << endl;
return 0;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
solve();
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
ll solve() {
ll t = 0, a = 100, x;
cin >> x;
while (a < x) {
a += a / 100;
t++;
}
cout << t << endl;
return 0;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
solve();
}
| replace | 7 | 8 | 7 | 8 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int x;
cin >> x;
int d = 100;
int cnt = 0;
while (d < x) {
d = d + d * 0.01;
cnt++;
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long int x;
cin >> x;
long long int d = 100;
long long int cnt = 0;
while (d < x) {
d = d + d * 0.01;
cnt++;
}
cout << cnt << endl;
}
| replace | 5 | 7 | 5 | 7 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep_bit(n) for (int bit = 0; bit < (1 << n); ++bit)
#define ll long long
using namespace std;
int main() {
ll X;
cin >> X;
ll money = 100;
ll time = 0;
while (money < X) {
money = int(money * 1.01);
time++;
}
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep_bit(n) for (int bit = 0; bit < (1 << n); ++bit)
#define ll long long
using namespace std;
int main() {
ll X;
cin >> X;
ll money = 100;
ll time = 0;
while (money < X) {
money = money * 1.01;
time++;
}
cout <... | replace | 13 | 14 | 13 | 14 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int x, cnt = 0;
int total = 100;
cin >> x;
while (total < x) {
total += total / 100;
cnt++;
}
cout << cnt << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int cnt = 0;
long long total = 100;
long long x;
cin >> x;
while (total < x) {
total += total / 100;
cnt++;
}
cout << cnt << endl;
return 0;
}
| replace | 4 | 6 | 4 | 7 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int x, res = 0, curr = 100;
cin >> x;
while (curr < x) {
res++;
curr += curr * 0.01;
}
cout << res << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long x, res = 0, curr = 100;
cin >> x;
while (curr < x) {
res++;
curr += curr * 0.01;
}
cout << res << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | TLE | |
p02694 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
int func(int a, int b, int cnt) {
if (a >= b) {
return cnt;
}
func(a + a * 0.01, b, cnt + 1);
}
signed main() {
int x;
cin >> x;
cout << func(100, x, 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int func(int a, int b, int cnt) {
if (a >= b) {
return cnt;
}
return func(a + a * 0.01, b, cnt + 1);
}
signed main() {
int x;
cin >> x;
cout << func(100, x, 0) << endl;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02694 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | replace | 89 | 90 | 89 | 90 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n = 100;
int x;
int count = 0;
cin >> x;
while (n < x) {
count += 1;
n += n / 100;
}
cout << count << '\n';
return 0;
}
| #include <iostream>
using namespace std;
int main() {
long long int n = 100;
long long int x;
int count = 0;
cin >> x;
while (n < x) {
count += 1;
n += n / 100;
}
cout << count << '\n';
return 0;
}
| replace | 4 | 6 | 4 | 6 | TLE | |
p02694 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
#define pqb priority_queue<in... | replace | 41 | 43 | 41 | 45 | TLE | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int N, M, Q;
vector<int> a, b, c, d;
long long ans;
long long res, res2;
vector<int> num;
long long dfs(int i, int u) {
long long t2 = 0;
if (u == N) {
long long t = 0;
for (int j = 0; j < Q; j++) {
if (num[b[j] - 1] - num[a[j] - ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int N, M, Q;
vector<int> a, b, c, d;
long long ans;
long long res, res2;
vector<int> num;
long long dfs(int i, int u) {
long long t2 = 0;
if (u == N) {
long long t = 0;
for (int j = 0; j < Q; j++) {
if (num[b[j] - 1] - num[a[j] - ... | insert | 34 | 34 | 34 | 35 | -11 | |
p02695 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m, q;
vector<int> a, b, c, d, A;
int saiki(int k, int l, int p, vector<int> A);
int main() {
int as;
// cerr << "test";
cin >> n >> m >> q;
for (int i = 0; i < q; i++) {
int e, f, g, h;
cin >> e >> f >> g >> h;
a.push_back(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m, q;
vector<int> a, b, c, d, A;
int saiki(int k, int l, int p, vector<int> A);
int main() {
int as;
// cerr << "test";
cin >> n >> m >> q;
for (int i = 0; i < q; i++) {
int e, f, g, h;
cin >> e >> f >> g >> h;
a.push_back(... | replace | 37 | 40 | 37 | 39 | TLE | |
p02695 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
// #include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#... | #include <iostream>
#include <stdio.h>
// #include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#... | replace | 36 | 37 | 36 | 37 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
const double PI = acos(-1.0);
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) ... | #include <bits/stdc++.h>
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
const double PI = acos(-1.0);
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) ... | replace | 132 | 133 | 132 | 133 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[20], b[20], c[20], d[20];
long long ans = 0;
int l[20];
int n, m, q;
void dfs(int x, int y) // x当前第几位,这一位是几
{
l[x] = y;
if (x == n) {
long long sum = 0;
for (int i = 1; i <= q; i++)
if (l[b[i]] - l[a[i]] == c[i])
sum += d[i];
ans = max(... | #include <bits/stdc++.h>
using namespace std;
int a[100], b[100], c[100], d[100];
long long ans = 0;
int l[20];
int n, m, q;
void dfs(int x, int y) // x当前第几位,这一位是几
{
l[x] = y;
if (x == n) {
long long sum = 0;
for (int i = 1; i <= q; i++)
if (l[b[i]] - l[a[i]] == c[i])
sum += d[i];
ans = ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define name ""
#define ini \
freopen(name ".inp", "r", stdin); \
freopen(name ".out", "w", stdout)
#define foe(it, c) for (__typeof(c.begin()) it = c.begin();... | #include <bits/stdc++.h>
using namespace std;
#define name ""
#define ini \
freopen(name ".inp", "r", stdin); \
freopen(name ".out", "w", stdout)
#define foe(it, c) for (__typeof(c.begin()) it = c.begin();... | replace | 23 | 24 | 23 | 24 | 0 | |
p02695 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, INF = 1010101010;
constex... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, INF = 1010101010;
constex... | replace | 80 | 81 | 80 | 81 | 0 | |
p02695 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int odp = 0, n, m, q;
void rec(vector<int> x, int nr, int co, vector<int> &a, vector<int> &b,
vector<int> &c, vector<int> &d) {
x[nr] = co;
if (nr == n) {
int wyn = 0;
for (int i = 0; i < q; ++i)
if (x[b[i]] - x[a[i]] == c[i])
... | #include <iostream>
#include <vector>
using namespace std;
int odp = 0, n, m, q;
void rec(vector<int> x, int nr, int co, vector<int> &a, vector<int> &b,
vector<int> &c, vector<int> &d) {
x[nr] = co;
if (nr == n - 1) {
int wyn = 0;
for (int i = 0; i < q; ++i)
if (x[b[i]] - x[a[i]] == c[i])
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02695 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int A[15], n, m, q, a[55], b[55], c[55], d[55], ans;
int main() {
cin >> n >> m >> q;
for (int i = 1; i <= q; i++) {
cin >> a[i] >> b[i] >> c[i] >> d[i];
}
for (int i = 1; i <= n; i++)
A[i] = 1; // 1 1 1
while (!a[0]) // a[0]=0是标志位 ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int A[15], n, m, q, a[55], b[55], c[55], d[55], ans;
int main() {
cin >> n >> m >> q;
for (int i = 1; i <= q; i++) {
cin >> a[i] >> b[i] >> c[i] >> d[i];
}
for (int i = 1; i <= n; i++)
A[i] = 1; // 1 1 1
while (!A[0]) // A[0]=0是标志位 ... | replace | 11 | 12 | 11 | 12 | TLE | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int recursive(int col, vector<int> ¤t, int n, int m, int q,
vector<vector<int>> &aa, vector<vector<int>> &cc,
vector<vector<int>> &dd);
int main() {
int n, m, q;
cin >> n >> m >> q;
vector<int> a(q), b(q), c(q), d(q);
for (int i ... | #include <bits/stdc++.h>
using namespace std;
int recursive(int col, vector<int> ¤t, int n, int m, int q,
vector<vector<int>> &aa, vector<vector<int>> &cc,
vector<vector<int>> &dd);
int main() {
int n, m, q;
cin >> n >> m >> q;
vector<int> a(q), b(q), c(q), d(q);
for (int i ... | replace | 16 | 17 | 16 | 17 | 0 | |
p02695 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i = s; i < g; i++)
using namespace std;
using ll = long long;
const int inf = 10... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for (i = s; i < g; i++)
using namespace std;
using ll = long long;
const int inf = 10... | insert | 41 | 41 | 41 | 46 | -11 | |
p02695 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch : s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.cl... | #include <algorithm>
#include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch : s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.cl... | delete | 149 | 151 | 149 | 149 | 0 | |
p02695 | C++ | Runtime Error | /*ヽ｀、ヽ｀｀、ヽ｀ヽ｀、、ヽ ｀ヽ 、ヽ｀🌙｀ヽヽ｀ヽ、ヽ｀
ヽ｀、ヽ｀｀、ヽ 、｀｀、 ｀、ヽ｀ 、｀ ヽ｀ヽ、ヽ ｀、ヽ｀｀、
ヽ、｀｀、｀、ヽ｀｀、 、ヽヽ｀、｀、、ヽヽ、｀｀、 、 ヽ｀、
ヽ｀｀、 ヽ｀ヽ｀、、ヽ ｀ヽ 、 🚶ヽ｀｀｀｀ヽヽヽ｀、、ヽ｀、、ヽ*/
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.h... | /*ヽ｀、ヽ｀｀、ヽ｀ヽ｀、、ヽ ｀ヽ 、ヽ｀🌙｀ヽヽ｀ヽ、ヽ｀
ヽ｀、ヽ｀｀、ヽ 、｀｀、 ｀、ヽ｀ 、｀ ヽ｀ヽ、ヽ ｀、ヽ｀｀、
ヽ、｀｀、｀、ヽ｀｀、 、ヽヽ｀、｀、、ヽヽ、｀｀、 、 ヽ｀、
ヽ｀｀、 ヽ｀ヽ｀、、ヽ ｀ヽ 、 🚶ヽ｀｀｀｀ヽヽヽ｀、、ヽ｀、、ヽ*/
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.h... | replace | 59 | 60 | 59 | 60 | 0 | |
p02695 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int A[15], n, m, q, a[55], b[55], c[55], d[55], res, ans;
int main() {
cin >> n >> m >> q;
for (int i = 1; i <= q; i++) {
cin >> a[i] >> b[i] >> c[i] >> d[i];
}
for (int i = 1; i <= n; i++)
A[i] = 1;
while (!a[0]) {
int res = 0;
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int A[15], n, m, q, a[55], b[55], c[55], d[55], res, ans;
int main() {
cin >> n >> m >> q;
for (int i = 1; i <= q; i++) {
cin >> a[i] >> b[i] >> c[i] >> d[i];
}
for (int i = 1; i <= n; i++)
A[i] = 1;
while (!A[0]) {
int res = 0;
... | replace | 11 | 12 | 11 | 12 | TLE | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i < (n + 1); i++)
using namespace std;
using ll = long long;
int n, m, q;
vector<int> a, b, c, d;
int ans;
void dfs(vector<int> A) {
if (A.size() == n + 1) {
int now = 0;
rep(i, q) {
if (A[b[i]] - A[a[i]] == c[i])
now += d[i];
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int n, m, q;
vector<int> a, b, c, d;
int ans;
void dfs(vector<int> A) {
if (A.size() == n + 1) {
int now = 0;
rep(i, q) {
if (A[b[i]] - A[a[i]] == c[i])
now += d[i];
}
an... | replace | 1 | 2 | 1 | 2 | 0 | |
p02695 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (ll i = init; i < (n); i++)
#define repd(i, n, init) for (ll i = (n); i >= init; i--)
#define repm(i, m) for (a... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (ll i = init; i < (n); i++)
#define repd(i, n, init) for (ll i = (n); i >= init; i--)
#define repm(i, m) for (a... | replace | 21 | 22 | 21 | 22 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a ... | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a ... | replace | 23 | 24 | 23 | 24 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
#define MOD 1000000007
#define INF 1000000000
#define mp make_pair
#define pb push_back
#define ss second
#define ff first
#define endl '\n'
#define pl cout <<... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;
#define MOD 1000000007
#define INF 1000000000
#define mp make_pair
#define pb push_back
#define ss second
#define ff first
#define endl '\n'
#define pl cout <<... | replace | 69 | 70 | 69 | 70 | 0 | |
p02695 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int funcovf(int *Ax, int i, int M) {
Ax[i]++;
if (Ax[i] > M) {
funcovf(Ax, i - 1, M);
Ax[i] = Ax[i - 1];
}
return 0;
}
int main() {
int N, M, Q;
cin >> N >> M >> Q;
int ai[50];
int bi[50];
int ci[50];
int di[50]... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int funcovf(int *Ax, int i, int M) {
if (i == 0) {
Ax[0] = 2;
return 0;
}
Ax[i]++;
if (Ax[i] > M) {
funcovf(Ax, i - 1, M);
Ax[i] = Ax[i - 1];
}
return 0;
}
int main() {
int N, M, Q;
cin >> N >> M >> Q;
in... | insert | 7 | 7 | 7 | 12 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
int arr[50][4] = {0};
int Q;
int dfs(vector<int> A, int digit, int max, int N, int M) {
if (A.size() < digit) {
int sum = 0;
for (int i = 0; i <= Q; i++) {
if (A[arr[i][1]] - A[arr[i][0]] == arr[i][2]) {
sum += arr[i][3];
... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
int arr[50][4] = {0};
int Q;
int dfs(vector<int> A, int digit, int max, int N, int M) {
if (N < digit) {
int sum = 0;
for (int i = 0; i <= Q; i++) {
if (A[arr[i][1]] - A[arr[i][0]] == arr[i][2]) {
sum += arr[i][3];
}
... | replace | 9 | 10 | 9 | 10 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int a[50], b[50], c[50], d[50];
int n, m, q;
int mx = 0;
vector<int> t;
int check() {
int curr = 0;
for (int i = 0; i < q; i++) {
if (t[b[i]] - t[a[i]] == c[i])
curr += d[i];
}
return curr;
}
void dfs(int i, int cur) {
if (i ... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int a[50], b[50], c[50], d[50];
int n, m, q;
int mx = 0;
vector<int> t;
int check() {
int curr = 0;
for (int i = 0; i < q; i++) {
if (t[b[i]] - t[a[i]] == c[i])
curr += d[i];
}
return curr;
}
void dfs(int i, int cur) {
if (i ... | insert | 21 | 21 | 21 | 22 | -11 | |
p02695 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
long mod = (long)1e9 + 7;
int n, m, q, a[10], b[10], c[10], d[10], ans = 0;
int bfs(vector<int> t) {
if (t.size() == n... | #include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
long mod = (long)1e9 + 7;
int n, m, q, a[50], b[50], c[50], d[50], ans = 0;
int bfs(vector<int> t) {
if (t.size() == n... | replace | 10 | 11 | 10 | 11 | 0 | |
p02695 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int N, M, Q;
long long ans = 0;
vector<int> a(M), b(M), c(M), d(M);
void dfs(vector<int> v, int depth, int lastNum) {
if (depth == N) {
// 数列が完成したらスコア計算
long long score = 0;
for (int i = 0; i < Q; i++) {
if (v[b[i] - 1] - v[a[i] - 1] == c[i])
s... | #include "bits/stdc++.h"
using namespace std;
int N, M, Q;
long long ans = 0;
vector<int> a(50), b(50), c(50), d(50);
void dfs(vector<int> v, int depth, int lastNum) {
if (depth == N) {
// 数列が完成したらスコア計算
long long score = 0;
for (int i = 0; i < Q; i++) {
if (v[b[i] - 1] - v[a[i] - 1] == c[i])
... | replace | 5 | 6 | 5 | 6 | -11 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m, q;
vector<int> a, b, c, d;
int ans = 0;
void dfs(int cnt, vector<int> A, int now) {
if (cnt == n) {
int num = 0;
for (int i = 0; i < q; i++) {
if (A[b[i] - 1] - A[a[i] - 1] == c[i]) {
num += d[i];
}
}
a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m, q;
vector<int> a, b, c, d;
int ans = 0;
void dfs(int cnt, vector<int> A, int now) {
if (cnt == n) {
int num = 0;
for (int i = 0; i < q; i++) {
if (A[b[i] - 1] - A[a[i] - 1] == c[i]) {
num += d[i];
}
}
a... | replace | 36 | 37 | 36 | 37 | 0 | |
p02695 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repe(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep_bit(n) for (int bit = 0; bit < (1 << n); ++bit)
#define ll long long
using namespace std;
typedef vector<vector<int>> Graph;
int ans = 0;
int N, M, Q;
vector<int> a, b, c, d;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repe(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep_bit(n) for (int bit = 0; bit < (1 << n); ++bit)
#define ll long long
using namespace std;
typedef vector<vector<int>> Graph;
int ans = 0;
int N, M, Q;
vector<int> a, b, c, d;... | insert | 19 | 19 | 19 | 20 | TLE | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct point {
int a, b, c, d;
};
int n, m, q;
point query[55];
int arr[15];
int mx, call;
int f(int curr, int before) {
call++;
for (int i = before; i <= m; i++) {
arr[curr] = i;
if (curr == n) {
int sum = 0;
for (int j = 0; j < q; j++) {
... | #include <bits/stdc++.h>
using namespace std;
struct point {
int a, b, c, d;
};
int n, m, q;
point query[55];
int arr[15];
int mx, call;
void f(int curr, int before) {
call++;
for (int i = before; i <= m; i++) {
arr[curr] = i;
if (curr == n) {
int sum = 0;
for (int j = 0; j < q; j++) {
... | replace | 9 | 10 | 9 | 10 | 0 | |
p02695 | C++ | Runtime Error | /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <cstdint>
#include <iostream>
#include <string>
constexpr int32_t kMaxArraySize = 10;
constexpr int32_t kMinArrayValue = 1;
constexpr int32_t kMaxArrayValue = 10;
constexpr int32_t kMaxNumberOfConditions = 10;
void CallDepthFirstSearch(std::istream &input_str... | /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <cstdint>
#include <iostream>
#include <string>
constexpr int32_t kMaxArraySize = 10;
constexpr int32_t kMinArrayValue = 1;
constexpr int32_t kMaxArrayValue = 10;
constexpr int32_t kMaxNumberOfConditions = 50;
void CallDepthFirstSearch(std::istream &input_str... | replace | 11 | 12 | 11 | 12 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, m, q;
long long ans = 0;
vector<int> a(10), b(10), c(10), d(10);
void calc(vector<int> &A) {
long long cur = 0;
for (int i = 0; i < q; i++) {
if (A[a[i] - 1] + c[i] == A[b[i] - 1])
cur += d[i];
}
ans = max(ans, cur);
}
void rec(vector<int> &A, in... | #include <bits/stdc++.h>
using namespace std;
int n, m, q;
long long ans = 0;
vector<int> a(50), b(50), c(50), d(50);
void calc(vector<int> &A) {
long long cur = 0;
for (int i = 0; i < q; i++) {
if (A[a[i] - 1] + c[i] == A[b[i] - 1])
cur += d[i];
}
ans = max(ans, cur);
}
void rec(vector<int> &A, in... | replace | 5 | 6 | 5 | 6 | 0 | |
p02695 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int n, m, q;
vector<int> a, b, c, d;
int ans = 0;
void dfs(vector<int> s) {
if (s.size() == n + 1) {
int now = 0;
for (int i = 0; i < q; i++)
if (s[b[i]] - s[a[i]] == c[i])
now += d[i];
ans = max(ans, now);
}
s.push_back(s.back()... | #include <iostream>
#include <vector>
using namespace std;
int n, m, q;
vector<int> a, b, c, d;
int ans = 0;
void dfs(vector<int> s) {
if (s.size() == n + 1) {
int now = 0;
for (int i = 0; i < q; i++)
if (s[b[i]] - s[a[i]] == c[i])
now += d[i];
ans = max(ans, now);
return;
}
s.push_b... | insert | 13 | 13 | 13 | 14 | TLE | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T> istream &operator>>(istream &istr, vector<T> &v) {
for (T &x : v)
istr >> x;
return istr;
}
template <typename T, typename U>
istream &operator>>(istream &istr, pair<T, U> &p) {
istr >> p.first >> p.second;
return istr;
}
template <typen... | #include <bits/stdc++.h>
using namespace std;
template <typename T> istream &operator>>(istream &istr, vector<T> &v) {
for (T &x : v)
istr >> x;
return istr;
}
template <typename T, typename U>
istream &operator>>(istream &istr, pair<T, U> &p) {
istr >> p.first >> p.second;
return istr;
}
template <typen... | replace | 119 | 120 | 119 | 120 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | replace | 76 | 77 | 76 | 77 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<int> a, b, c, d;
int n, m, q;
int ans;
void dfs(vector<int> A) {
if (A.size() == n + 1) {
int sum = 0;
for (int i = 0; i < q; i++) {
if (A[b[i]] - A[a[i]] == c[i]) {
sum += d[i];
}
}
ans = max(ans, sum);
return;
}
a.push... | #include <bits/stdc++.h>
using namespace std;
vector<int> a, b, c, d;
int n, m, q;
int ans;
void dfs(vector<int> A) {
if (A.size() == n + 1) {
int sum = 0;
for (int i = 0; i < q; i++) {
if (A[b[i]] - A[a[i]] == c[i]) {
sum += d[i];
}
}
ans = max(ans, sum);
return;
}
A.push... | replace | 17 | 18 | 17 | 18 | -11 | |
p02695 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
int A[10], a[10], b[10], c[10], d[10];
int ans;
int n, m, q;
void dfs(int k) {
if (k == n) {
int sum = 0;
for (int i = 0; i < q; ++i) {
if (A[b[i]] - A[a[i]] == c[i])
sum += d[i];
}
ans = std::max(ans, sum);
return;
}
for (int i = A[... | #include <algorithm>
#include <iostream>
int A[10], a[50], b[50], c[50], d[50];
int ans;
int n, m, q;
void dfs(int k) {
if (k == n) {
int sum = 0;
for (int i = 0; i < q; ++i) {
if (A[b[i]] - A[a[i]] == c[i])
sum += d[i];
}
ans = std::max(ans, sum);
return;
}
for (int i = A[... | replace | 3 | 4 | 3 | 4 | 0 | |
p02695 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
using ll = long long int;
int main(void) {
int n, m, q;
cin >> n >> m >> q;
vector<int> a(q), b(q), c(q), d(q);
for (int i = 0; i < q; i++) {
cin >> a[i] >> b[i] >> c[i] >> d[i];
}
int mx = 0, score;
vector<int> s(n, 1);
do {
score = 0... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long int;
int main(void) {
int n, m, q;
cin >> n >> m >> q;
vector<int> a(q), b(q), c(q), d(q);
for (int i = 0; i < q; i++) {
cin >> a[i] >> b[i] >> c[i] >> d[i];
}
int mx = 0, score;
vector<int> s(n, 1);
do {
score = 0... | replace | 25 | 31 | 25 | 34 | 0 | |
p02695 | C++ | Runtime Error | #include <iostream>
using namespace std;
#ifndef ONLINE_JUDGE
#include <fstream>
#define cin fin
#define cout fout
ifstream fin("test.in");
ofstream fout("test.out");
#endif
int p[10];
int n, m, q;
int a[60], b[60], c[60], d[60];
int f(int i, int fn) {
if (i == n + 1) {
int r = 0;
/*for (int j = 1; j <= n... | #include <iostream>
using namespace std;
#ifndef ONLINE_JUDGE
#include <fstream>
#define cin fin
#define cout fout
ifstream fin("test.in");
ofstream fout("test.out");
#endif
int p[11];
int n, m, q;
int a[60], b[60], c[60], d[60];
int f(int i, int fn) {
if (i == n + 1) {
int r = 0;
/*for (int j = 1; j <= n... | replace | 12 | 13 | 12 | 13 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1e9 + 7;
using ll = long long;
int main() {
int n, m, q;
cin >> n >> m >> q;
vector<ll> a(n), b(n), c(n), d(n);
rep(i, q) {
int A, B, C, D;
cin >> A >> B >> C >> D;
A--;
B--;
a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1e9 + 7;
using ll = long long;
int main() {
int n, m, q;
cin >> n >> m >> q;
vector<ll> a(q), b(q), c(q), d(q);
rep(i, q) {
int A, B, C, D;
cin >> A >> B >> C >> D;
A--;
B--;
a... | replace | 9 | 10 | 9 | 10 | 0 | |
p02695 | C++ | Runtime Error | #include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
// などの必要なインクルードファイルすべて（3章の各標準ライブラリの説明でそれぞれ書いています）
using namespace std;
int N, M, Q;
int a[50][4];
int A[10];
int t, c;
int tokuten(int k) {
int i, j;
if (k == N) {
c = 0;
for (j = 0; j < Q; j++) {
if... | #include <iostream>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
// などの必要なインクルードファイルすべて（3章の各標準ライブラリの説明でそれぞれ書いています）
using namespace std;
int N, M, Q;
int a[50][4];
int A[10];
int t, c;
void tokuten(int k) {
int i, j;
if (k == N) {
c = 0;
for (j = 0; j < Q; j++) {
i... | replace | 17 | 18 | 17 | 18 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, m, q;
vector<int> a, b, c, d;
int ans = 0;
void dfs(vector<int> k) {
if ((int)k.size() == m + 1) {
int sco = 0;
for (int i = 0; i < q; i++) {
if (k.at(b.at(i)) - k.at(a.at(i)) == c.at(i))
sco += d.at(i);
}
ans = max(ans, sco);
ret... | #include <bits/stdc++.h>
using namespace std;
int n, m, q;
vector<int> a, b, c, d;
int ans = 0;
void dfs(vector<int> k) {
if ((int)k.size() == n + 1) {
int sco = 0;
for (int i = 0; i < q; i++) {
if (k.at(b.at(i)) - k.at(a.at(i)) == c.at(i))
sco += d.at(i);
}
ans = max(ans, sco);
ret... | replace | 7 | 8 | 7 | 8 | 0 | |
p02695 | C++ | Runtime Error | /*input
10 10 1
1 10 9 1
*/
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mod 998244353
#define int long long
int n, m, q;
struct node {
int a, b, c, d;
node(int a1, int b1, int c1, int d1) : a(a1), b(b1), c(c1), d(d1) {}
node() {}
};
vector<node> Q;
int ans = 0;
int cal(vector<int>... | /*input
10 10 1
1 10 9 1
*/
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mod 998244353
#define int long long
int n, m, q;
struct node {
int a, b, c, d;
node(int a1, int b1, int c1, int d1) : a(a1), b(b1), c(c1), d(d1) {}
node() {}
};
vector<node> Q;
int ans = 0;
int cal(vector<int>... | replace | 43 | 44 | 43 | 44 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL << 60;
long long N;
long long M;
long long Q;
vector<ll> a, b, c, d;
ll ans = 0;
// i: 何回めか
// v: 配列
void dfs(int cnt, int i, vecto... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL << 60;
long long N;
long long M;
long long Q;
vector<ll> a, b, c, d;
ll ans = 0;
// i: 何回めか
// v: 配列
void dfs(int cnt, int i, vecto... | insert | 33 | 33 | 33 | 34 | -11 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int check(vector<int> A, int Q, int r[11][4]) {
int score = 0;
for (int i = 0; i < Q; i++) {
if (A[r[i][1]] - A[r[i][0]] == r[i][2]) {
score += r[i][3];
}
}
return score;
}
int main(void) {
int N, M, Q;
std::cin >> N >> M >> Q;
int r[11][4];
f... | #include <bits/stdc++.h>
using namespace std;
int check(vector<int> A, int Q, int r[11][4]) {
int score = 0;
for (int i = 0; i < Q; i++) {
if (A[r[i][1]] - A[r[i][0]] == r[i][2]) {
score += r[i][3];
}
}
return score;
}
int main(void) {
int N, M, Q;
std::cin >> N >> M >> Q;
int r[55][4];
f... | replace | 15 | 16 | 15 | 16 | 0 | |
p02695 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
#define fs first
#define sc second
#define _GLIBCXX_DEBUG
template <class S> S sum(vector<S> &... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
#define fs first
#define sc second
#define _GLIBCXX_DEBUG
template <class S> S sum(vector<S> &... | replace | 38 | 39 | 38 | 39 | TLE | |
p02695 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
const int N = 100005;
using namespace std;
int A[15], n, m, q, a[55], b[55], c[55], d[55], ans;
int main() {
cin >> n >> m >> q;
for (int i = 1; i <= q; i++)
cin >> a[i] >> b[i] >> c[i] >> d[i];
for (int i = 1; i <= n; i++)
A[i] = 1;
while (!a[0]) {
int ... | #include <bits/stdc++.h>
#define ll long long
const int N = 100005;
using namespace std;
int A[15], n, m, q, a[55], b[55], c[55], d[55], ans;
int main() {
cin >> n >> m >> q;
for (int i = 1; i <= q; i++)
cin >> a[i] >> b[i] >> c[i] >> d[i];
for (int i = 1; i <= n; i++)
A[i] = 1;
while (!A[0]) {
int ... | replace | 11 | 12 | 11 | 12 | TLE | |
p02695 | C++ | Runtime Error | #include <iostream>
using namespace std;
int maxv = 0;
struct node {
int a, b, c, d;
};
node tmp[20];
int arr[20];
int n, m, q;
void dfs(int u, int last) {
if (u == n + 1) {
int sum = 0;
for (int i = 1; i <= q; i++) {
if (arr[tmp[i].b] - arr[tmp[i].a] == tmp[i].c) {
sum += tmp[i].d;
}
... | #include <iostream>
using namespace std;
int maxv = 0;
struct node {
int a, b, c, d;
};
node tmp[100];
int arr[20];
int n, m, q;
void dfs(int u, int last) {
if (u == n + 1) {
int sum = 0;
for (int i = 1; i <= q; i++) {
if (arr[tmp[i].b] - arr[tmp[i].a] == tmp[i].c) {
sum += tmp[i].d;
}
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02695 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
... | replace | 24 | 25 | 24 | 25 | 0 | |
p02695 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
using namespace std;
int main() {
int N, M, Q;
int ans = 0;
cin >> N >> M >> Q;
vector<int> A(N + 2);
vector<int> v(4 + 2, 0);
vector<vector<int>> S(Q + 2, v);
for (int i ... | #include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
using namespace std;
int main() {
int N, M, Q;
int ans = 0;
cin >> N >> M >> Q;
vector<int> A(N + 5);
vector<int> v(4 + 5, 0);
vector<vector<int>> S(Q + 5, v);
for (int i ... | replace | 13 | 16 | 13 | 16 | -11 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<long long> factorial;
long long fact(long long n) {
if (factorial[n] == -1)
factorial[n] = n * fact(n - 1);
return factorial[n];
}
long long binom(long long n, long long r) {
return fact(n) / fact(r) / fact(n - r);
}
int main() {
int n, m, q;
cin >> n >... | #include <bits/stdc++.h>
using namespace std;
vector<long long> factorial;
long long fact(long long n) {
if (factorial[n] == -1)
factorial[n] = n * fact(n - 1);
return factorial[n];
}
long long binom(long long n, long long r) {
return fact(n) / fact(r) / fact(n - r);
}
int main() {
int n, m, q;
cin >> n >... | insert | 33 | 33 | 33 | 35 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int N, M, Q;
vector<int> a, b, c, d;
ll ans;
// 参考:解説放送
void dfs(vector<int> A) {
if (A.size() == M + 1) //([0]を1にしてi-indexedにしているため)
{
// calc an... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int N, M, Q;
vector<int> a, b, c, d;
ll ans;
// 参考:解説放送
void dfs(vector<int> A) {
if (A.size() == N + 1) //([0]を1にしてi-indexedにしているため)
{
// calc an... | replace | 12 | 13 | 12 | 13 | 0 | |
p02695 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
// 特別に1を最初の要素とする
int64_t f(vector<int> &A, int i, int m, vi const &a, vi const &b, vi const &... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
// 特別に1を最初の要素とする
int64_t f(vector<int> &A, int i, int m, vi const &a, vi const &b, vi const &... | replace | 18 | 19 | 18 | 19 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
typedef tuple<int, int, int, int> T;
#define PI 3.14159265359
#define MOD 1000000007
const int MAX = 510000;
int maxd = 0;
vector<int> A(11);
int N, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
typedef tuple<int, int, int, int> T;
#define PI 3.14159265359
#define MOD 1000000007
const int MAX = 510000;
int maxd = 0;
vector<int> A(11);
int N, ... | replace | 17 | 18 | 17 | 18 | 0 | |
p02695 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <functional> //sort第三引数greater<型名>()で降順
#include <iomanip> //cout<<setw(数字) で空白による桁揃え
#include <iostream> //cout<<right で右揃え
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ... | #include <algorithm>
#include <cmath> //abs()かfabs()で少数絶対値
#include <cstdlib> //abs()で整数絶対値
#include <functional> //sort第三引数greater<型名>()で降順
#include <iomanip> //cout<<setw(数字) で空白による桁揃え
#include <iostream> //cout<<right で右揃え
#include <queue>
#include <string>
#include <vector>
using namespace std;
using ... | insert | 17 | 17 | 17 | 18 | TLE | |
p02695 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | insert | 1,263 | 1,263 | 1,263 | 1,272 | 0 | |
p02695 | C++ | Runtime Error | // raja1999
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#includ... | // raja1999
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#includ... | insert | 79 | 79 | 79 | 80 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define BOUND 27182818284
#define MAT 2
typedef long long ll;
typedef long long int lli;
typedef pair<ll, ll> P;
ll MOD = 1000000007;
const ll INF = (1ll << 60);
const int INFint = (1 << 30);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) fo... | #include <bits/stdc++.h>
using namespace std;
#define BOUND 27182818284
#define MAT 2
typedef long long ll;
typedef long long int lli;
typedef pair<ll, ll> P;
ll MOD = 1000000007;
const ll INF = (1ll << 60);
const int INFint = (1 << 30);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) fo... | insert | 413 | 413 | 413 | 414 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, m, q, a[50], b[50], c[50], d[50], ans = 0, A[10];
int dfs(int p, int k) {
if (p == n) {
int sum = 0;
for (int i = 0; i < q; i++) {
if (A[b[i] - 1] - A[a[i] - 1] == c[i])
sum += d[i];
}
ans = max(ans, sum);
} else {
for (int i = k... | #include <bits/stdc++.h>
using namespace std;
int n, m, q, a[50], b[50], c[50], d[50], ans = 0, A[10];
void dfs(int p, int k) {
if (p == n) {
int sum = 0;
for (int i = 0; i < q; i++) {
if (A[b[i] - 1] - A[a[i] - 1] == c[i])
sum += d[i];
}
ans = max(ans, sum);
} else {
for (int i = ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repo(i, n) for (int i = 1; i <= n; i++)
#define INF 1001001001
#define INFll 100100100100100
// debug用
#define PrintVec(x) \
for (auto elementPrintVec : x) { ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repo(i, n) for (int i = 1; i <= n; i++)
#define INF 1001001001
#define INFll 100100100100100
// debug用
#define PrintVec(x) \
for (auto elementPrintVec : x) { ... | replace | 45 | 49 | 45 | 49 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N, M, Q;
int dsum = 0;
cin >> N >> M >> Q;
vector<vector<int>> kumi(Q, vector<int>(4));
for (int i = 0; i < Q; i++) {
cin >> kumi[i][0] >> kumi[i][1] >> kumi[i][2] >> kumi[i][3];
}
vector<int> A(N);
for (int tmp =... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int N, M, Q;
int dsum = 0;
cin >> N >> M >> Q;
vector<vector<int>> kumi(Q, vector<int>(4));
for (int i = 0; i < Q; i++) {
cin >> kumi[i][0] >> kumi[i][1] >> kumi[i][2] >> kumi[i][3];
}
vector<int> A(N);
for (int tmp =... | replace | 17 | 19 | 17 | 21 | 0 | |
p02695 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int ans;
int a[10], b[10], c[10], d[10];
int n, m, q;
void dfs(vector<int> A) {
if (A.size() == n + 1) {
int now = 0;
rep(i, q) if (A[b[i]] - A[a[i]] == c[i]) now += d[i];
ans = max(ans, now... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int ans;
int a[50], b[50], c[50], d[50];
int n, m, q;
void dfs(vector<int> A) {
if (A.size() == n + 1) {
int now = 0;
rep(i, q) if (A[b[i]] - A[a[i]] == c[i]) now += d[i];
ans = max(ans, now... | replace | 6 | 7 | 6 | 7 | 0 | |
p02695 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
template <class T> inline void read(T &x) {
x = 0;
int f = 0;
char ch = getchar();
while (!isdigit(ch)) {
f |= ch == '-';
ch = getchar();
}
while (isdigit(ch)) {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar()... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
template <class T> inline void read(T &x) {
x = 0;
int f = 0;
char ch = getchar();
while (!isdigit(ch)) {
f |= ch == '-';
ch = getchar();
}
while (isdigit(ch)) {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar()... | replace | 21 | 22 | 21 | 22 | 0 | |
p02695 | C++ | Runtime Error | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | #pragma GCC optimize("O3")
#define _GLIBCXX_DEBUG
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string_view>
#include <vector>
using namespace s... | replace | 87 | 88 | 87 | 88 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02695 | C++ | Runtime Error | // #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#incl... | // #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#incl... | replace | 68 | 69 | 68 | 69 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.