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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02596 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(c) (c).rbegin(), (c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define ma... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(c) (c).rbegin(), (c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define ma... | replace | 30 | 31 | 30 | 31 | 0 | |
p02596 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
typedef long long ll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
typedef long long ll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const... | replace | 103 | 104 | 103 | 104 | -11 | |
p02596 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int k;
cin >> k;
if (k % 2 == 0) {
cout << -1 << endl;
} else {
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long long int k;
cin >> k;
if (k % 2 == 0 || k % 5 == 0) {
cout << -1 << endl;
... | replace | 14 | 15 | 14 | 15 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define COUT(x)... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define COUT(x)... | replace | 173 | 174 | 173 | 174 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define MM(arr, x) memset(arr, x, sizeof(arr))
#define INF 0x3f3f3f3f
#define Maxn 1e5 + 10;
using namespace std;
int main() {
ios::sync_with_stdio(0);
ll ans = 0, k, now = 0;
cin >> k;
while (ans <= 999999999) {
ans++;
now = (now * 10 + 7) % k;
if (now ... | #include <bits/stdc++.h>
#define ll long long
#define MM(arr, x) memset(arr, x, sizeof(arr))
#define INF 0x3f3f3f3f
#define Maxn 1e5 + 10;
using namespace std;
int main() {
ios::sync_with_stdio(0);
ll ans = 0, k, now = 0;
cin >> k;
while (ans <= 99999999) {
ans++;
now = (now * 10 + 7) % k;
if (now =... | replace | 10 | 11 | 10 | 11 | TLE | |
p02596 | C++ | Time Limit Exceeded | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <ioma... | /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <ioma... | replace | 116 | 117 | 116 | 117 | TLE | |
p02596 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, b) for (long long i = a; i < b; i += 1)
#define repr(i, a, b) for (long long i = a; i <= b; i += 1)
#define vec vector<ll>
#define map map<char, int>
#define repa(p, A) for (auto p : A)
#define pb push_back
#define sort(a) sort(a.begin(), a.end())
#define ... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, b) for (long long i = a; i < b; i += 1)
#define repr(i, a, b) for (long long i = a; i <= b; i += 1)
#define vec vector<ll>
#define map map<char, int>
#define repa(p, A) for (auto p : A)
#define pb push_back
#define sort(a) sort(a.begin(), a.end())
#define ... | replace | 19 | 20 | 19 | 20 | -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)
|
p02596 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, d, cnt = 1;
set<ll> s;
cin >> n;
ll aux = 1;
if (n % 7 == 0)
n %= 7;
while (1) {
if (s.find(aux) != s.end()) {
cout << "-1";
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, d, cnt = 1;
set<ll> s;
cin >> n;
ll aux = 1;
if (n % 7 == 0)
n /= 7;
while (1) {
if (s.find(aux) != s.end()) {
cout << "-1";
re... | replace | 14 | 15 | 14 | 16 | 0 | |
p02596 | C++ | Time Limit Exceeded | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
using namespace std;
int main() {
long long k;
cin >> k;
// 偶数は排除
if (k % 2 == 0 || k % 5 == 0) {
cout << -1 << endl;
return 0;
}
long long count... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
using namespace std;
int main() {
long long k;
cin >> k;
// 偶数は排除
if (k % 2 == 0 || k % 5 == 0) {
cout << -1 << endl;
return 0;
}
long long count... | replace | 31 | 32 | 31 | 32 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int k;
scanf("%d", &k);
if (k % 2 == 0) {
printf("-1");
} else {
ll cnt = 0, sum = 0;
while (true) {
cnt++;
sum = sum * 10 + 7;
if (sum % k == 0) {
break;
} else
sum %= k;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int k;
scanf("%d", &k);
if (k % 2 == 0 || k % 5 == 0) {
printf("-1");
} else {
ll cnt = 0, sum = 0;
while (true) {
cnt++;
sum = sum * 10 + 7;
if (sum % k == 0) {
break;
} else
su... | replace | 7 | 8 | 7 | 8 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long... | replace | 35 | 36 | 35 | 36 | TLE | |
p02596 | C++ | Runtime Error | #include <bits/stdc++.h>
// #pragma GCC optimize ("-O3")
using namespace std;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// const long double PI = 3.14159265358979323846; /* pi */
int main() {
// ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
int k;
cin >> k... | #include <bits/stdc++.h>
// #pragma GCC optimize ("-O3")
using namespace std;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// const long double PI = 3.14159265358979323846; /* pi */
int main() {
// ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
int k;
cin >> k... | insert | 17 | 17 | 17 | 18 | 0 | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
#define ll long long
#define double lon... | #include <bits/stdc++.h>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
#define ll long long
#define double lon... | replace | 33 | 34 | 33 | 34 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int k;
cin >> k;
if (k % 2 == 0) {
cout << -1 << endl;
return 0;
}
int ans = 1;
int cur = 7 % k;
while (cur != 0) {
cur = 10 * cur + 7;
cur %= k;
++ans;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int k;
cin >> k;
if (k % 2 == 0) {
cout << -1 << endl;
return 0;
}
int ans = 1;
int cur = 7 % k;
while (cur != 0) {
cur = 10 * cur + 7;
cur %= k;
++ans;
if (ans > 100000000) {
ans = -1;
br... | insert | 17 | 17 | 17 | 21 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <iostream>
int main() {
unsigned long long N;
std::cin >> N;
unsigned long long amari = 0;
unsigned long long last_amari = 7 % N;
amari += last_amari;
int cnt = 1;
if (N % 2 == 0) {
std::cout << -1 << std::endl;
return 0;
}
while (amari) {
last_amari *= 10;
last_amari %= ... | #include <iostream>
int main() {
unsigned long long N;
std::cin >> N;
unsigned long long amari = 0;
unsigned long long last_amari = 7 % N;
amari += last_amari;
int cnt = 1;
if (N % 2 == 0 || N % 5 == 0) {
std::cout << -1 << std::endl;
return 0;
}
while (amari) {
last_amari *= 10;
... | replace | 12 | 13 | 12 | 13 | TLE | |
p02596 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define reps(i, a, b) for (int i = a; i < b; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
ll k;
cin >> k;
vector<ll> vec(k + 1, ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define reps(i, a, b) for (int i = a; i < b; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
ll k;
cin >> k;
vector<ll> vec(k + 2, ... | replace | 12 | 13 | 12 | 13 | 0 | |
p02596 | C++ | Time Limit Exceeded | // #include"bits/stdc++.h"
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define ll long long
#define FOR(i, j, k, in) for (int i = j; i < k; i += in)
#define rep(i, j) FOR(i, 0, j, 1)
#define MP make_... | // #include"bits/stdc++.h"
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define ll long long
#define FOR(i, j, k, in) for (int i = j; i < k; i += in)
#define rep(i, j) FOR(i, 0, j, 1)
#define MP make_... | insert | 49 | 49 | 49 | 53 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int k;
cin >> k;
ll sum = 1;
int a = 7 % k;
int tmp = a;
bool flg = true;
while (a) {
a = 10 * a + 7;
a %= k;
if (tmp == a) {
flg = false;
break;
}
sum++;
}
if (flg) {
cout << sum << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int k;
cin >> k;
ll sum = 1;
int a = 7 % k;
int tmp = a;
bool flg = true;
while (a) {
a = 10 * a + 7;
a %= k;
if (sum > k) {
flg = false;
break;
}
sum++;
}
if (flg) {
cout << sum << e... | replace | 15 | 16 | 15 | 16 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
int L, i = 1;
int ans = -1;
if (K % 7 == 0)
L = 9 * K / 7;
else
L = 9 * K;
if (L % 2 != 0 || L % 5 != 0) {
int m = 10 % L;
if (m == 1)
ans = 1;
else {
do {
m = m * 10 % L;
i++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
int L, i = 1;
int ans = -1;
if (K % 7 == 0)
L = 9 * K / 7;
else
L = 9 * K;
if (L % 2 != 0 && L % 5 != 0) {
int m = 10 % L;
if (m == 1)
ans = 1;
else {
do {
m = m * 10 % L;
i++;
... | replace | 12 | 13 | 12 | 13 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
const int mod = 1e9 + 7;
using namespace std;
int main(void) {
ll K;
cin >> K;
ll n = 1;
ll S = 7 % K;
ll d = 7 % K;
auto start = clock();
while (S % K != 0) {
n++;
d = (d * 10) % K;
S = (S + d... | #include "bits/stdc++.h"
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
const int mod = 1e9 + 7;
using namespace std;
int main(void) {
ll K;
cin >> K;
ll n = 1;
ll S = 7 % K;
ll d = 7 % K;
auto start = clock();
while (S % K != 0) {
n++;
d = (d * 10) % K;
S = (S + d... | replace | 25 | 26 | 25 | 26 | TLE | |
p02596 | C++ | Time Limit Exceeded | // May this submission get accepted
#include <bits/stdc++.h>
// エイリアス
using ll = long signed long;
using ull = long unsigned long;
using ld = long double;
using namespace std;
// AtCoder/Codeforces 用 デバッグ検知
#ifdef ONLINE_JUDGE
constexpr bool DEBUG_MODE = false;
#else
constexpr bool DEBUG_MODE = true;
#endif
// エイリアス... | // May this submission get accepted
#include <bits/stdc++.h>
// エイリアス
using ll = long signed long;
using ull = long unsigned long;
using ld = long double;
using namespace std;
// AtCoder/Codeforces 用 デバッグ検知
#ifdef ONLINE_JUDGE
constexpr bool DEBUG_MODE = false;
#else
constexpr bool DEBUG_MODE = true;
#endif
// エイリアス... | insert | 167 | 167 | 167 | 168 | TLE | |
p02596 | C++ | Time Limit Exceeded | // #Sazaの1日1AC
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000000 + 7;
const long long INF = 9e15;
const double PI = 3.14159265358979323846;
// マクロ
// 型エイリアス
using ll = long long;
using P = pair<long long, long long>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
usin... | // #Sazaの1日1AC
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000000 + 7;
const long long INF = 9e15;
const double PI = 3.14159265358979323846;
// マクロ
// 型エイリアス
using ll = long long;
using P = pair<long long, long long>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
usin... | insert | 165 | 165 | 165 | 170 | TLE | |
p02596 | C++ | Time Limit Exceeded | // #pragma GCC target("avx") // CPU 処理並列化
// #pragma GCC optimize("O3") // CPU 処理並列化
// #pragma GCC optimize("unroll-loops") // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ =
// malloc(size);void * stack_extend_origin_memory_;char *
// stack_extend_dummy_memory_ = (char*)alloca((1+(i... | // #pragma GCC target("avx") // CPU 処理並列化
// #pragma GCC optimize("O3") // CPU 処理並列化
// #pragma GCC optimize("unroll-loops") // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ =
// malloc(size);void * stack_extend_origin_memory_;char *
// stack_extend_dummy_memory_ = (char*)alloca((1+(i... | insert | 136 | 136 | 136 | 140 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;
const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;
#define AC \
ios::sync_with_stdio(0); ... | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;
const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;
#define AC \
ios::sync_with_stdio(0); ... | replace | 20 | 21 | 20 | 21 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define endl '\n'
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define zy -2147382637
#define bql 2147483647
#define ll long long
#define ull unsigned long long
#define ld long double
#define il inline
#define sz(x) x.size()
#define maxn 100010
#define rp(i, l, r) for (int i = ... | #include <bits/stdc++.h>
#define endl '\n'
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define zy -2147382637
#define bql 2147483647
#define ll long long
#define ull unsigned long long
#define ld long double
#define il inline
#define sz(x) x.size()
#define maxn 100010
#define rp(i, l, r) for (int i = ... | replace | 95 | 96 | 95 | 96 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long i = 0, k, n;
int main() {
cin >> k;
while (i < 1000000220) {
i++;
n = (n * 10 + 7) % k;
if (n == 0) {
cout << i;
return 0;
}
}
cout << -1;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long i = 0, k, n;
int main() {
cin >> k;
while (i < 1000000) {
i++;
n = (n * 10 + 7) % k;
if (n == 0) {
cout << i;
return 0;
}
}
cout << -1;
return 0;
} | replace | 5 | 6 | 5 | 6 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define db(x) cout << x << '\n'
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y <<... | #include <bits/stdc++.h>
using namespace std;
#define db(x) cout << x << '\n'
#define db1(x) cout << #x << "=" << x << '\n'
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << '\n'
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y <<... | insert | 73 | 73 | 73 | 77 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long int ll;
void solve() {
ll k;
cin >> k;
ll total = 0;
for (int i = 1; i <= 1e9; i++) {
total = (total * 10 + 7) % k;
if (total == 0) {
cout << i;
return;
}
}
cout << -1;
}
int... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long int ll;
void solve() {
ll k;
cin >> k;
ll total = 0;
for (int i = 1; i <= 1e8; i++) {
total = (total * 10 + 7) % k;
if (total == 0) {
cout << i;
return;
}
}
cout << -1;
}
int... | replace | 12 | 13 | 12 | 13 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int K;
cin >> K;
int C = 1;
int M = 7;
if (M % K == 0) {
cout << 1;
} else if (K % 2 == 0) {
cout << -1;
} else {
M = 77 % K;
C = 2;
while (M != 0 && M != (7 % K)) {
C += 1;
M = (M * 10 + 7) % K;
}
if (M == 0) {... | #include <iostream>
using namespace std;
int main() {
int K;
cin >> K;
int C = 1;
int M = 7;
if (M % K == 0) {
cout << 1;
} else if (K % 2 == 0 || K % 5 == 0) {
cout << -1;
} else {
M = 77 % K;
C = 2;
while (M != 0 && M != (7 % K)) {
C += 1;
M = (M * 10 + 7) % K;
}
... | replace | 10 | 11 | 10 | 11 | TLE | |
p02596 | 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;
typedef pair<int, int> P;
int main() {
int k;
cin >> k;
ll ans = 0;
if (k % 2 == 0)
cout << -1 << endl;
else {
ll num = 7, col = 1;
while (num % k != 0) {
ans++;
num %= ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int k;
cin >> k;
ll ans = 0;
if (k % 2 == 0)
cout << -1 << endl;
else if (k % 5 == 0)
cout << -1 << endl;
else {
ll num = 7, col = 1;
wh... | insert | 11 | 11 | 11 | 13 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll k;
cin >> k;
if (k % 2 == 0) {
cout << -1 << endl;
return 0;
}
int ans = 1;
ll r = 7 % k;
while (r != 0) {
r = r * 10 + 7;
r %= k;
ans++;
}
co... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll k;
cin >> k;
if (k % 2 == 0 || k % 5 == 0) {
cout << -1 << endl;
return 0;
}
int ans = 1;
ll r = 7 % k;
while (r != 0) {
r = r * 10 + 7;
r %= k;
a... | replace | 12 | 13 | 12 | 13 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define debug(val) "[ " << #val " : " << (val)
#define space " "
#define vi vector<int>
#define vl vector<ll>
#define vll vector<vector<ll>>
#define vii vector<vector<int>>
#define PI (double)(atan(1) * 4)
#define pb push_back
#define pi pair<int... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define debug(val) "[ " << #val " : " << (val)
#define space " "
#define vi vector<int>
#define vl vector<ll>
#define vll vector<vector<ll>>
#define vii vector<vector<int>>
#define PI (double)(atan(1) * 4)
#define pb push_back
#define pi pair<int... | replace | 55 | 56 | 55 | 56 | TLE | |
p02596 | C++ | Time Limit Exceeded | /*
YATIN KWATRA _03_08_14
Let's Hoop..
__oooo
// / o
/ / | o
| / |__ o
| | __/ o
| | / oooo
| / | _______________________
| | | |_______________________|
|| |___ \__/\_/\_/\/\/\/\/\/\/... | /*
YATIN KWATRA _03_08_14
Let's Hoop..
__oooo
// / o
/ / | o
| / |__ o
| | __/ o
| | / oooo
| / | _______________________
| | | |_______________________|
|| |___ \__/\_/\_/\/\/\/\/\/\/... | replace | 135 | 136 | 135 | 136 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int mod = (1 ? 1e9 + 7 : 998244353);
const int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
ll a, b, c, d, e, f, n, T;
int main() {... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int mod = (1 ? 1e9 + 7 : 998244353);
const int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
ll a, b, c, d, e, f, n, T;
int main() {... | replace | 17 | 18 | 17 | 18 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < ... | insert | 39 | 39 | 39 | 43 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = array<ll, 3>;
template <class T> using p... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = array<ll, 3>;
template <class T> using p... | replace | 536 | 537 | 536 | 537 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <fstream>
#include <iostream>
using namespace std;
int const NMAX = 1e6;
bool freq[1 + NMAX];
int main() {
int n, m = 0, ans = 0;
cin >> n;
while (freq[m] == false) {
m = (m * 10 + 7) % n;
ans++;
if (m == 0) {
cout << ans;
return 0;
}
}
cout << -1;
return 0;
}
| #include <fstream>
#include <iostream>
using namespace std;
int const NMAX = 1e6;
bool freq[1 + NMAX];
int main() {
int n, m = 0, ans = 0;
cin >> n;
while (freq[m] == false) {
freq[m] = true;
m = (m * 10 + 7) % n;
ans++;
if (m == 0) {
cout << ans;
return 0;
}
}
cout << -1;
... | insert | 13 | 13 | 13 | 14 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#... | replace | 47 | 48 | 47 | 48 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
int main() {
int k;
cin >> k;
if (k % 2 == 0) {
cout << "-1" << endl;
return 0;
}
int ans = 1, mod = 7 % k;
while (true) {
if (mod == 0) {
cout ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
int main() {
int k;
cin >> k;
if (k % 2 == 0) {
cout << "-1" << endl;
return 0;
}
int ans = 1, mod = 7 % k;
while (true) {
if (mod == 0) {
cout ... | insert | 22 | 22 | 22 | 26 | TLE | |
p02596 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
// マクロ
// forループ関係
// 引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (lol i = 0; i < lol(n); i++)
#define REPD(i, n) for (lol i = n - 1; i >= 0; i--)
#define FOR(i, a, b) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
// マクロ
// forループ関係
// 引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (lol i = 0; i < lol(n); i++)
#define REPD(i, n) for (lol i = n - 1; i >= 0; i--)
#define FOR(i, a, b) ... | replace | 42 | 58 | 42 | 58 | 0 | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
typedef long long int ll;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag,
tree_order... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
typedef long long int ll;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag,
tree_order... | replace | 31 | 32 | 31 | 32 | TLE | |
p02596 | Python | Runtime Error | k = int(input())
if k % 7 == 0:
L = 9 * k / 7
else:
L = 9 * k
out = -1
s = 10
for i in range(L):
if s % L == 1:
out = i + 1
break
else:
s = (s % L) * 10
print(out)
| k = int(input())
if k % 7 == 0:
L = 9 * k // 7
else:
L = 9 * k
out = -1
s = 10
for i in range(L):
if s % L == 1:
out = i + 1
break
else:
s = (s % L) * 10
print(out)
| replace | 2 | 3 | 2 | 3 | 0 | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
// #define mp make_pair
#define pii pair<int, int>
#define vec vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define no_of_test(x)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
// #define mp make_pair
#define pii pair<int, int>
#define vec vector<int>
#define mii map<int, int>
#define pqb priority_queue<int>
#define inf 1e18
#define ps(x, y) fixed << setprecision(y) << x
#define no_of_test(x)... | replace | 52 | 53 | 52 | 53 | TLE | |
p02596 | C++ | Time Limit Exceeded | #pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#includ... | #pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#includ... | replace | 241 | 242 | 241 | 242 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define mp make_pair
#define ff first
#define ss second
#define bg begin()
#define en end()
#define pb push_back
#define w(x) \
scanf("%d", &x); \
while (x--)
#defin... | #include <bits/stdc++.h>
#define mp make_pair
#define ff first
#define ss second
#define bg begin()
#define en end()
#define pb push_back
#define w(x) \
scanf("%d", &x); \
while (x--)
#defin... | replace | 39 | 40 | 39 | 40 | TLE | |
p02596 | Python | Time Limit Exceeded | K = int(input())
if K % 2 == 0:
print(-1)
else:
mod, modt, ans = 7 % K, 7 % K, 1
while mod != 0:
modt = (modt * (10 % K)) % K
mod, ans = (mod + modt) % K, ans + 1
print(ans)
| K = int(input())
if K % 2 == 0 or K % 5 == 0:
print(-1)
else:
mod, modt, ans = 7 % K, 7 % K, 1
while mod != 0:
modt = (modt * (10 % K)) % K
mod, ans = (mod + modt) % K, ans + 1
print(ans)
| replace | 1 | 2 | 1 | 2 | TLE | |
p02596 | Python | Time Limit Exceeded | K = int(input())
if K % 2 == 0 or K % 5 == 0:
print(-1)
exit()
now = 0
count = 0
while True:
now = now * 10 + 7
count += 1
if now % K == 0:
print(count)
exit()
| K = int(input())
if K % 2 == 0 or K % 5 == 0:
print(-1)
exit()
now = 0
count = 0
while True:
now = (now * 10 + 7) % K
count += 1
if now % K == 0:
print(count)
exit()
| replace | 8 | 9 | 8 | 9 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// typedef tree <int,null_type,less <int>, rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
// #include <ext/rope>
// using namespace __gnu_cxx;
typedef long long int ll;
typedef lon... | #include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// typedef tree <int,null_type,less <int>, rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
// #include <ext/rope>
// using namespace __gnu_cxx;
typedef long long int ll;
typedef lon... | replace | 53 | 54 | 53 | 54 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
void fastio() {
cin.tie(nullptr);
cin.sync_with_stdio(false);
}
using LL = long long;
using LD = long double;
const LL MOD = 1e9 + 7;
const LL INF = LLONG_MAX;
const LL N = 1e6 + 1;
int main() {
fastio();
LL k;
cin >> k;
LL low = k % 10;
if (low == 2 |... | #include <bits/stdc++.h>
using namespace std;
void fastio() {
cin.tie(nullptr);
cin.sync_with_stdio(false);
}
using LL = long long;
using LD = long double;
const LL MOD = 1e9 + 7;
const LL INF = LLONG_MAX;
const LL N = 1e6 + 1;
int main() {
fastio();
LL k;
cin >> k;
LL low = k % 10;
if (low == 2 |... | replace | 24 | 25 | 24 | 25 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LLU long long unsigned
#define rarr(arr, n) \
for (int aab = 0; aab < n; aab++) { \
cin >> arr[aab]; ... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LLU long long unsigned
#define rarr(arr, n) \
for (int aab = 0; aab < n; aab++) { \
cin >> arr[aab]; ... | replace | 27 | 28 | 27 | 28 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define f(i, a, b) for (ll i = a; i < b; i++)
#define af(i, a, b) for (ll i = a; i >= b; i--)
#define rep(i, a, b, k) for (ll i = a; i < b; i += k)
#define arep(i, a, b, k) for (ll i = a; i >= b; i -= k)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(a)... | #include <bits/stdc++.h>
#define f(i, a, b) for (ll i = a; i < b; i++)
#define af(i, a, b) for (ll i = a; i >= b; i--)
#define rep(i, a, b, k) for (ll i = a; i < b; i += k)
#define arep(i, a, b, k) for (ll i = a; i >= b; i -= k)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(a)... | replace | 54 | 55 | 54 | 55 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#... | replace | 195 | 206 | 195 | 207 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f(a, b) for (ll i = a; i <= b; i++)
#define pb push_back
#define pf push_front
#define mp make_pair
using namespace std;
#define N 200005
const ll INF = 1000000000000000001;
const ll MOD = 1000000007;
// vector< vector<ll> > g(N);
// vector< ... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f(a, b) for (ll i = a; i <= b; i++)
#define pb push_back
#define pf push_front
#define mp make_pair
using namespace std;
#define N 200005
const ll INF = 1000000000000000001;
const ll MOD = 1000000007;
// vector< vector<ll> > g(N);
// vector< ... | replace | 20 | 21 | 20 | 21 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctype.h>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctype.h>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | replace | 164 | 165 | 164 | 165 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define deb(x... | #include <bits/stdc++.h>
#define ll long long
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define deb(x... | insert | 24 | 24 | 24 | 28 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
int main() {
long long ch, i = 1, n, q, k, l, r;
long long j;
cin >> n;
ch = 7;
if (n % 2 != 0) {
while (... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
int main() {
long long ch, i = 1, n, q, k, l, r;
long long j;
cin >> n;
ch = 7;
if (n % 2 != 0) {
while (... | insert | 21 | 21 | 21 | 25 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << ": " << x << endl;
using namespace std;
typedef long long ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REPR(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define INF 1e9
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << #x << ": " << x << endl;
using namespace std;
typedef long long ... | insert | 28 | 28 | 28 | 32 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define f0(i, a, n) for (i = a; i < n;... | #include <bits/stdc++.h>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define f0(i, a, n) for (i = a; i < n;... | replace | 28 | 29 | 28 | 29 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define _Rep(i, a, b) for (int i = a; i >= b; i--)
#define RepG(i, u) for (int i = head[u]; ~i; i = e[i].next)
typedef long long ll;
const int N = 1e5 + 5;
template <typename T> void read(T &x) {
x = 0;
int f = 1;
... | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define _Rep(i, a, b) for (int i = a; i >= b; i--)
#define RepG(i, u) for (int i = head[u]; ~i; i = e[i].next)
typedef long long ll;
const int N = 1e5 + 5;
template <typename T> void read(T &x) {
x = 0;
int f = 1;
... | insert | 35 | 35 | 35 | 37 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define lli long long
#define all(i) i.begin(), i.end()
#define rall(i) i.rbegin(), i.rend()
#define rep0(i, j) for (int i = 0; i < j; i++)
#define rep1(i, j) for (int i = 1; i <= j; i++)
#define rep0d(i, j) for (int i = j - 1; i >= 0; i--)
#define MOD 1000000007
#define M... | #include <bits/stdc++.h>
using namespace std;
#define lli long long
#define all(i) i.begin(), i.end()
#define rall(i) i.rbegin(), i.rend()
#define rep0(i, j) for (int i = 0; i < j; i++)
#define rep1(i, j) for (int i = 1; i <= j; i++)
#define rep0d(i, j) for (int i = j - 1; i >= 0; i--)
#define MOD 1000000007
#define M... | replace | 200 | 201 | 200 | 201 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
#define endl '\n'
#ifndef CODE_JAM
#undef CASE_INFO
#endif
#else
#pragma GCC optimize "trapv"
#endif
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define rep(n) for (int i = 0; i < n; i++)
#define repj(n) for (int j = 0; ... | #include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
#define endl '\n'
#ifndef CODE_JAM
#undef CASE_INFO
#endif
#else
#pragma GCC optimize "trapv"
#endif
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define rep(n) for (int i = 0; i < n; i++)
#define repj(n) for (int j = 0; ... | insert | 59 | 59 | 59 | 60 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
using ld = long double;
using vld = std::vector<ld>;
using vvld = std::vector<vld>;
using vvvld = std::vector<vvl... | #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
using ld = long double;
using vld = std::vector<ld>;
using vvld = std::vector<vld>;
using vvvld = std::vector<vvl... | insert | 305 | 305 | 305 | 308 | TLE | |
p02596 | C++ | Time Limit Exceeded | // Ayushman Tripathy, IIT Roorkee, CSE-23
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define db double
#define fl float
#define endl '\n'
#define mod (ll)(1000000007)
#define mod1 (ll)998242353
#define mod2 (ll)998244353
#define PI 3.1415926535897932384626433832795
#define pii pair<int, i... | // Ayushman Tripathy, IIT Roorkee, CSE-23
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define db double
#define fl float
#define endl '\n'
#define mod (ll)(1000000007)
#define mod1 (ll)998242353
#define mod2 (ll)998244353
#define PI 3.1415926535897932384626433832795
#define pii pair<int, i... | replace | 341 | 342 | 341 | 342 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define int long long // comment it out when MLE
#define endl "\n"
// template <typename T>
// using ordered_set = tree<T, null_type, less<... | #include <bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define int long long // comment it out when MLE
#define endl "\n"
// template <typename T>
// using ordered_set = tree<T, null_type, less<... | replace | 124 | 125 | 124 | 125 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
const int MOD = 1e9 + 7;
const int maxn = 1e6 + 5;
const int... | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
const int MOD = 1e9 + 7;
const int maxn = 1e6 + 5;
const int... | insert | 30 | 30 | 30 | 34 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int k;
cin >> k;
long long t = 7;
int count = 1;
if (k % 2 == 0) {
cout << -1;
return 0;
}
while (true) {
if (t % k == 0)
break;
else {
t = ((t * 10) % k + 7) % k;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int k;
cin >> k;
long long t = 7;
int count = 1;
if (k % 2 == 0) {
cout << -1;
return 0;
}
while (true) {
if (t % k == 0)
break;
else {
t = ((t * 10) % k + 7) % k;
... | insert | 19 | 19 | 19 | 23 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define pb push_back
#define rep(p, a, b) for (ll p = a; p < b; p++)
#define F first
#define S second
using namespace std;
int main() {
ll t, i, j, k, ans, n;
// cin>>t;
t = 1;
while (t--) {
ll term = 7,... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define pb push_back
#define rep(p, a, b) for (ll p = a; p < b; p++)
#define F first
#define S second
using namespace std;
int main() {
ll t, i, j, k, ans, n;
// cin>>t;
t = 1;
while (t--) {
ll term = 7,... | replace | 20 | 21 | 20 | 21 | TLE | |
p02596 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
typedef long long LL;
#define ll unsigned long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll p... |
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
typedef long long LL;
#define ll unsigned long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define pll p... | insert | 88 | 88 | 88 | 89 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
/*bool compare_function(const pair<int, int> a, const pair<int, int> b)
{
return a.first ... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
/*bool compare_function(const pair<int, int> a, const pair<int, int> b)
{
return a.first ... | replace | 59 | 60 | 59 | 60 | TLE | |
p02596 | C++ | Runtime Error | /* Simplicity and Goodness */
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
// typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
void my... | /* Simplicity and Goodness */
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
// typedef tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
void my... | replace | 74 | 75 | 74 | 75 | 0 | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long int
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define vi vector<int>
#define vvi vector<vector<int>>
#define mii map<int, int>
#define pb push_back
#define pii pair<int, int>
#define mkp make_pair
#define scan(a, n) ... | #include <bits/stdc++.h>
#define ll long long int
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define vi vector<int>
#define vvi vector<vector<int>>
#define mii map<int, int>
#define pb push_back
#define pii pair<int, int>
#define mkp make_pair
#define scan(a, n) ... | replace | 62 | 63 | 62 | 63 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdint>
#include <iostream>
#include <string>
using namespace std;
int main() {
int K;
cin >> K;
if (K % 2 == 0) {
cout << -1 << endl;
return 0;
}
int64_t unit = log10(K) + 1;
int sevens = stoi(string(unit, '7'));
while (true) {
sevens %= K;
if (sevens % K == ... | #include <cmath>
#include <cstdint>
#include <iostream>
#include <string>
using namespace std;
int main() {
int K;
cin >> K;
if (K % 2 == 0) {
cout << -1 << endl;
return 0;
}
int64_t unit = log10(K) + 1;
int sevens = stoi(string(unit, '7'));
while (true) {
sevens %= K;
if (sevens % K == ... | insert | 23 | 23 | 23 | 28 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define all(v) v.begin(), v.end()
#define pb push_back
#define sz(x) (int)(x.size())
#define endl "\n"
#define isOdd(n) (n & 1)
#define pow(n, m) (ll) powl(n, m)
#define clr(x, val) memset(x, val, sizeof(x))
#define EPS 1e-7
typedef long long ll;
typedef long double ld;
... | #include "bits/stdc++.h"
using namespace std;
#define all(v) v.begin(), v.end()
#define pb push_back
#define sz(x) (int)(x.size())
#define endl "\n"
#define isOdd(n) (n & 1)
#define pow(n, m) (ll) powl(n, m)
#define clr(x, val) memset(x, val, sizeof(x))
#define EPS 1e-7
typedef long long ll;
typedef long double ld;
... | replace | 27 | 28 | 27 | 28 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define mx 100005
#define ll long long
int ar[mx];
char ch[mx];
int m, n, k, ii;
void solve() {
cin >> n;
if (n % 2 == 0) {
cout << -1 << endl;
return;
}
int cnt = 0;
ll hate = 0;
while (1) {
cnt++;
hate *= 10;
hate += 7;
hate %= n;
... | #include <bits/stdc++.h>
using namespace std;
#define mx 100005
#define ll long long
int ar[mx];
char ch[mx];
int m, n, k, ii;
void solve() {
cin >> n;
if (n % 2 == 0) {
cout << -1 << endl;
return;
}
int cnt = 0;
ll hate = 0;
while (1) {
cnt++;
hate *= 10;
hate += 7;
hate %= n;
... | insert | 26 | 26 | 26 | 30 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
if (k % 2 == 0) {
printf("-1");
return 0;
}
int remind = 7 % k, number = 1;
while (remind) {
++number;
remind = (remind * 10 + 7) % k;
}
printf("%d\n", number);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
if (k % 2 == 0) {
printf("-1");
return 0;
}
int remind = 7 % k, number = 1;
while (remind) {
++number;
remind = (remind * 10 + 7) % k;
if (number > 1000000) {
cout << "-1" << endl;
return 0;
}
... | insert | 14 | 14 | 14 | 18 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<vector<int>>;
int main() {
int K;
cin >> K;
int res = 1;
int S = 7;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<vector<int>>;
int main() {
int K;
cin >> K;
int res = 1;
int S = 7;
... | insert | 23 | 23 | 23 | 27 | TLE | |
p02596 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
#define ff first
#define ss second
#define pb push_back
#define... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
#define ff first
#define ss second
#define pb push_back
#define... | replace | 48 | 49 | 48 | 49 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, res, count = 1;
cin >> n;
if (n % 2 == 0 || n % 5 == 0)
count = -1;
else {
string s = "7";
stringstream(s) >> res;
while (res % n != 0) {
s += "7";
stringstream(s) >> res;
count++;
}
}
cout << count... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, res, count = 1;
cin >> n;
if (n % 2 == 0 || n % 5 == 0)
count = -1;
else {
long long m = 7 % n;
while (m != 0) {
m = (m * 10 + 7) % n;
count++;
}
}
cout << count << "\n";
return 0;
} | replace | 8 | 13 | 8 | 11 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int k;
cin >> k;
if (k % 2 == 0) {
cout << -1;
return 0;
}
if (k % 7 == 0)
k /= 7;
int p = 1;
int m = 0;
int cnt = 0;
do {
m += p;
m %= k;
p *= 10;
p %= k;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int k;
cin >> k;
if (k % 2 == 0 or k % 5 == 0) {
cout << -1;
return 0;
}
if (k % 7 == 0)
k /= 7;
int p = 1;
int m = 0;
int cnt = 0;
do {
m += p;
m %= k;
p *= 10;
... | replace | 10 | 11 | 10 | 11 | TLE | |
p02596 | C++ | Time Limit Exceeded | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author rchalamala
*/
/*
ID: rchalam1
LANG: C++14
TASK:
*/
// For train.usaco.org, fill the template above.
// Competitive Coding Template
// GCC OPTIMIAZTION FLAGS
#ifndef LOCAL
#include <x86intrin.h>
#pragma GCC optimize( ... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author rchalamala
*/
/*
ID: rchalam1
LANG: C++14
TASK:
*/
// For train.usaco.org, fill the template above.
// Competitive Coding Template
// GCC OPTIMIAZTION FLAGS
#ifndef LOCAL
#include <x86intrin.h>
#pragma GCC optimize( ... | replace | 323 | 324 | 323 | 324 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll k;
cin >> k;
if (k % 2 == 0) {
cout << -1 << endl;
return 0;
}
bool flag = true;
ll rem = 7;
ll ans = 1;
while (flag) {
rem = rem % k;
if (rem == 0) {
flag = false;
} else {
rem = rem ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll k;
cin >> k;
if (k % 2 == 0 || k % 5 == 0) {
cout << -1 << endl;
return 0;
}
bool flag = true;
ll rem = 7;
ll ans = 1;
while (flag) {
rem = rem % k;
if (rem == 0) {
flag = false;
} else {
... | replace | 9 | 10 | 9 | 10 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
int n = 7 % k;
if (!(k % 2))
cout << "-1" << endl;
else {
for (int cnt = 1;;) {
if (!n) {
cout << cnt << endl;
break;
}
n = (n * 10 + 7) % k;
cnt++;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
int n = 7 % k;
if (!(k % 2) || !(k % 5))
cout << "-1" << endl;
else {
for (int cnt = 1;;) {
if (!n) {
cout << cnt << endl;
break;
}
n = (n * 10 + 7) % k;
cnt++;
}
}
return 0;
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define st first
#define nd second
#define endl '\n'
#define what_is(x) cerr << #x << " is " << x... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define st first
#define nd second
#define endl '\n'
#define what_is(x) cerr << #x << " is " << x... | insert | 48 | 48 | 48 | 50 | TLE | |
p02596 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll k, num = 0, cnt = 0;
int main() {
while (cnt <= k) {
num = (num * 10 + 7) % k;
cnt++;
if (!num) {
cout << cnt;
return 0;
}
}
cout << "-1";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll k, num = 0, cnt = 0;
int main() {
cin >> k;
while (cnt <= k) {
num = (num * 10 + 7) % k;
cnt++;
if (!num) {
cout << cnt;
return 0;
}
}
cout << "-1";
return 0;
}
| insert | 5 | 5 | 5 | 6 | -8 | |
p02596 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
int k, i, ans = -1, tmp = 0;
for (i = 1; i <= k + 100; i++) {
tmp = tmp * 10 + 7;
tmp %= k;
if (!tmp) {
ans = i;
break;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
int k, i, ans = -1, tmp = 0;
cin >> k;
for (i = 1; i <= k + 100; i++) {
tmp = tmp * 10 + 7;
tmp %= k;
if (!tmp) {
ans = i;
break;
}
}
cout << ans;
return 0;
} | insert | 5 | 5 | 5 | 6 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
long long K;
cin >> K;
if (K % 2 == 0)
cout << -1 << endl;
else {
long long ans = 1;
long long mod = 7 % K;
while (mod != 0) {
ans++;
mod = (mod * 10 + 7) % K;
}
cout << ans << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
long long K;
cin >> K;
if (K % 2 == 0)
cout << -1 << endl;
else {
long long ans = 1;
long long mod = 7 % K;
while (mod != 0) {
ans++;
mod = (mod * 10 + 7) % K;
if (ans > 1000000) {
cout << -1 << endl;
r... | insert | 15 | 15 | 15 | 19 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long k;
cin >> k;
long long i = 0;
long long val = 0;
long long first = -1;
while (true) {
i++;
val = val * 10 + 7;
long long rem = val % k;
if (rem == 0) {
break;
}
... | #include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
long long k;
cin >> k;
long long i = 0;
long long val = 0;
long long first = -1;
while (true) {
i++;
val = val * 10 + 7;
long long rem = val % k;
if (rem == 0) {
break;
}
... | replace | 25 | 27 | 25 | 28 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define L long
#define endl "\n"
#define ___ \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define ll long long
#define L long
#define endl "\n"
#define ___ \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | replace | 31 | 32 | 31 | 32 | TLE | |
p02596 | C++ | Time Limit Exceeded | /*
Author : Chandan Agrawal
College : Poornima College of Engg. jaipur, Raj
Mail : chandanagrawal23@gmail.com
" when you are not practicing someone else is ,
and the day u meet them u will lose "
*/
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define fastio ... | /*
Author : Chandan Agrawal
College : Poornima College of Engg. jaipur, Raj
Mail : chandanagrawal23@gmail.com
" when you are not practicing someone else is ,
and the day u meet them u will lose "
*/
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define fastio ... | replace | 112 | 113 | 112 | 113 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
co... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
co... | replace | 42 | 43 | 42 | 43 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define pb push_back
#define fori(j, n) for (int i = j; i < n; i++)
#define forj(i, n) for (int j = i; j < n; j++)
#define fork(i, n) for (int k = i; k < n; k++)
#define ppb pop_back()
#define umap unordered_map
#define uset unordered_set
#define lli long long int
using namespace std;
void so... | #include <bits/stdc++.h>
#define pb push_back
#define fori(j, n) for (int i = j; i < n; i++)
#define forj(i, n) for (int j = i; j < n; j++)
#define fork(i, n) for (int k = i; k < n; k++)
#define ppb pop_back()
#define umap unordered_map
#define uset unordered_set
#define lli long long int
using namespace std;
void so... | replace | 15 | 16 | 15 | 16 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define IOS \
{ \
ios::sync_with_stdio(false); \
cin.tie(0); ... | #include "bits/stdc++.h"
using namespace std;
#define IOS \
{ \
ios::sync_with_stdio(false); \
cin.tie(0); ... | replace | 47 | 48 | 47 | 48 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
// 入力
cin >> K;
int ans = -1;
int o;
o = K / 10;
if (K % 2 != 0 and K % 5 != 0) {
for (int i = o; i >= 0; i++) {
int seven = 0;
for (int j = 0; j <= i; j++) {
seven = seven + 7 * pow(10, j);
}
if (seven ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K;
// 入力
cin >> K;
int ans = -1;
int seven = 0;
for (int i = 1; i <= 1000001; i++) {
seven = 10 * seven % K + 7;
if (seven % K == 0) {
ans = i;
break;
}
}
cout << ans << endl;
}
| replace | 8 | 20 | 8 | 14 | TLE | |
p02596 | C++ | Runtime Error | /*
Author:loceaner
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define int long long
using namespace std;
const int A = 1e5 + 11;
const int B = 1e6 + 11;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
inline int read() {
char c = getchar();
int x = 0, f ... | /*
Author:loceaner
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define int long long
using namespace std;
const int A = 1e6 + 11;
const int B = 1e6 + 11;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
inline int read() {
char c = getchar();
int x = 0, f ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02596 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int k;
cin >> k;
bool flag = false;
ll l = (k % 7 == 0) ? 9 * k / l : 9 * k;
ll n = 1;
for (ll i ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int k;
cin >> k;
bool flag = false;
ll l = (k % 7 == 0) ? 9 * k / 7 : 9 * k;
ll n = 1;
for (ll i ... | replace | 12 | 13 | 12 | 13 | 0 | |
p02596 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll k;
vector<int> v = vector<int>(k, -1);
v[0] = 0;
ll a = 0;
ll idx = 1;
while (true) {
a = a * 10 + 7;
a %= k;
if (v[a] != -1) {
cout << idx - v[a] << endl;
return 0;
} else {
v[a] = idx;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll k;
cin >> k;
if (k % 2 == 0 || k % 5 == 0) {
cout << -1 << endl;
return 0;
}
vector<int> v = vector<int>(k, -1);
v[0] = 0;
ll a = 0;
ll idx = 1;
while (true) {
a = a * 10 + 7;
a %= k;
if (v[a] != ... | insert | 7 | 7 | 7 | 12 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 5;
ll x;
boo... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 5;
ll x;
boo... | insert | 38 | 38 | 38 | 42 | TLE | |
p02596 | 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 n;
cin >> n;
ll tmp = 7;
// ll ans = 0;
for (ll i = 1; i < 1000000000; ++i) {
if (tmp % n == 0) {
cout << i << endl;
return 0;
}
tmp *= 10;
tmp +... | #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 n;
cin >> n;
ll tmp = 7;
// ll ans = 0;
for (ll i = 1; i < 100000000; ++i) {
if (tmp % n == 0) {
cout << i << endl;
return 0;
}
tmp *= 10;
tmp +=... | replace | 11 | 12 | 11 | 12 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll K;
cin >> K;
if (K % 2 == 0) {
cout << -1 << endl;
return 0;
}
ll ans = 1;
ll x = 7;
x %= K;
while (x) {
ans++;
x = x * 10 + 7;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll K;
cin >> K;
if (K % 2 == 0 || K % 5 == 0) {
cout << -1 << endl;
return 0;
}
ll ans = 1;
ll x = 7;
x %= K;
while (x) {
ans++;
x =... | replace | 9 | 10 | 9 | 10 | TLE | |
p02596 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define dub long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ROF(i, a, b) for (int i = (a); i > (b); --i)
#define CASET \
int _T; ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define dub long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ROF(i, a, b) for (int i = (a); i > (b); --i)
#define CASET \
int _T; ... | insert | 134 | 134 | 134 | 139 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.