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 |
|---|---|---|---|---|---|
#include <iostream>
#include <string>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0) {
break;
}
int len[40];
for (int i = 0; i < n; i++) {
string w;
cin >> w;
len[i] = w.size();
}
for (int i = 0; i < n; i++) {
bool flg = fals... | #include <iostream>
#include <string>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0) {
break;
}
int len[40];
for (int i = 0; i < n; i++) {
string w;
cin >> w;
len[i] = w.size();
}
for (int i = 0; i < n; i++) {
bool flg = fals... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 22]] | 1 | 202 | 2 |
#include <iostream>
#include <string>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int len[n];
for (int i = 0; i < n; i++) {
string w;
cin >> w;
len[i] = w.size();
}
for (int i = 0; i < n; i++) {
bool flag = false;
... | #include <iostream>
#include <string>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int len[n];
for (int i = 0; i < n; i++) {
string w;
cin >> w;
len[i] = w.size();
}
for (int i = 0; i < n; i++) {
bool flag = false;
... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 202 | 13 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FI first
#define SE second
#define PF push_front
#define PB push_back
#define POF pop_front
#define POB pop_back
#define MA make_pair
#define ll long lon... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FI first
#define SE second
#define PF push_front
#define PB push_back
#define POF pop_front
#define POB pop_back
#define MA make_pair
#define ll long lon... | [["+", 0, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 336 | 2 |
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < n; i++)
int main() {
while (1) {
ll n;
cin >> n;
if (n == 0) {
break;
}
string name[n];
REP(i, n) { cin >> name[i]; }
ll num[n];
REP(i, n) { num[i] = name[i].leng... | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < n; i++)
int main() {
while (1) {
ll n;
cin >> n;
if (n == 0) {
break;
}
string name[n];
REP(i, n) { cin >> name[i]; }
ll num[n];
REP(i, n) { num[i] = name[i].leng... | [["+", 0, 57, 64, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 57, 64, 9, 0, 1, 0, 16, 12, 22]] | 1 | 274 | 2 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
int d_words[5] = {5, 7, 5, 7, 7};
while (cin >> n && n != 0) {
int *n_words = new int[n];
for (int i = 0; i < n; i++) {
string str;
cin >> str;
n_words[i] = str.size();
}
int start = 0;
int succes... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
int d_words[5] = {5, 7, 5, 7, 7};
while (cin >> n && n != 0) {
int *n_words = new int[n];
for (int i = 0; i < n; i++) {
string str;
cin >> str;
n_words[i] = str.size();
}
int start = 0;
int succes... | [["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 192 | 4 |
#include <bits/stdc++.h>
using namespace std;
string str[101];
int n, idx = 0;
int cal(char ch, int a, int b) {
if (ch == '*')
return a * b;
return a + b;
}
int get_cnt(string a) {
int res = 0;
while (a[res] == '.')
res++;
return res;
}
int dfs() {
int cnt = get_cnt(str[idx]);
char ch = str[idx... | #include <bits/stdc++.h>
using namespace std;
string str[101];
int n, idx = 0;
int cal(char ch, int a, int b) {
if (ch == '*')
return a * b;
return a + b;
}
int get_cnt(string a) {
int res = 0;
while (a[res] == '.')
res++;
return res;
}
int dfs() {
int cnt = get_cnt(str[idx]);
char ch = str[idx... | [["+", 0, 52, 8, 57, 75, 76, 0, 93, 0, 94], ["+", 0, 52, 8, 57, 75, 76, 0, 93, 0, 35]] | 1 | 234 | 10 |
#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i... | #define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i... | [["+", 0, 118, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 118, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 775 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
map<char, int> cc, ic;
for (int i = 0; i < s.size(); i++) {
if (isdigit(s[i]))
ic[s[i]]++;
else
cc[s[i]]++;
}
int ans = s.size();
for (char c = 'a'; c < 'z'; c++) {
while (cc[c]) {
char next =... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
map<char, int> cc, ic;
for (int i = 0; i < s.size(); i++) {
if (isdigit(s[i]))
ic[s[i]]++;
else
cc[s[i]]++;
}
int ans = s.size();
for (char c = 'a'; c < 'z'; c++) {
while (cc[c]) {
char next =... | [["-", 0, 52, 15, 339, 51, 16, 12, 69, 28, 22], ["+", 0, 52, 15, 339, 51, 16, 12, 69, 28, 22]] | 1 | 276 | 2 |
#include <bits/stdc++.h>
using namespace std;
int mem[100];
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
char c = s[i];
if (c >= '0' && c <= '9')
mem[c - '0']++;
if (c >= 'a' && c <= 'z')
mem[c - 'a' + 1]++;
}
int ans = 0;
bool updated = true;
while (updat... | #include <bits/stdc++.h>
using namespace std;
int mem[100];
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
char c = s[i];
if (c >= '0' && c <= '9')
mem[c - '0']++;
if (c >= 'a' && c <= 'z')
mem[c - 'a' + 20]++;
}
int ans = 0;
bool updated = true;
while (upda... | [["-", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 183 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
vector<int> s(256, 0);
for (int i = 0; i < str.size(); i++) {
s[str[i]]++;
}
int res = 0;
bool fg = true;
while (fg) {
fg = false;
int count = 0;
for (int i = '0'; i <= '9'; i++) {
if (s[i] > 0)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
vector<int> s(256, 0);
for (int i = 0; i < str.size(); i++) {
s[str[i]]++;
}
int res = 0;
bool fg = true;
while (fg) {
fg = false;
int count = 0;
for (int i = '0'; i <= '9'; i++) {
if (s[i] > 0)
... | [["+", 0, 27, 28, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 371 | 4 |
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
priority_queue<int> q;
vector<P> vec;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
vec.push_back(make_pair(a, b));
}
sort(vec.begin... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
priority_queue<int> q;
vector<P> vec;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
vec.push_back(make_pair(a, b));
}
sort(vec.begin... | [["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 1 | 234 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> movie;
int num[100] = {0};
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a;
cin >> b;
movie.push_back(make_pair(a, b));
}
sort(movie.begin(), movie.end());
int sum = 0;
for (int i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> movie;
int num[100] = {0};
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a;
cin >> b;
movie.push_back(make_pair(a, b));
}
sort(movie.begin(), movie.end());
int sum = 0;
for (int i ... | [["-", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95], ["-", 75, 76, 0, 57, 75, 76, 0, 9, 0, 45], ["-", 0, 57, 75, 76, 0, 9, 0, 116, 0, 117], ["-", 0, 57, 75, 76, 0, 9, 0, 116, 0, 35], ["-", 75, 76, 0, 57, 75, 76, 0, 9, 0, 46]] | 1 | 328 | 5 |
#include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
#include <vector>
using namespace ... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
#include <vector>
using namespace ... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 604 | 4 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 28;
int main() {
int n;
cin >> n;
string S, T;
cin >> S >> T;
vector<int> s(256), t(256);
for (int i = 0; i < n; i++) {
s[S[i]]++;
t[T[i]]++;
}
sort(s.begin(), s.end(), greater<int>());
sort(t.begin(), t.end(), greater<int>... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 28;
int main() {
int n;
cin >> n;
string S, T;
cin >> S >> T;
vector<int> s(256), t(256);
for (int i = 0; i < n; i++) {
s[S[i]]++;
t[T[i]]++;
}
sort(s.begin(), s.end(), greater<int>());
sort(t.begin(), t.end(), greater<int>... | [["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 85], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 187 | 2 |
#include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(), (c).end())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> se;
se.resize(m);
REP(i, m) cin >> se[i];
int answer = ... | #include <bits/stdc++.h>
typedef long long LL;
#define SORT(c) sort((c).begin(), (c).end())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> se;
se.resize(m);
REP(i, m) cin >> se[i];
int answer = ... | [["-", 3, 4, 0, 16, 31, 23, 0, 16, 17, 33], ["-", 3, 4, 0, 16, 31, 23, 0, 16, 12, 13]] | 1 | 157 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 486 | 2 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
struct init {
init() {
cin.tie(0);
ios::sync_with_stdio(false);
}
} ________init;
int main() {
#ifdef INPUT_FROM_FILE
ifstream cin("sample.in");
ofstream cout("sample.out");
#en... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
struct init {
init() {
cin.tie(0);
ios::sync_with_stdio(false);
}
} ________init;
int main() {
#ifdef INPUT_FROM_FILE
ifstream cin("sample.in");
ofstream cout("sample.out");
#en... | [["-", 3, 4, 0, 16, 31, 23, 0, 16, 17, 72], ["-", 3, 4, 0, 16, 31, 23, 0, 16, 12, 13]] | 1 | 183 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int W, H;
int N;
cin >> W >> H;
cin >> N;
int x = W * 2 + H - 2;
int y = (W - 1) * 2 + H - 4;
int ret = 0;
while (N--) {
int P;
cin >> P;
if (P == 0)
--x;
else
--y;
if (x < W) {
if (x == y)
++ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H;
int N;
cin >> W >> H;
cin >> N;
int x = W * 2 + H - 2;
int y = (W - 1) * 2 + H - 4;
int ret = 0;
while (N--) {
int P;
cin >> P;
if (P == 0)
--x;
else
--y;
if (x < W) {
if (x == y)
++ret... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 171 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int W, H;
cin >> W >> H;
int n;
cin >> n;
int in = 0, out = 0, c = 0;
for (int i = 0; i < n; i++) {
int inp;
cin >> inp;
if (inp) {
in++;
} else {
out++;
}
if (out < W) {
if (in == out)
... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int W, H;
cin >> W >> H;
int n;
cin >> n;
int in = 0, out = 0, c = 0;
for (int i = 0; i < n; i++) {
int inp;
cin >> inp;
if (inp) {
in++;
} else {
out++;
}
if (out < W) {
if (in == out)
... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 145 | 4 |
#include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | [["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 355], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 31, 22]] | 1 | 692 | 2 |
#include "bits/stdc++.h"
using namespace std;
int H, W;
int a, b;
int main() {
cin >> H >> W;
int N;
cin >> N;
a = 0;
b = 0;
int ans = 0;
while (N--) {
int p;
cin >> p;
if (p) {
a++;
} else {
b++;
}
if (a == W - 1 || a == W + H - 2) {
} else if (a < W - 1) {
... | #include "bits/stdc++.h"
using namespace std;
int H, W;
int a, b;
int main() {
cin >> W >> H;
int N;
cin >> N;
a = 0;
b = 0;
int ans = 0;
while (N--) {
int p;
cin >> p;
if (!p) {
a++;
} else {
b++;
}
if (a == W - 1 || a == W + H - 2) {
} else if (a < W - 1) {
... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 91, 17, 111]] | 1 | 164 | 5 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include... | [["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 110], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 726 | 4 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = Integer.parseInt(sc.nextLine());
if (n == 0)
break;
int[] kouho = new int[26];
for (int i = 0; i < 26; i... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = Integer.parseInt(sc.nextLine());
if (n == 0)
break;
int[] kouho = new int[26];
for (int i = 0; i < 26; i... | [["-", 0, 7, 8, 196, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 196, 0, 7, 15, 16, 12, 499]] | 3 | 319 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
String gomi = sc.nextLine();
String data = sc.nextLine();
String[] data2 = data.split(" ");... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
if (n == 0)
break;
String gomi = sc.nextLine();
String data = sc.nextLine();
String[] data2 = data.split(" ")... | [["-", 0, 492, 3, 4, 0, 16, 31, 5, 0, 491], ["+", 0, 492, 3, 4, 0, 16, 31, 5, 0, 491]] | 3 | 1,479 | 4 |
public class Main {
public void run(java.util.Scanner sc, java.io.PrintStream out) {
PROBLEM:
for (;;) {
final int n = sc.nextInt();
if (n == 0)
break;
final int[] c = new int[n];
for (int i = 0; i < n; ++i)
c[i] = sc.next().charAt(0) - 'A';
final int[] d = new in... | public class Main {
public void run(java.util.Scanner sc, java.io.PrintStream out) {
PROBLEM:
for (;;) {
final int n = sc.nextInt();
if (n == 0)
break;
final int[] c = new int[n];
for (int i = 0; i < n; ++i)
c[i] = sc.next().charAt(0) - 'A';
final int[] d = new in... | [["-", 0, 74, 51, 23, 0, 16, 12, 504, 516, 22], ["-", 0, 74, 51, 23, 0, 16, 12, 504, 0, 70], ["-", 0, 74, 51, 23, 0, 16, 12, 504, 71, 22], ["-", 0, 74, 51, 23, 0, 16, 12, 504, 0, 73], ["+", 3, 4, 0, 74, 51, 23, 0, 16, 12, 22]] | 3 | 312 | 5 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int main() {
int n;
while (cin >> n, n) {
char c[n], i, j, k;
int a[26] = {};
for (i = 0; i < n; i++)
cin >> c[i], c[i] -= 'A';
priority_queue<P> q;
P x, y;
for (i = 0; i < n; i++) {
a[c[i]]++;
q.push(P... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int main() {
int n;
while (cin >> n, n) {
char c[n], i, j, k;
int a[26] = {};
for (i = 0; i < n; i++)
cin >> c[i], c[i] -= 'A';
priority_queue<P> q;
P x, y;
for (i = 0; i < n; i++) {
a[c[i]]++;
q.push(P... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 289 | 2 |
#include <bits/stdc++.h>
#define C 26
using namespace std;
int main() {
int n;
char c;
while (1) {
cin >> n;
if (!n)
break;
int cnt[C] = {}, idx, ans1, ans2 = 0;
for (int i = 0; i < n; i++) {
cin >> c;
idx = c - 'A';
cnt[idx]++;
int maxcnt = 0, maxidx;
for (int... | #include <bits/stdc++.h>
#define C 26
using namespace std;
int main() {
int n;
char c;
while (1) {
cin >> n;
if (!n)
break;
int cnt[C] = {}, idx, ans1, ans2 = 0;
for (int i = 0; i < n; i++) {
cin >> c;
idx = c - 'A';
cnt[idx]++;
int maxcnt = 0, maxidx;
for (int... | [["-", 0, 57, 64, 1, 0, 34, 31, 11, 12, 22], ["+", 0, 57, 64, 1, 0, 34, 31, 11, 12, 22]] | 1 | 241 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, j, m, p, k, q;
char c, w;
while (cin >> n, n) {
int a[26] = {0}, i, f = 1, q = 0;
for (i = 1; i <= n; i++) {
cin >> c;
for (a[c - 'A']++, m = j = 0; j < 26; j++)
if (max(m, a[j]) == a[j]) {
k = j;
m =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, j, m, p, k, q;
char c, w;
while (cin >> n, n) {
int a[26] = {0}, i, f = 1, q = 0;
for (i = 1; i <= n; i++) {
cin >> c;
for (a[c - 'A']++, m = j = 0; j < 26; j++)
if (max(m, a[j]) == a[j]) {
k = j;
m =... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 0, 1, 0, 11, 12, 16, 12, 103, 0, 104], ["+", 0, 1, 0, 11, 12, 16, 12, 103, 0, 125]] | 1 | 220 | 6 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
vector<char> v(N);
for (auto &i : v)
cin >> i;
vector<int> sum(26);
for (int i = 0; i < N; i++) {
sum[v[i] - 'A']++;
vector<pair<int, int>> ssum;
for (int j = 0; j < 26; j++) {
s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
vector<char> v(N);
for (auto &i : v)
cin >> i;
vector<int> sum(26);
for (int i = 0; i < N; i++) {
sum[v[i] - 'A']++;
vector<pair<int, int>> ssum;
for (int j = 0; j < 26; j++) {
s... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 221 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, string> P;
int main() {
int n;
while (cin >> n, n) {
map<string, int> M;
P ans = P(-1, "#");
for (int i = 0; i < n; i++) {
string name;
cin >> name;
M[name]++;
map<string, int>::iterator it = M.begin();
vect... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, string> P;
int main() {
int n;
while (cin >> n, n) {
map<string, int> M;
P ans = P(-1, "#");
for (int i = 0; i < n; i++) {
string name;
cin >> name;
M[name]++;
map<string, int>::iterator it = M.begin();
vect... | [["-", 0, 57, 15, 339, 51, 16, 31, 91, 17, 111], ["-", 0, 57, 15, 339, 51, 16, 31, 91, 28, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 106]] | 1 | 286 | 3 |
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <vector>
using namespace std;
int vec_find(vector<pair<int, char>> &v, char c) {
int i = 0;
for (auto &key : v) {
if (key.second == c) {
return i;
}
i++;
}
return 0;
}
int main() {
vector<pair<... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <vector>
using namespace std;
int vec_find(vector<pair<int, char>> &v, char c) {
int i = 0;
for (auto &key : v) {
if (key.second == c) {
return i;
}
i++;
}
return 0;
}
int main() {
vector<pair<... | [["+", 0, 57, 64, 9, 0, 57, 75, 76, 0, 95]] | 1 | 363 | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
map<char, int> mp;
pair<char, int> ans;
int k = n;
bool flag = 0;
for (int i = 0; i < n; ++i) {
char c;
cin >> c;
if (flag)
continue;
mp[c]++;
k--;
int f = 0, s =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
map<char, int> mp;
pair<char, int> ans;
int k = n;
bool flag = 0;
for (int i = 0; i < n; ++i) {
char c;
cin >> c;
if (flag)
continue;
mp[c]++;
k--;
int f = 0, s =... | [["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 189 | 4 |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using Pib = pair<int, bool>;
using Pibi = pair<pair<int, bool>, int>;
const int M = 1000000007;
int main() {
while (1) {
int n, m, k;
cin >> n >> m >> k;
if (!n)
return 0;
vector<vector<Pibi>> edge(n);
for (int j = 0; j... | #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using Pib = pair<int, bool>;
using Pibi = pair<pair<int, bool>, int>;
const int M = 1000000007;
int main() {
while (1) {
int n, m, k;
cin >> n >> m >> k;
if (!n)
return 0;
vector<vector<Pibi>> edge(n);
for (int j = 0; j... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 484 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define MS(m, v) memset(m, v, sizeof(m))
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
typedef ... | [["-", 0, 52, 8, 9, 0, 9, 0, 43, 39, 78], ["+", 0, 52, 8, 9, 0, 9, 0, 43, 39, 78], ["-", 64, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["-", 64, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 64, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 64, 9, 0, 57, 75, 76, 0, 9, 0, 46]] | 1 | 885 | 6 |
#include <stdio.h>
int main() {
int n, a[1000], diff, i, j, mindiff;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
if (a[0] > a[1]) {
mindiff = a[0] - a[1];
} else {
mindiff = a[1] - a[0];
}
for (i = 0; i < n... | #include <stdio.h>
int main() {
int n, a[1000], diff, i, j, mindiff;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
if (a[0] > a[1]) {
mindiff = a[0] - a[1];
} else {
mindiff = a[1] - a[0];
}
for (i = 0; i < n... | [["-", 0, 57, 15, 23, 0, 16, 31, 16, 17, 47], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 17, 20]] | 0 | 196 | 2 |
#include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
int ar[50000];
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++)
cin >> ar[i];
sort(ar, ar + n);
int ans = 99999999;
for (int i = 0;... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
typedef long long ll;
int ar[1000];
int main() {
while (1) {
int n;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++)
cin >> ar[i];
sort(ar, ar + n);
int ans = 99999999;
for (int i = 0; ... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 16, 12, 69, 341, 342, 0, 16, 17, 72]] | 1 | 132 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int point[50000];
for (int i = 0; i < n; i++) {
cin >> point[i];
}
sort(point, point + n);
int ans = 1000000;
for (int i = 0; i < n; i++) {
ans = min(ans, point[i + 1] - po... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int point[50000];
for (int i = 0; i < n; i++) {
cin >> point[i];
}
sort(point, point + n);
int ans = 1000000;
for (int i = 0; i < n - 1; i++) {
ans = min(ans, point[i + 1] ... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 114 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int abs(int a, int b) {
int result;
if (a < b)
result = b - a;
else
result = a - b;
return result;
};
int main(void) {
int n;
int min = 1000001;
int temp;
while (cin >> n, n) {
vector<int> student(n);
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int abs(int a, int b) {
int result;
if (a < b)
result = b - a;
else
result = a - b;
return result;
};
int main(void) {
int n;
int min = 1000001;
int temp;
while (cin >> n, n) {
vector<int> student(n);
... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 192 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long n, tmp;
while (cin >> n, n) {
vector<long> polong;
long min = 1000001;
long res;
for (long i = 0; i < n; i++) {
cin >> tmp;
polong.push_back(tmp);
}
sort(polong.begin(), polong.end... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long n, tmp;
while (cin >> n, n) {
vector<long> polong;
long min = 1000001;
long res;
for (long i = 0; i < n; i++) {
cin >> tmp;
polong.push_back(tmp);
}
sort(polong.begin(), polong.end... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 148 | 2 |
#include <iostream>
using namespace std;
int main(void) {
int n;
int a[1000] = {};
int min = 1000000;
cin >> n;
while (n != 0) {
min = 1000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n / 2; i++) {
for (int j = 0; j < n; j++) {
if (i != j) {
... | #include <iostream>
using namespace std;
int main(void) {
int n;
int a[1000] = {};
int min = 1000000;
cin >> n;
while (n != 0) {
min = 1000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i != j) {
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 85], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 181 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
while (cin >> n, n) {
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
int ans = a[n - 1] - a[0];
for (int i = 0; i < n - 1; ++i)
for (int j = i + 1; j < n; ++j)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
while (cin >> n, n) {
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
int ans = abs(a[n - 1] - a[0]);
for (int i = 0; i < n - 1; ++i)
for (int j = i + 1; j < n; ... | [["+", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 24], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 25]] | 1 | 147 | 3 |
#include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 22]] | 1 | 247 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[1001];
int c[1001];
int b, mn;
mn = 1000000;
while (1) {
cin >> b;
if (b == 0)
break;
mn = 1000000;
for (int i = 0; i < b; i++) {
cin >> a[i];
}
for (int j = 0; j < b + b; j++) {
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[1001];
int c[1001];
int b, mn;
mn = 1000000;
while (1) {
cin >> b;
if (b == 0)
break;
mn = 1000000;
for (int i = 0; i < b; i++) {
cin >> a[i];
}
for (int j = 0; j < b; j++) {
for (int i = 0; i ... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 22], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 216 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[1000], minx = 1000000, i;
cin >> n;
while (n != 0) {
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (i = 0; i < n - 1; i++)
if (minx > a[i + 1] - a[i])
minx = a[i + 1] - a[i];
cout <<... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, a[1000], minx = 1000000, i;
cin >> n;
while (n != 0) {
minx = 1000000;
for (i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (i = 0; i < n - 1; i++)
if (minx > a[i + 1] - a[i])
minx = a[i + 1]... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 124 | 4 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#inc... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#inc... | [["-", 0, 1, 0, 2, 3, 4, 0, 118, 119, 120], ["+", 0, 1, 0, 2, 3, 4, 0, 118, 119, 120]] | 1 | 4,289 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
static auto add = [](int a, int b) { return a + b; };
static auto mul = [](int a, int b) { return a * b; };
int n;
while (cin >> n, n) {
vector<string> a(n);
for (auto &e : a) {
cin >> e;
}
a.push_back("0");
vector<pair<functi... | #include <bits/stdc++.h>
using namespace std;
int main() {
static auto add = [](int a, int b) { return a + b; };
static auto mul = [](int a, int b) { return a * b; };
int n;
while (cin >> n, n) {
vector<string> a(n);
for (auto &e : a) {
cin >> e;
}
a.push_back("0");
vector<pair<functi... | [["-", 0, 11, 31, 118, 28, 23, 0, 16, 17, 33], ["+", 0, 11, 31, 118, 28, 23, 0, 16, 17, 72], ["-", 12, 2, 63, 118, 28, 23, 0, 16, 17, 33], ["+", 12, 2, 63, 118, 28, 23, 0, 16, 17, 72], ["-", 3, 4, 0, 118, 28, 23, 0, 16, 17, 33], ["+", 3, 4, 0, 118, 28, 23, 0, 16, 17, 72]] | 1 | 310 | 6 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < n; ++i)
#define rep(i, n) reps(i, 0, n)
#define maxl(a, b) a = max(a, b)
pair<int, int> dp[101][210 * 500];
const int MAX = 1001001001;
void solve(int n) {
vector<int> p(n);
rep(i, n) { cin... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define reps(i, f, n) for (int i = f; i < n; ++i)
#define rep(i, n) reps(i, 0, n)
#define maxl(a, b) a = max(a, b)
pair<int, int> dp[101][210 * 500];
const int MAX = 1001001001;
void solve(int n) {
vector<int> p(n);
rep(i, n) { cin... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 13], ["+", 0, 2, 3, 4, 0, 16, 31, 23, 0, 24], ["+", 3, 4, 0, 16, 31, 23, 0, 16, 31, 22], ["+", 3, 4, 0, 16, 31, 23, 0, 16, 17, 72], ["+", 3, 4, 0, 16, 31, 23, 0, 16, 12, 13], ["+", 0, 2, 3, 4, 0, 16, 31, 23, 0, 25]] | 1 | 428 | 8 |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cassert>
#include <functi... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cassert>
#include <functi... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 554 | 2 |
// finish date: 2018/06/21
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)... | // finish date: 2018/06/21
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)... | [["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 645 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int check[1 << 10][10];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string s;
while (cin >> N, N) {
memset(check, 0, sizeof check);
cin >> s;
bool ok = true;
vector<P> v;
int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int check[1 << 10][10];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
string s;
while (cin >> N, N) {
// cout << N << endl;
memset(check, 0, sizeof check);
cin >> s;
bool ok = true;... | [["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117], ["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 532 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i =... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i =... | [["+", 0, 57, 64, 9, 0, 1, 0, 2, 63, 22], ["+", 64, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 75, 76, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 1,327 | 7 |
#include <algorithm>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define ALL(c) (c).begin(), (c).end()
#define REP(i, n) for (ll i = 0; i < (n); ++i)
using ll = long long;
using vl = vector<ll>;
struct union_find {
vl v;
union_find(ll n) :... | #include <algorithm>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define ALL(c) (c).begin(), (c).end()
#define REP(i, n) for (ll i = 0; i < (n); ++i)
using ll = long long;
using vl = vector<ll>;
struct union_find {
vl v;
union_find(ll n) :... | [["-", 64, 9, 0, 37, 0, 2, 3, 4, 0, 22], ["+", 0, 37, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 37, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 37, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 693 | 4 |
#include <stdio.h>
#define M 1000000
int MIN(int a, int b) { return a < b ? a : b; }
int n, r = 1, x[M], y[M], z[M], bv[M], gx, gy, gz, min, m[M] = {0};
int f(int a, int b, int c, int d, int e) {
x[r] = a;
y[r] = b;
z[r] = c;
bv[r] = d;
m[r] = e;
r++;
// printf("%d %d %d %d\n",a,b,c,m[r-1]);
// l=abs(a-... | #include <stdio.h>
#define M 1000000
int MIN(int a, int b) { return a < b ? a : b; }
int n, r = 1, x[M], y[M], z[M], bv[M], gx, gy, gz, min, m[M] = {0};
int f(int a, int b, int c, int d, int e) {
x[r] = a;
y[r] = b;
z[r] = c;
bv[r] = d;
m[r] = e;
r++;
// printf("%d %d %d %d\n",a,b,c,m[r-1]);
// l=abs(a-... | [["-", 0, 2, 3, 4, 0, 16, 12, 69, 28, 22], ["+", 0, 2, 3, 4, 0, 16, 12, 69, 28, 22]] | 0 | 973 | 12 |
#include <climits>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef pair<int, int> i_i;
int N, x2, y2, z2;
int ans = INT_MAX;
void dfs(int x, int y, int z, int k, map<vector<int>, int> &memo) {
vector<int> v(3);
v[0] = x;
v[1] = y;
v[2] = z;
if (memo.count(v) && memo[v] <= ... | #include <climits>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef pair<int, int> i_i;
int N, x2, y2, z2;
int ans = INT_MAX;
void dfs(int x, int y, int z, int k, map<vector<int>, int> &memo) {
vector<int> v(3);
v[0] = x;
v[1] = y;
v[2] = z;
if (memo.count(v) && memo[v] <= ... | [["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 22]] | 1 | 531 | 2 |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
public class Main implements Runnable {
int N, X, Y;
int[] a, b, c, d;
int[][][] dp;
public int dfs(int n, int x, int y) {
if (n == N) {
if (x < 300 || y < 300)
retur... | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
public class Main implements Runnable {
int N, X, Y;
int[] a, b, c, d;
int[][][] dp;
public int dfs(int n, int x, int y) {
if (n >= N) {
if (x < 300 || y < 300)
retur... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 60], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 20], ["-", 0, 1, 0, 11, 12, 227, 497, 505, 0, 499], ["+", 0, 1, 0, 11, 12, 227, 497, 505, 0, 499], ["-", 0, 7, 8, 196, 0, 7, 15, 16, 12, 499], ["+", 0, 7, 8, 196, 0, 7, 15, 16, 12, 499]] | 3 | 866 | 10 |
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define pb push_back
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = 1; i <= n; ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mins(x, y) x = min(x, y)
#define... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define pb push_back
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = 1; i <= n; ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mins(x, y) x = min(x, y)
#define... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 376 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int n, x, y;
int a[102], b[102], c[102], d[102];
// idx, umaka, fugashi
int dp[102][302][700... | #include <algorithm>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int n, x, y;
int a[102], b[102], c[102], d[102];
// idx, umaka, fugashi
int dp[102][302][700... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 511 | 2 |
#include <bits/stdc++.h>
#define int long long
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i,... | #include <bits/stdc++.h>
#define int long long
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i,... | [["-", 0, 1, 0, 11, 31, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 31, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 338, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 338, 8, 9, 0, 43, 39, 78]] | 1 | 1,289 | 6 |
// AOJ 1585 String in String
// 2018.5.20 bal4u
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#if 1
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif
int in() {
int n = 0, c = gc();
do
n = 10 * n + (c & 0xf), c = gc();
... | // AOJ 1585 String in String
// 2018.5.20 bal4u
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#if 1
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif
int in() {
int n = 0, c = gc();
do
n = 10 * n + (c & 0xf), c = gc();
... | [["-", 8, 9, 0, 52, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 19]] | 0 | 920 | 2 |
#include <bits/stdc++.h>
using namespace std;
complex<double> P;
struct SAComp {
const int h;
const vector<int> &g;
SAComp(int h, vector<int> &g) : h(h), g(g) {}
bool operator()(int a, int b) {
return a == b ? false : g[a] != g[b] ? g[a] < g[b] : g[a + h] < g[b + h];
}
};
vector<int> buildSA(string &t) ... | #include <bits/stdc++.h>
using namespace std;
complex<double> P;
struct SAComp {
const int h;
const vector<int> &g;
SAComp(int h, vector<int> &g) : h(h), g(g) {}
bool operator()(int a, int b) {
return a == b ? false : g[a] != g[b] ? g[a] < g[b] : g[a + h] < g[b + h];
}
};
vector<int> buildSA(string &t) ... | [["-", 8, 9, 0, 57, 15, 339, 51, 2, 63, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 91, 17, 111], ["+", 0, 57, 15, 339, 51, 91, 28, 2, 63, 22]] | 1 | 952 | 3 |
#include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int v[50][50];
int main() {
int h, w, t;
int p;
cin >> w >> h >> t >> p;
for (int i = 0; i < p; i++) {
int x, y, z;
cin >> x >> y >> ... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
int v[50][50];
int main() {
int h, w, t;
int p;
cin >> w >> h >> t >> p;
for (int i = 0; i < p; i++) {
int x, y, z;
cin >> x >> y >> ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 163 | 2 |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
... | import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
... | [["+", 0, 11, 12, 492, 3, 4, 0, 16, 17, 72], ["+", 0, 11, 12, 492, 3, 4, 0, 16, 12, 22]] | 3 | 2,978 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const double PI = 3.1415926535897932384626433832795028841971;
const int INF = 100000000;
const double EPS = 1e-10;
const int MOD = 1000000007;
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n, m, k;
int a[15], b[15];
P c[1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
const double PI = 3.1415926535897932384626433832795028841971;
const int INF = 100000000;
const double EPS = 1e-10;
const int MOD = 1000000007;
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n, m, k;
int a[15], b[15];
P c[1... | [["+", 12, 2, 3, 4, 0, 16, 12, 2, 63, 22], ["+", 3, 4, 0, 16, 12, 2, 3, 4, 0, 24], ["+", 3, 4, 0, 16, 12, 2, 3, 4, 0, 21], ["+", 3, 4, 0, 16, 12, 2, 3, 4, 0, 13], ["+", 3, 4, 0, 16, 12, 2, 3, 4, 0, 25]] | 1 | 324 | 5 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, b) FOR(i, 0, b)
#define PB push_back
#define ALL(c) c.begin(), c.end()
using namespace std;
typedef long long LL;
typedef int ut;
typedef pair<ut, ut> pr;
typedef vector<ut> VI;
typedef vector<pr> Vpr;
const int SIZE = 100;
Vpr... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, b) FOR(i, 0, b)
#define PB push_back
#define ALL(c) c.begin(), c.end()
using namespace std;
typedef long long LL;
typedef int ut;
typedef pair<ut, ut> pr;
typedef vector<ut> VI;
typedef vector<pr> Vpr;
const int SIZE = 100;
Vpr... | [["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 22]] | 1 | 291 | 2 |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) r... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) r... | [["+", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 25]] | 1 | 432 | 5 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | [["-", 49, 50, 51, 16, 31, 16, 31, 16, 12, 13], ["+", 49, 50, 51, 16, 31, 16, 31, 16, 12, 22]] | 1 | 417 | 2 |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) r... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define repd(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) r... | [["-", 15, 339, 51, 16, 31, 23, 0, 16, 17, 98], ["+", 15, 339, 51, 16, 31, 23, 0, 16, 17, 67], ["-", 31, 69, 28, 69, 341, 342, 0, 16, 17, 106], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 17, 139], ["-", 0, 69, 28, 69, 341, 342, 0, 16, 17, 106], ["+", 0, 69, 28, 69, 341, 342, 0, 16, 17, 139]] | 1 | 794 | 6 |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
struct Data {
int bit, t;
};
#define DAY 5
#define SELECT 310
int N, M, L;
vector<Data> info[DAY];
int dp1[DAY][SELECT][1 << 9];
int dp2[DAY][SELECT];
int dp3[DAY + 1][SELECT];
void comp... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
using namespace std;
struct Data {
int bit, t;
};
#define DAY 5
#define SELECT 310
int N, M, L;
vector<Data> info[DAY];
int dp1[DAY][SELECT][1 << 9];
int dp2[DAY][SELECT];
int dp3[DAY + 1][SELECT];
void comp... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 629 | 3 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define mp make_pair
#define pb push_back
#define INF 1000000001
#define MAX_V 100000
struct st {
int time, to;
};
vector<st> G[MAX_V];
int ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define mp make_pair
#define pb push_back
#define INF 1000000001
#define MAX_V 100000
struct st {
int time, to;
};
vector<st> G[MAX_V];
int ... | [["-", 0, 2, 3, 4, 0, 2, 3, 4, 0, 13], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 22]] | 1 | 389 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
int read() {
int i;
scanf("%d", &i);
return i;
}
int main() {
ll n ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
int read() {
int i;
scanf("%d", &i);
return i;
}
int main() {
ll n ... | [["-", 12, 16, 12, 16, 12, 23, 0, 16, 31, 22], ["-", 12, 16, 12, 16, 12, 23, 0, 16, 17, 72], ["-", 12, 16, 12, 16, 12, 23, 0, 16, 12, 13], ["+", 31, 16, 12, 16, 12, 16, 12, 23, 0, 13]] | 1 | 158 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
int m = n - d - 1;
if (d == 1)
cout << n * (n - 1) / 2 << endl;
else if (d == 2)
cout << n * (n - 1) / 2 - 1 << endl;
else
cout << d + m * (m - 1) / 2 + 2 * m << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, d;
cin >> n >> d;
int m = n - d - 1;
if (d == 1)
cout << n * (n - 1) / 2 << endl;
else if (d == 2)
cout << n * (n - 1) / 2 - 1 << endl;
else
cout << d + m * (m + 1) / 2 + 2 * m << endl;
return 0;
}
| [["+", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 0, 30, 0, 14, 39, 86, 0, 156], ["-", 12, 16, 31, 16, 12, 23, 0, 16, 17, 33], ["+", 12, 16, 31, 16, 12, 23, 0, 16, 17, 72]] | 1 | 99 | 5 |
#include <stdio.h>
int MAX(int a, int b) { return a < b ? b : a; }
int main() {
int n, i, j, a, b, f[100010], q[100010], r, t;
int ta[100010], to[100010], nt[1000010], d[2][100010];
scanf("%d", &n);
for (i = 0; i <= n; i++)
ta[i] = -1;
for (i = 0; i < n - 1; i++) {
scanf("%d %d", &a, &b);
to[i] = ... | #include <stdio.h>
int MAX(int a, int b) { return a < b ? b : a; }
int main() {
int n, i, j, a, b, f[100010], q[100010], r, t;
int ta[100010], to[200010], nt[200010], d[2][100010];
scanf("%d", &n);
for (i = 0; i <= n; i++)
ta[i] = -1;
for (i = 0; i < n - 1; i++) {
scanf("%d %d", &a, &b);
to[i] = b... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 10, 11, 12, 11, 31, 69, 71, 69, 28, 22], ["+", 10, 11, 12, 11, 31, 69, 71, 69, 0, 70], ["+", 10, 11, 12, 11, 31, 69, 71, 69, 0, 73]] | 0 | 662 | 7 |
#include <bits/stdc++.h>
using namespace std;
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define abs(a) max((a), -(a))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repe(i, n) rep(i, (n) + 1)
#define per(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define pere(i,... | #include <bits/stdc++.h>
using namespace std;
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
#define abs(a) max((a), -(a))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repe(i, n) rep(i, (n) + 1)
#define per(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define pere(i,... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 239 | 6 |
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
while (cin >> a >> b >> c, a | b | c) {
map<int, int> e;
for (int d = 0; d < a; d++) {
int f;
cin >> f;
e[20000 - f]++;
}
auto i = e.begin();
... | #include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b, c;
while (cin >> a >> b >> c, a | b | c) {
map<int, int> e;
for (int d = 0; d < a; d++) {
int f;
cin >> f;
e[20000 - f]++;
}
auto i = e.end();
... | [["-", 0, 43, 49, 50, 51, 2, 63, 118, 119, 120], ["+", 0, 43, 49, 50, 51, 2, 63, 118, 119, 120]] | 1 | 210 | 2 |
#include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
typedef long long ll;
int main() {
int m, min, max;
while (cin >> m >> min >> ... | #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
typedef long long ll;
int main() {
int m, min, max;
while (cin >> m >> min >> ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 157 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for (int i = 0; i < N; i++)
#define Reps(i, x, N) for (int i = x; i < N; i++)
signed main() {
int M, nmin, nmax;
int P, save;
while (cin >> M >> nmin >> nmax, M || nmin || nmax) {
int maxp = -1, maxv = 0;
cin >> save;... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for (int i = 0; i < N; i++)
#define Reps(i, x, N) for (int i = x; i < N; i++)
signed main() {
int M, nmin, nmax;
int P, save;
while (cin >> M >> nmin >> nmax, M || nmin || nmax) {
int maxp = -1, maxv = 0;
cin >> save;... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 136 | 2 |
#include <iostream>
using namespace std;
int main() {
int m, n_min, n_max, gap = 1000000, z;
int ary[1000001];
while (1) {
cin >> m >> n_min >> n_max;
if (m == 0 && n_min == 0 && n_max == 0)
break;
for (int i = 0; i < m; i++) {
cin >> ary[i];
}
for (int i = n_min; i <= n_max; ... | #include <iostream>
using namespace std;
int main() {
int m, n_min, n_max, gap = 1000000, z;
int ary[1000001];
while (1) {
cin >> m >> n_min >> n_max;
if (m == 0 && n_min == 0 && n_max == 0)
break;
for (int i = 1; i <= m; i++) {
cin >> ary[i];
}
for (int i = n_min; i <= n_max;... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 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], ["-", 12, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 16, 31, 69, 341, 342, 0, 16, 17, 72]] | 1 | 153 | 8 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define pb push_back
int main() {
int x, y, z;
while (1) {
cin >> x >> y >> z;
if (x == 0 && y == 0 && z == 0)
break;
int a[114514];
int b[114514];... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define pb push_back
int main() {
int x, y, z;
while (1) {
cin >> x >> y >> z;
if (x == 0 && y == 0 && z == 0)
break;
int a[114514];
int b[114514];... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 229 | 2 |
#include <iostream>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
int c[n];
for (int i = 0; i < n; i++) {
cin >> c[i];
}
int can[26] = {0}; //????£????(candidate)????\¨??°
for (int i = 0; i < n; i++) {
can[(int)(c[i] - 'A')]+... | #include <iostream>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0)
break;
char c[n];
for (int i = 0; i < n; i++) {
cin >> c[i];
}
int can[26] = {0}; //????£????(candidate)????\¨??°
for (int i = 0; i < n; i++) {
can[(int)(c[i] - 'A')]... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 1 | 276 | 2 |
#include <iostream>
using namespace std;
int n;
main() {
while (cin >> n, n) {
char a[111];
for (int i = 0; i < n; i++)
cin >> a[i];
int cnt[111] = {}, max1 = 0, max2 = 0;
char maxa = '0';
bool f = 0;
for (int i = 0; i < n; i++) {
cnt[a[i]]++;
if (max1 < cnt[a[i]]) {
... | #include <iostream>
using namespace std;
int n;
main() {
while (cin >> n, n) {
char a[111];
for (int i = 0; i < n; i++)
cin >> a[i];
int cnt[111] = {}, max1 = 0, max2 = 0;
char maxa = '0';
bool f = 0;
for (int i = 0; i < n; i++) {
cnt[a[i]]++;
if (max1 < cnt[a[i]]) {
... | [["-", 31, 16, 31, 16, 31, 16, 12, 69, 28, 22], ["-", 31, 16, 31, 16, 12, 69, 341, 342, 0, 70], ["-", 31, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["-", 31, 16, 31, 16, 12, 69, 341, 342, 0, 73], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22]] | 1 | 222 | 5 |
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int a[30] = {};
char c[100] = {}, mc;
int ma = 0;
for (int i = 0; i < n; i++) {
cin >> c[i];
a[c[i] - 'A']++;
}
int f = 0;
for (int i = 0; i < 30; i++) {
if (a[i] == ma)
f = 1;
... | #include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
int a[30] = {};
char c[100] = {}, mc;
int ma = 0;
for (int i = 0; i < n; i++) {
cin >> c[i];
a[c[i] - 'A']++;
}
int f = 0;
for (int i = 0; i < 30; i++) {
if (a[i] == ma)
f = 1;
... | [["+", 75, 76, 0, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 0, 9, 0, 43, 49, 50, 51, 83, 0, 46]] | 1 | 271 | 3 |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdexcept>
#include <string>
#include <vector>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
cons... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdexcept>
#include <string>
#include <vector>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using namespace std;
const long long MOD = 1e9 + 7;
cons... | [["-", 8, 9, 0, 42, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 42, 0, 2, 3, 4, 0, 22], ["-", 51, 16, 31, 118, 28, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 118, 28, 69, 341, 342, 0, 22], ["-", 0, 27, 28, 118, 28, 69, 341, 342, 0, 22], ["+", 0, 27, 28, 118, 28, 69, 341, 342, 0, 22]] | 1 | 352 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define RFOR(i, m, n) for (int i = m; i >= n; i--)
#define rep(i, n) FOR(i, 0, n)
#def... | #include <bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define RFOR(i, m, n) for (int i = m; i >= n; i--)
#define rep(i, n) FOR(i, 0, n)
#def... | [["+", 8, 9, 0, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 9, 0, 57, 64, 9, 0, 46]] | 1 | 315 | 6 |
def secMax(a):
mx = 0
smx = 0
for i in range(0,len(a)):
if a[i] > mx:
smx = mx
mx = a[i]
elif a[i] > smx:
smx = a[i]
else:
return smx
while True:
n = int(input())
if n == 0:
break
c = list(map(str,input().split()))
##al... | def secMax(a):
mx = 0
smx = 0
for i in range(0,len(a)):
if a[i] > mx:
smx = mx
mx = a[i]
elif a[i] > smx:
smx = a[i]
else:
return smx
while True:
n = int(input())
if n == 0:
break
c = list(map(str,input().split()))
##al... | [["-", 0, 7, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 350 | 4 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int m = Integer.parseInt(sc.next());
int n = Integer.parseInt(sc.next());
if (m == 0 && n == 0)
break;
int w = (m + n) * 20;
int f[] ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int m = Integer.parseInt(sc.next());
int n = Integer.parseInt(sc.next());
if (m == 0 && n == 0)
break;
int w = (m + n) * 20;
int f[] ... | [["-", 8, 196, 0, 7, 15, 16, 12, 492, 500, 22], ["-", 8, 196, 0, 7, 15, 16, 12, 492, 0, 131], ["-", 8, 196, 0, 7, 15, 16, 12, 492, 141, 22], ["-", 0, 7, 15, 16, 12, 492, 3, 4, 0, 24], ["-", 0, 7, 15, 16, 12, 492, 3, 4, 0, 25]] | 3 | 329 | 5 |
#include <bits/stdc++.h>
bool ok[7368792];
int main() {
int m, n;
while (scanf("%d%d", &m, &n), m) {
memset(ok, 0, sizeof(ok));
int cnt = 0;
for (int i = m;; i++) {
if (!ok[i])
continue;
if (++cnt > n) {
printf("%d\n", i);
break;
}
for (int j = i; j <= 736... | #include <bits/stdc++.h>
bool ok[7368792];
int main() {
int m, n;
while (scanf("%d%d", &m, &n), m) {
memset(ok, 0, sizeof(ok));
int cnt = 0;
for (int i = m;; i++) {
if (ok[i])
continue;
if (++cnt > n) {
printf("%d\n", i);
break;
}
for (int j = i; j <= 7368... | [["-", 8, 9, 0, 57, 15, 339, 51, 91, 17, 111]] | 1 | 121 | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, n;
while (cin >> m >> n, m) {
vector<int> goodyear(7368792, 0);
int cnt = 0;
int res = -1;
for (int i = m;; i++) {
if (goodyear[i] == 0) {
if (cnt == n) {
res = i;
break;
} else {
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, n;
while (cin >> m >> n, m) {
vector<int> goodyear(7368792, 0);
int cnt = 0;
int res = -1;
for (int i = m;; i++) {
if (goodyear[i] == 0) {
if (cnt == n) {
res = i;
break;
} else {
c... | [["-", 75, 76, 0, 9, 0, 7, 15, 16, 12, 13], ["+", 75, 76, 0, 9, 0, 7, 15, 16, 12, 13]] | 1 | 124 | 2 |
#include <bits/stdc++.h>
using namespace std;
const int limit = 7369791;
int main() {
int M, N;
bitset<limit + 1> dp;
while (cin >> M >> N, M) {
dp.set(0);
for (int i = M; i <= limit; i++) {
if (!dp[i]) {
if (--N < 0) {
cout << i << endl;
break;
}
for (... | #include <bits/stdc++.h>
using namespace std;
const int limit = 7369791;
int main() {
int M, N;
bitset<limit + 1> dp;
while (cin >> M >> N, M) {
dp.reset();
for (int i = M; i <= limit; i++) {
if (!dp[i]) {
if (--N < 0) {
cout << i << endl;
break;
}
for ... | [["-", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 117 | 3 |
#include <iostream>
#include <vector>
#define MAX 5 * 1e5
using namespace std;
int main() {
int n, m;
while (std::cin >> m >> n) {
vector<bool> isBoring(MAX, false);
if (n == 0 and m == 0)
break;
int mini = m;
for (int i = 0; i < n; i++) {
while (isBoring[mini] == true)
mini++;
... | #include <iostream>
#include <vector>
#define MAX 1e7
using namespace std;
int main() {
int n, m;
while (std::cin >> m >> n) {
vector<bool> isBoring(MAX, false);
if (n == 0 and m == 0)
break;
int mini = m;
for (int i = 0; i < n; i++) {
while (isBoring[mini] == true)
mini++;
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 156 | 2 |
#include <iostream>
#include <vector>
#define MAX int(7.5 * 1e6)
using namespace std;
int main() {
int n, m;
while (1) {
scanf("%d %d\n", &m, &n);
if (n == 0)
break;
vector<bool> isBoring(MAX, false);
for (int i = 0; i < n; i++) {
while (isBoring[m])
m++;
for (int j = m; j... | #include <iostream>
#include <vector>
#define MAX int(7.5 * 1e6)
using namespace std;
int main() {
int n, m;
while (1) {
scanf("%d %d\n", &m, &n);
if (n == 0)
break;
vector<bool> isBoring(MAX, false);
for (int i = 0; i < n; i++) {
while (isBoring[m])
m++;
for (int j = m; j... | [["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 12, 13]] | 1 | 135 | 16 |
#include <stdbool.h>
#include <stdio.h>
int main() {
int n, m, k = 8e6;
while (scanf("%d%d", &m, &n), n) {
bool b[k] = {};
for (; n != 0; n--) {
while (b[m])
m++;
for (int j = m; j < k; j += m)
b[j] = true;
}
while (b[m++])
;
printf("%d\n", m);
}
} | #include <stdbool.h>
#include <stdio.h>
int main() {
int n, m, k = 8e6;
while (scanf("%d%d", &m, &n), n) {
bool b[k] = {};
for (; n != 0; n--) {
while (b[m])
m++;
for (int j = m; j < k; j += m)
b[j] = true;
}
while (b[++m])
;
printf("%d\n", m);
}
} | [["-", 15, 339, 51, 69, 341, 342, 0, 27, 28, 22], ["+", 15, 339, 51, 69, 341, 342, 0, 27, 28, 22]] | 1 | 110 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, n;
while (cin >> m >> n, m) {
bool s[7654321] = {};
int i = m, j = 0, k;
for (; j <= n; i++)
if (!s[i] && j != n)
for (k = 2, j++; i * k < 7654321; k++)
s[i * k] = 1;
cout << i - 1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, n;
while (cin >> m >> n, m) {
bool s[7654321] = {};
int i = m, j = 0, k;
for (; j <= n; i++)
if (!s[i])
for (k = 2, j++; i * k < 7654321; k++)
s[i * k] = 1;
cout << i - 1 << endl;
}
return 0;
} | [["-", 0, 7, 8, 57, 15, 339, 51, 16, 17, 98], ["-", 8, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["-", 8, 57, 15, 339, 51, 16, 12, 16, 17, 79], ["-", 8, 57, 15, 339, 51, 16, 12, 16, 12, 22]] | 1 | 109 | 4 |
#include <stdio.h>
#include <stdlib.h>
#define MAX 7368791
int main(void) {
int m, n;
int year[MAX];
while (1) {
scanf("%d %d", &m, &n);
if (m == 0 && n == 0)
break;
for (int i = 0; i < MAX; i++)
year[i] = false;
int seed = 0;
for (int i = m; i <= MAX; i++) {
if (!year[i... | #include <stdio.h>
#include <stdlib.h>
#define MAX 7368791
int main(void) {
int m, n;
bool year[MAX];
while (1) {
scanf("%d %d", &m, &n);
if (m == 0 && n == 0)
break;
for (int i = 0; i < MAX; i++)
year[i] = false;
int seed = 0;
for (int i = m; i <= MAX; i++) {
if (!year[... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 167 | 2 |
#include <iostream>
using namespace std;
constexpr int MAX_LEN = 7368791;
bool seeBamboo[MAX_LEN + 20] = {
true,
true,
};
int main() {
int m, n;
while (cin >> m >> n, (m + n)) {
fill(seeBamboo + m, seeBamboo + MAX_LEN, false);
int num = 0;
for (int i = 0; i < n; i++) {
while (seeBamb... | #include <iostream>
using namespace std;
constexpr int MAX_LEN = 7368791;
bool seeBamboo[MAX_LEN + 20] = {
true,
true,
};
int main() {
int m, n;
while (cin >> m >> n, (m + n)) {
fill(seeBamboo + m, seeBamboo + MAX_LEN, false);
int num = m;
for (int i = 0; i < n; i++) {
while (seeBamb... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 22]] | 1 | 147 | 2 |
#include <stdio.h>
#define saigo 7368792
bool ok[saigo];
int all_ok(int k) {
int m = k;
while (m < saigo) {
ok[m] = true;
m = m + k;
}
}
int main() {
int m, n;
int i;
scanf("%d %d", &m, &n);
while (m != 0) {
for (i = 0; i < saigo; i++) {
ok[i] = false;
}
int nokori = n;
f... | #include <stdio.h>
#define saigo 7368792
bool ok[saigo];
int all_ok(int k) {
int m = k;
while (m < saigo) {
ok[m] = true;
m = m + k;
}
}
int main() {
int m, n;
int i;
scanf("%d %d", &m, &n);
while (m != 0) {
for (i = 0; i < saigo; i++) {
ok[i] = false;
}
int nokori = n;
f... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 186 | 1 |
const input = require('fs').readFileSync('/dev/stdin', 'utf8');
const lines = input.trim().split('\n');
let array;
let index = 0;
let n;
let m;
let answers = [];
while (line = lines.shift()) {
if (index === 0) {
const test = line.split(' ').map(Number);
n = test[0];
m = test[1];
index++;
} else {
... | const input = require('fs').readFileSync('/dev/stdin', 'utf8');
const lines = input.trim().split('\n');
let array;
let index = 0;
let n;
let m;
let answers = [];
while (line = lines.shift()) {
if (index === 0) {
const test = line.split(' ').map(Number);
n = test[0];
m = test[1];
index++;
} else {
... | [["+", 0, 568, 8, 2, 3, 3, 0, 510, 0, 101], ["+", 0, 568, 8, 2, 3, 3, 0, 510, 64, 22], ["+", 0, 568, 8, 2, 3, 3, 0, 510, 0, 102], ["+", 8, 2, 3, 3, 0, 510, 75, 557, 0, 104], ["+", 8, 2, 3, 3, 0, 510, 75, 557, 0, 491]] | 2 | 232 | 6 |
const input = require('fs').readFileSync('/dev/stdin', 'utf8');
const lines = input.trim().split('\n');
while (line = lines.shift()) {
const [n, max] = line.split(' ').map(Number);
if (n === 0 && max === 0) {
break;
}
const prices = lines.shift().split(' ').map(Number);
const allSum = [];
prices.ma... | const input = require('fs').readFileSync('/dev/stdin', 'utf8');
const lines = input.trim().split('\n');
while (line = lines.shift()) {
const [n, max] = line.split(' ').map(Number);
if (n === 0 && max === 0) {
break;
}
const prices = lines.shift().split(' ').map(Number);
const allSum = [];
prices.ma... | [["-", 0, 1, 0, 2, 3, 3, 0, 557, 0, 491], ["+", 0, 1, 0, 2, 3, 3, 0, 557, 0, 491]] | 2 | 224 | 36 |
const input = require('fs').readFileSync('/dev/stdin', 'utf8');
const lines = input.trim().split('\n');
while (line = lines.shift()) {
const [n, max] = line.split(' ').map(Number);
if (n === 0 && max === 0) {
break;
}
const prices = lines.shift().split(' ').map(Number);
const allSum = [];
prices.ma... | const input = require('fs').readFileSync('/dev/stdin', 'utf8');
const lines = input.trim().split('\n');
while (line = lines.shift()) {
const [n, max] = line.split(' ').map(Number);
if (n === 0 && max === 0) {
break;
}
const prices = lines.shift().split(' ').map(Number);
const allSum = [];
prices.ma... | [["-", 0, 1, 0, 2, 3, 3, 0, 510, 15, 22], ["-", 0, 1, 0, 2, 3, 3, 0, 510, 0, 101], ["-", 0, 1, 0, 2, 3, 3, 0, 510, 0, 102], ["+", 0, 1, 0, 2, 3, 3, 0, 16, 17, 106]] | 2 | 202 | 4 |
// 1616
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
int m = sc.nextInt();
if (n == 0 && m == 0) {
break;
}
int a[] = new int[n];
int an = 0;
... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
int m = sc.nextInt();
if (n == 0 && m == 0) {
break;
}
int a[] = new int[n];
int an = 0;
int a... | [["-", 75, 57, 15, 15, 0, 16, 31, 16, 31, 22], ["-", 75, 57, 15, 15, 0, 16, 31, 16, 17, 18], ["-", 75, 57, 15, 15, 0, 16, 31, 16, 12, 22], ["-", 0, 57, 75, 57, 15, 15, 0, 16, 17, 98]] | 3 | 258 | 4 |
#include <stdio.h>
#include <stdlib.h>
int main() {
long n, m;
long max;
long sum;
long i, j;
long *list;
while (1) {
scanf("%ld %ld", &n, &m);
if ((n == 0) && (m == 0)) {
break;
}
list = (long *)malloc(sizeof(long) * n);
for (i = 0; i < n; i++) {
scanf("%ld", (list + i));
... | #include <stdio.h>
#include <stdlib.h>
int main() {
long n, m;
long max;
long sum;
long i, j;
long *list;
while (1) {
scanf("%ld %ld", &n, &m);
if ((n == 0) && (m == 0)) {
break;
}
list = (long *)malloc(sizeof(long) * n);
for (i = 0; i < n; i++) {
scanf("%ld", (list + i));
... | [["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 0, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 0 | 214 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.