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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03127 | C++ | Time Limit Exceeded |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int INF = (1 << 30);
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int main() {
//
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int ans = INF;
for (int i = 0; i < N; ++i) {
... |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int INF = (1 << 30);
int gcd(int a, int b) { return b != 0 ? gcd(b, a % b) : a; }
int main() {
//
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
int ans = INF;
for (int i = 1; i < N; ++i) {
... | replace | 22 | 26 | 22 | 26 | TLE | |
p03127 | C++ | Runtime Error | #include <iostream>
using namespace std;
long gcd(long a, long b) {
if (a == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
long A[n];
int i;
for (i = 0; i < n; i++) {
cin >> A[i];
}
long ans = A[0];
for (i = 1; i < n; i++) {
ans = gcd(ans, A[i]);... | #include <iostream>
using namespace std;
long gcd(long a, long b) {
if (b == 0) {
return a;
} else {
return gcd(b, a % b);
}
}
int main() {
int n;
cin >> n;
long A[n];
int i;
for (i = 0; i < n; i++) {
cin >> A[i];
}
long ans = A[0];
for (i = 1; i < n; i++) {
ans = gcd(ans, A[i]);... | replace | 3 | 4 | 3 | 4 | -8 | |
p03127 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, x) for (__typeof(x) i = 0; i < x; i++)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define sci(x) ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, x) for (__typeof(x) i = 0; i < x; i++)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define sci(x) ... | replace | 60 | 65 | 60 | 65 | TLE | |
p03127 | C++ | Time Limit Exceeded | #include <iostream>
#include <queue>
using namespace std;
int main() {
vector<int> dtom{-1, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int n, m;
cin >> n;
long long int min = 10000000000;
priority_queue<int> pq;
int temp;
for (int i = 0; i < n; i++) {
cin >> temp;
pq.push(temp);
}
while (pq.size() != 1) {
... | #include <iostream>
#include <queue>
using namespace std;
int main() {
vector<int> dtom{-1, 2, 5, 5, 4, 5, 6, 3, 7, 6};
int n, m;
cin >> n;
long long int min = 10000000000;
priority_queue<int> pq;
int temp;
for (int i = 0; i < n; i++) {
cin >> temp;
pq.push(temp);
}
while (pq.size() != 1) {
... | replace | 21 | 22 | 21 | 22 | TLE | |
p03127 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
ll gcd(ll a, ll b) {
if (a < b) {
ll temp = a;
a = b;
b = temp;
}
ll r = a % b;
while (r > 0) {
a = b;
b = r;
r = a % b;
}
return 0;
}
int main() {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define ll long long
using namespace std;
ll gcd(ll a, ll b) {
if (a < b) {
ll temp = a;
a = b;
b = temp;
}
ll r = a % b;
while (r > 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
... | replace | 19 | 20 | 19 | 20 | -8 | |
p03127 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (auto &a : A) {
cin >> a;
}
sort(A.begin(), A.end());
int s = 0;
while (s < N - 1) {
if (A[s] == 1) {
break;
}
for (int ii = s + 1; ii < N; ii++) {
A[ii] -= A[s];
}
sor... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (auto &a : A) {
cin >> a;
}
sort(A.begin(), A.end());
int s = 0;
while (s < N - 1) {
if (A[s] == 1) {
break;
}
for (int ii = s + 1; ii < N; ii++) {
A[ii] %= A[s];
}
sor... | replace | 18 | 19 | 18 | 19 | TLE | |
p03127 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll>::iterator min_it;
int minIndex;
ll min;
while (a.size() >... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll>::iterator min_it;
int minIndex;
ll min;
while (a.size() >... | insert | 31 | 31 | 31 | 32 | -8 | |
p03127 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, mi = 1000000000;
bool bou = true;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
int a = 1;
while (1) {
a *= 2;
for (int i = 0; i < vec.si... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, mi = 1000000000;
bool bou = true;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
int a = 1;
while (1) {
a *= 2;
for (int i = 0; i < vec.si... | replace | 18 | 19 | 18 | 19 | 0 | |
p03127 | C++ | Runtime Error | //----------------------------------------------------------------------
#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>;
using Graph = vector<vecto... | //----------------------------------------------------------------------
#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>;
using Graph = vector<vecto... | insert | 12 | 12 | 12 | 13 | 0 | |
p03127 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int GCD(int x, int y) { return x ? GCD(y % x, x) : y; }
int main() {
int n;
cin >> n;
vector<int> k;
for (int i = 0; i < n; i++)
cin >> k.at(i);
int s = k[0];
for (int i = 0; i < n; i++)
s = GCD(s, k.at(i));
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int GCD(int x, int y) { return x ? GCD(y % x, x) : y; }
int main() {
int n;
cin >> n;
vector<int> k(n);
for (int i = 0; i < n; i++)
cin >> k.at(i);
int s = k[0];
for (int i = 0; i < n; i++)
s = GCD(s, k.at(i));
cout << s << endl;
}
| replace | 6 | 7 | 6 | 7 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p03127 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int N_MAX = 2000;
long gcd(long m, long n) {
while (m > 0 && n > 0) {
n = n % m;
if (n > 0)
m = m % n;
}
if (n == 0)
return m;
else
return n;
}
int main() {
int n;
cin >> n;
int a[N_MAX];
for (int i = 0; i < n; i++)
... | #include <algorithm>
#include <iostream>
using namespace std;
int N_MAX = 100000;
long gcd(long m, long n) {
while (m > 0 && n > 0) {
n = n % m;
if (n > 0)
m = m % n;
}
if (n == 0)
return m;
else
return n;
}
int main() {
int n;
cin >> n;
int a[N_MAX];
for (int i = 0; i < n; i++)
... | replace | 3 | 4 | 3 | 4 | 0 | |
p03127 | C++ | Runtime Error | //---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <numeric>
#include <sstream>
#include <vector>
//... | //---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <numeric>
#include <sstream>
#include <vector>
//... | replace | 58 | 60 | 58 | 62 | 0 | |
p03127 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
int calc_min(int x, int y) { return x % y == 0 ? y : calc_min(y, x % y); }
int main(void) {
int n;
int mon[100000];
int min = 1000000000;
int fmin = 0;
scanf("%d", &n);
for (int num = 0; num < n; num++) {
scanf("%d", ... | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
int calc_min(int x, int y) { return x % y == 0 ? y : calc_min(y, x % y); }
int main(void) {
int n;
int mon[100000];
int min = 1000000000;
int fmin = 0;
scanf("%d", &n);
for (int num = 0; num < n; num++) {
scanf("%d", ... | replace | 19 | 25 | 19 | 24 | TLE | |
p03127 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
pair<ll, ll> mininarray(vector<ll> a, int n) {
ll mina = a.at(0);
int ind = 0;
rep(p, n) {
if (a.at(p) != 0) {
if (mina > a.at(p)) {
mina = a.at(p);
ind = p;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
pair<ll, ll> mininarray(vector<ll> a, int n) {
ll mina = 1000000000;
int ind = 0;
rep(p, n) {
if (a.at(p) != 0) {
if (mina > a.at(p)) {
mina = a.at(p);
ind = p;
... | replace | 6 | 7 | 6 | 7 | 0 | |
p03127 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define ONLINE_JUDGE
#define ll long long
#define PI 3.14159265359
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)
#define pb(a) push_back(a)
//////////// Solution /////////////////////////////////
const int MAX = 1e5 + 1;
void solve() {
int n;
cin >>... | #include <bits/stdc++.h>
using namespace std;
#define ONLINE_JUDGE
#define ll long long
#define PI 3.14159265359
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)
#define pb(a) push_back(a)
//////////// Solution /////////////////////////////////
const int MAX = 1e5 + 1;
void solve() {
int n;
cin >> n;... | replace | 3 | 4 | 3 | 4 | -11 | |
p03127 | C++ | Time Limit Exceeded | #include <stdio.h>
long long int gcd(long long int a, long long int b) {
long long int tmp;
while (1) {
if (a % b == 0) {
return b;
break;
} else {
if (a > b)
a = a - b;
tmp = a;
a = b;
b = tmp;
}
}
}
int main(void) {
long long int n, i, j, ans;
scanf(... | #include <stdio.h>
long long int gcd(long long int a, long long int b) {
long long int tmp;
while (1) {
if (a % b == 0) {
return b;
break;
} else {
a = a % b;
tmp = a;
a = b;
b = tmp;
}
}
}
int main(void) {
long long int n, i, j, ans;
scanf("%lld", &n);
int ... | replace | 9 | 11 | 9 | 10 | TLE | |
p03127 | C++ | Runtime Error | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#define _USE_MATH_DEFINES
#include <math.h>
// #include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <c... | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#define _USE_MATH_DEFINES
#include <math.h>
// #include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <c... | replace | 117 | 118 | 117 | 118 | 0 | |
p03127 | C++ | Time Limit Exceeded | // INCLUDE
//------------------------------------------
#include <bits/stdc++.h>
// DEFINE
//------------------------------------------
#define ll long long
#define ld long double
#define ALLv(a) (a).begin(), (a).end()
#define ALL(a, n) (a), (a) + n
#define vi vector<long long>
#define vd vector<long double>
#define vs... | // INCLUDE
//------------------------------------------
#include <bits/stdc++.h>
// DEFINE
//------------------------------------------
#define ll long long
#define ld long double
#define ALLv(a) (a).begin(), (a).end()
#define ALL(a, n) (a), (a) + n
#define vi vector<long long>
#define vd vector<long double>
#define vs... | replace | 45 | 65 | 45 | 49 | TLE | |
p03127 | C++ | Runtime Error | #include <iostream>
#include <utility>
int n;
int a;
int gcd(int x, int y) {
if (x > y)
std::swap(x, y);
return (x == 1) ? y : gcd(y % x, x);
}
int main() {
std::cin >> n;
std::cin >> a;
int g = a;
for (int i = 0; i < n - 1; ++i) {
std::cin >> a;
g = gcd(g, a);
}
std::cout << g << s... | #include <iostream>
#include <utility>
int n;
int a;
int gcd(int x, int y) {
if (x > y)
std::swap(x, y);
return (x == 0) ? y : gcd(y % x, x);
}
int main() {
std::cin >> n;
std::cin >> a;
int g = a;
for (int i = 0; i < n - 1; ++i) {
std::cin >> a;
g = gcd(g, a);
}
std::cout << g << s... | replace | 10 | 11 | 10 | 11 | -8 | |
p03127 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
int c;
c = a % b;
a = b;
b = c;
if (c == 0) {
return a;
} else {
return GCD(a, b);
}
}
int main() {
int N, i, j, mn = 1000000000;
cin >> N;
vector<int> A(N);
for (i = 0; i < N; i++)
cin >> A[i];
for (i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
int c;
c = a % b;
a = b;
b = c;
if (c == 0) {
return a;
} else {
return GCD(a, b);
}
}
int main() {
int N, i, j, mn = 1000000000;
cin >> N;
vector<int> A(N);
for (i = 0; i < N; i++)
cin >> A[i];
for (i = 0; i ... | replace | 24 | 28 | 24 | 26 | TLE | |
p03127 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG // TLEの原因になるので注意！！！！！！！！！！！
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1... | #include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
typedef set<int> set_t;
typed... | delete | 0 | 1 | 0 | 0 | TLE | |
p03127 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, P> P3;
const ll MOD = ll(1e9) + 7;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(1e5 + 5);
const double EPS = 1e-11;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define R... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, P> P3;
const ll MOD = ll(1e9) + 7;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(1e5 + 5);
const double EPS = 1e-11;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define R... | replace | 17 | 19 | 17 | 19 | -8 | |
p03127 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
int gcd(int a, int b);
int gcd(std::vector<int> a);
int main() {
int n;
std::vector<int> v(n);
for (int &x : v) {
std::cin >> x;
}
std::cout << gcd(v) << std::endl;
return 0;
}
int gcd(int a, int b) {
if (a % b == 0) {
return b;
} ... | #include <algorithm>
#include <iostream>
#include <vector>
int gcd(int a, int b);
int gcd(std::vector<int> a);
int main() {
int n;
std::cin >> n;
std::vector<int> v(n);
for (int &x : v) {
std::cin >> x;
}
std::cout << gcd(v) << std::endl;
return 0;
}
int gcd(int a, int b) {
if (a % b == 0) {
... | insert | 9 | 9 | 9 | 11 | -8 | |
p03127 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < ... | replace | 26 | 29 | 26 | 27 | TLE | |
p03127 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define all(x) (x).begin(), (x).end()
#define PRI(n) c... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define all(x) (x).begin(), (x).end()
#define PRI(n) c... | delete | 155 | 157 | 155 | 155 | -11 | |
p03127 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define MAX 10000
int N;
long int A[MAX];
bool one_survive() {
int survive = 0;
for (int i = 0; i < N; i++) {
if (A[i] > 0) {
survive += 1;
}
}
if (survive == 1) {
return true;
} else {
return false;
}
}
int main() {
cin >> N;
for (int i =... | #include <iostream>
using namespace std;
#define MAX 100000
int N;
long int A[MAX];
bool one_survive() {
int survive = 0;
for (int i = 0; i < N; i++) {
if (A[i] > 0) {
survive += 1;
}
}
if (survive == 1) {
return true;
} else {
return false;
}
}
int main() {
cin >> N;
for (int i ... | replace | 2 | 3 | 2 | 3 | 0 | |
p03127 | C++ | Runtime Error | //
// Created by yuu on 2019-06-30.
//
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a %... | //
// Created by yuu on 2019-06-30.
//
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a %... | replace | 48 | 49 | 48 | 49 | 0 | |
p03127 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> monsters(n);
for (int i = 0; i < monsters.size(); i++) {
cin >> monsters[i];
}
int min = monsters[0];
for (int pow : monsters) {
min = __gcd(min, pow);
}
cout << min << endl;
}
| #include <bits/stdc++.h>
#include <numeric>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> monsters(n);
for (int i = 0; i < monsters.size(); i++) {
cin >> monsters[i];
}
int min = monsters[0];
for (int i = 0; i < monsters.size(); i++) {
min = __gcd(min, monsters[i]);
}
cout <<... | replace | 12 | 14 | 12 | 14 | TLE | |
p03127 | C++ | Runtime Error | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto &x : c) { \
cout << x << ' '; ... | #include "bits/stdc++.h"
#define REP(i, num) for (int i = 0; i < (num); ++i)
#define ALL(c) c.begin(), c.end()
#define PRINTALL(c) \
for (auto &x : c) { \
cout << x << ' '; ... | replace | 28 | 32 | 28 | 35 | 0 | |
p03127 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
while (a != b) {
if (a > b)
a = a - b;
if (a < b)
b = b - a;
}
return a;
}
int main() {
int N;
cin >> N;
vector<int> S(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
for (int i = 1; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
while (a != b) {
if (a > b) {
if (a % b == 0)
return b;
else
a = a % b;
}
if (a < b) {
if (b % a == 0)
return a;
else
b = b % a;
}
}
return a;
}
int main() {
int N;
... | replace | 5 | 9 | 5 | 17 | TLE | |
p03127 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
else
return gcd(b, ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
else
return gcd(b, ... | replace | 24 | 25 | 24 | 25 | -11 | |
p03127 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(i) sort((i).begin(), (i).end())
#define INF 2000000000
constexpr ll mod = 1000000007;
ll gcd(ll x, ll y) { return y != 0 ? gcd(y, x % y) : x; }
int main() {
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(i) sort((i).begin(), (i).end())
#define INF 2000000000
constexpr ll mod = 1000000007;
ll gcd(ll x, ll y) { return y != 0 ? gcd(y, x % y) : x; }
int main() {
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; ++i) {
cin ... | replace | 16 | 22 | 16 | 20 | TLE | |
p03127 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x = 0 || y == 0)
return max(x, y);
else {
if (x < y)
return gcd(x, y % x);
else if (y < x)
return gcd(y, x % y);
else
return x;
}
}
int main() {
int N;
cin >> N;
int Min;
cin >> Min;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (x == 0 || y == 0)
return max(x, y);
else {
if (x < y)
return gcd(x, y % x);
else if (y < x)
return gcd(y, x % y);
else
return x;
}
}
int main() {
int N;
cin >> N;
int Min;
cin >> Min;
for (int i =... | replace | 3 | 4 | 3 | 4 | -8 | |
p03127 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main(void) {
int n;
cin >> n;
long a[n];
for (int i = 0; i < ... | #include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b)
euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
int main(void) {
int n;
cin >> n;
long a[n];
for (int i = 0; i < ... | replace | 27 | 32 | 27 | 31 | TLE | |
p03127 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int Solve() {
int n;
cin >> n;
int res = INT_MAX;
priority_queue<int> que;
for (int i = 0, a; i < n; ++i) {
cin >> a;
que.push(a);
res = min(res, a);
}
while (1 < que.size()) {
int cur = que.top();
que.pop();
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int Solve() {
int n;
cin >> n;
int res = INT_MAX;
priority_queue<int> que;
for (int i = 0, a; i < n; ++i) {
cin >> a;
que.push(a);
res = min(res, a);
}
while (1 < que.size()) {
int cur = que.top();
que.pop();
... | replace | 22 | 24 | 22 | 25 | TLE | |
p03127 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll m, ll n) {
if (m == 0 || n == 0)
return 0;
// ユークリッドの方法
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}... | #include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll m, ll n) {
if (m == 0 || n == 0)
return 0;
// ユークリッドの方法
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}... | replace | 47 | 50 | 47 | 48 | TLE | |
p03127 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long int gcd(long int m, long int n) {
if ((0 == m) || (0 == n))
return 0;
while (m != n) {
if (m > n)
m = m - n;
else
n = n - m;
}
return m;
}
int main() {
int n;
cin >> n;
long int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[... | #include <bits/stdc++.h>
using namespace std;
long int gcd(long int m, long int n) {
if ((0 == m) || (0 == n))
return 0;
while (m != n) {
if (m > n) {
if (m % n == 0) {
m = n;
} else {
m = m % n;
}
} else {
if (n % m == 0) {
n = m;
} else {
... | replace | 7 | 11 | 7 | 20 | TLE | |
p03127 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long GCD(long long A, long long B) {
long long R = A % B;
while (R != 0) {
A = B;
B = R;
R = A % B;
}
return B;
}
int main(void) {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A.begin(), A.end(... | #include <bits/stdc++.h>
using namespace std;
long long GCD(long long A, long long B) {
long long R = A % B;
while (R != 0) {
A = B;
B = R;
R = A % B;
}
return B;
}
int main(void) {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A.begin(), A.end(... | replace | 19 | 23 | 19 | 21 | TLE | |
p03127 | C++ | Time Limit Exceeded | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | replace | 207 | 213 | 207 | 211 | TLE | |
p03127 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <numeric>
long long int GCD(long long int a, long long int b) {
long long int c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
using namespace std;
int main() {
int n;
long long int a[n + 1];
for (int i = 0; i != n; i++) {
cin >> a[i];
}
lon... | #include <bits/stdc++.h>
#include <numeric>
long long int GCD(long long int a, long long int b) {
long long int c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n + 1];
for (int i = 0; i != n; i++) {
cin >> a[i... | insert | 15 | 15 | 15 | 16 | 0 | |
p03127 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N;
int A[200];
int Min = 1000000000;
cin >> N;
int beforemin = 12345;
int aftermin = 56789;
for (int i = 0; i < N; ++i)
cin >> A[i];
while (true) {
for (int i = 0; i < N; ++i)
if ((A[i] != 0) && (A[i] < Min))
Min = A[i];
... | #include <iostream>
using namespace std;
int main() {
int N;
int A[1000002];
int Min = 1000000000;
cin >> N;
int beforemin = 12345;
int aftermin = 56789;
for (int i = 0; i < N; ++i)
cin >> A[i];
while (true) {
for (int i = 0; i < N; ++i)
if ((A[i] != 0) && (A[i] < Min))
Min = A[i... | replace | 5 | 6 | 5 | 6 | 0 | |
p03127 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int yg(int a, int b) {
int tmp;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
int r = a % b;
while (r != 0) {
a = b;
b = r;
}
return b;
}
int v[110000];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> v[i... | #include <iostream>
#include <vector>
using namespace std;
int yg(int a, int b) {
int tmp;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
int r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int v[110000];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {... | insert | 14 | 14 | 14 | 15 | TLE | |
p03127 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n);
for (long long i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
vector<long long> r(105, 1);
int count = 0;
for (long long i = 1; i * i <= a.at(0); i++) {
if (a.at(0... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n);
for (long long i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
vector<long long> r(10000, 1);
int count = 0;
for (long long i = 1; i * i <= a.at(0); i++) {
if (a.at... | replace | 16 | 17 | 16 | 17 | 0 | |
p03127 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#de... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#de... | replace | 43 | 50 | 43 | 44 | TLE | |
p03127 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef unsigned long long int llu;
#define rep(i, n) for (lld i = 0; i < n; i++)
lld N;
lld hp[10010];
int main() {
cin >> N;
rep(i, N) {
scanf("%lld", &hp[i]);
if (hp[i] == 1) {
cout << 1 << endl;
return 0;
}
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef unsigned long long int llu;
#define rep(i, n) for (lld i = 0; i < n; i++)
lld N;
lld hp[100010];
int main() {
cin >> N;
rep(i, N) {
scanf("%lld", &hp[i]);
if (hp[i] == 1) {
cout << 1 << endl;
return 0;
}
... | replace | 10 | 11 | 10 | 11 | 0 | |
p03127 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, ans = 100000100;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
while (A.size() > 1) {
sort(A.begin(), A.end());
if (A[A.size() - 1] % A[A.size() - 2] == 0)
A.pop_back(... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, ans = 100000100;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A.begin(), A.end());
for (int i = 0; i < A.size() - 1; i++) {
if (A[i + 1] % A[i] == 0) {
A.erase(A.b... | insert | 12 | 12 | 12 | 28 | TLE | |
p03127 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define reprl(i, n) for (ll i = n; i >= ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define reprl(i, n) for (ll i = n; i >= ... | replace | 25 | 26 | 25 | 26 | 0 | |
p03127 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 3005
#define REP(i, n) for (int i = 0; i < n; i++)
long n;
long a[10000];
long ans, en;
long cou;
long gcd(long i, long j) {
if (i < j) {
int tmp = i;
i = j;
j = tmp;
}
/* ユークリッドの互除法 */
long r = i % j;
while (r != 0) {
i = j;
j = r;
... | #include <bits/stdc++.h>
using namespace std;
#define N 3005
#define REP(i, n) for (int i = 0; i < n; i++)
long n;
long a[100000];
long ans, en;
long cou;
long gcd(long i, long j) {
if (i < j) {
int tmp = i;
i = j;
j = tmp;
}
/* ユークリッドの互除法 */
long r = i % j;
while (r != 0) {
i = j;
j = r;... | replace | 5 | 6 | 5 | 6 | 0 | |
p03127 | C++ | Time Limit Exceeded |
#include <iostream>
using namespace std;
int GCD(int x, int y) {
int gcd;
for (int i = 1; i <= x && i <= y; i++) {
if (x % i == 0 && y % i == 0)
gcd = i;
}
return gcd;
}
int main() {
int N;
int ans;
cin >> N;
N -= 2;
int x, y;
cin >> x >> y;
ans = GCD(x, y);
for (int i = 0; ... |
#include <iostream>
using namespace std;
int GCD(int x, int y) {
if (y == 0)
return x;
return GCD(y, x % y);
}
int main() {
int N;
int ans;
cin >> N;
N -= 2;
int x, y;
cin >> x >> y;
ans = GCD(x, y);
for (int i = 0; i < N; i++) {
int A;
cin >> A;
ans = GCD(ans, A);
}
... | replace | 6 | 12 | 6 | 9 | TLE | |
p03127 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
while (1) {
int N;
cin >> N;
if (N == 0)
break;
vector<int> tairyoku(N);
for (int i = 0; i < N; i++)
cin >> tairyoku[N];
int gcds = 0;
for (... | #include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
int N;
cin >> N;
vector<int> tairyoku(N);
for (int i = 0; i < N; i++)
cin >> tairyoku[i];
int gcds = 0;
for (int i = 0; i < N; i++)
gcds = gcd(gcds, tairyoku[i]);... | replace | 9 | 22 | 9 | 18 | TLE | |
p03127 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
int N, temp;
std::vector<int> A;
int main() {
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::cin >> temp;
A.push_back(temp);
}
std::sort(A.begin(), A.end());
auto begin = A.begin();
auto next = std::next(begin);
while (next != A.end... | #include <algorithm>
#include <iostream>
#include <vector>
int N, temp;
std::vector<int> A;
int main() {
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::cin >> temp;
A.push_back(temp);
}
std::sort(A.begin(), A.end());
auto begin = A.begin();
auto next = std::next(begin);
while (next != A.end... | replace | 21 | 22 | 21 | 22 | -8 | |
p03127 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
int c;
c = a % b;
if (c == 0)
return b;
a = b;
b = c;
}
int main() {
int n, a[111111], i;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
int ans = a[0];
for (i = 1; i < n; i++)
ans = gcd(a[i], ans);
cout << ans << en... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
int c;
while (1) {
c = a % b;
if (c == 0)
return b;
a = b;
b = c;
}
}
int main() {
int n, a[111111], i;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
int ans = a[0];
for (i = 1; i < n; i++)
ans = gcd(a[i... | replace | 4 | 9 | 4 | 11 | 0 | |
p03127 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int N, A[100000];
int min;
bool same_min = false;
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d", &A[i]);
while (!same_min) {
min = *min_element(A, &A[N]);
for (int i = 0; i < N; i++) {
if (A[i] != min)
... | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int N, A[100000];
int min;
bool same_min = false;
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d", &A[i]);
while (!same_min) {
min = *min_element(A, &A[N]);
for (int i = 0; i < N; i++) {
if (A[i] != min)
... | replace | 20 | 22 | 20 | 25 | TLE | |
p03127 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
uint64_t gcd(uint64_t u, uint64_t v) {
while (v != 0) {
uint64_t r = u % v;
u = v;
v = r;
}
return u;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a... | #include <bits/stdc++.h>
using namespace std;
uint64_t gcd(uint64_t u, uint64_t v) {
while (v != 0) {
uint64_t r = u % v;
u = v;
v = r;
}
return u;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a... | replace | 21 | 31 | 21 | 24 | TLE | |
p03127 | Python | Runtime Error | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from math import gcd
from functools import reduce
def solve(string):
n, *a = map(int, string.split())
return str(reduce(gcd, a))
if __name__ == "__main__":
print(solve("\n".join([input(), input()])))
| #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from fractions import gcd
from functools import reduce
def solve(string):
n, *a = map(int, string.split())
return str(reduce(gcd, a))
if __name__ == "__main__":
print(solve("\n".join([input(), input()])))
| replace | 3 | 4 | 3 | 4 | 0 | |
p03127 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A, A + N);
int enemy_min = A[0];
int enemy_next = A[1];
int i = 0;
while (1) {
A[i + 1] = A[i + 1] - A[i];
if (A[i + 1] < A[i]) {
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A, A + N);
int enemy_min = A[0];
int enemy_next = A[1];
int i = 0;
while (1) {
A[i + 1] = A[i + 1] % A[i];
if (A[i + 1] < A[i]) {
... | replace | 20 | 21 | 20 | 21 | TLE | |
p03127 | Python | Runtime Error | from math import gcd
n = int(input())
A = list(map(int, input().split()))
ans = A[0]
for a in A[1:]:
ans = gcd(ans, a)
print(ans)
| from fractions import gcd
n = int(input())
A = list(map(int, input().split()))
ans = A[0]
for a in A[1:]:
ans = gcd(ans, a)
print(ans)
| replace | 0 | 1 | 0 | 1 | 0 | |
p03127 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
a.sort()
while len(a) >= 2:
k = a[1] % a[0]
if k == 0:
a.pop(1)
else:
a[1] = k
a.sort()
if a[0] == 1:
break
print(a[0])
| n = int(input())
a = list(map(int, input().split()))
a.sort()
while len(a) >= 2:
k = a[1] % a[0]
if k == 0:
a.pop(1)
else:
a[1] = k
a[0], a[1] = a[1], a[0]
print(a[0])
| replace | 9 | 12 | 9 | 10 | TLE | |
p03127 | Python | Runtime Error | from math import gcd
N = int(input())
A = sorted([int(n) for n in input().split()], reverse=True)
x = A[0]
for i in range(1, N):
x = gcd(x, A[i])
print(x)
| from fractions import gcd
N = int(input())
A = sorted([int(n) for n in input().split()], reverse=True)
x = A[0]
for i in range(1, N):
x = gcd(x, A[i])
print(x)
| replace | 0 | 1 | 0 | 1 | 0 | |
p03127 | Python | Runtime Error | import sys
readline = sys.stdin.buffer.readline
def sss(A, N):
A.sort()
if A[0] == 0:
A.remove(0)
for i in range(1, len(A)):
A[i] = A[i] % A[0]
if A[0] == sum(A):
print(sum(A))
else:
return sss(A, N)
def main():
N = int(readline())
A = list(map(int, readl... | import sys
readline = sys.stdin.buffer.readline
def sss(A, N):
A.sort()
while A[0] == 0:
A.remove(0)
for i in range(1, len(A)):
A[i] = A[i] % A[0]
if A[0] == sum(A):
print(sum(A))
else:
return sss(A, N)
def main():
N = int(readline())
A = list(map(int, re... | replace | 7 | 8 | 7 | 8 | 0 | |
p03127 | Python | Time Limit Exceeded | # -*- coding: utf-8 -*-
N = map(int, input())
A = list(map(int, input().split()))
while len(A) >= 2:
x = A.pop(A.index(max(A)))
y = min(A)
n = x % y
if n == 0:
pass
else:
A.append(n)
print(A[0])
| # -*- coding: utf-8 -*-
N = map(int, input())
A = list(map(int, input().split()))
while len(A) >= 2:
idx = A.index(min(A))
x = A.pop(idx)
B = list()
for i in range(len(A)):
if A[i] % x != 0:
B.append(A[i] % x)
B.append(x)
A = B[:]
print(A[0])
| replace | 5 | 12 | 5 | 13 | TLE | |
p03127 | Python | Runtime Error | from functools import reduce
from math import gcd
if __name__ == "__main__":
n = int(input())
a = [int(s) for s in input().split()]
print(reduce(gcd, a))
| from functools import reduce
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
if __name__ == "__main__":
n = int(input())
a = [int(s) for s in input().split()]
print(reduce(gcd, a))
| replace | 1 | 2 | 1 | 8 | 0 | |
p03127 | Python | Runtime Error | from math import gcd
N = int(input())
A = [int(x) for x in input().split()]
ans = A[0]
for i in range(1, N):
ans = gcd(ans, A[i])
print(ans)
| def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
N = int(input())
A = [int(x) for x in input().split()]
ans = A[0]
for i in range(1, N):
ans = gcd(ans, A[i])
print(ans)
| replace | 0 | 1 | 0 | 5 | 0 | |
p03127 | Python | Runtime Error | import sys
sys.setrecursionlimit(20000)
def inpl():
return list(map(int, input().split()))
def gcd(a, b):
la = max(a, b)
sm = min(a, b)
if la % sm == 0:
return sm
else:
return gcd(sm, la - sm)
n = int(input())
A = inpl()
ans = gcd(A[0], A[1])
for a in A:
ans = gcd(ans, a)... | import sys
sys.setrecursionlimit(20000)
def inpl():
return list(map(int, input().split()))
def gcd(a, b):
la = max(a, b)
sm = min(a, b)
if la % sm == 0:
return sm
else:
return gcd(sm, la - sm)
n = int(input())
A = inpl()
A.sort()
ans = gcd(A[0], A[1])
for a in A:
ans = gcd... | replace | 20 | 21 | 20 | 21 | 0 | |
p03127 | Python | Runtime Error | from functools import reduce
from functools import gcd
N = int(input())
A = [int(i) for i in input().split()]
print(reduce(gcd, A))
| from functools import reduce
from fractions import gcd
N = int(input())
A = [int(i) for i in input().split()]
print(reduce(gcd, A))
| replace | 1 | 2 | 1 | 2 | ImportError: cannot import name 'gcd' from 'functools' (/usr/lib/python3.10/functools.py) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03127/Python/s208362126.py", line 2, in <module>
from functools import gcd
ImportError: cannot import name 'gcd' from 'functools' (/usr/lib/python3.10/functools.py)
|
p03127 | Python | Time Limit Exceeded | N = int(input())
A = list(map(int, input().split()))
while True:
if len(A) == 1:
break
max_i = A.index(max(A))
min_i = A.index(min(A))
life = A[max_i] % A[min_i]
if life == 0:
A.pop(max_i)
else:
A[max_i] = life
print(A[0])
| N = int(input())
A = list(map(int, input().split()))
while True:
if len(A) == 1:
break
pop_i = []
A.sort()
for i in range(1, len(A)):
life = A[i] % A[0]
if life == 1:
print(life)
exit()
else:
A[i] = life
A = [n for n in A if n > 0]... | replace | 6 | 13 | 6 | 16 | TLE | |
p03128 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
type... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
type... | replace | 31 | 32 | 31 | 33 | TLE | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) s... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) s... | replace | 52 | 53 | 52 | 53 | 0 | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
// #define MODE 1
#ifdef MODE
#define DEB(... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
// #define MODE 1
#ifdef MODE
#define DEB(... | replace | 40 | 42 | 40 | 42 | 0 | |
p03128 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | replace | 48 | 49 | 48 | 49 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i < n; i++)
int main() {
int num[10];
num[1] = 2, num[2] = 5, num[3] = 5, num[4] = 4, num[5] = 5;
num[6] = 6, num[7] = 3, num[8] = 7, num[9] = 6;
int N, M;
cin >> N >> M;
int A[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i < n; i++)
int main() {
int num[10];
num[1] = 2, num[2] = 5, num[3] = 5, num[4] = 4, num[5] = 5;
num[6] = 6, num[7] = 3, num[8] = 7, num[9] = 6;
int N, M;
cin >> N >> M;
int A[... | replace | 26 | 27 | 26 | 27 | 0 | |
p03128 | C++ | Time Limit Exceeded |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | replace | 95 | 96 | 95 | 96 | TLE | |
p03128 | C++ | Time Limit Exceeded |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | replace | 95 | 96 | 95 | 96 | TLE | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n;... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n;... | replace | 184 | 185 | 184 | 185 | -11 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, ... | replace | 60 | 61 | 60 | 61 | 0 | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<l... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<l... | replace | 190 | 191 | 190 | 191 | 0 | |
p03128 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
/* macro */
#define rep(i, a, b) for (int i = a; i < b; i++)
#define revrep(i, a, b) for (int i = a; i > b; i--)
#define int long long
#define exist(s, e) ((s).find(e) != (s).end())
#define all(v) (v).begin(), (v).end()
#define each(s, itr) for (auto(itr) = s.begin(); (itr... | #include "bits/stdc++.h"
using namespace std;
/* macro */
#define rep(i, a, b) for (int i = a; i < b; i++)
#define revrep(i, a, b) for (int i = a; i > b; i--)
#define int long long
#define exist(s, e) ((s).find(e) != (s).end())
#define all(v) (v).begin(), (v).end()
#define each(s, itr) for (auto(itr) = s.begin(); (itr... | replace | 154 | 155 | 154 | 155 | 0 | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int INF = 10000;
in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int INF = 10000;
in... | replace | 38 | 39 | 38 | 39 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for (int w = 0; w < (p); w++)
#define fx(p) for (int x = 0; x < (p); x++)
#define fy(p) for (int y = 0; y < (p); y++)
#define fz(p) for (int z = 0; z < (p); z++)
#define fyg(p, g) for (int y = (g); y < (p); y++)
#define fzg(p, g) for (int ... | replace | 71 | 72 | 71 | 72 | 0 | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i... | replace | 43 | 44 | 43 | 44 | 0 | |
p03128 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <vector... | replace | 636 | 639 | 636 | 642 | TLE | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll f[2001][2001];
int main() {
ll n, m;
cin >> n >> m;
ll c[10];
c[1] = 2;
c[2] = 5;
c[3] = 5;
c[4] = 4;
c[5] = 5;
c[6] = 6;
c[7] = 3;
c[8] = 7;
c[9] = 6;
ll a[m + 1];
for (ll i = 1; i <= m; i++) {
cin >> a[i];
f[c[a[... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll f[20001][20];
int main() {
ll n, m;
cin >> n >> m;
ll c[10];
c[1] = 2;
c[2] = 5;
c[3] = 5;
c[4] = 4;
c[5] = 5;
c[6] = 6;
c[7] = 3;
c[8] = 7;
c[9] = 6;
ll a[m + 1];
for (ll i = 1; i <= m; i++) {
cin >> a[i];
f[c[a[i... | replace | 3 | 4 | 3 | 4 | 0 | |
p03128 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
template <typename T> void trace(T *a, int s, int n) {
for (int i = s; i < n; i++) {
cout << a[i] << " ";
}
cout << endl;
}
typedef lo... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
template <typename T> void trace(T *a, int s, int n) {
for (int i = s; i < n; i++) {
cout << a[i] << " ";
}
cout << endl;
}
typedef lo... | replace | 48 | 49 | 48 | 49 | TLE | |
p03128 | C++ | Runtime Error | // 繝・Φ繝励Ξ
#include <bits/stdc++.h>
#define int long long
#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(v) (v).begin(), (v).end()
#define PAIR pair<int, int>
using namespace std;
// constexpr int MOD = 10e9+7;
// constexpr int INF = 1LL << 60;
template ... | // 繝・Φ繝励Ξ
#include <bits/stdc++.h>
#define int long long
#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(v) (v).begin(), (v).end()
#define PAIR pair<int, int>
using namespace std;
// constexpr int MOD = 10e9+7;
// constexpr int INF = 1LL << 60;
template ... | replace | 64 | 65 | 64 | 65 | 0 | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp(a, b) make_pair(a, b)
#define pb(t) push_back(t)
#define ft first
#define sc s... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mkp(a, b) make_pair(a, b)
#define pb(t) push_back(t)
#define ft first
#define sc s... | replace | 44 | 45 | 44 | 45 | 0 | |
p03128 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
const int INF = 1000000;
const int MAXK = 6000;
int main() {
int... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
const int INF = 1000000;
const int MAXK = 1000005;
int main() {
... | replace | 11 | 12 | 11 | 12 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define dump(x) cerr << #x << " => " << (x) << endl
#define MIN(vec) *min_element(vec.begin(), vec.end())
#define MAX(vec) *max_element(vec.begin(), vec.end())
#define UNIQ(vec) ... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define dump(x) cerr << #x << " => " << (x) << endl
#define MIN(vec) *min_element(vec.begin(), vec.end())
#define MAX(vec) *max_element(vec.begin(), vec.end())
#define UNIQ(vec) ... | replace | 67 | 68 | 67 | 69 | 0 | |
p03128 | Python | Runtime Error | inf = float("inf")
N, M = map(int, input().split())
A = map(int, input().split())
C = [2, 5, 5, 4, 5, 6, 3, 7, 6]
costs = {m: C[m - 1] for m in A}
dp = [0]
for i in range(1, N + 1):
dp.append(max([dp[i - c] if i - c >= 0 else -inf for c in costs.values()]) + 1)
digits = list(costs.keys())
digits = sorted(digits, r... | inf = float("inf")
N, M = map(int, input().split())
A = map(int, input().split())
C = [2, 5, 5, 4, 5, 6, 3, 7, 6]
costs = {m: C[m - 1] for m in A}
dp = [0]
for i in range(1, N + 1):
dp.append(max([dp[i - c] if i - c >= 0 else -inf for c in costs.values()]) + 1)
digits = list(costs.keys())
digits = sorted(digits, r... | replace | 15 | 16 | 15 | 20 | 0 | |
p03128 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rt "\n"
#define sp " "
#define test(n) cout << "test" << n << endl;
#define fixsp(n) fixed << setprecision(n)
#define defsp(n) defaultfloat << setprecision(n)
#define kyopro \
ios::sync_with_stdio(false); ... | #include <bits/stdc++.h>
#define rt "\n"
#define sp " "
#define test(n) cout << "test" << n << endl;
#define fixsp(n) fixed << setprecision(n)
#define defsp(n) defaultfloat << setprecision(n)
#define kyopro \
ios::sync_with_stdio(false); ... | replace | 84 | 85 | 84 | 86 | 0 | |
p03128 | C++ | Runtime Error | /*#include <iostream>
#include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#de... | /*#include <iostream>
#include <algorithm>
#include <array>
#include <cmath>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#de... | replace | 174 | 175 | 174 | 175 | 0 | |
p03128 | Python | Runtime Error | """
Match Matching
提出 #4299735 を参考に作成
"""
def solve():
# 初期値の設定
num = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]
N, M = map(int, input().split())
A = [int(i) for i in input().split()]
A.sort(reverse=True)
# 丁度n本で作成できる最大桁数を格納する.
# 初期値は -inf (丁度使い切ることは不可能) としておく
dp = [-1 * float("inf")] * (N + 1)
... | """
Match Matching
提出 #4299735 を参考に作成
"""
def solve():
# 初期値の設定
num = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]
N, M = map(int, input().split())
A = [int(i) for i in input().split()]
A.sort(reverse=True)
# 丁度n本で作成できる最大桁数を格納する.
# 初期値は -inf (丁度使い切ることは不可能) としておく
dp = [-1 * float("inf")] * (N + 1)
... | insert | 17 | 17 | 17 | 18 | TypeError: 'float' object cannot be interpreted as an integer | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03128/Python/s934603439.py", line 50, in <module>
solve()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03128/Python/s934603439.py", line 30, in solve
for i in range(dp[N]): # dp[N... |
p03128 | Python | Runtime Error | #!/usr/bin/env python3
N, M = map(int, input().split())
A = sorted(map(int, input().split()), reverse=True)
inf = float("inf")
num = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]
dp = [0] + [-inf] * N
for i in range(N + 1)[1::]:
for x in A:
if i >= num[x]:
dp[i] = max(dp[i], dp[i - num[x]] + 1)
ans = ""
whil... | #!/usr/bin/env python3
N, M = map(int, input().split())
A = sorted(map(int, input().split()), reverse=True)
inf = float("inf")
num = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]
dp = [0] + [-inf] * N
for i in range(N + 1)[1::]:
for x in A:
if i >= num[x]:
dp[i] = max(dp[i], dp[i - num[x]] + 1)
ans = ""
whil... | replace | 15 | 16 | 15 | 16 | 0 | |
p03128 | Python | Runtime Error | num_A = {1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
A.reverse()
INF = 10**6
dp = [-INF for i in range(N + 1)] # get the max digit size using i matches
dp[0] = 0
for i in range(1, N + 1):
next_num = [Ai for Ai in A if num_A[Ai... | num_A = {1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
A.reverse()
INF = 10**6
dp = [-INF for i in range(N + 1)] # get the max digit size using i matches
dp[0] = 0
for i in range(1, N + 1):
next_num = [Ai for Ai in A if num_A[Ai... | replace | 19 | 20 | 19 | 23 | 0 | |
p03128 | Python | Runtime Error | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
n, m = map(int, readline().split())
a = list(map(int, readline().split()))
memo = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]
dp = [""] * (n + 1)
for aa in a:
if aa <= n:
if ... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
n, m = map(int, readline().split())
a = list(map(int, readline().split()))
memo = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]
dp = [""] * (n + 1)
for aa in a:
if memo[aa] <= n:
... | replace | 12 | 15 | 12 | 14 | 0 | |
p03128 | Python | Runtime Error | f = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]
n, m = map(int, input().split())
a = list(map(int, input().split()))
memo = ["-1"] * 10100
def MAX(x, y):
if y[0] != "#" and (x == "#" or len(x) < len(y) or (len(x) == len(y) and x < y)):
return y
else:
return x
def dp(i):
# i本のマッチを使って作れる最大の整数
if i... | import resource
import sys
sys.setrecursionlimit(20000)
f = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]
n, m = map(int, input().split())
a = list(map(int, input().split()))
memo = ["-1"] * 10100
def MAX(x, y):
if y[0] != "#" and (x == "#" or len(x) < len(y) or (len(x) == len(y) and x < y)):
return y
else:
... | insert | 0 | 0 | 0 | 4 | 0 | |
p03128 | Python | Runtime Error | n, m = map(int, input().split())
a = list(map(int, input().split()))
dp = dict.fromkeys(range(n + 1)) # dp[n]: n本使うときの桁数
dp[0] = 0
num = {1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}
anum = sorted(
dict(filter(lambda e: e[0] in a, num.items())).items(), reverse=True
) # 後の計算用にsortしておく
for i in range(n... | n, m = map(int, input().split())
a = list(map(int, input().split()))
dp = dict.fromkeys(range(n + 1)) # dp[n]: n本使うときの桁数
dp[0] = 0
num = {1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}
anum = sorted(
dict(filter(lambda e: e[0] in a, num.items())).items(), reverse=True
) # 後の計算用にsortしておく
for i in range(n... | replace | 12 | 13 | 12 | 13 | 0 | |
p03128 | Python | Runtime Error | N, M = map(int, input().split())
A = [int(x) for x in input().split()]
f = {1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}
A = sorted(A, reverse=True)
dp = [float("-inf")] * (N + 1)
dp[0] = 0
for i in range(N + 1):
for a in A:
if i - f[a] >= 0:
dp[i] = max(dp[i], dp[i - f[a]] + 1)
ans ... | N, M = map(int, input().split())
A = [int(x) for x in input().split()]
f = {1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}
A = sorted(A, reverse=True)
dp = [float("-inf")] * (N + 1)
dp[0] = 0
for i in range(N + 1):
for a in A:
if i - f[a] >= 0:
dp[i] = max(dp[i], dp[i - f[a]] + 1)
ans ... | replace | 17 | 18 | 17 | 19 | 0 | |
p03128 | Python | Runtime Error | # -*- coding: utf-8 -*-
N, M = map(int, input().split())
A = list(map(int, input().split()))
cost = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]
cd = [(a, cost[a]) for a in A]
cd.sort(key=lambda x: x[0], reverse=True)
dp = [0] + [-1] * N
for i in range(1, N + 1):
for a, c in cd:
if i - c >= 0 and 0 <= dp[i - c]:
... | # -*- coding: utf-8 -*-
N, M = map(int, input().split())
A = list(map(int, input().split()))
cost = [0, 2, 5, 5, 4, 5, 6, 3, 7, 6]
cd = [(a, cost[a]) for a in A]
cd.sort(key=lambda x: x[0], reverse=True)
dp = [0] + [-1] * N
for i in range(1, N + 1):
for a, c in cd:
if i - c >= 0 and 0 <= dp[i - c]:
... | replace | 18 | 19 | 18 | 19 | 0 | |
p03128 | C++ | Runtime Error |
#if 1
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... |
#if 1
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | replace | 33 | 34 | 33 | 34 | 0 | |
p03128 | Python | Runtime Error | import sys
mp = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]
if __name__ == "__main__":
n, m = map(int, input().split())
a = sorted(input().split(), reverse=True)
dp = [-10007] * (n + 1)
dp[0] = 0
for i in a:
step = mp[int(i)]
for j in range(step, n + 1):
dp[j] = max(dp[j - step] + ... | import sys
mp = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]
if __name__ == "__main__":
n, m = map(int, input().split())
a = sorted(input().split(), reverse=True)
dp = [-10007] * (n + 1)
dp[0] = 0
for i in a:
step = mp[int(i)]
for j in range(step, n + 1):
dp[j] = max(dp[j - step] + ... | replace | 19 | 20 | 19 | 20 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.