buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
// 35
#include <algorithm>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int main() {
for (int n; cin >> n, n;) {
pair<string, int> t[20000];
for (int i = 0; i < n; i++) {
string s, g;
cin >> s >> g;
t[2 * i] = make_pair(s, 1);
t[2 * i + 1] = make_pair... | // 35
#include <algorithm>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int main() {
for (int n; cin >> n, n;) {
pair<string, int> t[20000];
for (int i = 0; i < n; i++) {
string s, g;
cin >> s >> g;
t[2 * i] = make_pair(s, 1);
t[2 * i + 1] = make_pair... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 48], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 164 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
const int MAX = 100000;
typedef pair<int, int> P;
int ans[MAX];
int ToS(int h, int m, int s) { return h * 60 * 60 + m * 60 + s; }
void init() { fill(ans, ans + MAX, 0); }
int main() {
int n;
while (cin >> n && n) {
init();
f... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
const int MAX = 100000;
typedef pair<int, int> P;
int ans[MAX];
int ToS(int h, int m, int s) { return h * 60 * 60 + m * 60 + s; }
void init() { fill(ans, ans + MAX, 0); }
int main() {
int n;
while (cin >> n && n) {
init();
f... | [["-", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22]] | 1 | 244 | 8 |
loop {
n, m = gets.split.map &:to_i
break if n == 0
road = (1..n).map{ gets.split.map &:to_i }
road.sort_by!(&:last).reverse!
while !road.empty?
if road[0][0] > m
road[0][0] -= m
break
else
m -= road[0][0]
road.shift
end
end... | loop {
n, m = gets.split.map &:to_i
break if n == 0
road = (1..n).map{ gets.split.map &:to_i }
road.sort_by!(&:last).reverse!
while !road.empty?
if road[0][0] > m
road[0][0] -= m
break
else
m -= road[0][0]
road.shift
end
end... | [["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 612], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 21], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 4 | 104 | 4 |
# AOJ2019
shukuba = []
n = 0
m = 0
def solve():
shukuba.sort(key = lambda x: x[0])
s = sum(map(lambda x: x[0], shukuba)) - m
if s <= 0:
return 0
e = 0
i = 0
while s > 0:
d = shukuba[i][0] if s >= shukuba[i][0] else s
e += shukuba[i][1] * d
s -= d
i += 1
... | # AOJ2019
shukuba = []
n = 0
m = 0
def solve():
shukuba.sort(key = lambda x: x[1])
s = sum(map(lambda x: x[0], shukuba)) - m
if s <= 0:
return 0
e = 0
i = 0
while s > 0:
d = shukuba[i][0] if s >= shukuba[i][0] else s
e += shukuba[i][1] * d
s -= d
i += 1
... | [["-", 3, 4, 0, 653, 51, 670, 8, 206, 206, 612], ["+", 3, 4, 0, 653, 51, 670, 8, 206, 206, 612]] | 5 | 185 | 2 |
while True:
N,M = map(int,input().split())
if N == 0:
break
expect = 0
a = []
exsum = 0
for i in range(N): #二次元配列を作る
a.append(list(map(int,input().split())))
exsum += a[i][0]*a[i][1] #誰も雇わなかった場合の期待値
b = sorted(a, key=lambda x: x[1]) #危険度の高い区間ほど後ろにくるように並べる
i = N-1
... | while True:
N,M = map(int,input().split())
if N == 0:
break
expect = 0
a = []
exsum = 0
for i in range(N): #二次元配列を作る
a.append(list(map(int,input().split())))
exsum += a[i][0]*a[i][1] #誰も雇わなかった場合の期待値
b = sorted(a, key=lambda x: x[1]) #危険度の高い区間ほど後ろにくるように並べる
i = N-1
... | [["+", 0, 52, 8, 196, 0, 52, 15, 679, 17, 355], ["+", 8, 196, 0, 52, 15, 679, 12, 666, 0, 22], ["+", 8, 196, 0, 52, 15, 679, 12, 666, 667, 20], ["+", 8, 196, 0, 52, 15, 679, 12, 666, 0, 612]] | 5 | 173 | 4 |
while True:
N,M = list(map(int,input().split()))
if N == M == 0: break
DP = [list(map(int,input().split())) for _ in range(N)]
DP = sorted(DP, key = lambda x:x[1], reverse = True)
ans = 0
for i in range(N):
if M-DP[i][0] >= 0: M -= DP[i][0]
else:
ans += DP[i][1]*(DP[... | while True:
N,M = list(map(int,input().split()))
if N == M == 0: break
DP = [list(map(int,input().split())) for _ in range(N)]
DP = sorted(DP, key = lambda x:x[1], reverse = True)
ans = 0
for i in range(N):
if M-DP[i][0] >= 0:
M -= DP[i][0]
else:
ans += D... | [["-", 12, 652, 3, 4, 0, 657, 31, 657, 31, 22], ["-", 12, 652, 3, 4, 0, 657, 31, 657, 17, 33], ["-", 0, 659, 12, 652, 3, 4, 0, 657, 17, 33], ["+", 0, 659, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 3, 668, 0, 659, 12, 652, 3, 4, 0, 21], ["+", 3, 668, 0, 659, 12, 652, 3, 4, 0, 22]] | 5 | 168 | 6 |
while True:
n, m = map(int, input().split())
if n == 0 and m == 0:
break
sections = []
for i in range(n):
d, p = map(int, input().split())
sections.append([p, d])
sections.sort()
sections.reverse()
e = 0
for p, d in sections:
if d < m:
m -= d
... | while True:
n, m = map(int, input().split())
if n == 0 and m == 0:
break
sections = []
for i in range(n):
d, p = map(int, input().split())
sections.append([p, d])
sections.sort()
sections.reverse()
e = 0
for p, d in sections:
if d <= m:
m -= d... | [["-", 0, 7, 8, 196, 0, 57, 15, 666, 667, 18], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 19], ["-", 8, 196, 0, 57, 75, 665, 15, 666, 667, 18], ["-", 8, 196, 0, 57, 75, 665, 15, 666, 0, 22], ["+", 8, 196, 0, 57, 75, 665, 15, 666, 667, 47], ["+", 8, 196, 0, 57, 75, 665, 15, 666, 0, 612]] | 5 | 118 | 6 |
while True:
n, m = map(int, input().split())
dpList = []
if (n,m) == (0,0):
break
for i in range(n):
row = list(map(int,input().split()))
dpList.append(row)
dpList = sorted(dpList, key = lambda x:x[1], reverse = True)
num = 0
for i in range(n):
if m >= dpList[... | while True:
n, m = map(int, input().split())
dpList = []
if (n,m) == (0,0):
break
for i in range(n):
row = list(map(int,input().split()))
dpList.append(row)
dpList = sorted(dpList, key = lambda x:x[1], reverse = True)
num = 0
for i in range(n):
if m >= dpList[... | [["+", 75, 76, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 75, 76, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 75, 76, 8, 196, 0, 1, 0, 662, 12, 612]] | 5 | 146 | 3 |
while True:
n, m = map(int, input().split())
if n == 0:
break
risks = [(p, d) for d, p in (map(int, input().split()) for _ in range(n))]
risks.sort()
while m:
p, d = risks.pop()
if d >= m:
remain = p * (d - m)
break
m -= d
print(remain + su... | while True:
n, m = map(int, input().split())
if n == 0:
break
risks = [(p, d) for d, p in (map(int, input().split()) for _ in range(n))]
risks.sort()
remain = 0
while risks:
p, d = risks.pop()
if d >= m:
remain = p * (d - m)
break
m -= d
... | [["+", 0, 52, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 52, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 0, 52, 8, 196, 0, 1, 0, 662, 12, 612], ["-", 0, 656, 0, 52, 8, 196, 0, 52, 15, 22], ["+", 0, 656, 0, 52, 8, 196, 0, 52, 15, 22]] | 5 | 112 | 5 |
while True:
n, m = map(int, input().split())
if n == 0:
break
else:
s = 0
l = []
for _ in range(n):
d, p = map(int, input().split())
s += d * p
l.append((p,d))
l.sort()
while m > 0:
a, b = l.pop()
if... | while True:
n, m = map(int, input().split())
if n == 0:
break
else:
s = 0
l = []
for _ in range(n):
d, p = map(int, input().split())
s += d * p
l.append((p,d))
l.sort()
while m > 0 and l:
a, b = l.pop()
... | [["+", 75, 76, 8, 196, 0, 52, 15, 679, 17, 355], ["+", 75, 76, 8, 196, 0, 52, 15, 679, 12, 22]] | 5 | 119 | 2 |
da = list(map(int,input().split()))
k = [[0 for i in range(2)]for j in range(10001)]
i = 0
su = 0
j = 0
while da[0] + da[1] != 0:
i = 0
su = 0
j = 0
for i in range(da[0]):
k[i][0],k[i][1] = map(int,input().split())
sorted(k,key = lambda x: x[1],reverse = True)
while j != i + 1:
if da[1] > k[j][0]:
da[1... | da = list(map(int,input().split()))
k = [[0 for i in range(2)]for j in range(10001)]
i = 0
su = 0
j = 0
while da[0] + da[1] != 0:
i = 0
su = 0
j = 0
for i in range(da[0]):
k[i][0],k[i][1] = map(int,input().split())
k = sorted(k,key = lambda x: x[1],reverse = True)
while j != i + 1:
if da[1] > k[j][0]:
... | [["+", 0, 52, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 52, 8, 196, 0, 1, 0, 662, 0, 32]] | 5 | 280 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = n - 1; i >= (0); i--)
#define reps(i, f, n) for (int i = (f); i < (n); i++)
#define each(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = n - 1; i >= (0); i--)
#define reps(i, f, n) for (int i = (f); i < (n); i++)
#define each(i... | [["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 751 | 6 |
#include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
const int INF = 100000000;
using namespace std;
const int N = 100;
void warshallFloyd(int m[N][N], int n... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
const int INF = 100000000;
using namespace std;
const int N = 100;
void warshallFloyd(int m[N][N], int n... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 480 | 2 |
#include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
constexpr int INF = 1 << 29;
struct state {
int pos, life, cost;
state() {}
state(int a, int b, int c) : pos(a), life(b), cost(c) {}
};
int N, M, L, K, A, H;
int fridge[111];
int graph[111][111];
bool solve() {
cin >> N >> M >> ... | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
constexpr int INF = 1 << 29;
struct state {
int pos, life, cost;
state() {}
state(int a, int b, int c) : pos(a), life(b), cost(c) {}
};
int N, M, L, K, A, H;
int fridge[111];
int graph[111][111];
bool solve() {
cin >> N >> M >> ... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22]] | 1 | 695 | 2 |
#include <iostream>
#include <queue>
#include <vector>
#define N_NODE 100
#define INF (1 << 29)
using namespace std;
struct Edge {
int to, cost;
};
class Path {
public:
Path(int _num, int _cost, int _M) {
num = _num;
cost = _cost;
limit_time = _M;
}
int num;
int cost;
int limit_time;
bool ... | #include <iostream>
#include <queue>
#include <vector>
#define N_NODE 101
#define INF (1 << 29)
using namespace std;
struct Edge {
int to, cost;
};
class Path {
public:
Path(int _num, int _cost, int _M) {
num = _num;
cost = _cost;
limit_time = _M;
}
int num;
int cost;
int limit_time;
bool ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19]] | 1 | 783 | 33 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int n, m, l, k, a, h;
bool frez[125];
int dist[125][125];
vector<pii> g[125];
int main() {
while (true) {
scanf("%d%d%d%d%d%d", &n, &m, &l, &k, &a, &h);
if (n + m + l + k + a + h == 0)
return 0;
for (int i = 0; i < 125; i++) ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int n, m, l, k, a, h;
bool frez[125];
int dist[125][125];
vector<pii> g[125];
int main() {
while (true) {
scanf("%d%d%d%d%d%d", &n, &m, &l, &k, &a, &h);
if (n + m + l + k + a + h == 0)
return 0;
for (int i = 0; i < 125; i++) ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 646 | 2 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <memory>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include ... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <memory>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include ... | [["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 696 | 6 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int MAX = 101;
const int INF = (1 << 25);
int T[MAX][MAX];
int N, M, L, K, A, H;
bool heal[MAX];
struct Edge {
int to, cost;
Edge(int a, int b) : to(a), cost(b){};
Edge() {}
};
struct State {
int pos, blood... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int MAX = 101;
const int INF = (1 << 25);
int T[MAX][MAX];
int N, M, L, K, A, H;
bool heal[MAX];
struct Edge {
int to, cost;
Edge(int a, int b) : to(a), cost(b){};
Edge() {}
};
struct State {
int pos, blood... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 723 | 2 |
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define INF (1 << 30)
typedef pair<int, int> P;
typedef pair<int, P> T;
vector<P> edge[105];
int n, m, l, k, a, h;
bool recover[105];
int dist[105][105];
void dijkstra(int s) {
for (int i = 0; i < 105; i... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define INF (1 << 30)
typedef pair<int, int> P;
typedef pair<int, P> T;
vector<P> edge[105];
int n, m, l, k, a, h;
bool recover[105];
int dist[105][105];
void dijkstra(int s) {
for (int i = 0; i < 105; i... | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 623 | 1 |
#define _CRT_SECURE_NO_WARNINGS
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int ll
//#define endl "\n"
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i, a, b) for (ll i = a; i < ll(... | #define _CRT_SECURE_NO_WARNINGS
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int ll
//#define endl "\n"
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i, a, b) for (ll i = a; i < ll(... | [["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13]] | 1 | 1,140 | 2 |
#include <bits/stdc++.h>
using namespace std;
int n;
vector<string> str;
string mem[15][15];
typedef pair<string, int> P;
string con(string a, string b) {
int K = 0;
for (int i = 0; i < a.size(); i++) {
int j = i, k = 0;
while (a[j] && b[k] && a[j] == b[k])
j++, k++;
if (!a[j] || !b[k])
K =... | #include <bits/stdc++.h>
using namespace std;
int n;
vector<string> str;
string mem[15][15];
typedef pair<string, int> P;
string con(string a, string b) {
int K = 0;
for (int i = 0; i < a.size(); i++) {
int j = i, k = 0;
while (a[j] && b[k] && a[j] == b[k])
j++, k++;
if (!a[j] || !b[k])
K =... | [["+", 15, 339, 51, 16, 31, 16, 31, 91, 17, 111]] | 1 | 617 | 1 |
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include ... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include ... | [["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 30, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 486 | 4 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = ... | [["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 18], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 17, 19], ["-", 51, 16, 12, 23, 0, 16, 31, 16, 17, 18], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 17, 60]] | 1 | 394 | 4 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long LL;
int main() {
int n;
while (cin >> n && n > 0) {
if (n <= 16) {
cout << 0 << endl;
continue;
}
LL f = n;
REP(i, 7) f *= i + 1;
if (n % 2 == 0) {
n /= 2;
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long LL;
int main() {
int n;
while (cin >> n && n > 0) {
if (n <= 16) {
cout << 0 << endl;
continue;
}
LL f = n;
REP(i, 7) f *= i + 1;
if (n % 2 == 0) {
n /= 2;
... | [["-", 8, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 69, 28, 22]] | 1 | 452 | 4 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace ... | [["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 48], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 517 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <v... | [["-", 0, 11, 12, 69, 28, 69, 341, 342, 0, 13], ["+", 0, 11, 12, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22]] | 1 | 714 | 4 |
/*
AOJ 2030
Title:Ruins
@kankichi573
*/
#include <limits.h>
#include <math.h>
#include <stdio.h>
extern double sqrt(double);
int compare_int(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int solve(int m, int n) {
int min_, sum, i, j, k, l, a[4], b[4];
min_ = INT_MAX;
for (i = 1; i < sqr... | /*
AOJ 2030
Title:Ruins
@kankichi573
*/
#include <limits.h>
#include <math.h>
#include <stdio.h>
extern double sqrt(double);
int compare_int(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int solve(int m, int n) {
int min_, sum, i, j, k, l, a[4], b[4];
min_ = INT_MAX;
for (i = 1; i <= sq... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 328 | 4 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 483 | 6 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
// #include <b... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
// #include <b... | [["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 366 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 345 | 4 |
#include <algorithm>
#include <stdio.h>
int a, b;
int main() {
while (scanf("%d%d", &a, &b), a + b) {
int ret = 999999999;
for (int i = 1; i * i <= a; i++) {
if (a % i)
continue;
for (int j = 1; j * j <= b; j++) {
if (b % j)
continue;
int p[4] = {i, a / i, j, b / ... | #include <algorithm>
#include <stdio.h>
int a, b;
int main() {
while (scanf("%d%d", &a, &b), a + b) {
int ret = 999999999;
for (int i = 1; i * i <= a; i++) {
if (a % i)
continue;
for (int j = 1; j * j <= b; j++) {
if (b % j)
continue;
int p[4] = {i, a / i, j, b / ... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 194 | 2 |
#include <algorithm>
#include <iostream>
#define sq(a) ((a) * (a))
#define INFTY (1 << 30)
using namespace std;
int main() {
while (true) {
int ans = INFTY;
int s[4];
int a, b;
scanf("%d%d", &a, &b);
if (a == 0 && b == 0)
break;
for (int i = 1; i < a; ++i) {
if (a % i == 0) {
... | #include <algorithm>
#include <iostream>
#define sq(a) ((a) * (a))
#define INFTY (1 << 30)
using namespace std;
int main() {
while (true) {
int ans = INFTY;
int s[4];
int a, b;
scanf("%d%d", &a, &b);
if (a == 0 && b == 0)
break;
for (int i = 1; i <= a; ++i) {
if (a % i == 0) {
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19], ["-", 3, 4, 0, 16, 31, 69, 341, 342, 0, 13], ["+", 3, 4, 0, 16, 31, 69, 341, 342, 0, 13], ["-", 3, 4, 0, 16, 12, 69, 341, 342, 0, 13], ["+", 3, 4, 0,... | 1 | 224 | 12 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int inf = 999999;
int func(int a[4]) {
int t = 0;
for (int i = 0; i < 3; i++) {
t += ((a[i + 1] - a[i]) * (a[i + 1] - a[i]));
}
return t;
}
int main() {
int n, m;
while (cin >> n >> m && n && m) {
vector<int... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int inf = 99999999;
int func(int a[4]) {
int t = 0;
for (int i = 0; i < 3; i++) {
t += ((a[i + 1] - a[i]) * (a[i + 1] - a[i]));
}
return t;
}
int main() {
int n, m;
while (cin >> n >> m && n && m) {
vector<i... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]] | 1 | 307 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
const int INF = 1000000000;
main() {
int a, b;
while (cin >> a >> b && (a | b)) {
int ans = INF;
for (int i = 1; i + i <= a; i++) {
if (a % i != 0)
continue;
for (int j = 1; j + j <= b; j++) {
if (b % j != 0)
... | #include <algorithm>
#include <iostream>
using namespace std;
const int INF = 1000000000;
main() {
int a, b;
while (cin >> a >> b && (a | b)) {
int ans = INF;
for (int i = 1; i <= a; i++) {
if (a % i != 0)
continue;
for (int j = 1; j <= b; j++) {
if (b % j != 0)
cont... | [["-", 8, 9, 0, 7, 15, 16, 31, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 7, 15, 16, 31, 16, 31, 22]] | 1 | 199 | 4 |
#!/usr/bin/ruby
while(a,b=gets.split.map(&:to_i))!=[0,0]do
r=99999999
2.step(Math.sqrt(a)){|i|
i=i.to_i
if a%i>0 then next end
2.step(Math.sqrt(b)){|j|
j=j.to_i
if b%j>0 then next end
x=[i,a/i,j,b/j].sort
p=(x[3]-x[2])**2+(x[2]-x[1])**2+(x[1]-x[0])**2
if r>p then r=p end
}
}
p r
end | #!/usr/bin/ruby
while(a,b=gets.split.map(&:to_i))!=[0,0]do
r=99999999
1.step(Math.sqrt(a)){|i|
i=i.to_i
if a%i>0 then next end
1.step(Math.sqrt(b)){|j|
j=j.to_i
if b%j>0 then next end
x=[i,a/i,j,b/j].sort
p=(x[3]-x[2])**2+(x[2]-x[1])**2+(x[1]-x[0])**2
if r>p then r=p end
}
}
p r
end | [["-", 0, 493, 0, 89, 8, 170, 0, 652, 486, 612], ["+", 0, 493, 0, 89, 8, 170, 0, 652, 486, 612], ["-", 15, 652, 3, 4, 0, 772, 0, 773, 0, 6], ["+", 15, 652, 3, 4, 0, 772, 0, 773, 0, 6]] | 4 | 137 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int z = 0; z < n; z++) {
int n2;
cin >> n2;
int a[200];
for (int i = 0; i < n2; i++) {
cin >> a[i];
}
int u = -1000, d = -1000;
for (int i = 0; i < n2 - 1; i++) {
if (u < a[i + 1] - a[i])
u ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int z = 0; z < n; z++) {
int n2;
cin >> n2;
int a[200];
for (int i = 0; i < n2; i++) {
cin >> a[i];
}
int u = 0, d = 0;
for (int i = 0; i < n2 - 1; i++) {
if (u < a[i + 1] - a[i])
u = a[i + ... | [["-", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 186 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, are, h1, h2, d, u;
d = u = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> are >> h1;
for (int j = 1; j < are; j++) {
cin >> h2;
if (h1 < h2) {
if (u < h2 - h1)
u = h2 - h1;
} else if (h1 > h2) {
... | #include <iostream>
using namespace std;
int main() {
int n, are, h1, h2, d, u;
d = u = 0;
cin >> n;
for (int i = 0; i < n; i++) {
d = u = 0;
cin >> are >> h1;
for (int j = 1; j < are; j++) {
cin >> h2;
if (h1 < h2) {
if (u < h2 - h1)
u = h2 - h1;
} else if (h1 >... | [["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 141 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int a[1000], q;
int mx = 0;
int mi = 0;
cin >> q;
for (int f = 0; f < q; f++) {
cin >> a[q];
if (f >= 1) {
mx = max((a[q] - a[q - 1]), mx);
mi = min((a[q] - a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int a[1000], q;
int mx = 0;
int mi = 0;
cin >> q;
for (int f = 0; f < q; f++) {
cin >> a[f];
if (f >= 1) {
mx = max((a[f] - a[f - 1]), mx);
mi = min((a[f] - a... | [["-", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22], ["-", 0, 23, 0, 16, 31, 69, 341, 342, 0, 22], ["+", 0, 23, 0, 16, 31, 69, 341, 342, 0, 22], ["-", 0, 16, 12, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 31, 22]] | 1 | 147 | 10 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, tt;
cin >> tt;
for (int j = 0; j < tt; j++) {
int cu = 0, cd = 0, m = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t;
if (t - m > cu)
cu = t - m;
if (m - t > cd)
cd = m - t;
m = t;
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, tt;
cin >> tt;
for (int j = 0; j < tt; j++) {
int cu = 0, cd = 0, m = 0;
cin >> n;
cin >> m;
for (int i = 1; i < n; i++) {
cin >> t;
if (t - m > cu)
cu = t - m;
if (m - t > cd)
cd = m - t;
... | [["+", 0, 7, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 123 | 6 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int i, j, n, t, in[2], max, min;
cin >> t;
for (i = 0; i < t; i++) {
cin >> n;
cin >> in[1];
max = min = 0;
for (j = 1; j < n; j++) {
in[0] = in[1];
cin >> in[1];
if (in[1] > in[0]) {
... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int i, j, n, t, in[2], max, min;
cin >> t;
for (i = 0; i < t; i++) {
cin >> n;
cin >> in[1];
max = min = 0;
for (j = 1; j < n; j++) {
in[0] = in[1];
cin >> in[1];
if (in[1] > in[0]) {
... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18]] | 1 | 188 | 2 |
/*
* 2100.cpp
*
* Created on: 2012/07/08
* Author: shimomire
*/
#include <algorithm>
#include <complex>
#include <float.h>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, b, n) for (int i = b; ... | /*
* 2100.cpp
*
* Created on: 2012/07/08
* Author: shimomire
*/
#include <algorithm>
#include <complex>
#include <float.h>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, b, n) for (int i = b; ... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 232 | 2 |
#include <iostream>
using namespace std;
int main() {
int to;
cin >> to;
for (int oo = 0; oo < to; oo++) {
int n;
cin >> n;
int h[n], ud, upmax = 0, downmax = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int j = 0; j < n - 1; j++) {
if (h[j] > h[j + 1]) {
ud = ... | #include <iostream>
using namespace std;
int main() {
int to;
cin >> to;
for (int oo = 0; oo < to; oo++) {
int n;
cin >> n;
int h[n], ud, upmax = 0, downmax = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int j = 0; j < n - 1; j++) {
if (h[j] > h[j + 1]) {
ud = ... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 199 | 2 |
#include <stdio.h>
int max(int x, int y) { return x > y ? x : y; }
int min(int x, int y) { return x < y ? x : y; }
int main(void) {
int t, n, h[101], i, up = 0, down = 0;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &h[i]);
for (i = 0; i < n - 1; i++) ... | #include <stdio.h>
int max(int x, int y) { return x > y ? x : y; }
int min(int x, int y) { return x < y ? x : y; }
int main(void) {
int t, n, h[101], i, up = 0, down = 0;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &h[i]);
for (i = up = down = 0; i < ... | [["+", 8, 9, 0, 7, 10, 11, 12, 11, 31, 22], ["+", 8, 9, 0, 7, 10, 11, 12, 11, 17, 32], ["+", 0, 7, 10, 11, 12, 11, 12, 11, 31, 22], ["+", 0, 7, 10, 11, 12, 11, 12, 11, 17, 32]] | 1 | 193 | 4 |
#include <iostream>
using namespace std;
int main() {
int num = 0, count = 0, h = 0, hh = 0, m = 0, n = 0, k = 0, s = 0;
cin >> num;
for (int i = 0; i < num; i++) {
cin >> count;
for (int j = 0; j < count; j++) {
cin >> h;
if (j == 0) {
s = h;
} else
s = hh;
hh =... | #include <iostream>
using namespace std;
int main() {
int num = 0, count = 0, h = 0, hh = 0, m = 0, n = 0, k = 0, s = 0;
cin >> num;
for (int i = 0; i < num; i++) {
cin >> count;
for (int j = 0; j < count; j++) {
cin >> h;
if (j == 0)
s = h;
else
s = hh;
hh = h;
... | [["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 15, 339, 51, 16, 12, 16, 31, 91, 17, 33]] | 1 | 190 | 3 |
import java.util.*;
class Main {
public static void main(String[] z) {
Scanner s = new Scanner(System.in);
for (int n, c, i, j; (n = s.nextInt()) > 0;
System.out.println(((n -= c) < 0 ? "deficient"
: n > 0 ? "abundant"
: "per... | import java.util.*;
class Main {
public static void main(String[] z) {
Scanner s = new Scanner(System.in);
for (int n, c, i, j; (n = s.nextInt()) > 0;
System.out.println(((n -= c) > 0 ? "deficient"
: n < 0 ? "abundant"
: "per... | [["-", 0, 16, 31, 23, 0, 510, 15, 16, 17, 18], ["+", 0, 16, 31, 23, 0, 510, 15, 16, 17, 47], ["-", 31, 23, 0, 510, 75, 510, 15, 16, 17, 47], ["+", 31, 23, 0, 510, 75, 510, 15, 16, 17, 18]] | 3 | 149 | 4 |
#include <stdio.h>
int main(void) {
int n;
int i, j, num;
while (scanf("%d", &n) && n != 0) {
num = 0;
for (i = 1; i * i < n; i++) {
if (n % i == 0)
num = num + i + n / i;
}
num = -n;
if (num == n) {
printf("perfect number\n");
} else if (num > n) {
printf("abun... | #include <stdio.h>
int main(void) {
int n;
int i, j, num;
while (scanf("%d", &n) && n != 0) {
num = 0;
for (i = 1; i * i < n; i++) {
if (n % i == 0)
num = num + i + n / i;
}
num -= n;
if (num == n) {
printf("perfect number\n");
} else if (num > n) {
printf("abun... | [["-", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 8, 9, 0, 1, 0, 11, 12, 91, 17, 33], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 110]] | 0 | 128 | 20 |
#include <stdio.h>
int main(void) {
int n[100];
int i, j, s, t, u, v, w, x;
int sum = 0;
i = 0;
do {
scanf("%d", &n[i]);
i++;
} while (n[i - 1] != 0);
for (i = 0; n[i] != 0; i++) {
s = n[i];
t = n[i] / 6 + 1;
sum += 1;
for (j = 2; j < t; j++) {
if (s % j == 0)
sum ... | #include <stdio.h>
int main(void) {
int n[100];
int i, j, s, t, u, v, w, x;
int sum = 0;
i = 0;
do {
scanf("%d", &n[i]);
i++;
} while (n[i - 1] != 0);
for (i = 0; n[i] != 0; i++) {
s = n[i];
t = n[i] / 6 + 1;
for (j = 1; j < t; j++) {
if (s % j == 0)
sum += j;
}
... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 335 | 6 |
#include <stdio.h>
int main() {
int n, sum, i;
sum = 0;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (i == 1)
sum = 1;
else if (n == i * i)
sum += i;
else
sum += (i + (n / i));
... | #include <stdio.h>
int main() {
int n, sum, i;
sum = 0;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (i == 1)
sum = 1;
else if (n == i * i)
sum += i;
else
sum += (i + (n / i));
... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 161 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int ans = 1;
for (int i = 0; i * i < n; i++) {
if (n % i == 0) {
ans += i;
if (n / i != i)
ans += n / i;
}
}
if (n != 1 && ans < n) {
cout << "deficient number" << endl... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int ans = 1;
for (int i = 2; i * i < n; i++) {
if (n % i == 0) {
ans += i;
if (n / i != i)
ans += n / i;
}
}
if (n != 1 && ans == n) {
cout << "perfect number" << endl... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 127 | 8 |
#include <iostream>
using namespace std;
int sun_factors(int n) {
if (n <= 1)
return 0;
int i, s = 1;
for (i = 2; i * i < n; i++)
if (n % i == 0)
s += i + n / i;
if (i * i == n && n % i == 0)
s += i;
return s;
}
int main() {
int n;
while (cin >> n && n) {
int s = sun_factors(n);
... | #include <iostream>
using namespace std;
int sun_factors(int n) {
if (n <= 1)
return 0;
int i, s = 1;
for (i = 2; i * i < n; i++)
if (n % i == 0)
s += i + n / i;
if (i * i == n && n % i == 0)
s += i;
return s;
}
int main() {
int n;
while (cin >> n && n) {
int s = sun_factors(n);
... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 150 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, i;
while (cin >> n, n) {
int s = -n;
for (i = 1; i * i <= n; i++) {
if (n % i == 0)
s += i + n / 1;
}
i--;
if (i * i == n)
s -= i;
cout << (s == n ? "perfect"
: s > n ? "abund... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, i;
while (cin >> n, n) {
int s = -n;
for (i = 1; i * i <= n; i++) {
if (n % i == 0)
s += i + n / i;
}
i--;
if (i * i == n)
s -= i;
cout << (s == n ? "perfect"
: s > n ? "abund... | [["-", 64, 1, 0, 11, 12, 16, 12, 16, 12, 13], ["+", 64, 1, 0, 11, 12, 16, 12, 16, 12, 22]] | 1 | 116 | 2 |
#include <stdio.h>
#pragma warning(disable : 4996)
int n;
int main() {
while (true) {
scanf("%d", &n);
if (n == 0)
break;
int ret = 1;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
if (i * i != n) {
ret += i + n / i;
} else {
ret += i;
}
... | #include <stdio.h>
#pragma warning(disable : 4996)
int n;
int main() {
while (true) {
scanf("%d", &n);
if (n == 0)
break;
int ret = n > 1 ? 1 : 0;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
if (i * i != n) {
ret += i + n / i;
} else {
ret += i;... | [["+", 0, 43, 49, 50, 51, 41, 15, 16, 31, 22], ["+", 0, 43, 49, 50, 51, 41, 15, 16, 17, 47], ["+", 0, 43, 49, 50, 51, 41, 15, 16, 12, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 41, 0, 101], ["+", 8, 9, 0, 43, 49, 50, 51, 41, 0, 102], ["+", 8, 9, 0, 43, 49, 50, 51, 41, 75, 13]] | 1 | 142 | 6 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repb(i, a, b) for (int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
type... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repb(i, a, b) for (int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
type... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 204 | 2 |
#include <bits/stdc++.h>
#define r(i, n) for (int i = 1; i < n; i++)
using namespace std;
int main() {
long long n, p, a, b;
while (cin >> n, n) {
long long s = 1;
if (n == 1)
s--;
for (int i = 2; i < n / 2; i++)
if (n % i == 0)
s += i + n / i;
if (n < s)
cout << "abundant ... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 1; i < n; i++)
using namespace std;
int main() {
long long n, p, a, b;
while (cin >> n, n) {
long long s = 1;
if (n == 1)
s--;
for (int i = 2; i * i < n; i++)
if (n % i == 0)
s += i + n / i;
if (n < s)
cout << "abundant ... | [["+", 8, 9, 0, 7, 15, 16, 31, 16, 17, 48], ["+", 8, 9, 0, 7, 15, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 85], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 125 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
static const int M = 31623;
int main() {
vector<int> primes;
primes.push_back(2);
for (int i = 3; i <= M; i += 2) {
bool f = true;
int r = (int)sqrt(i);
for (int j = 0; primes[j] <= r; ++j) {
if (i %... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
static const int M = 31623;
int main() {
vector<int> primes;
primes.push_back(2);
for (int i = 3; i <= M; i += 2) {
bool f = true;
int r = (int)sqrt(i);
for (int j = 0; primes[j] <= r; ++j) {
if (i %... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 108]] | 1 | 314 | 2 |
#include <iostream>
using namespace std;
int main() {
long long int n;
while (cin >> n, n) {
long long int total = -n;
for (long long int i = 1; i * i <= n; i++) {
if (n % i == 0) {
total += i + i / n;
if (i == n / i) {
total -= i;
}
}
}
if (total < n) ... | #include <iostream>
using namespace std;
int main() {
long long int n;
while (cin >> n, n) {
long long int total = -n;
for (long long int i = 1; i * i <= n; i++) {
if (n % i == 0) {
total += i + n / i;
if (i == n / i) {
total -= i;
}
}
}
if (total < n) ... | [["-", 0, 1, 0, 11, 12, 16, 12, 16, 31, 22], ["-", 0, 1, 0, 11, 12, 16, 12, 16, 17, 85], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 17, 85], ["+", 0, 1, 0, 11, 12, 16, 12, 16, 12, 22]] | 1 | 135 | 4 |
#include <cmath>
#include <cstdio>
int yaksu(int a) {
if (a == 1)
return 1;
int res = a;
for (int i = sqrt(a); i > 0; i--) {
if (a % i == 0) {
res -= i;
if (i != a / i && i != 1)
res = res - a / i;
}
if (res < 0)
break;
}
return res;
}
int main() {
int a, tk;
whi... | #include <cmath>
#include <cstdio>
int yaksu(int a) {
if (a == 1)
return 1;
int res = a;
for (int i = sqrt(a); i > 0; i--) {
if (a % i == 0) {
res -= i;
if (i != a / i && i != 1)
res = res - a / i;
}
if (res < 0)
break;
}
return res;
}
int main() {
int a, tk;
whi... | [["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 168 | 3 |
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <ut... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <ut... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 302 | 4 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
while (scanf("%d", &n), n) {
int cnt = 0;
int x = 0;
for (int i = 2; i * i < n; i++) {
if (n % i == 0) {
cnt += i;
x = n / i;
cnt += x;
}
}
cnt++;
if (n == ... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
while (scanf("%d", &n), n) {
int cnt = 0;
int x = 0;
for (int i = 2; i * i < n; i++) {
if (n % i == 0) {
cnt += i;
x = n / i;
cnt += x;
}
}
cnt++;
if (n == ... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 146 | 2 |
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MAX 100000010
int n;
void init() { n = 0; }
bool input() {
cin >> n;
return n;
}
string solve() {
int ans = 1;
for (int i = 2; i * i < n... | #include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MAX 100000010
int n;
void init() { n = 0; }
bool input() {
cin >> n;
return n;
}
string solve() {
int ans = 1;
for (int i = 2; i * i < n... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 48], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 12, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 85], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 187 | 6 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int n;
while (1) {
cin >> n;
if (n == 0)
break;
int sum, hoge = n;
n < 2 ? sum = 0 : sum = 1;
for (int i = 2; i < hoge && sum < n; i++) {
i... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int n;
while (1) {
cin >> n;
if (n == 0)
break;
int sum, hoge = n;
n < 2 ? sum = 0 : sum = 1;
for (int i = 2; i < hoge && sum < n; i++) {
i... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 159 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define each(itr, c) \
for (__typeof(c.begin()) itr = c.begin(); itr != c.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define each(itr, c) \
for (__typeof(c.begin()) itr = c.begin(); itr != c.end(); ++itr)
#define all(x) (x).begin(), (x).end()
#define... | [["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 72], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106], ["-", 15, 339, 51, 16, 12, 16, 12, 16, 17, 72], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 17, 33]] | 1 | 721 | 6 |
import java.util.*;
public class Main {
public static void main(String[] agrs) {
Scanner sc = new Scanner(System.in);
IX:
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
boolean[][] a = new boolean[n][n];
for (int i = 0; i < n; i++) {
a[i][i] = true;
}
... | import java.util.*;
public class Main {
public static void main(String[] agrs) {
Scanner sc = new Scanner(System.in);
IX:
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
boolean[][] a = new boolean[n][n];
for (int i = 0; i < n; i++) {
a[i][i] = true;
}
... | [["-", 0, 57, 15, 15, 0, 504, 516, 504, 71, 22], ["+", 0, 57, 15, 15, 0, 504, 516, 504, 71, 22], ["-", 0, 1, 0, 11, 31, 504, 516, 504, 71, 22], ["+", 0, 1, 0, 11, 31, 504, 516, 504, 71, 22]] | 3 | 431 | 4 |
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int n, used[51][51], day[51][32];
int solve() {
vector<int> l;
for (int i = 1; i <= 30; i++) {
l.clear();
for (int j = 0; j < n; j++)
if (day[j][i] == 1)
l.push_back(j);
int a[51] = {};
for (int j = 0; j < l... | #include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int n, used[51][51], day[51][32];
int solve() {
vector<int> l;
for (int i = 1; i <= 30; i++) {
l.clear();
for (int j = 0; j < n; j++)
if (day[j][i] == 1)
l.push_back(j);
int a[51] = {};
for (int j = 0; j < l... | [["+", 31, 69, 28, 69, 341, 342, 0, 69, 28, 22], ["+", 28, 69, 341, 342, 0, 69, 341, 342, 0, 70], ["+", 28, 69, 341, 342, 0, 69, 341, 342, 0, 73]] | 1 | 429 | 3 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_D 70
#define MAX_N 60
#define INF 1 << 30
int X[MAX_D][MAX_D];
int DP[MAX_D][MAX_D];
int Y[MAX_D][MAX_D];
int n, p, a;
int main() {
while (true) {
for (int i = 0; i < MAX_D; i++) {
for (int j = 0; j < MAX_D; j++) ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define MAX_D 70
#define MAX_N 60
#define INF 1 << 30
int X[MAX_D][MAX_D];
int DP[MAX_D][MAX_D];
int Y[MAX_D][MAX_D];
int n, p, a;
int main() {
while (true) {
for (int i = 0; i < MAX_D; i++) {
for (int j = 0; j < MAX_D; j++) ... | [["-", 3, 4, 0, 69, 28, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 69, 28, 69, 341, 342, 0, 22], ["-", 12, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 12, 2, 3, 4, 0, 69, 341, 342, 0, 22]] | 1 | 582 | 4 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
ll dp[55][35];
bool ok[55][35];
int main() {
int n, m, t;
while (cin >> n, n) {
int s = 0;
rep(i, 31) {
rep(j, n) {
dp[j][i] = 0;
ok[j][i] = false;
}
... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
ll dp[55][35];
bool ok[55][35];
int main() {
int n, m, t;
while (cin >> n, n) {
int s = -1;
rep(i, 31) {
rep(j, n) {
dp[j][i] = 0;
ok[j][i] = false;
}
... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 51, 16, 12, 16, 31, 23, 0, 16, 31, 13], ["+", 51, 16, 12, 16, 31, 23, 0, 16, 31, 13]] | 1 | 321 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
while (cin >> n, n) {
bool a[50][30] = {};
ll g[50] = {};
ll m;
for (ll i = 0; i < n; i++) {
cin >> m;
for (ll j = 0, x; j < m; j++) {
cin >> x, x--;
a[i][x] = 1;
g[x] |= 1LL <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
while (cin >> n, n) {
bool a[50][30] = {};
ll m, g[50] = {};
for (ll i = 0; i < n; i++) {
cin >> m;
for (ll j = 0, x; j < m; j++) {
cin >> x, x--;
a[i][x] = 1;
g[x] |= 1LL << i;
... | [["+", 8, 9, 0, 52, 8, 9, 0, 43, 49, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 0, 21], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 78], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 49, 22], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 0, 35], ["-", 0, 11, 12, 16, 31, 69, 341, 342, 0, 22], ["+", 0, 11, 12, 16, 31, 69, 341, 342, 0, 22]] | 1 | 250 | 7 |
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long STATES;
int main(void) {
STATES free_days[31], dp[51], goal_state, next;
STATES *p;
short int i, j, n, answer, free_day, k;
while (scanf("%d", &n) == 1 && n) {
memset(free_days, 0, sizeof(free_days));
memset(dp, 0, sizeof(dp)... | #include <cstdio>
#include <cstring>
using namespace std;
typedef long long STATES;
int main(void) {
STATES free_days[31], dp[51], goal_state, next;
STATES *p;
int i, j, n, free_day, k;
short answer;
while (scanf("%d", &n) == 1 && n) {
memset(free_days, 0, sizeof(free_days));
memset(dp, 0, sizeof(d... | [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 133], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 14, 8, 9, 0, 43, 39, 86, 0, 133], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 1 | 316 | 16 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <s... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <s... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 78], ["-", 0, 7, 8, 1, 0, 11, 12, 16, 31, 13], ["+", 0, 7, 8, 1, 0, 11, 12, 16, 31, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 7, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 7, 8, 9, 0, ... | 1 | 458 | 10 |
#include <cstring>
#include <iostream>
#include <set>
using namespace std;
void solve() {
int d[51][31];
int m[51][51];
int n;
while (cin >> n, n) {
memset(d, 0, sizeof(d));
memset(m, 0, sizeof(m));
for (int i = 0; i < n; ++i) {
int num;
cin >> num;
for (int j = 0; j < num; ++j) ... | #include <cstring>
#include <iostream>
#include <set>
using namespace std;
void solve() {
int d[51][31];
int m[51][51];
int n;
while (cin >> n, n) {
memset(d, 0, sizeof(d));
memset(m, 0, sizeof(m));
for (int i = 0; i < n; ++i) {
int num;
cin >> num;
for (int j = 0; j < num; ++j) ... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 341 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int x[1000000];
int y[1000000];
int main() {
int t;
int all_length;
int n;
int k;
cin >> t;
for (int j = 0; j < t; ++j) {
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> x[i];
}
if (n == 1) {
all_length = 0;
... | #include <algorithm>
#include <iostream>
using namespace std;
int x[1000000];
int y[1000000];
int main() {
int t;
int all_length;
int n;
int k;
cin >> t;
for (int j = 0; j < t; ++j) {
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> x[i];
}
if (n <= k) {
all_length = 0;
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 12, 69, 341, 342, 0, 16, 31, 16, 12, 13], ["+", 12, 6... | 1 | 199 | 8 |
#include <algorithm>
#include <cstring>
#include <iostream>
int T, N, K, X[100000 + 10], A[100000 + 10];
using namespace std;
int main() {
cin >> T;
for (int t = 0; t < T; ++t) {
cin >> N;
cin >> K;
for (int i = 0; i < N; ++i)
cin >> X[i];
for (int i = 0; i + 1 < N; ++i) {
A[i] = X[i + 1... | #include <algorithm>
#include <cstring>
#include <iostream>
int T, N, K, X[100000 + 10], A[100000 + 10];
using namespace std;
int main() {
cin >> T;
for (int t = 0; t < T; ++t) {
cin >> N;
cin >> K;
for (int i = 0; i < N; ++i)
cin >> X[i];
for (int i = 0; i + 1 < N; ++i) {
A[i] = X[i + 1... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 179 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
int T, N, K, X[100000 + 10], A[100000 + 10];
int main() {
int sum = 0;
int i, j, t;
cin >> T; //データセットの数を詠みこむ
for (t = 0; t < T; t++) {
sum = 0;
cin >> N >> K;
for (i = 0; i < N; i++) {
cin >> X[i];
}
for (i = 0; i < N - 1; ... | #include <algorithm>
#include <iostream>
using namespace std;
int T, N, K, X[100000 + 10], A[100000 + 10];
int main() {
int sum = 0;
int i, j, t;
cin >> T; //データセットの数を詠みこむ
for (t = 0; t < T; t++) {
sum = 0;
cin >> N >> K;
for (i = 0; i < N; i++) {
cin >> X[i];
}
for (i = 0; i < N - 1; ... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 62], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 44], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151]] | 1 | 179 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int z = 0; z < t; z++) {
int n, k;
cin >> n >> k;
vector<int> x(n);
for (int i = 0; i < n; i++)
cin >> x[i];
vector<int> sub(n - 1);
for (int i = 0; i < n - 1; i++)
sub[i] = x[i + 1] - x[i];
so... | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int z = 0; z < t; z++) {
int n, k;
cin >> n >> k;
vector<int> x(n);
for (int i = 0; i < n; i++)
cin >> x[i];
vector<int> sub(n - 1);
for (int i = 0; i < n - 1; i++)
sub[i] = x[i + 1] - x[i];
so... | [["-", 0, 7, 10, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["-", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 22]] | 1 | 171 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int n, k;
int sum = 0;
cin >> n >> k;
vector<int> a(n);
vector<int> b(n - 1);
for (int j = 0; j < n; j++) {
cin >> a.at(j);
}
for (int m = 0; m < n - 1; m++) {
b.a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int n, k;
int sum = 0;
cin >> n >> k;
vector<int> a(n);
vector<int> b(n - 1);
for (int j = 0; j < n; j++) {
cin >> a.at(j);
}
for (int m = 0; m < n - 1; m++) {
b.a... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 190 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int t, n, k;
int x[100010];
int d[100010];
int main() {
cin >> t;
while (t) {
t--;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x[i];
}
int ans = x[n - 1] - x[n];
for (int i = 1; i < n; i++) {
d[i - 1] = x[i] -... | #include <algorithm>
#include <iostream>
using namespace std;
int t, n, k;
int x[100010];
int d[100010];
int main() {
cin >> t;
while (t) {
t--;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x[i];
}
int ans = x[n - 1] - x[0];
for (int i = 1; i < n; i++) {
d[i - 1] = x[i] -... | [["-", 49, 50, 51, 16, 12, 69, 341, 342, 0, 22], ["+", 49, 50, 51, 16, 12, 69, 341, 342, 0, 13], ["+", 12, 69, 341, 342, 0, 16, 31, 16, 31, 22], ["+", 12, 69, 341, 342, 0, 16, 31, 16, 17, 33], ["+", 12, 69, 341, 342, 0, 16, 31, 16, 12, 13], ["+", 0, 11, 12, 69, 341, 342, 0, 16, 17, 33]] | 1 | 182 | 6 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int house, generator;
cin >> house >> generator;
int a[house];
for (int j = 0; j < house; j++) {
cin >> a[j];
}
int b[house - 1];
int sum = 0;
for (int ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int house, generator;
cin >> house >> generator;
int a[house];
for (int j = 0; j < house; j++) {
cin >> a[j];
}
int b[house - 1];
int sum = 0;
for (int ... | [["-", 15, 339, 51, 16, 31, 16, 31, 16, 17, 19], ["-", 15, 339, 51, 16, 31, 16, 31, 16, 12, 22], ["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 98], ["-", 51, 16, 31, 16, 12, 16, 31, 16, 31, 22]] | 1 | 196 | 4 |
#include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
long long n, k, m, x[100010], d[100010], result, l = 0;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
cin >> n >> k;
for (int j = 0; j < n; j++) {
cin >> x[j];
}
for (int j = 0; j + 1 < n; j++) {
... | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
long long n, k, m, x[100010], d[100010], result, l = 0;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
result = 0;
cin >> n >> k;
for (int j = 0; j < n; j++) {
cin >> x[j];
}
for (int j = 0; j +... | [["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 176 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int T, N, K, X[100010], d[100010];
int main() {
cin >> T;
for (int t = 0; t <= T; t++) {
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> X[i];
for (int i = 0; i + 1 < N; i++)
d[i] = X[i + 1] - X[i];
sort(d, d + N - 1);
... | #include <algorithm>
#include <iostream>
using namespace std;
int T, N, K, X[100010], d[100010];
int main() {
cin >> T;
for (int t = 0; t < T; t++) {
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> X[i];
for (int i = 0; i + 1 < N; i++)
d[i] = X[i + 1] - X[i];
sort(d, d + N - 1);
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 165 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int q, n, m, a[100000], b[99999];
int main() {
cin >> q;
for (int i = 0; i < q; i++) {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++)
b[i - 1] = a[i] - a[i - 1];
sort(b, b + n - 1);
int... | #include <algorithm>
#include <iostream>
using namespace std;
int q, n, m, a[100000], b[99999];
int main() {
cin >> q;
for (int i = 0; i < q; i++) {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++)
b[i - 1] = a[i] - a[i - 1];
sort(b, b + n - 1);
int... | [["-", 0, 7, 15, 16, 31, 16, 12, 16, 17, 33], ["-", 0, 7, 15, 16, 31, 16, 12, 16, 12, 13]] | 1 | 174 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int n, k;
int sum = 0;
cin >> n >> k;
vector<int> x(n);
vector<int> dis;
int n_k;
n_k = n - k;
for (int i = 0; i < n; ++i)
cin >> x[i];
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int n, k;
int sum = 0;
cin >> n >> k;
vector<int> x(n);
vector<int> dis;
int n_k;
n_k = n - k;
for (int i = 0; i < n; ++i)
cin >> x[i];
for (int i = 0; i <... | [["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 171 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int t;
cin >> t;
for (int a = 0; a < t; a++) {
int n, k, x[100000], sum;
vector<int> vec;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x[i];
if (i)
vec.push_back(x[i] - x[i - 1]... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int t;
cin >> t;
for (int a = 0; a < t; a++) {
int n, k, x[100000], sum;
vector<int> vec;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x[i];
if (i)
vec.push_back(x[i] - x[i - 1]... | [["+", 0, 7, 15, 16, 12, 16, 31, 2, 63, 22], ["+", 15, 16, 12, 16, 31, 2, 3, 4, 0, 24], ["+", 15, 16, 12, 16, 31, 2, 3, 4, 0, 22], ["+", 15, 16, 12, 16, 31, 2, 3, 4, 0, 21], ["+", 15, 16, 12, 16, 31, 2, 3, 4, 0, 25]] | 1 | 177 | 5 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SIZE 100005
#define INF 1000000005LL
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
l... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define SIZE 100005
#define INF 1000000005LL
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
l... | [["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 319 | 2 |
#include <algorithm>
#include <iostream>
int main() {
int t;
std::cin >> t;
for (int i = 0; i < t; i++) {
// 入力
int n, k;
std::cin >> n >> k;
int x[100000];
for (int j = 0; j < n; j++) {
std::cin >> x[j];
}
// 演算
int a[100000];
for (int j = 0; j < n - 1; j++) {
... | #include <algorithm>
#include <iostream>
int main() {
int t;
std::cin >> t;
for (int i = 0; i < t; i++) {
// 入力
int n, k;
std::cin >> n >> k;
int x[100000];
for (int j = 0; j < n; j++) {
std::cin >> x[j];
}
// 演算
int a[100000];
for (int j = 0; j < n - 1; j++) {
... | [["+", 0, 11, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 11, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 195 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(C) (C).begin(), (C).end()
#define pb push_back
#define mp make_pair
typedef long long ll;
ll mypow(ll n, ll a) ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(C) (C).begin(), (C).end()
#define pb push_back
#define mp make_pair
typedef long long ll;
ll mypow(ll n, ll a) ... | [["+", 0, 11, 12, 16, 31, 23, 0, 16, 31, 22], ["+", 0, 11, 12, 16, 31, 23, 0, 16, 17, 72]] | 1 | 570 | 2 |
#include <algorithm>
#include <assert.h>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-9;
static const double PI = acos(-... | #include <algorithm>
#include <assert.h>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-9;
static const double PI = acos(-... | [["-", 0, 1, 0, 11, 12, 16, 31, 16, 12, 13], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 385 | 4 |
h={};2.step(36){|i|h[i]=i.prime_division}
while(l=gets.chomp)!="0 0"
l=l.split
n=l[0].to_i;m=l[1].to_i(n)
p h[n].map{|a,b|z=m;r=0;r+=(z/=a) while z>0;r/b}.min
end | require'prime'
h={};2.step(36){|i|h[i]=i.prime_division}
while(l=gets.chomp)!="0 0"
l=l.split
n=l[0].to_i;m=l[1].to_i(n)
p h[n].map{|a,b|z=m;r=0;r+=(z/=a) while z>0;r/b}.min
end | [["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["+", 0, 493, 0, 652, 3, 4, 0, 557, 0, 62], ["+", 0, 493, 0, 652, 3, 4, 0, 557, 0, 6]] | 4 | 101 | 4 |
#include <cstdio>
#include <cstdlib>
#include <stack>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int f[128];
struct card {
char rank, suit;
int strength() const { return 4 * f[rank] + f[suit]; }
bool neighbor(const card &c) const {
if (rank == 'A') {
return c.rank == '2' ||... | #include <cstdio>
#include <cstdlib>
#include <stack>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int f[128];
struct card {
char rank, suit;
int strength() const { return 4 * f[rank] + f[suit]; }
bool neighbor(const card &c) const {
if (rank == 'A') {
return c.rank == '2' ||... | [["-", 31, 69, 341, 342, 0, 69, 28, 5, 0, 6], ["+", 31, 69, 341, 342, 0, 69, 28, 5, 0, 6]] | 1 | 1,892 | 2 |
#include <iostream>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
string LCS(const string &s, const string &t) {
const int LMAX = 300;
int m = s.length(), n = t.length();
static int dp[LMAX + 1][LMAX + 1], from[LMAX + 1][LMAX + 1];
rep(i, m + 1) dp[i][0] = 0, from[i]... | #include <iostream>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
string LCS(const string &s, const string &t) {
const int LMAX = 300;
int m = s.length(), n = t.length();
static int dp[LMAX + 1][LMAX + 1], from[LMAX + 1][LMAX + 1];
rep(i, m + 1) dp[i][0] = 0, from[i]... | [["-", 8, 9, 0, 100, 0, 1, 0, 27, 28, 22], ["+", 8, 9, 0, 100, 0, 1, 0, 27, 28, 22]] | 1 | 522 | 4 |
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
int dp[301][301];
pii nxt[301][301];
char s1[501];
char s2[501];
int s1s;
int s2s;
char res[501];
int main() {
string str;
while (cin >> str && str != "#END") {
int ms = 0;
for (in... | #include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
int dp[301][301];
pii nxt[301][301];
char s1[501];
char s2[501];
int s1s;
int s2s;
char res[501];
int main() {
string str;
while (cin >> str && str != "#END") {
int ms = 0;
for (in... | [["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 593 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using name... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using name... | [["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 743 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef complex<double> P;
double eps = 1e-6;
double PI = acos(-1);
P getCrossPoint(P a, P b, P c, P d) {
a -= d;
b -= d;
c -= d;
return d + a + (b - a) * imag(a / c) / imag(a / c - b / c);
}
bool isParallel(P a, P b, P c, P d) {
return (abs(imag((b - a) * conj(... | #include <bits/stdc++.h>
using namespace std;
typedef complex<double> P;
double eps = 1e-6;
double PI = acos(-1);
P getCrossPoint(P a, P b, P c, P d) {
a -= d;
b -= d;
c -= d;
return d + a + (b - a) * imag(a / c) / imag(a / c - b / c);
}
bool isParallel(P a, P b, P c, P d) {
return (abs(imag((b - a) * conj(... | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 31, 22]] | 1 | 410 | 2 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace ... | [["-", 8, 9, 0, 7, 8, 9, 0, 52, 0, 89], ["+", 8, 9, 0, 7, 8, 9, 0, 57, 0, 121]] | 1 | 946 | 2 |
import java.util.Scanner;
public class Main {
public static Scanner sc;
public static void main(String[] args) throws Exception {
sc = new Scanner(System.in);
while (sc.hasNext()) {
int u = 0;
int d = 0;
int n = sc.nextInt();
int a = sc.nextInt();
for (int i = 0; i < n - 1; i... | import java.util.Scanner;
public class Main {
public static Scanner sc;
public static void main(String[] args) throws Exception {
sc = new Scanner(System.in);
sc.nextInt();
while (sc.hasNext()) {
int u = 0;
int d = 0;
int n = sc.nextInt();
int a = sc.nextInt();
for (int i... | [["+", 0, 195, 8, 196, 0, 1, 0, 492, 500, 22], ["+", 0, 195, 8, 196, 0, 1, 0, 492, 0, 131], ["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 24], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 25], ["+", 8, 498, 0, 195, 8, 196, 0, 1, 0, 35]] | 3 | 160 | 6 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int t, n, h[100], i, j, k, s;
scanf("%d", &t);
for (i = 0; i < t; i++) {
scanf("%d", &n);
for (j = 0; j < n; j++) {
scanf("%d", &h[j]);
}
for (j = 0; j < n - 1; j++) {
h[j] = h[j + 1] - h[j];
}
if (n = 2) {
if (h[0] >= ... | #include <stdio.h>
#include <stdlib.h>
int main() {
int t, n, h[100], i, j, k, s;
scanf("%d", &t);
for (i = 0; i < t; i++) {
scanf("%d", &n);
for (j = 0; j < n; j++) {
scanf("%d", &h[j]);
}
for (j = 0; j < n - 1; j++) {
h[j] = h[j + 1] - h[j];
}
if (n == 2) {
if (h[0] >=... | [["-", 8, 9, 0, 57, 15, 23, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60]] | 0 | 315 | 2 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> m;
while (m--) {
cin >> n;
int b, a;
cin >> b;
int Max = 0, Min = 100000000;
while (--n) {
cin >> a;
int dif = a - b;
Max = max(Max, dif);
Min ... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> m;
while (m--) {
cin >> n;
int b, a;
cin >> b;
int Max = 0, Min = 100000000;
while (--n) {
cin >> a;
int dif = a - b;
Max = max(Max, dif);
Min ... | [["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 75, 76, 0, 1, 0, 35]] | 1 | 118 | 5 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int n;
cin >> n;
int h[100];
for (int j = 0; j < n; j++) {
cin >> h[j];
}
int max1 = 0, min1 = 0;
for (int j = 1; j < n; j++) {
if (h[... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int n;
cin >> n;
int h[100];
for (int j = 0; j < n; j++) {
cin >> h[j];
}
int max1 = 0, min1 = 0;
for (int j = 1; j < n; j++) {
if (h[... | [["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 182 | 2 |
#include <iostream>
using namespace std;
int main() {
int t, n;
cin >> t;
while (t--) {
int mup = 0, mdown = 0, height[101] = {0};
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> height[i];
}
for (int i = 1; i < n; ++i) {
int diff = height[i] - height[i - 1];
if (diff > 0 &&... | #include <iostream>
using namespace std;
int main() {
int t, n;
cin >> t;
while (t--) {
int mup = 0, mdown = 0, height[101] = {0};
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> height[i];
}
for (int i = 1; i < n; ++i) {
int diff = height[i] - height[i - 1];
if (diff > 0 &&... | [["+", 15, 339, 51, 16, 12, 16, 31, 91, 17, 33], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 47]] | 1 | 148 | 3 |
#include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace ... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 494 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const double EPS = (1e-10);
bool EQ(double a, double b) { return abs(a - b) < EPS; }
typedef complex<double> P;
typedef pair<double, double> pdd;
double calc(double a1, double b1, d... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
const double EPS = (1e-10);
bool EQ(double a, double b) { return abs(a - b) < EPS; }
typedef complex<double> P;
typedef pair<double, double> pdd;
double calc(double a1, double b1, d... | [["-", 8, 9, 0, 57, 15, 339, 51, 91, 17, 111]] | 1 | 844 | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.