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
|
|---|---|---|---|---|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n) {
vector<int> taro(n);
vector<int> hanako;
for (int i = 0; i < n; i++) {
cin >> taro[i];
}
for (int i = 1; i <= 2 * n; i++) {
if (find(taro.begin(), taro.end(), i) == taro.end()) {
hanako.push_back(i);
}
}
sort(taro.begin(), taro.end());
sort(hanako.begin(), hanako.end());
bool now = true; // true:taro, false:hanako
int baNiDeteruCard = -1; //-1:naniMoDetenai
while (!taro.empty() && !hanako.empty()) {
if (baNiDeteruCard == -1) {
if (now) {
baNiDeteruCard = taro[0];
taro.erase(taro.begin());
} else {
baNiDeteruCard = hanako[0];
hanako.erase(hanako.begin());
}
}
else {
if (now) {
int idx = 0;
while (idx < taro.size() && baNiDeteruCard >= taro[idx]) {
idx++;
}
if (idx == taro.size()) {
baNiDeteruCard = -1;
} else {
baNiDeteruCard = taro[idx];
taro.erase(taro.begin() + idx);
}
} else {
int idx = 0;
while (idx < hanako.size() && baNiDeteruCard >= hanako[idx]) {
idx++;
}
if (idx == hanako.size()) {
baNiDeteruCard = -1;
} else {
baNiDeteruCard = hanako[idx];
hanako.erase(hanako.begin() + idx);
}
}
}
now = !now;
}
cout << hanako.size() << endl << taro.size() << endl;
}
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
vector<int> taro(n);
vector<int> hanako;
for (int i = 0; i < n; i++) {
cin >> taro[i];
}
for (int i = 1; i <= 2 * n; i++) {
if (find(taro.begin(), taro.end(), i) == taro.end()) {
hanako.push_back(i);
}
}
sort(taro.begin(), taro.end());
sort(hanako.begin(), hanako.end());
bool now = true; // true:taro, false:hanako
int baNiDeteruCard = -1; //-1:naniMoDetenai
while (!taro.empty() && !hanako.empty()) {
if (baNiDeteruCard == -1) {
if (now) {
baNiDeteruCard = taro[0];
taro.erase(taro.begin());
} else {
baNiDeteruCard = hanako[0];
hanako.erase(hanako.begin());
}
}
else {
if (now) {
int idx = 0;
while (idx < taro.size() && baNiDeteruCard >= taro[idx]) {
idx++;
}
if (idx == taro.size()) {
baNiDeteruCard = -1;
} else {
baNiDeteruCard = taro[idx];
taro.erase(taro.begin() + idx);
}
} else {
int idx = 0;
while (idx < hanako.size() && baNiDeteruCard >= hanako[idx]) {
idx++;
}
if (idx == hanako.size()) {
baNiDeteruCard = -1;
} else {
baNiDeteruCard = hanako[idx];
hanako.erase(hanako.begin() + idx);
}
}
}
now = !now;
}
cout << hanako.size() << endl << taro.size() << endl;
}
}
|
[["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]]
| 1
| 397
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> t, h;
int tmp;
int p, m;
int i;
while (1) {
cin >> n;
if (!n)
break;
t.clear();
for (i = 0; i < n; i++) {
cin >> tmp;
t.push_back(tmp);
}
sort(t.begin(), t.end());
h.clear();
int j = 0;
for (i = 1; i <= 2 * n; i++) {
if (t[j] != i)
h.push_back(i);
else
j++;
}
sort(h.begin(), h.end());
p = 0;
m = 0;
while (1) {
if (!m) {
i = 0;
while (i < t.size() && p > t[i])
i++;
if (i == t.size()) {
p = 0;
m = 1;
} else {
p = t[i];
t.erase(t.begin() + i);
if (!t.size())
break;
m = 1;
}
} else {
i = 0;
while (i < h.size() && p > h[i])
i++;
if (i == h.size()) {
p = 0;
m = 0;
} else {
p = h[i];
h.erase(h.begin() + i);
if (!h.size())
break;
m = 0;
}
}
}
cout << t.size() << endl << h.size() << endl;
}
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> t, h;
int tmp;
int p, m;
int i;
while (1) {
cin >> n;
if (!n)
break;
t.clear();
for (i = 0; i < n; i++) {
cin >> tmp;
t.push_back(tmp);
}
sort(t.begin(), t.end());
h.clear();
int j = 0;
for (i = 1; i <= 2 * n; i++) {
if (t[j] != i)
h.push_back(i);
else
j++;
}
sort(h.begin(), h.end());
p = 0;
m = 0;
while (1) {
if (!m) {
i = 0;
while (i < t.size() && p > t[i])
i++;
if (i == t.size()) {
p = 0;
m = 1;
} else {
p = t[i];
t.erase(t.begin() + i);
if (!t.size())
break;
m = 1;
}
} else {
i = 0;
while (i < h.size() && p > h[i])
i++;
if (i == h.size()) {
p = 0;
m = 0;
} else {
p = h[i];
h.erase(h.begin() + i);
if (!h.size())
break;
m = 0;
}
}
}
cout << h.size() << endl << t.size() << endl;
}
}
|
[["-", 31, 16, 31, 16, 12, 2, 63, 118, 28, 22], ["+", 31, 16, 31, 16, 12, 2, 63, 118, 28, 22], ["-", 0, 16, 31, 16, 12, 2, 63, 118, 28, 22], ["+", 0, 16, 31, 16, 12, 2, 63, 118, 28, 22]]
| 1
| 371
|
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n && n != 0) {
set<int> taro, hanako;
for (int i = 1; i <= 2 * n; i++)
hanako.insert(i);
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
hanako.erase(tmp);
taro.insert(tmp);
}
int placedNum = -1;
// 0:taro,1:hanako
int tern = 0;
while (!(taro.size() == 0 || hanako.size() == 0)) {
if (tern == 0) {
tern = 1;
set<int>::iterator it = taro.lower_bound(placedNum);
if (it == taro.end()) {
placedNum = -1;
continue;
} else {
placedNum = *it;
taro.erase(*it);
}
} else {
tern = 0;
set<int>::iterator it = hanako.lower_bound(placedNum);
if (it == hanako.end()) {
placedNum = -1;
continue;
} else {
placedNum = *it;
hanako.erase(*it);
}
}
}
cout << taro.size() << endl;
cout << hanako.size() << endl;
}
return 0;
}
|
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int main() {
int n;
while (cin >> n && n != 0) {
set<int> taro, hanako;
for (int i = 1; i <= 2 * n; i++)
hanako.insert(i);
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
hanako.erase(tmp);
taro.insert(tmp);
}
int placedNum = -1;
// 0:taro,1:hanako
int tern = 0;
while (!(taro.size() == 0 || hanako.size() == 0)) {
if (tern == 0) {
tern = 1;
set<int>::iterator it = taro.lower_bound(placedNum);
if (it == taro.end()) {
placedNum = -1;
continue;
} else {
placedNum = *it;
taro.erase(*it);
}
} else {
tern = 0;
set<int>::iterator it = hanako.lower_bound(placedNum);
if (it == hanako.end()) {
placedNum = -1;
continue;
} else {
placedNum = *it;
hanako.erase(*it);
}
}
}
cout << hanako.size() << endl;
cout << taro.size() << endl;
}
return 0;
}
|
[["-", 0, 16, 31, 16, 12, 2, 63, 118, 28, 22], ["+", 0, 16, 31, 16, 12, 2, 63, 118, 28, 22]]
| 1
| 273
|
#include <iostream>
using namespace std;
int main() {
int n;
bool *taro, *hanako;
while (cin >> n) {
if (n == 0)
break;
int card;
taro = new bool[2 * n + 1];
hanako = new bool[2 * n + 1];
for (int i = 0; i < 2 * n + 1; i++) {
taro[i] = false;
hanako[i] = true;
}
taro[0] = hanako[0] = false;
for (int i = 0; i < n; i++) {
cin >> card;
taro[card] = true;
hanako[card] = false;
}
int tn, hn;
bool thk = true;
tn = hn = n;
do {
int field = 0;
if (thk == true)
thk = false;
else
thk = true;
for (int i = 0; i < 2 * n + 1; i++) {
if (taro[i] && i > field && !thk) {
field = i;
taro[i] = false;
tn--;
thk = true;
} else if (hanako[i] && i > field && thk) {
field = i;
hanako[i] = false;
hn--;
thk = false;
}
if (tn == 0 || hn == 0)
break;
}
} while (tn != 0 && hn != 0);
cout << hn << " " << tn << endl;
}
delete[] taro;
delete[] hanako;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
bool *taro, *hanako;
while (cin >> n) {
if (n == 0)
break;
int card;
taro = new bool[2 * n + 1];
hanako = new bool[2 * n + 1];
for (int i = 0; i < 2 * n + 1; i++) {
taro[i] = false;
hanako[i] = true;
}
taro[0] = hanako[0] = false;
for (int i = 0; i < n; i++) {
cin >> card;
taro[card] = true;
hanako[card] = false;
}
int tn, hn;
bool thk = true;
tn = hn = n;
do {
int field = 0;
if (thk == true)
thk = false;
else
thk = true;
for (int i = 0; i < 2 * n + 1; i++) {
if (taro[i] && i > field && !thk) {
field = i;
taro[i] = false;
tn--;
thk = true;
} else if (hanako[i] && i > field && thk) {
field = i;
hanako[i] = false;
hn--;
thk = false;
}
if (tn == 0 || hn == 0)
break;
}
} while (tn != 0 && hn != 0);
cout << hn << endl;
cout << tn << endl;
delete[] taro;
delete[] hanako;
}
return 0;
}
|
[["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 320
|
#include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; ++i)
using namespace std;
//タロー→ハナァコォ
const int NONE = -1;
int main(void) {
while (1) {
int n;
vector<int> card[2];
cin >> n;
if (n == 0)
return 0;
int field = NONE; //今場に出ているカード
int turn = 0; // 0:太郎,1:花子;
bool a[301] = {};
for (int i = 0; i < n; ++i) {
int t;
cin >> t;
card[0].push_back(t);
a[t] = true;
}
for (int i = 1; i <= 2 * n; ++i) {
if (a[i] == false)
card[1].push_back(i);
}
sort(card[0].begin(), card[0].end());
sort(card[1].begin(), card[1].end());
while (1) {
if (card[0].empty() || card[0].empty())
break;
if (field == NONE) {
field = card[turn][0];
card[turn].erase(card[turn].begin());
} else {
bool outFlag = false;
for (int i = 0; i < card[turn].size(); ++i) {
if (field < card[turn][i]) //出せるカードがある
{
field = card[turn][i];
outFlag = true;
card[turn].erase(card[turn].begin() + i);
break;
}
}
if (outFlag == false) {
field = NONE;
}
}
if (turn == 0)
turn = 1;
else if (turn == 1)
turn = 0;
}
int tsum = 0;
int hsum = 0;
for (int i = 0; i < card[0].size(); ++i) {
hsum += card[0][i];
}
for (int j = 0; j < card[1].size(); ++j) {
tsum += card[1][j];
}
cout << card[1].size() << endl;
cout << card[0].size() << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; ++i)
using namespace std;
//タロー→ハナァコォ
const int NONE = -1;
int main(void) {
while (1) {
int n;
vector<int> card[2];
cin >> n;
if (n == 0)
return 0;
int field = NONE; //今場に出ているカード
int turn = 0; // 0:太郎,1:花子;
bool a[301] = {};
for (int i = 0; i < n; ++i) {
int t;
cin >> t;
card[0].push_back(t);
a[t] = true;
}
for (int i = 1; i <= 2 * n; ++i) {
if (a[i] == false)
card[1].push_back(i);
}
sort(card[0].begin(), card[0].end());
sort(card[1].begin(), card[1].end());
while (1) {
if (card[0].empty() || card[1].empty())
break;
if (field == NONE) {
field = card[turn][0];
card[turn].erase(card[turn].begin());
} else {
bool outFlag = false;
for (int i = 0; i < card[turn].size(); ++i) {
if (field < card[turn][i]) //出せるカードがある
{
field = card[turn][i];
outFlag = true;
card[turn].erase(card[turn].begin() + i);
break;
}
}
if (outFlag == false) {
field = NONE;
}
}
if (turn == 0)
turn = 1;
else if (turn == 1)
turn = 0;
}
int tsum = 0;
int hsum = 0;
for (int i = 0; i < card[0].size(); ++i) {
hsum += card[0][i];
}
for (int j = 0; j < card[1].size(); ++j) {
tsum += card[1][j];
}
cout << card[1].size() << endl;
cout << card[0].size() << endl;
}
return 0;
}
|
[["-", 12, 2, 63, 118, 28, 69, 341, 342, 0, 13], ["+", 12, 2, 63, 118, 28, 69, 341, 342, 0, 13]]
| 1
| 485
|
#include <iostream>
using namespace std;
int main() {
int n, a, c = 0, T, H;
bool t[200 + 2], h[200 + 2];
while (1) {
fill(t, t + 202, false);
fill(h, h + 202, false);
scanf("%d", &n);
if (n == 0)
break;
for (int i = 0; i < n; i++) {
scanf("%d", &a);
t[a] = true;
}
for (int i = 1; i < 2 * n + 1; i++) {
if (!t[i])
h[i] = true;
}
T = n;
H = n;
while (1) {
for (int i = c + 1;; i++) {
if (t[i]) {
t[i] = false;
T--;
c = i;
break;
}
if (i >= 2 * n) {
c = 0;
break;
}
}
if (T == 0)
break;
for (int i = c + 1;; i++) {
if (h[i]) {
h[i] = false;
H--;
c = i;
break;
}
if (i >= 2 * n) {
c = 0;
break;
}
}
if (H == 0)
break;
}
printf("%d\n%d\n", H, T);
}
}
|
#include <iostream>
using namespace std;
int main() {
int n, a, c = 0, T, H;
bool t[200 + 2], h[200 + 2];
while (1) {
c = 0;
fill(t, t + 202, false);
fill(h, h + 202, false);
scanf("%d", &n);
if (n == 0)
break;
for (int i = 0; i < n; i++) {
scanf("%d", &a);
t[a] = true;
}
for (int i = 1; i < 2 * n + 1; i++) {
if (!t[i])
h[i] = true;
}
T = n;
H = n;
while (1) {
for (int i = c + 1;; i++) {
if (t[i]) {
t[i] = false;
T--;
c = i;
break;
}
if (i >= 2 * n) {
c = 0;
break;
}
}
if (T == 0)
break;
for (int i = c + 1;; i++) {
if (h[i]) {
h[i] = false;
H--;
c = i;
break;
}
if (i >= 2 * n) {
c = 0;
break;
}
}
if (H == 0)
break;
}
printf("%d\n%d\n", H, T);
}
}
|
[["+", 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
| 310
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MP make_pair
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> P;
int main() {
int n;
while (cin >> n, 0) {
vector<int> v(2 * n + 1, 0);
rep(i, n) {
int k;
cin >> k;
v[k] = 1;
}
for (int i = 1; i <= 2 * n; i++) {
if (!v[i])
v[i] = 2;
}
int t = 0, c = 0;
int cnt[2] = {n, n};
while (cnt[0] && cnt[1]) {
rep(i, v.size()) {
if (!cnt[0] || !cnt[1])
break;
if ((t == 0 && v[i] == 1) || (t == 1 && v[i] == 2)) {
cnt[t]--;
c = v[i];
v[i] = 0;
t = !t;
}
}
c = 0;
t = !t;
}
cout << count(v.begin(), v.end(), 2) << endl;
cout << count(v.begin(), v.end(), 1) << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MP make_pair
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> P;
int main() {
int n;
while (cin >> n, n) {
vector<int> v(2 * n + 1, 0);
rep(i, n) {
int k;
cin >> k;
v[k] = 1;
}
for (int i = 1; i <= 2 * n; i++) {
if (!v[i])
v[i] = 2;
}
int t = 0, c = 0;
int cnt[2] = {n, n};
while (cnt[0] && cnt[1]) {
rep(i, v.size()) {
if (!cnt[0] || !cnt[1])
break;
if ((t == 0 && v[i] == 1) || (t == 1 && v[i] == 2)) {
cnt[t]--;
c = v[i];
v[i] = 0;
t = !t;
}
}
c = 0;
t = !t;
}
cout << count(v.begin(), v.end(), 2) << endl;
cout << count(v.begin(), v.end(), 1) << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 52, 15, 339, 51, 34, 12, 13], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]]
| 1
| 301
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define EQ(a, b) (abs((a) - (b)) < EPS)
// 1 taro 2 hanako
int card[201];
int f = 0;
int n;
int p[3];
int t, h;
void turn(int s) {
bool flag = false;
for (int i = f + 1; i <= 2 * n; i++) {
if (card[i] == s) {
f = i;
card[i] = 0;
p[s]--;
return;
}
}
if (!(flag)) {
f = 0;
return;
}
}
int main() {
while (1) {
memset(card, 0, sizeof(card));
f = 0;
t = 0;
h = 0;
cin >> n;
if (n == 0)
break;
p[1] = n;
p[2] = n;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
card[k] = 1;
}
for (int i = 1; i <= 2 * n; i++) {
if (card[i] != 1) {
card[i] = 2;
}
}
for (int i = 0;; i++) {
turn((i % 2) + 1);
if (p[1] == 0 || p[2] == 0)
break;
}
t = p[2];
h = p[1];
cout << t << ' ' << h << endl;
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define EQ(a, b) (abs((a) - (b)) < EPS)
// 1 taro 2 hanako
int card[201];
int f = 0;
int n;
int p[3];
int t, h;
void turn(int s) {
bool flag = false;
for (int i = f + 1; i <= 2 * n; i++) {
if (card[i] == s) {
f = i;
card[i] = 0;
p[s]--;
return;
}
}
if (!(flag)) {
f = 0;
return;
}
}
int main() {
while (1) {
memset(card, 0, sizeof(card));
f = 0;
t = 0;
h = 0;
cin >> n;
if (n == 0)
break;
p[1] = n;
p[2] = n;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
card[k] = 1;
}
for (int i = 1; i <= 2 * n; i++) {
if (card[i] != 1) {
card[i] = 2;
}
}
for (int i = 0;; i++) {
turn((i % 2) + 1);
if (p[1] == 0 || p[2] == 0)
break;
}
t = p[2];
h = p[1];
cout << t << endl;
cout << h << endl;
}
return 0;
}
|
[["-", 0, 16, 31, 16, 31, 16, 12, 103, 0, 104], ["-", 0, 16, 31, 16, 31, 16, 12, 103, 0, 125], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22]]
| 1
| 400
|
#include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
int main() {
int n, i, j, a, suu1, suu2, ba, t;
int tarou[100];
int hanako[100];
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++)
tarou[i] = 0, hanako[i] = 0;
for (i = 0; i < n; i++)
scanf("%d", &tarou[i]);
for (i = 0; i < n; i++) {
for (j = 0; j < n - 1; j++) {
if (tarou[j] > tarou[j + 1]) {
a = tarou[j];
tarou[j] = tarou[j + 1];
tarou[j + 1] = a;
}
}
}
j = 0;
a = 0;
for (i = 0; i < n * 2; i++) {
if (tarou[j] != i) {
hanako[a] = i;
a++;
} else if (tarou[j] == i)
j++;
}
suu1 = n;
suu2 = n;
t = 0;
ba = 0;
while (suu2 != 0 && suu1 != 0) {
if (t == 0) {
for (i = 0; i < n; i++) {
if (ba < tarou[i] && tarou[i] != 0) {
ba = tarou[i];
tarou[i] = 0;
t = 1;
suu2--;
break;
}
if (i == n - 1) {
t = 1;
ba = 0;
}
}
} else if (t == 1) {
for (i = 0; i < n; i++) {
if (ba < hanako[i] && hanako[i] != 0) {
ba = hanako[i];
hanako[i] = 0;
t = 0;
suu1--;
break;
}
if (i == n - 1) {
t = 0;
ba = 0;
}
}
}
}
printf("%d\n%d\n", suu1, suu2);
}
return 0;
}
|
#include <ctype.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
int main() {
int n, i, j, a, suu1, suu2, ba, t;
int tarou[100];
int hanako[100];
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++)
tarou[i] = 0, hanako[i] = 0;
for (i = 0; i < n; i++)
scanf("%d", &tarou[i]);
for (i = 0; i < n; i++) {
for (j = 0; j < n - 1; j++) {
if (tarou[j] > tarou[j + 1]) {
a = tarou[j];
tarou[j] = tarou[j + 1];
tarou[j + 1] = a;
}
}
}
j = 0;
a = 0;
for (i = 1; i <= n * 2; i++) {
if (tarou[j] != i) {
hanako[a] = i;
a++;
} else if (tarou[j] == i)
j++;
}
suu1 = n;
suu2 = n;
t = 0;
ba = 0;
while (suu2 != 0 && suu1 != 0) {
if (t == 0) {
for (i = 0; i < n; i++) {
if (ba < tarou[i] && tarou[i] != 0) {
ba = tarou[i];
tarou[i] = 0;
t = 1;
suu2--;
break;
}
if (i == n - 1) {
t = 1;
ba = 0;
}
}
} else if (t == 1) {
for (i = 0; i < n; i++) {
if (ba < hanako[i] && hanako[i] != 0) {
ba = hanako[i];
hanako[i] = 0;
t = 0;
suu1--;
break;
}
if (i == n - 1) {
t = 0;
ba = 0;
}
}
}
}
printf("%d\n%d\n", suu1, suu2);
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 465
|
#include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
/*
int main(){
int n;
int count=0;
string name;
cin >> n >> name;
vector<string> signs(n);
for(int i=0; i<n; ++i){
cin >> signs[i];
cout << signs[i].size() << "\n";
}
for(int m=0; m<n; ++n){
for(unsigned int i=0; i<signs[m].size(); ++i){
for(unsigned int j=1;
i+(name.size()-1)*j<signs[m].size(); ++j){ for(unsigned int k=0; k<name.size();
++k){ if(signs[m][i+k*j]!=name[k]){ goto fail;
}
}
count++;
goto naxtk;
fail:;
}
}
naxtk:;
}
cout << count << "\n";
return 0;
}
*/
int main() {
int n;
while (cin >> n) {
vector<int> Taro(2 * n + 1);
vector<int> Hanako(2 * n + 1);
int tc = n, hc = n;
int max = 0;
bool ok = false;
for (int i = 0; i < n; ++i) {
int m;
cin >> m;
Taro[m] = 1;
}
for (int i = 1; i < 2 * n + 1; ++i) {
if (Taro[i] == 0)
Hanako[i] = 1;
}
/*for(int i=1; i<2*n+1; ++i){
if(Taro[i]==1){
cout << i << " ";
}
}*/
while (1) {
if (tc == 0 || hc == 0)
break;
for (int i = 1; i < 2 * n + 1; ++i) {
if (max < i && Taro[i] == 1) {
max = i;
Taro[i] = 0;
ok = true;
--tc;
break;
}
} /*
for(int i=1; i<2*n+1; ++i){
if(Taro[i]==1){
cout << i << " ";
}
}*/
// cout << "\n";
if (ok == false)
max = 0;
ok = false;
if (tc == 0 || hc == 0)
break;
for (int i = 1; i < 2 * n + 1; ++i) {
if (max < i && Hanako[i] == 1) {
max = i;
Hanako[i] = 0;
ok = true;
--hc;
break;
}
} /*
for(int i=1; i<2*n+1; ++i){
if(Hanako[i]==1){
cout << i << " ";
}
}*/
// cout << "\n";
if (ok == false)
max = 0;
ok = false;
}
cout << hc << "\n" << tc << "\n";
}
return 0;
}
|
#include <algorithm>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
/*
int main(){
int n;
int count=0;
string name;
cin >> n >> name;
vector<string> signs(n);
for(int i=0; i<n; ++i){
cin >> signs[i];
cout << signs[i].size() << "\n";
}
for(int m=0; m<n; ++n){
for(unsigned int i=0; i<signs[m].size(); ++i){
for(unsigned int j=1;
i+(name.size()-1)*j<signs[m].size(); ++j){ for(unsigned int k=0; k<name.size();
++k){ if(signs[m][i+k*j]!=name[k]){ goto fail;
}
}
count++;
goto naxtk;
fail:;
}
}
naxtk:;
}
cout << count << "\n";
return 0;
}
*/
int main() {
int n;
while (cin >> n && n != 0) {
vector<int> Taro(2 * n + 1);
vector<int> Hanako(2 * n + 1);
int tc = n, hc = n;
int max = 0;
bool ok = false;
for (int i = 0; i < n; ++i) {
int m;
cin >> m;
Taro[m] = 1;
}
for (int i = 1; i < 2 * n + 1; ++i) {
if (Taro[i] == 0)
Hanako[i] = 1;
}
/*for(int i=1; i<2*n+1; ++i){
if(Taro[i]==1){
cout << i << " ";
}
}*/
while (1) {
if (tc == 0 || hc == 0)
break;
for (int i = 1; i < 2 * n + 1; ++i) {
if (max < i && Taro[i] == 1) {
max = i;
Taro[i] = 0;
ok = true;
--tc;
break;
}
} /*
for(int i=1; i<2*n+1; ++i){
if(Taro[i]==1){
cout << i << " ";
}
}*/
// cout << "\n";
if (ok == false)
max = 0;
ok = false;
if (tc == 0 || hc == 0)
break;
for (int i = 1; i < 2 * n + 1; ++i) {
if (max < i && Hanako[i] == 1) {
max = i;
Hanako[i] = 0;
ok = true;
--hc;
break;
}
} /*
for(int i=1; i<2*n+1; ++i){
if(Hanako[i]==1){
cout << i << " ";
}
}*/
// cout << "\n";
if (ok == false)
max = 0;
ok = false;
}
cout << hc << "\n" << tc << "\n";
}
return 0;
}
|
[["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 79], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 12, 13]]
| 1
| 337
|
#include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
const int INF = 1 << 29;
typedef pair<int, int> P;
vector<int> tcard[2];
int n;
int main(void) {
while (cin >> n && n) {
int taro = 0, hanako = 0;
tcard[0].resize(n);
tcard[1].resize(n);
int i2 = 0;
for (int i = 0; i < n; i++) {
cin >> tcard[0][i];
}
sort(tcard[0].begin(), tcard[0].end());
if (tcard[0][0] != 0) {
for (int i = 1; i < tcard[0][0]; i++) {
tcard[1][i2] = i;
i2++;
}
}
int sadfasf = 0;
for (int i = 1; i < n; i++) {
for (int j = tcard[0][i] - tcard[0][i - 1] - 1; j - 1 >= 0; j--) {
tcard[1][i2] = tcard[0][i - 1] + j;
i2++;
}
}
if (tcard[0][n - 1] != 2 * n) {
for (int i = tcard[0][n - 1] + 1; i <= 2 * n; i++) {
tcard[1][i2] = i;
i2++;
}
}
sort(tcard[1].begin(), tcard[1].end());
int stage = tcard[0][0];
tcard[0].erase(tcard[0].begin());
for (int i = 1; tcard[0].size() && tcard[1].size(); i++) {
bool flag = false;
for (int j = 0; j < tcard[i & 1].size(); j++) {
if (stage < tcard[i & 1][j]) {
stage = tcard[i & 1][j];
tcard[i & 1].erase(tcard[i & 1].begin() + j);
flag = true;
break;
}
}
if (!flag) {
stage = 0;
}
}
cout << tcard[0].size() << endl;
cout << tcard[1].size() << endl;
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
const int INF = 1 << 29;
typedef pair<int, int> P;
vector<int> tcard[2];
int n;
int main(void) {
while (cin >> n && n) {
int taro = 0, hanako = 0;
tcard[0].resize(n);
tcard[1].resize(n);
int i2 = 0;
for (int i = 0; i < n; i++) {
cin >> tcard[0][i];
}
sort(tcard[0].begin(), tcard[0].end());
if (tcard[0][0] != 0) {
for (int i = 1; i < tcard[0][0]; i++) {
tcard[1][i2] = i;
i2++;
}
}
int sadfasf = 0;
for (int i = 1; i < n; i++) {
for (int j = tcard[0][i] - tcard[0][i - 1] - 1; j - 1 >= 0; j--) {
tcard[1][i2] = tcard[0][i - 1] + j;
i2++;
}
}
if (tcard[0][n - 1] != 2 * n) {
for (int i = tcard[0][n - 1] + 1; i <= 2 * n; i++) {
tcard[1][i2] = i;
i2++;
}
}
sort(tcard[1].begin(), tcard[1].end());
int stage = tcard[0][0];
tcard[0].erase(tcard[0].begin());
for (int i = 1; tcard[0].size() && tcard[1].size(); i++) {
bool flag = false;
for (int j = 0; j < tcard[i & 1].size(); j++) {
if (stage < tcard[i & 1][j]) {
stage = tcard[i & 1][j];
tcard[i & 1].erase(tcard[i & 1].begin() + j);
flag = true;
break;
}
}
if (!flag) {
stage = 0;
}
}
cout << tcard[1].size() << endl;
cout << tcard[0].size() << endl;
}
return 0;
}
|
[["-", 12, 2, 63, 118, 28, 69, 341, 342, 0, 13], ["+", 12, 2, 63, 118, 28, 69, 341, 342, 0, 13]]
| 1
| 547
|
loop {
n = gets.to_i
break if n == 0
hand = [(1..n).map { gets.to_i }.sort]
hand << (1..2*n).to_a - hand[-1]
min = 0
i = 0
loop {
x = hand[i].find{|y| y > min}
if x
hand[i].delete(x)
min = x
break if hand[i].empty?
else
min = 0
end
i = 1 - i
}
puts hand.map(&:size)
}
|
loop {
n = gets.to_i
break if n == 0
hand = [(1..n).map { gets.to_i }.sort]
hand << (1..2*n).to_a - hand[-1]
min = 0
i = 0
loop {
x = hand[i].find{|y| y > min}
if x
hand[i].delete(x)
min = x
break if hand[i].empty?
else
min = 0
end
i = 1 - i
}
puts hand.map(&:size).reverse
}
|
[["+", 8, 734, 0, 652, 3, 4, 0, 652, 17, 131], ["+", 8, 734, 0, 652, 3, 4, 0, 652, 735, 22]]
| 4
| 113
|
#!/usr/bin/ruby
M=999
while(n=gets.to_i)>0 do
a=(1..(2*n)).map.to_a
b=[];n.times{b.push(gets.to_i)}
h=[b,a-b];f=0;m=0
while true do
x=h[f].map{|e|e>m ?e: M}.min
if x<M then h[f]-=[x];m=x else m=0 end
if h[f].size==0 then p h[1].size,h[0].size;exit end
f^=1
end
end
|
#!/usr/bin/ruby
M=999
while(n=gets.to_i)>0 do
a=(1..(2*n)).map.to_a
b=[];n.times{b.push(gets.to_i)}
h=[b,a-b];f=0;m=0
while true do
x=h[f].map{|e|e>m ?e: M}.min
if x<M then h[f]-=[x];m=x else m=0 end
if h[f].size==0 then p h[1].size,h[0].size;break end
f^=1
end
end
|
[["-", 0, 89, 8, 170, 0, 121, 64, 749, 0, 22], ["+", 8, 170, 0, 121, 64, 749, 0, 94, 0, 94]]
| 4
| 144
|
def discard(c, cards):
for card in cards:
if c < card:
return card
return 0
while True:
n = int(input())
if n == 0:
break
taro = [int(input()) for _ in range(n)]
hanako = [x + 1 for x in range(2*n) if (x + 1) not in taro]
taro.sort()
hanako.sort()
table = 0
while True:
if taro:
table = discard(table, taro)
if table:
taro.remove(table)
if not taro:
print(len(hanako))
print(0)
break
if hanako:
table = discard(table, hanako)
if table:
hanako.remove(table)
if not hanako:
print(0)
print(len(taro))
|
def discard(c, cards):
for card in cards:
if c < card:
return card
return 0
while True:
n = int(input())
if n == 0:
break
taro = [int(input()) for _ in range(n)]
hanako = [x + 1 for x in range(2*n) if (x + 1) not in taro]
taro.sort()
hanako.sort()
table = 0
while True:
if taro:
table = discard(table, taro)
if table:
taro.remove(table)
if not taro:
print(len(hanako))
print(0)
break
if hanako:
table = discard(table, hanako)
if table:
hanako.remove(table)
if not hanako:
print(0)
print(len(taro))
break
|
[["+", 8, 196, 0, 57, 64, 196, 0, 93, 0, 94]]
| 5
| 168
|
import bisect
while True:
n = int(input())
if n == 0:
break
tc = sorted([int(input()) for _ in range(n)])
hc = sorted([v for v in range(1, 2*n+1) if v not in tc])
ba = []
flag = True
while tc and hc:
if len(ba) == 0:
try:
if flag:
tmp = tc.pop(0)
flag = False
else:
tmp = hc.pop(0)
flag = True
except IndexError:
pass
ba = [tmp]
continue
last_card = ba[-1]
if flag:
x = bisect.bisect_left(tc, last_card)
flag = False
try:
tmp = tc.pop(x)
except IndexError:
ba = []
continue
else:
x = bisect.bisect_left(hc, last_card)
flag = True
try:
tmp = hc.pop(x)
except IndexError:
ba = []
continue
ba.append(tmp)
print(len(tc))
print(len(hc))
|
import bisect
while True:
n = int(input())
if n == 0:
break
tc = sorted([int(input()) for _ in range(n)])
hc = sorted([v for v in range(1, 2*n+1) if v not in tc])
ba = []
flag = True
while tc and hc:
if len(ba) == 0:
try:
if flag:
tmp = tc.pop(0)
flag = False
else:
tmp = hc.pop(0)
flag = True
except IndexError:
pass
ba = [tmp]
continue
last_card = ba[-1]
if flag:
x = bisect.bisect_left(tc, last_card)
flag = False
try:
tmp = tc.pop(x)
except IndexError:
ba = []
continue
else:
x = bisect.bisect_left(hc, last_card)
flag = True
try:
tmp = hc.pop(x)
except IndexError:
ba = []
continue
ba.append(tmp)
print(len(hc))
print(len(tc))
|
[["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 22]]
| 5
| 218
|
import bisect
while True:
n = int(input())
if n == 0:
break
card_set = [sorted(int(input()) for _ in range(n)), []]
card_set[1] = sorted({i for i in range(1, 2*n+1)}.difference(card_set[0]))
card = turn = 0
flag = 1
ba = []
while flag:
if len(ba) == 0:
card = card_set[turn].pop(0)
ba.append(card)
flag = 0 if len(card_set[turn])==0 else 1
turn = 0 if turn else 1
continue
last_card = ba[-1]
x = bisect.bisect_left(card_set[turn], last_card)
try:
card = card_set[turn].pop(x)
ba.append(card)
except IndexError:
ba = []
flag = 0 if len(card_set[turn])==0 else 1
turn = 0 if turn else 1
print(*[len(cet) for cet in card_set], sep='\n')
|
import bisect
while True:
n = int(input())
if n == 0:
break
card_set = [sorted(int(input()) for _ in range(n)), []]
card_set[1] = sorted({i for i in range(1, 2*n+1)}.difference(card_set[0]))
card = turn = 0
flag = 1
ba = []
while flag:
if len(ba) == 0:
card = card_set[turn].pop(0)
ba.append(card)
flag = 0 if len(card_set[turn])==0 else 1
turn = 0 if turn else 1
continue
last_card = ba[-1]
x = bisect.bisect_left(card_set[turn], last_card)
try:
card = card_set[turn].pop(x)
ba.append(card)
except IndexError:
ba = []
flag = 0 if len(card_set[turn])==0 else 1
turn = 0 if turn else 1
print(*[len(cet) for cet in card_set[::-1]], sep='\n')
|
[["+", 0, 661, 0, 658, 0, 659, 12, 206, 0, 70], ["+", 0, 658, 0, 659, 12, 206, 206, 663, 0, 102], ["+", 0, 659, 12, 206, 206, 663, 0, 664, 17, 33], ["+", 0, 659, 12, 206, 206, 663, 0, 664, 28, 612], ["+", 0, 661, 0, 658, 0, 659, 12, 206, 0, 73]]
| 5
| 225
|
#include <stdio.h>
#define HASH_LEN 1024
typedef struct {
int x, y;
} point_t;
typedef struct _hash_element hash_element_t;
struct _hash_element {
void *value;
hash_element_t *next;
};
hash_element_t *_hash[HASH_LEN];
hash_element_t _hashelm[HASH_LEN];
int _hashelm_index;
void hash_init() {
int i;
for (i = 0; i < HASH_LEN; i++) {
_hash[i] = NULL;
}
_hashelm_index = 0;
}
hash_element_t *hash_new_element(void *value) {
hash_element_t *elm = &_hashelm[_hashelm_index++];
elm->value = value;
return elm;
}
int hash_star(int x, int y) { return (x * 33 + y) % HASH_LEN; }
void hash_set_star(point_t *star) {
int h;
hash_element_t *elm;
h = hash_star(star->x, star->y);
elm = hash_new_element((void *)star);
elm->next = _hash[h];
_hash[h] = elm;
}
point_t *hash_get_star(int x, int y) {
int h;
hash_element_t *elm;
point_t *p;
h = hash_star(x, y);
elm = _hash[h];
while (elm != NULL) {
p = (point_t *)elm->value;
if (p->x == x && p->y == y)
return p;
elm = elm->next;
}
return NULL;
}
point_t target[200], offset[200], stars[1000];
int main(void) {
int m, n, i, j;
while (scanf("%d", &m) != EOF && m) {
hash_init();
point_t *o, *s;
for (i = 0; i < m; i++) {
scanf("%d%d", &(target[i].x), &(target[i].y));
if (i == 0) {
o = &target[i];
} else {
offset[i].x = target[i].x - o->x;
offset[i].y = target[i].y - o->y;
}
}
scanf("%d\n", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &(stars[i].x), &(stars[i].y));
hash_set_star(&stars[i]);
}
for (i = 0; i < n; i++) {
s = &stars[i];
for (j = 1; j < m; j++) {
if (hash_get_star(s->x + offset[j].x, s->y + offset[j].y) == NULL)
break;
}
if (j == m) {
printf("%d %d\n", s->x - o->x, s->y - o->y);
break;
}
}
}
return 0;
}
|
#include <stdio.h>
#define HASH_LEN 1024
typedef struct {
int x, y;
} point_t;
typedef struct _hash_element hash_element_t;
struct _hash_element {
void *value;
hash_element_t *next;
};
hash_element_t *_hash[HASH_LEN];
hash_element_t _hashelm[HASH_LEN];
int _hashelm_index;
void hash_init() {
int i;
for (i = 0; i < HASH_LEN; i++) {
_hash[i] = NULL;
}
_hashelm_index = 0;
}
hash_element_t *hash_new_element(void *value) {
hash_element_t *elm = &_hashelm[_hashelm_index++];
elm->value = value;
return elm;
}
int hash_star(int x, int y) { return (x * 33 + y) & (HASH_LEN - 1); }
void hash_set_star(point_t *star) {
int h;
hash_element_t *elm;
h = hash_star(star->x, star->y);
elm = hash_new_element((void *)star);
elm->next = _hash[h];
_hash[h] = elm;
}
point_t *hash_get_star(int x, int y) {
int h;
hash_element_t *elm;
point_t *p;
h = hash_star(x, y);
elm = _hash[h];
while (elm != NULL) {
p = (point_t *)elm->value;
if (p->x == x && p->y == y)
return p;
elm = elm->next;
}
return NULL;
}
point_t target[200], offset[200], stars[1000];
int main(void) {
int m, n, i, j;
while (scanf("%d", &m) != EOF && m) {
hash_init();
point_t *o, *s;
for (i = 0; i < m; i++) {
scanf("%d%d", &(target[i].x), &(target[i].y));
if (i == 0) {
o = &target[i];
} else {
offset[i].x = target[i].x - o->x;
offset[i].y = target[i].y - o->y;
}
}
scanf("%d\n", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &(stars[i].x), &(stars[i].y));
hash_set_star(&stars[i]);
}
for (i = 0; i < n; i++) {
s = &stars[i];
for (j = 1; j < m; j++) {
if (hash_get_star(s->x + offset[j].x, s->y + offset[j].y) == NULL)
break;
}
if (j == m) {
printf("%d %d\n", s->x - o->x, s->y - o->y);
break;
}
}
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 37, 0, 16, 17, 109], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 17, 67], ["+", 8, 9, 0, 37, 0, 16, 12, 23, 0, 24], ["+", 0, 37, 0, 16, 12, 23, 0, 16, 17, 33], ["+", 0, 37, 0, 16, 12, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 37, 0, 16, 12, 23, 0, 25]]
| 0
| 602
|
#include <iostream>
#include <map>
#include <vector>
using namespace std;
struct pos {
int x, y;
};
map<int, map<int, int>> smap;
int index(int x, int y) {
auto i0 = smap.find(x);
if (i0 == smap.end())
return -1;
auto i1 = i0->second.find(y);
if (i1 == i0->second.end())
return -1;
return i1->second;
}
int main() {
while (true) {
int m, n;
cin >> m;
if (m == 0)
break;
vector<pos> star(m);
for (int i = 0; i < m; i++) {
cin >> star[i].x >> star[i].y;
}
cin >> n;
vector<pos> sky(n);
for (int i = 0; i < n; i++) {
cin >> sky[i].x >> sky[i].y;
smap[sky[i].x][sky[i].y] = i;
}
for (int i = 0; i < n; i++) {
int dx = sky[i].x - star[0].x;
int dy = sky[i].y - star[0].y;
bool same = true;
for (int j = 0; j < m; j++) {
int id = index(star[j].x + dx, star[j].y + dy);
if (id < 0) {
same = false;
break;
}
}
if (same) {
cout << dx << "," << dy << endl;
break;
}
}
}
return 0;
}
|
#include <iostream>
#include <map>
#include <vector>
using namespace std;
struct pos {
int x, y;
};
map<int, map<int, int>> smap;
int index(int x, int y) {
auto i0 = smap.find(x);
if (i0 == smap.end())
return -1;
auto i1 = i0->second.find(y);
if (i1 == i0->second.end())
return -1;
return i1->second;
}
int main() {
while (true) {
int m, n;
cin >> m;
if (m == 0)
break;
vector<pos> star(m);
for (int i = 0; i < m; i++) {
cin >> star[i].x >> star[i].y;
}
cin >> n;
vector<pos> sky(n);
for (int i = 0; i < n; i++) {
cin >> sky[i].x >> sky[i].y;
smap[sky[i].x][sky[i].y] = i;
}
for (int i = 0; i < n; i++) {
int dx = sky[i].x - star[0].x;
int dy = sky[i].y - star[0].y;
bool same = true;
for (int j = 0; j < m; j++) {
int id = index(star[j].x + dx, star[j].y + dy);
if (id < 0) {
same = false;
break;
}
}
if (same) {
cout << dx << " " << dy << endl;
break;
}
}
}
return 0;
}
|
[["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]]
| 1
| 366
|
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
const int mod = 10000000;
int m, n, a, b;
int main() {
while (cin >> m, m) {
vector<ll> v(m);
for (int i = 0; i < m; i++) {
cin >> a >> b;
v[i] = 1LL * a * mod + b;
}
set<int> s;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
s.insert(1LL * a * mod + b);
}
for (int i : s) {
bool flag = true;
for (int j = 1; j < v.size() && flag; j++) {
if (s.find(v[j] - v[0] + i) == s.end())
flag = false;
}
if (flag)
cout << i / mod - v[0] / mod << ' ' << i % mod - v[0] % mod << endl;
}
}
return 0;
}
|
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
const int mod = 10000000;
int m, n, a, b;
int main() {
while (cin >> m, m) {
vector<ll> v(m);
for (int i = 0; i < m; i++) {
cin >> a >> b;
v[i] = 1LL * a * mod + b;
}
set<ll> s;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
s.insert(1LL * a * mod + b);
}
for (ll i : s) {
bool flag = true;
for (int j = 1; j < v.size() && flag; j++) {
if (s.find(v[j] - v[0] + i) == s.end())
flag = false;
}
if (flag)
cout << i / mod - v[0] / mod << ' ' << i % mod - v[0] % mod << endl;
}
}
return 0;
}
|
[["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 43, 39, 344, 3, 347, 0, 77, 39, 78], ["-", 8, 9, 0, 52, 8, 9, 0, 338, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 338, 39, 78]]
| 1
| 237
|
#include <bits/stdc++.h>
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FORR(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define pb(a) push_back(a)
#define mp(x, y) make_pair(x, y)
#define ZERO(a) memset(a, 0, sizeof(a))
#define len(a) sizeof(a)
#define ll long long
#define pii pair<int, int>
#define INF 1 << 29
#define MAX_M 201
#define MAX_N 1111
using namespace std;
int x[MAX_M], y[MAX_M], xx[MAX_N], yy[MAX_N];
void solve() {
int m, n;
for (;;) {
cin >> m;
if (!m)
break;
set<pii> st;
vector<pii> v;
FOR(i, m) cin >> x[i] >> y[i];
cin >> n;
FOR(i, n) {
cin >> xx[i] >> yy[i];
st.insert(mp(xx[i], yy[i]));
}
FOR(i, m) { v.pb(mp(x[i] - x[0], y[i] - y[0])); }
set<pii>::iterator ite;
FOR(i, n) {
bool f = true;
FOR(j, v.size()) {
ite = st.find(mp(v[j].first + xx[i], v[j].second + yy[i]));
if (ite == st.end()) {
f = false;
break;
}
}
if (f) {
cout << xx[i] - x[0] << yy[i] - y[0] << endl;
break;
}
}
}
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FORR(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define pb(a) push_back(a)
#define mp(x, y) make_pair(x, y)
#define ZERO(a) memset(a, 0, sizeof(a))
#define len(a) sizeof(a)
#define ll long long
#define pii pair<int, int>
#define INF 1 << 29
#define MAX_M 201
#define MAX_N 1111
using namespace std;
int x[MAX_M], y[MAX_M], xx[MAX_N], yy[MAX_N];
void solve() {
int m, n;
for (;;) {
cin >> m;
if (!m)
break;
set<pii> st;
vector<pii> v;
FOR(i, m) cin >> x[i] >> y[i];
cin >> n;
FOR(i, n) {
cin >> xx[i] >> yy[i];
st.insert(mp(xx[i], yy[i]));
}
FOR(i, m) { v.pb(mp(x[i] - x[0], y[i] - y[0])); }
set<pii>::iterator ite;
FOR(i, n) {
bool f = true;
FOR(j, v.size()) {
ite = st.find(mp(v[j].first + xx[i], v[j].second + yy[i]));
if (ite == st.end()) {
f = false;
break;
}
}
if (f) {
cout << xx[i] - x[0] << " " << yy[i] - y[0] << endl;
break;
}
}
}
}
int main() {
solve();
return 0;
}
|
[["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 9, 0, 1, 0, 16, 31, 16, 17, 151]]
| 1
| 355
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 10;
bitset<maxn> cookie[10];
int main() {
int R, C;
while (cin >> R >> C && (R || C)) {
int i, j;
for (int i = 0; i < R; i++)
for (int j = 0; j < C; j++) {
bool upward;
cin >> upward;
cookie[i][j] = upward;
}
int r = 1 << R;
int res = 0;
for (int i = 0; i < r; i++) {
for (int j = 0; j < R; j++) {
if (i & (1 << j))
cookie[i].flip();
}
int ans = 0;
for (int j = 0; j < C; j++) {
int up = 0;
for (int k = 0; k < R; k++) {
if (cookie[k][j])
up++;
}
ans += max(up, R - up);
}
res = max(ans, res);
for (int j = 0; j < R; j++) {
if (i & (1 << j))
cookie[j].flip();
}
}
printf("%d\n", res);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 10;
bitset<maxn> cookie[10];
int main() {
int R, C;
while (cin >> R >> C && (R || C)) {
int i, j;
for (int i = 0; i < R; i++)
for (int j = 0; j < C; j++) {
bool upward;
cin >> upward;
cookie[i][j] = upward;
}
int r = 1 << R;
int res = 0;
for (int i = 0; i < r; i++) {
for (int j = 0; j < R; j++) {
if (i & (1 << j))
cookie[j].flip();
}
int ans = 0;
for (int j = 0; j < C; j++) {
int up = 0;
for (int k = 0; k < R; k++) {
if (cookie[k][j])
up++;
}
ans += max(up, R - up);
}
res = max(ans, res);
for (int j = 0; j < R; j++) {
if (i & (1 << j))
cookie[j].flip();
}
}
printf("%d\n", res);
}
}
|
[["-", 0, 2, 63, 118, 28, 69, 341, 342, 0, 22], ["+", 0, 2, 63, 118, 28, 69, 341, 342, 0, 22]]
| 1
| 285
|
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
int r, c;
string ConvertDecToBinString(int dec_num) {
if (dec_num == 0) {
return string("0");
}
string bin_num_str;
while (dec_num) {
if ((dec_num & 1) == 0) {
bin_num_str.insert(bin_num_str.begin(), '0');
} else {
bin_num_str.insert(bin_num_str.begin(), '1');
}
dec_num >>= 1;
}
return bin_num_str;
}
int GetTurnOverMaxGoodNum(vector<vector<int>> &senbeis, int raw) {
string bin_raw_string = ConvertDecToBinString(raw);
for (size_t i = 0; i < r; i++) {
if (bin_raw_string[i] == '1') {
for (size_t j = 0; j < c; j++) {
senbeis[i][j] = 1 - senbeis[i][j];
}
}
}
int max_good_senbei_num = 0;
for (size_t j = 0; j < c; j++) {
int zero_num = 0;
for (size_t i = 0; i < r; i++) {
if (senbeis[i][j] == 0) {
zero_num++;
}
}
max_good_senbei_num += max(zero_num, r - zero_num);
}
for (size_t i = 0; i < r; i++) {
if (bin_raw_string[i] == '1') {
for (size_t j = 0; j < c; j++) {
senbeis[i][j] = 1 - senbeis[i][j];
}
}
}
return max_good_senbei_num;
}
int main() {
scanf("%d %d", &r, &c);
while (r * c != 0) {
auto senbeis = vector<vector<int>>(r, vector<int>(c));
int max_good_senbei_num = 0;
for (size_t i = 0; i < r; i++) {
for (size_t j = 0; j < c; j++) {
scanf("%d", &senbeis[i][j]);
}
}
for (size_t i = 0; i < 2 << (r - 2); i++) {
int good_num = GetTurnOverMaxGoodNum(senbeis, i);
if (max_good_senbei_num < good_num) {
max_good_senbei_num = good_num;
}
}
printf("%d\n", max_good_senbei_num);
scanf("%d %d", &r, &c);
}
return 0;
}
|
#include <cstdio>
#include <string>
#include <vector>
using namespace std;
int r, c;
string ConvertDecToBinString(int dec_num) {
if (dec_num == 0) {
return string("0");
}
string bin_num_str;
while (dec_num) {
if ((dec_num & 1) == 0) {
bin_num_str.insert(bin_num_str.begin(), '0');
} else {
bin_num_str.insert(bin_num_str.begin(), '1');
}
dec_num >>= 1;
}
return bin_num_str;
}
int GetTurnOverMaxGoodNum(vector<vector<int>> &senbeis, int raw) {
string bin_raw_string = ConvertDecToBinString(raw);
for (size_t i = 0; i < r; i++) {
if (bin_raw_string[i] == '1') {
for (size_t j = 0; j < c; j++) {
senbeis[i][j] = 1 - senbeis[i][j];
}
}
}
int max_good_senbei_num = 0;
for (size_t j = 0; j < c; j++) {
int zero_num = 0;
for (size_t i = 0; i < r; i++) {
if (senbeis[i][j] == 0) {
zero_num++;
}
}
max_good_senbei_num += max(zero_num, r - zero_num);
}
for (size_t i = 0; i < r; i++) {
if (bin_raw_string[i] == '1') {
for (size_t j = 0; j < c; j++) {
senbeis[i][j] = 1 - senbeis[i][j];
}
}
}
return max_good_senbei_num;
}
int main() {
scanf("%d %d", &r, &c);
while (r * c != 0) {
auto senbeis = vector<vector<int>>(r, vector<int>(c));
int max_good_senbei_num = 0;
for (size_t i = 0; i < r; i++) {
for (size_t j = 0; j < c; j++) {
scanf("%d", &senbeis[i][j]);
}
}
for (size_t i = 0; i < 2 << (r - 2) + 1; i++) {
int good_num = GetTurnOverMaxGoodNum(senbeis, i);
if (max_good_senbei_num < good_num) {
max_good_senbei_num = good_num;
}
}
printf("%d\n", max_good_senbei_num);
scanf("%d %d", &r, &c);
}
return 0;
}
|
[["+", 0, 7, 15, 16, 12, 16, 12, 16, 17, 72], ["+", 0, 7, 15, 16, 12, 16, 12, 16, 12, 13]]
| 1
| 499
|
#include <bits/stdc++.h>
using namespace std;
int R, C;
int cnt;
int s = 0;
bool sen[11][10001];
bool flg[11];
int fnc() {
// for(int i = 1;i <= R;i++){
// cout <<flg[i] <<" ";
// }
// printf("\n");
int ret = 0;
int senc[R + 1][C + 1];
for (int i = 1; i <= R; i++) {
for (int j = 1; j <= C; j++) {
senc[i][j] = sen[i][j];
if (flg[i] == 1) {
if (sen[i][j] == 1) {
senc[i][j] = 0;
} else if (sen[i][j] == 0) {
senc[i][j] = 1;
}
}
}
}
// for(int i = 1;i <= R;i++){
// for(int j = 1;j <= C;j++){
// cout << senc[i][j] <<" ";
// }
// printf("\n");
// }
int sum1;
int sum0;
int sum;
for (int i = 1; i <= C; i++) {
sum1 = 0;
sum0 = 0;
sum = 0;
for (int j = 1; j <= R; j++) {
if (senc[j][i] == 1)
sum1++;
if (senc[j][i] == 0)
sum0++;
}
sum = max(sum1, sum0);
// cout << sum1 <<" " << sum0 << " " << sum << endl;
// cout << sum << endl;
ret += sum;
// cout << ret << " ";
}
printf("\n");
// cout << ret <<" "<< ++s << endl ;
return ret;
}
int solve(int d) {
int ret = 0;
if (d == R)
return fnc();
ret = max(ret, solve(d + 1));
flg[d + 1] = 1;
ret = max(ret, solve(d + 1));
flg[d + 1] = 0;
return ret;
}
int main() {
while (cin >> R >> C, R) {
fill_n(flg, 11, 0);
fill_n(*sen, 11 * 10001, -1);
for (int i = 1; i <= R; i++) {
for (int j = 1; j <= C; j++) {
cin >> sen[i][j];
}
}
cout << solve(0) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int R, C;
int cnt;
int s = 0;
bool sen[11][10001];
bool flg[11];
int fnc() {
// for(int i = 1;i <= R;i++){
// cout <<flg[i] <<" ";
// }
// printf("\n");
int ret = 0;
int senc[R + 1][C + 1];
for (int i = 1; i <= R; i++) {
for (int j = 1; j <= C; j++) {
senc[i][j] = sen[i][j];
if (flg[i] == 1) {
if (sen[i][j] == 1) {
senc[i][j] = 0;
} else if (sen[i][j] == 0) {
senc[i][j] = 1;
}
}
}
}
// for(int i = 1;i <= R;i++){
// for(int j = 1;j <= C;j++){
// cout << senc[i][j] <<" ";
// }
// printf("\n");
// }
int sum1;
int sum0;
int sum;
for (int i = 1; i <= C; i++) {
sum1 = 0;
sum0 = 0;
sum = 0;
for (int j = 1; j <= R; j++) {
if (senc[j][i] == 1)
sum1++;
if (senc[j][i] == 0)
sum0++;
}
sum = max(sum1, sum0);
// cout << sum1 <<" " << sum0 << " " << sum << endl;
// cout << sum << endl;
ret += sum;
// cout << ret << " ";
}
// printf("\n");
// cout << ret <<" "<< ++s << endl ;
return ret;
}
int solve(int d) {
int ret = 0;
if (d == R)
return fnc();
ret = max(ret, solve(d + 1));
flg[d + 1] = 1;
ret = max(ret, solve(d + 1));
flg[d + 1] = 0;
return ret;
}
int main() {
while (cin >> R >> C, R) {
fill_n(flg, 11, 0);
fill_n(*sen, 11 * 10001, -1);
for (int i = 1; i <= R; i++) {
for (int j = 1; j <= C; j++) {
cin >> sen[i][j];
}
}
cout << solve(0) << endl;
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 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, 44], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]]
| 1
| 452
|
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
const int MAX_R = 15;
const int MAX_C = 10005;
bool pan[MAX_R][MAX_C] = {0};
int r, c;
void reverse(int row) {
for (int i = 0; i < c; i++) {
if (pan[row][i] == 0)
pan[row][i] = 1;
else
pan[row][i] = 0;
}
}
int dfs(int row) {
if (row == r) {
int cnt = 0;
int a, b;
for (int j = 0; j < c; j++) {
a = 0;
for (int i = 0; i < r; j++) {
if (pan[i][j] == 1)
a++;
}
b = r - a;
// a>r-a?(cnt+=a):(cnt+=(r-a));
b > a ? (cnt += b) : (cnt += a);
}
return cnt;
}
int a = dfs(row + 1);
reverse(row);
int b = dfs(row + 1);
return a > b ? a : b;
}
int main() {
while ((scanf("%d%d", &r, &c) != EOF)) {
if (r == 0 && c == 0)
break;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> pan[i][j];
}
}
cout << dfs(0) << endl;
}
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
const int MAX_R = 15;
const int MAX_C = 10005;
bool pan[MAX_R][MAX_C] = {0};
int r, c;
void reverse(int row) {
for (int i = 0; i < c; i++) {
if (pan[row][i] == 0)
pan[row][i] = 1;
else
pan[row][i] = 0;
}
}
int dfs(int row) {
if (row == r) {
int cnt = 0;
int a, ano;
for (int j = 0; j < c; j++) {
a = 0;
for (int i = 0; i < r; i++) {
if (pan[i][j] == 1)
a++;
}
ano = r - a;
// a>r-a?(cnt+=a):(cnt+=(r-a));
ano > a ? (cnt += ano) : (cnt += a);
}
return cnt;
}
int a = dfs(row + 1);
reverse(row);
int b = dfs(row + 1);
return a > b ? a : b;
}
int main() {
while ((scanf("%d%d", &r, &c) != EOF)) {
if (r == 0 && c == 0)
break;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> pan[i][j];
}
}
cout << dfs(0) << endl;
}
}
|
[["-", 8, 9, 0, 57, 64, 9, 0, 43, 49, 22], ["+", 8, 9, 0, 57, 64, 9, 0, 43, 49, 22], ["-", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 31, 22], ["-", 8, 9, 0, 1, 0, 41, 15, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 41, 15, 16, 31, 22], ["-", 0, 1, 0, 41, 64, 23, 0, 42, 0, 22], ["+", 8, 9, 0, 1, 0, 41, 64, 23, 0, 22]]
| 1
| 324
|
#include <iostream>
int R, C, s[10000][10], f[10], N, i, j, n, m;
void rec(int k) {
if (k < R) {
f[k] = 0;
rec(k + 1);
f[k] = 1;
rec(k + 1);
} else
for (n = i = 0; i<C; i++, n += m> R - m ? m : R - m) {
for (m = j = 0; j < R; j++)
m += s[i][j] ^ f[j];
N = N > n ? N : n;
}
}
main() {
for (; std::cin >> R >> C, R | C; rec(0), printf("%d\n", N))
for (j = R; j-- > 0;)
for (i = C; i-- > 0;)
std::cin >> s[i][j];
}
|
#include <iostream>
int R, C, s[10000][10], f[10], N, i, j, n, m;
void rec(int k) {
if (k < R) {
f[k] = 0;
rec(k + 1);
f[k] = 1;
rec(k + 1);
} else {
for (n = i = 0; i<C; i++, n += m> R - m ? m : R - m)
for (m = j = 0; j < R; j++)
m += s[i][j] ^ f[j];
N = N > n ? N : n;
}
}
main() {
for (; std::cin >> R >> C, R; rec(0), printf("%d\n", N))
for (j = R; j-- > 0;)
for (i = C; i-- > 0;)
std::cin >> s[i][j];
}
|
[["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["-", 0, 57, 75, 76, 0, 7, 8, 9, 0, 45], ["-", 8, 9, 0, 7, 15, 34, 12, 16, 17, 139], ["-", 8, 9, 0, 7, 15, 34, 12, 16, 12, 22]]
| 1
| 217
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int r, c;
while (cin >> r >> c && r && c) {
vector<vector<int>> v(r, vector<int>(c)), v2;
int ans = 0;
for (int i = 0; i < r; i++)
for (int j = 0; j < c; j++)
cin >> v[i][j];
for (int i = 0; i < (1 << (r - 1)); i++) {
v2 = v;
for (int j = 0; j < r - 1; j++) {
if (i & (1 << j) != 0) {
for (int k = 0; k < c; k++)
v2[j][k] = (v2[j][k] + 1) % 2;
}
}
int a = 0;
for (int j = 0; j < c; j++) {
int b = 0;
for (int k = 0; k < r; k++) {
if (v2[k][j] == 1)
b++;
}
a += max(b, r - b);
}
ans = max(ans, a);
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int r, c;
while (cin >> r >> c && r && c) {
vector<vector<int>> v(r, vector<int>(c)), v2;
int ans = 0;
for (int i = 0; i < r; i++)
for (int j = 0; j < c; j++)
cin >> v[i][j];
for (int i = 0; i < (1 << (r - 1)); i++) {
v2 = v;
for (int j = 0; j < r - 1; j++) {
if ((i & (1 << j)) != 0) {
for (int k = 0; k < c; k++)
v2[j][k] = (v2[j][k] + 1) % 2;
}
}
int a = 0;
for (int j = 0; j < c; j++) {
int b = 0;
for (int k = 0; k < r; k++) {
if (v2[k][j] == 0)
b++;
}
a += max(b, r - b);
}
ans = max(ans, a);
}
cout << ans << endl;
}
return 0;
}
|
[["+", 0, 57, 15, 339, 51, 16, 31, 23, 0, 24], ["+", 51, 16, 31, 23, 0, 16, 12, 23, 0, 25], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]]
| 1
| 280
|
#include <algorithm>
#include <iostream>
#define rep2(i, b, n) for (int i = b; i < n; ++i)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
bool fd[10][10000];
int h, w;
int search(int r) {
int res = 0;
if (r >= w) {
rep(x, w) {
int t_sum = 0;
rep(y, h) {
if (!fd[y][x])
++t_sum;
}
res += max(t_sum, h - t_sum);
}
return res;
}
rep(i, w) { fd[r][i] = !fd[r][i]; }
res = max(res, search(r + 1));
rep(i, w) { fd[r][i] = !fd[r][i]; }
res = max(res, search(r + 1));
return res;
}
int main(void) {
while (cin >> h >> w) {
rep(y, h) rep(x, w) { cin >> fd[y][x]; }
cout << search(0) << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#define rep2(i, b, n) for (int i = b; i < n; ++i)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
bool fd[10][10000];
int h, w;
int search(int r) {
int res = 0;
if (r >= h) {
rep(x, w) {
int t_sum = 0;
rep(y, h) {
if (!fd[y][x])
++t_sum;
}
res += max(t_sum, h - t_sum);
}
return res;
}
rep(i, w) { fd[r][i] = !fd[r][i]; }
res = max(res, search(r + 1));
rep(i, w) { fd[r][i] = !fd[r][i]; }
res = max(res, search(r + 1));
return res;
}
int main(void) {
while (cin >> h >> w, h | w) {
rep(y, h) rep(x, w) { cin >> fd[y][x]; }
cout << search(0) << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 0, 52, 15, 339, 51, 34, 31, 16, 12, 22], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 31, 22], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 17, 139]]
| 1
| 244
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
bool field[11][10010];
int r, c;
int calc(int bit) {
for (int i = 0; i < r; i++) {
if ((bit >> i) && 1) {
for (int j = 0; j < c; j++) {
field[i][j] = !field[i][j];
}
}
}
int ret = 0;
for (int i = 0; i < c; i++) {
int a = 0, b = 0;
for (int j = 0; j < r; j++) {
a += field[j][i];
b += !field[j][i];
}
ret += max(a, b);
}
for (int i = 0; i < r; i++) {
if (bit >> i && 1) {
for (int j = 0; j < c; j++) {
field[i][j] = !field[i][j];
}
}
}
return ret;
}
int main() {
while (cin >> r >> c) {
if (r == 0 && c == 0)
break;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> field[i][j];
}
}
int ans = 0;
for (int i = 0; i < (1 << r); i++) { // bit know reverse position
ans = max(ans, calc(i));
}
cout << ans << endl;
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
bool field[11][10010];
int r, c;
int calc(int bit) {
for (int i = 0; i < r; i++) {
if ((bit >> i) & 1) {
for (int j = 0; j < c; j++) {
field[i][j] = !field[i][j];
}
}
}
int ret = 0;
for (int i = 0; i < c; i++) {
int a = 0, b = 0;
for (int j = 0; j < r; j++) {
a += field[j][i];
b += !field[j][i];
}
ret += max(a, b);
}
for (int i = 0; i < r; i++) {
if (bit >> i & 1) {
for (int j = 0; j < c; j++) {
field[i][j] = !field[i][j];
}
}
}
return ret;
}
int main() {
while (cin >> r >> c) {
if (r == 0 && c == 0)
break;
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
cin >> field[i][j];
}
}
int ans = 0;
for (int i = 0; i < (1 << r); i++) { // bit know reverse position
ans = max(ans, calc(i));
}
cout << ans << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 67]]
| 1
| 350
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
struct island {
int way[1010];
bool kaku;
};
void slove(int n, int k) {
int a, b, c, d;
pair<int, int> pa;
island isl[1010];
for (int i = 0; i < k; i++) {
scanf("%d%d%d", &a, &b, &c);
if (a == 0) {
priority_queue<pair<int, int>> pq;
pq.push(make_pair(0, b));
while (1) {
if (pq.empty()) {
printf("-1\n");
break;
}
pa = pq.top();
pq.pop();
if (pa.second == c) {
printf("%d\n", -1 * pa.first);
break;
}
isl[pa.second].kaku = true;
for (int i = 1; i <= n; i++) {
if (isl[pa.second].way[i] < 0 && !isl[i].kaku) {
pq.push(make_pair(isl[pa.second].way[i] + pa.first, i));
}
}
}
for (int j = 1; j <= n; j++) {
isl[j].kaku = false;
}
} else {
scanf("%d", &d);
if (isl[b].way[c] < -1 * d || isl[b].way[c] == 0) {
isl[b].way[c] = -1 * d;
isl[c].way[b] = -1 * d;
}
}
}
return;
}
int main() {
int ina, inb;
while (1) {
scanf("%d%d", &ina, &inb);
if (ina + inb == 0)
break;
slove(ina, inb);
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
struct island {
int way[1010];
bool kaku;
};
void slove(int n, int k) {
int a, b, c, d;
pair<int, int> pa;
island isl[1010] = {0};
for (int i = 0; i < k; i++) {
scanf("%d%d%d", &a, &b, &c);
if (a == 0) {
priority_queue<pair<int, int>> pq;
pq.push(make_pair(0, b));
while (1) {
if (pq.empty()) {
printf("-1\n");
break;
}
pa = pq.top();
pq.pop();
if (pa.second == c) {
printf("%d\n", -1 * pa.first);
break;
}
isl[pa.second].kaku = true;
for (int i = 1; i <= n; i++) {
if (isl[pa.second].way[i] < 0 && !isl[i].kaku) {
pq.push(make_pair(isl[pa.second].way[i] + pa.first, i));
}
}
}
for (int j = 1; j <= n; j++) {
isl[j].kaku = false;
}
} else {
scanf("%d", &d);
if (isl[b].way[c] < -1 * d || isl[b].way[c] == 0) {
isl[b].way[c] = -1 * d;
isl[c].way[b] = -1 * d;
}
}
}
return;
}
int main() {
int ina, inb;
while (1) {
scanf("%d%d", &ina, &inb);
if (ina + inb == 0)
break;
slove(ina, inb);
}
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46]]
| 1
| 430
|
#include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define INF (INT_MAX / 2)
int E[100][100];
int main() {
int n, k;
while (cin >> n >> k, n | k) {
fill_n((int *)E, n * n, INF);
REP(i, n) E[i][i] = 0;
bool updated = false;
REP(i, k) {
int a, b, c, d, e;
int f;
cin >> f;
if (f == 1) {
cin >> c >> d >> e;
c--;
d--;
if (E[c][d] > e) {
E[c][d] = E[d][c] = e;
updated = true;
}
} else {
if (updated) {
updated = false;
REP(i, n)
REP(j, n) REP(k, n) E[j][k] = min(E[j][k], E[j][i] + E[i][k]);
}
cin >> a >> b;
a--;
b--;
cout << (E[a][b] == INF ? -1 : E[a][b]) << endl;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr, __VA_ARGS__)
//#define LOG(...)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define INF (INT_MAX / 2)
int E[100][100];
int main() {
int n, k;
while (cin >> n >> k, n | k) {
fill_n((int *)E, 100 * 100, INF);
REP(i, n) E[i][i] = 0;
bool updated = false;
REP(i, k) {
int a, b, c, d, e;
int f;
cin >> f;
if (f == 1) {
cin >> c >> d >> e;
c--;
d--;
if (E[c][d] > e) {
E[c][d] = E[d][c] = e;
updated = true;
}
} else {
if (updated) {
updated = false;
REP(i, n)
REP(j, n) REP(k, n) E[j][k] = min(E[j][k], E[j][i] + E[i][k]);
}
cin >> a >> b;
a--;
b--;
cout << (E[a][b] == INF ? -1 : E[a][b]) << endl;
}
}
}
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 397
|
#include <iostream>
using namespace std;
int main() {
int d[101];
bool v[101];
int map[101][101];
int mx = 99999999, mn, z, a, b, c, dd, e, hozon, k, n;
while (1) {
for (int i = 0; i < 101; i++) {
for (int j = 0; j < 101; j++) {
map[i][j] = mx;
}
d[i] = mx;
}
cin >> n >> k;
if (n == 0 && k == 0)
break;
for (int i = 0; i < k; i++) {
cin >> z;
if (z == 1) {
cin >> c >> dd >> e;
if (map[c][dd] > e) {
map[c][dd] = e;
map[dd][c] = e;
}
} else {
cin >> a >> b;
for (int j = 0; j < 101; j++) {
d[j] = mx;
v[j] = false;
}
d[a] = 0;
while (1) {
mn = mx;
for (int j = 0; j <= n; j++) {
if (mn > d[j] && v[j] == false) {
mn = d[j];
hozon = j;
}
}
// cout<<hozon<<endl;
if (mn == mx)
break;
v[hozon] = true;
for (int j = 0; j <= n; j++) {
if (d[j] > map[hozon][j] + d[hozon])
d[j] = map[hozon][j] + d[hozon];
}
}
if (d[b] == mx) {
cout << -1 << endl;
} else {
cout << d[b] << endl;
}
}
}
return 0;
}
}
|
#include <iostream>
using namespace std;
int main() {
int d[101];
bool v[101];
int map[101][101];
int mx = 99999999, mn, z, a, b, c, dd, e, hozon, k, n;
while (1) {
for (int i = 0; i < 101; i++) {
for (int j = 0; j < 101; j++) {
map[i][j] = mx;
}
d[i] = mx;
}
cin >> n >> k;
if (n == 0 && k == 0)
break;
for (int i = 0; i < k; i++) {
cin >> z;
if (z == 1) {
cin >> c >> dd >> e;
if (map[c][dd] > e) {
map[c][dd] = e;
map[dd][c] = e;
}
} else {
cin >> a >> b;
for (int j = 0; j < 101; j++) {
d[j] = mx;
v[j] = false;
}
d[a] = 0;
while (1) {
mn = mx;
for (int j = 0; j <= n; j++) {
if (mn > d[j] && v[j] == false) {
mn = d[j];
hozon = j;
}
}
// cout<<hozon<<endl;
if (mn == mx)
break;
v[hozon] = true;
for (int j = 0; j <= n; j++) {
if (d[j] > map[hozon][j] + d[hozon])
d[j] = map[hozon][j] + d[hozon];
}
}
if (d[b] == mx) {
cout << -1 << endl;
} else {
cout << d[b] << endl;
}
}
}
}
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 404
|
#include <bits/stdc++.h>
#define INF 1 << 29
using namespace std;
int d[150][150];
void wa_syaru(int n, int s, int g);
main() {
int n, k;
int num;
while (1) {
cin >> n >> k;
if (n == 0 && k == 0)
break;
fill_n(*d, 150 * 150, INF);
for (int i = 0; i < n; i++) {
d[i][i] = 0;
}
for (int i = 0; i < k; i++) {
cin >> num;
if (num == 0) {
int s, g;
cin >> s >> g;
cout << (d[s][g] == INF ? -1 : d[s][g]) << endl;
} else {
int s, g, c;
cin >> s >> g >> c;
d[s][g] = d[g][s] = min(d[s][g], c);
wa_syaru(n, s, g);
}
}
}
}
void wa_syaru(int n, int s, int g) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
d[i][j] = min(d[i][j], d[i][s] + d[s][g] + d[g][j]);
d[i][j] = min(d[i][j], d[i][g] + d[g][s] + d[s][j]);
}
}
return;
}
|
#include <bits/stdc++.h>
#define INF 1 << 29
using namespace std;
int d[150][150];
void wa_syaru(int n, int s, int g);
main() {
int n, k;
int num;
while (1) {
cin >> n >> k;
if (n == 0 && k == 0)
break;
fill_n(*d, 150 * 150, INF);
for (int i = 0; i <= n; i++) {
d[i][i] = 0;
}
for (int i = 0; i < k; i++) {
cin >> num;
if (num == 0) {
int s, g;
cin >> s >> g;
cout << (d[s][g] == INF ? -1 : d[s][g]) << endl;
} else {
int s, g, c;
cin >> s >> g >> c;
d[s][g] = d[g][s] = min(d[s][g], c);
wa_syaru(n, s, g);
}
}
}
}
void wa_syaru(int n, int s, int g) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
d[i][j] = min(d[i][j], d[i][s] + d[s][g] + d[g][j]);
d[i][j] = min(d[i][j], d[i][g] + d[g][s] + d[s][j]);
}
}
return;
}
|
[["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 361
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef complex<int> P;
int m, n, x, y;
P c[200], s[1000];
int main() {
while (cin >> m) {
if (!m)
return 0;
int mx = 9999999, my = 9999999, M;
for (int i = 0; i < m; i++) {
cin >> x >> y;
if (x < mx || x == mx && y < my) {
mx = x;
my = y;
M = i;
}
c[i] = P(x, y);
}
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x >> y;
s[i] = P(x, y);
}
for (int i = 0; i < n; i++) {
P dif = s[i] - c[M];
int f = 0;
for (int j = 0; j < m; j++) {
P t = c[j] + dif;
int f2 = 0;
for (int k = 0; k < n; k++) {
if (s[k] == t) {
f2 = 1;
break;
}
}
if (!f2) {
f = 1;
break;
}
}
if (!f) {
cout << dif.real() << endl << dif.imag() << endl;
break;
}
}
}
}
|
#include <algorithm>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef complex<int> P;
int m, n, x, y;
P c[200], s[1000];
int main() {
while (cin >> m) {
if (!m)
return 0;
int mx = 9999999, my = 9999999, M;
for (int i = 0; i < m; i++) {
cin >> x >> y;
if (x < mx || x == mx && y < my) {
mx = x;
my = y;
M = i;
}
c[i] = P(x, y);
}
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x >> y;
s[i] = P(x, y);
}
for (int i = 0; i < n; i++) {
P dif = s[i] - c[M];
int f = 0;
for (int j = 0; j < m; j++) {
P t = c[j] + dif;
int f2 = 0;
for (int k = 0; k < n; k++) {
if (s[k] == t) {
f2 = 1;
break;
}
}
if (!f2) {
f = 1;
break;
}
}
if (!f) {
cout << dif.real() << " " << dif.imag() << endl;
break;
}
}
}
}
|
[["-", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]]
| 1
| 324
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pair_i;
int main() {
int n, m;
while (cin >> m && m) {
vector<Pair_i> target(m);
for (int i = 0; i < m; i++)
cin >> target[i].first >> target[i].second;
cin >> n;
vector<Pair_i> night(n);
for (int i = 0; i < n; i++)
cin >> night[i].first >> night[i].second;
sort(night.begin(), night.end());
sort(target.begin(), target.end());
for (int i = 0; i < n; i++) {
bool flag = false;
Pair_i d = make_pair(target[0].first - night[i].first,
target[0].second - night[i].second);
for (int j = 1; j < m; j++) {
if (!binary_search(night.begin(), night.end(),
make_pair(target[j].first - d.first,
target[j].second - d.second)))
break;
else if (j == m - 1) {
cout << d.first << " " << d.second << endl;
;
flag = true;
break;
}
}
if (flag)
break;
}
}
}
|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pair_i;
int main() {
int n, m;
while (cin >> m && m) {
vector<Pair_i> target(m);
for (int i = 0; i < m; i++)
cin >> target[i].first >> target[i].second;
cin >> n;
vector<Pair_i> night(n);
for (int i = 0; i < n; i++)
cin >> night[i].first >> night[i].second;
sort(night.begin(), night.end());
sort(target.begin(), target.end());
for (int i = 0; i < n; i++) {
bool flag = false;
Pair_i d = make_pair(target[0].first - night[i].first,
target[0].second - night[i].second);
for (int j = 1; j < m; j++) {
if (!binary_search(night.begin(), night.end(),
make_pair(target[j].first - d.first,
target[j].second - d.second)))
break;
else if (j == m - 1) {
cout << -d.first << " " << -d.second << endl;
;
flag = true;
break;
}
}
if (flag)
break;
}
}
}
|
[["+", 31, 16, 31, 16, 31, 16, 12, 91, 17, 33], ["+", 0, 1, 0, 16, 31, 16, 12, 91, 17, 33]]
| 1
| 331
|
#include <iostream>
#include <queue>
using namespace std;
int main() {
int m;
int n;
int c;
int f;
int g;
int h;
int i;
int j;
int k;
while (cin >> m) {
if (m == 0) {
break;
}
int a[m];
int b[m];
c = 0;
while (c < m) {
cin >> a[c];
cin >> b[c];
c = c + 1;
}
cin >> n;
int d[n];
int e[n];
c = 0;
while (c < n) {
cin >> d[c];
cin >> e[c];
c = c + 1;
}
c = 0;
while (c < n) {
k = 0;
f = d[c] - a[0];
g = e[c] - b[0];
h = 1;
while (h < m) {
j = 0;
i = 0;
while (i < n) {
if (a[h] + f == d[i] && b[h] + g == e[i]) {
j = 1;
break;
}
i = i + 1;
}
if (j == 0) {
k = 1;
break;
}
h = h + 1;
}
if (k == 0) {
cout << g << " " << h << endl;
break;
}
c = c + 1;
}
}
}
|
#include <iostream>
#include <queue>
using namespace std;
int main() {
int m;
int n;
int c;
int f;
int g;
int h;
int i;
int j;
int k;
while (cin >> m) {
if (m == 0) {
break;
}
int a[m];
int b[m];
c = 0;
while (c < m) {
cin >> a[c];
cin >> b[c];
c = c + 1;
}
cin >> n;
int d[n];
int e[n];
c = 0;
while (c < n) {
cin >> d[c];
cin >> e[c];
c = c + 1;
}
c = 0;
while (c < n) {
k = 0;
f = d[c] - a[0];
g = e[c] - b[0];
h = 1;
while (h < m) {
j = 0;
i = 0;
while (i < n) {
if (a[h] + f == d[i] && b[h] + g == e[i]) {
j = 1;
break;
}
i = i + 1;
}
if (j == 0) {
k = 1;
break;
}
h = h + 1;
}
if (k == 0) {
cout << f << " " << g << endl;
break;
}
c = c + 1;
}
}
}
|
[["-", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["-", 64, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 64, 9, 0, 1, 0, 16, 31, 16, 12, 22]]
| 1
| 307
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int n, m;
/*
bool operator == (const P &a, const P &b)const
{
return (a.first == b.first) & (a.second == b.second);
}
*/
void solve() {
vector<P> model(n);
vector<P> dist(n);
for (int i = 0; i < n; i++)
cin >> model[i].first >> model[i].second;
for (int i = 0; i < n; i++) {
dist[i] =
P(model[0].first - model[i].first, model[0].second - model[i].second);
// cout << dist[i].first << ' ' << dist[i].second << endl;
}
sort(dist.begin(), dist.end());
cin >> m;
vector<P> some(m);
for (int j = 0; j < m; j++) {
cin >> some[j].first >> some[j].second;
}
for (int i = 0; i < m; i++) {
int c = 0;
for (int j = 0; j < m; j++) {
P sdist =
P(some[i].first - some[j].first, some[i].second - some[j].second);
if (binary_search(dist.begin(), dist.end(), sdist)) {
c++;
}
}
if (c == n) {
cout << some[0].first - model[0].first << ' '
<< some[i].second - model[0].second << endl;
break;
}
}
}
int main(void) {
while (cin >> n, n)
solve();
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int n, m;
/*
bool operator == (const P &a, const P &b)const
{
return (a.first == b.first) & (a.second == b.second);
}
*/
void solve() {
vector<P> model(n);
vector<P> dist(n);
for (int i = 0; i < n; i++)
cin >> model[i].first >> model[i].second;
for (int i = 0; i < n; i++) {
dist[i] =
P(model[0].first - model[i].first, model[0].second - model[i].second);
// cout << dist[i].first << ' ' << dist[i].second << endl;
}
sort(dist.begin(), dist.end());
cin >> m;
vector<P> some(m);
for (int j = 0; j < m; j++) {
cin >> some[j].first >> some[j].second;
}
for (int i = 0; i < m; i++) {
int c = 0;
for (int j = 0; j < m; j++) {
P sdist =
P(some[i].first - some[j].first, some[i].second - some[j].second);
if (binary_search(dist.begin(), dist.end(), sdist)) {
c++;
}
}
if (c == n) {
cout << some[i].first - model[0].first << ' '
<< some[i].second - model[0].second << endl;
break;
}
}
}
int main(void) {
while (cin >> n, n)
solve();
return 0;
}
|
[["-", 12, 16, 31, 118, 28, 69, 341, 342, 0, 13], ["+", 12, 16, 31, 118, 28, 69, 341, 342, 0, 22]]
| 1
| 355
|
for e in iter(input,'0'):
a={tuple(map(int,input().split())) for _ in range(int(e))}
s,t=a[0]
b={tuple(map(int,input().split())) for _ in range(int(input()))}
for x,y in b:
flag = True
for u,v in a[1:]:
if(x+u-s,y+v-t)not in b:
flag = False
break
if flag == True:
print(x - s, y - t)
break
|
for e in iter(input,'0'):
a=list(tuple(map(int,input().split())) for _ in range(int(e)))
s,t=a[0]
b={tuple(map(int,input().split())) for _ in range(int(input()))}
for x,y in b:
flag = True
for u,v in a[1:]:
if(x+u-s,y+v-t)not in b:
flag = False
break
if flag == True:
print(x - s, y - t)
break
|
[["-", 8, 196, 0, 1, 0, 662, 12, 689, 0, 45], ["+", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 668, 0, 24], ["-", 8, 196, 0, 1, 0, 662, 12, 689, 0, 46], ["+", 0, 1, 0, 662, 12, 652, 3, 668, 0, 25]]
| 5
| 139
|
for e in iter(input,'0'):
a={tuple(map(int,input().split())) for _ in range(int(e))}
s,t=a[0]
b={tuple(map(int,input().split())) for _ in range(int(input()))}
for x,y in b:
flag = True
for u,v in a[1:]:
if(x+u-s,y+v-t)not in b:
flag = False
break
if flag == True:
print(x - s, y - t)
break
|
for e in iter(input,'0'):
a=list(tuple(map(int,input().split())) for _ in range(int(e)))
s,t=a[0]
b=[tuple(map(int,input().split())) for _ in range(int(input()))]
for x,y in b:
flag = True
for u,v in a[1:]:
if(x+u-s,y+v-t)not in b:
flag = False
break
if flag == True:
print(x - s, y - t)
break
|
[["-", 8, 196, 0, 1, 0, 662, 12, 689, 0, 45], ["+", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 668, 0, 24], ["-", 8, 196, 0, 1, 0, 662, 12, 689, 0, 46], ["+", 0, 1, 0, 662, 12, 652, 3, 668, 0, 25], ["+", 8, 196, 0, 1, 0, 662, 12, 658, 0, 70], ["+", 8, 196, 0, 1, 0, 662, 12, 658, 0, 73]]
| 5
| 139
|
import java.util.Scanner;
public class Main {
private static boolean debug = false;
private static int r;
private static int c;
private static int[][] senbeis;
private static int URA = 0, OMOTE = 1;
@SuppressWarnings("unused")
private static void debug(String format, Object... objects) {
if (!debug)
return;
System.out.format(format, objects);
}
public static int solve() {
int ans = 0;
for (int trial = 0; trial < (2 << 10); trial++) {
int canSell = 0;
for (int x = 0; x < c; x++) {
int ura = 0;
for (int y = 0; y < r; y++) {
boolean reverses = ((y >> trial) & 1) == 0;
int target = reverses ? URA : OMOTE;
ura += (senbeis[y][x] == target) ? 1 : 0;
}
canSell += Math.max(ura, r - ura);
}
ans = Math.max(ans, canSell);
}
return ans;
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while (true) {
r = scanner.nextInt();
c = scanner.nextInt();
if (r == 0 && c == 0) {
break;
}
senbeis = new int[r][c];
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
senbeis[i][j] = scanner.nextInt();
}
}
debug("===\n");
debug("%d %d\n", r, c);
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
debug("%d ", senbeis[i][j]);
}
debug("\n");
}
debug("===\n");
System.out.format("%d\n", solve());
}
scanner.close();
}
}
|
import java.util.Scanner;
public class Main {
private static boolean debug = false;
private static int r;
private static int c;
private static int[][] senbeis;
private static int URA = 0, OMOTE = 1;
@SuppressWarnings("unused")
private static void debug(String format, Object... objects) {
if (!debug)
return;
System.out.format(format, objects);
}
public static int solve() {
int ans = 0;
for (int trial = 0; trial < (2 << r); trial++) {
int canSell = 0;
for (int x = 0; x < c; x++) {
int ura = 0;
for (int y = 0; y < r; y++) {
boolean reverses = ((trial >> y) & 1) == 0;
int target = reverses ? URA : OMOTE;
ura += (senbeis[y][x] == target) ? 1 : 0;
}
canSell += Math.max(ura, r - ura);
}
ans = Math.max(ans, canSell);
}
return ans;
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while (true) {
r = scanner.nextInt();
c = scanner.nextInt();
if (r == 0 && c == 0) {
break;
}
senbeis = new int[r][c];
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
senbeis[i][j] = scanner.nextInt();
}
}
debug("===\n");
debug("%d %d\n", r, c);
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
debug("%d ", senbeis[i][j]);
}
debug("\n");
}
debug("===\n");
System.out.format("%d\n", solve());
}
scanner.close();
}
}
|
[["-", 0, 7, 15, 16, 12, 23, 0, 16, 12, 499], ["+", 0, 7, 15, 16, 12, 23, 0, 16, 12, 22], ["-", 31, 23, 0, 16, 31, 23, 0, 16, 31, 22], ["-", 31, 23, 0, 16, 31, 23, 0, 16, 17, 152], ["+", 31, 23, 0, 16, 31, 23, 0, 16, 17, 152], ["+", 31, 23, 0, 16, 31, 23, 0, 16, 12, 22]]
| 3
| 452
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define mem(x, y) (x *)malloc(sizeof(x) * (y));
int main() {
int r, c, i, j, k;
int *list;
int **data;
int *count;
while (scanf("%d %d", &r, &c), r) {
if (r == 1)
printf("%d\n", c);
else {
list = mem(int, 2 << (r - 1));
count = mem(int, 2 << (r - 1));
data = mem(int *, r);
for (i = 0; i < r; i++) {
data[i] = mem(int, c);
for (j = 0; j < c; j++) {
scanf("%d", &data[i][j]);
}
}
for (i = 0; i < c; i++) {
int num = 0;
for (j = 0; j < (r - 1); j++) {
num += data[j][i] << j;
}
list[num]++;
}
for (i = 0; i < (2 << (r - 1)); i++) {
count[i] = 0;
}
const half_r = r >> 1;
for (i = 0; i < (2 << (r - 1)); i++) {
for (j = 0; j < (2 << (r - 1)); j++) {
int num = 0;
for (k = 0; k < r; k++) {
if (((~(j ^ i)) >> k) & 1) {
num++;
}
}
if (num <= half_r) {
num = r - num;
}
count[i] += num * list[j];
}
}
int max = 0;
for (i = 0; i < (2 << (r - 1)); i++) {
if (max < count[i]) {
max = count[i];
}
}
printf("%d\n", max);
}
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define mem(x, y) (x *)malloc(sizeof(x) * (y));
int main() {
int r, c, i, j, k;
int *list;
int **data;
int *count;
while (scanf("%d %d", &r, &c), r) {
if (r == 1)
printf("%d\n", c);
else {
list = mem(int, 2 << (r - 1));
count = mem(int, 2 << (r - 1));
data = mem(int *, r);
for (i = 0; i < r; i++) {
data[i] = mem(int, c);
for (j = 0; j < c; j++) {
scanf("%d", &data[i][j]);
}
}
for (i = 0; i < c; i++) {
int num = 0;
for (j = 0; j < r; j++) {
num += data[j][i] << j;
}
list[num]++;
}
for (i = 0; i < (2 << (r - 1)); i++) {
count[i] = 0;
}
const int half_r = r >> 1;
for (i = 0; i < (2 << (r - 1)); i++) {
for (j = 0; j < (2 << (r - 1)); j++) {
int num = 0;
for (k = 0; k < r; k++) {
if (((~(j ^ i)) >> k) & 1) {
num++;
}
}
if (num <= half_r) {
num = r - num;
}
count[i] += num * list[j];
}
}
int max = 0;
for (i = 0; i < (2 << (r - 1)); i++) {
if (max < count[i]) {
max = count[i];
}
}
printf("%d\n", max);
}
}
return 0;
}
|
[["-", 8, 9, 0, 7, 15, 16, 12, 23, 0, 24], ["-", 0, 7, 15, 16, 12, 23, 0, 16, 17, 33], ["-", 0, 7, 15, 16, 12, 23, 0, 16, 12, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 23, 0, 25], ["+", 0, 57, 75, 76, 0, 9, 0, 43, 39, 40], ["-", 75, 76, 0, 9, 0, 43, 39, 78, 0, 22]]
| 0
| 448
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int R, C;
while (1) {
cin >> R >> C;
if (R == 0 && C == 0)
break;
vector<vector<bool>> senbei(R, vector<bool>(C));
for (int i = 0, x; i < R; ++i) {
for (int j = 0; j < C; ++j) {
cin >> x;
senbei[i][j] = x & 1 ? true : false;
}
}
int ans = 0;
int m;
for (int b = 0; b < 1 << R; ++b) {
vector<vector<bool>> senbei_tmp = senbei;
for (int i = 0; i < R; ++i) {
if (b & (1 << i)) {
for (auto &&s : senbei_tmp[i])
s = ~s;
}
}
m = 0;
for (int i = 0; i < C; ++i) {
int sum = 0;
for (int j = 0; j < R; ++j)
if (senbei_tmp[j][i])
++sum;
m += max(sum, R - sum);
}
ans = max(ans, m);
}
cout << ans << endl;
}
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int R, C;
while (1) {
cin >> R >> C;
if (R == 0 && C == 0)
break;
vector<vector<bool>> senbei(R, vector<bool>(C));
for (int i = 0, x; i < R; ++i) {
for (int j = 0; j < C; ++j) {
cin >> x;
senbei[i][j] = x & 1 ? true : false;
}
}
int ans = 0;
int m;
for (int b = 0; b < 1 << R; ++b) {
vector<vector<bool>> senbei_tmp = senbei;
for (int i = 0; i < R; ++i) {
if (b & (1 << i)) {
for (auto &&s : senbei_tmp[i])
s = !s;
}
}
m = 0;
for (int i = 0; i < C; ++i) {
int sum = 0;
for (int j = 0; j < R; ++j)
if (senbei_tmp[j][i])
++sum;
m += max(sum, R - sum);
}
ans = max(ans, m);
}
cout << ans << endl;
}
}
|
[["-", 0, 338, 8, 1, 0, 11, 12, 91, 17, 92], ["+", 0, 338, 8, 1, 0, 11, 12, 91, 17, 111]]
| 1
| 276
|
// Solution for 0525: Osenbei
#include <algorithm>
#include <iostream>
using namespace std;
int r, c, ans, sum;
int cracker[11][10001], save[11][10001];
void solve(int i) {
sum = 0;
for (int j = 1; j <= c; j++) {
save[i][j] = cracker[i][j];
if (cracker[i][j])
cracker[i][j] = 0;
else
cracker[i][j] = 1;
int count = 0;
for (int k = 1; k <= r; k++) {
if (cracker[k][j])
count++;
}
if (count > r / 2)
sum += count;
else
sum += r - count;
}
ans = max(ans, sum);
if (i == c)
return;
for (int j = i + 1; i <= c; i++) {
solve(j);
for (int k = 1; k <= c; k++) {
cracker[j][k] = save[j][k];
}
}
}
int main() {
while (true) {
cin >> r >> c;
if (!r && !c)
return 0;
ans = 0;
for (int i = 1; i <= r; i++) {
for (int j = 1; j <= c; j++) {
cin >> cracker[i][j];
}
}
for (int i = 1; i <= r; i++) {
solve(i);
}
cout << ans << endl;
}
}
|
// Solution for 0525: Osenbei
#include <algorithm>
#include <iostream>
using namespace std;
int r, c, ans, sum;
int cracker[11][10001], save[11][10001];
void solve(int i) {
sum = 0;
for (int j = 1; j <= c; j++) {
save[i][j] = cracker[i][j];
if (cracker[i][j])
cracker[i][j] = 0;
else
cracker[i][j] = 1;
int count = 0;
for (int k = 1; k <= r; k++) {
if (cracker[k][j])
count++;
}
if (count > r / 2)
sum += count;
else
sum += r - count;
}
ans = max(ans, sum);
if (i == r)
return;
for (int j = i + 1; j <= r; j++) {
solve(j);
for (int k = 1; k <= c; k++) {
cracker[j][k] = save[j][k];
}
}
}
int main() {
while (true) {
cin >> r >> c;
if (!r && !c)
return 0;
ans = 0;
for (int i = 1; i <= r; i++) {
for (int j = 1; j <= c; j++) {
cin >> cracker[i][j];
}
}
for (int i = 1; i <= r; i++) {
solve(i);
}
cout << ans << endl;
}
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22]]
| 1
| 337
|
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
#define dump(n) cout << "# " << #n << "=" << (n) << endl
#define debug(n) \
cout << __FILE__ << "," << __LINE__ << ": #" << #n << "=" << (n) << endl
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, n) repi(i, 0, n)
#define iter(c) __typeof((c).begin())
#define foreach(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define allof(c) (c).begin(), (c).end()
#define mp make_pair
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
int VCount(const vvi &s, int j) {
int res = 0;
rep(i, s.size()) res += s[i][j];
return res;
}
int main() {
for (int h, w; cin >> h >> w, h | w;) {
vvi s(h, vi(w));
rep(i, h) rep(j, w) cin >> s[i][j];
int res = 0;
rep(bit, 1 << h) {
vvi temp = s;
rep(i, h) if ((1 << i) & bit)
transform(allof(s[i]), s[i].begin(), logical_not<int>());
int sum = 0;
rep(j, w) {
int vc = VCount(temp, j);
sum += max(vc, h - vc);
}
res = max(res, sum);
}
cout << res << endl;
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
#define dump(n) cout << "# " << #n << "=" << (n) << endl
#define debug(n) \
cout << __FILE__ << "," << __LINE__ << ": #" << #n << "=" << (n) << endl
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, n) repi(i, 0, n)
#define iter(c) __typeof((c).begin())
#define foreach(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define allof(c) (c).begin(), (c).end()
#define mp make_pair
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
int VCount(const vvi &s, int j) {
int res = 0;
rep(i, s.size()) res += s[i][j];
return res;
}
int main() {
for (int h, w; cin >> h >> w, h | w;) {
vvi s(h, vi(w));
rep(i, h) rep(j, w) cin >> s[i][j];
int res = 0;
rep(bit, 1 << h) {
vvi temp = s;
rep(i, h) if ((1 << i) & bit)
transform(allof(temp[i]), temp[i].begin(), logical_not<int>());
int sum = 0;
rep(j, w) {
int vc = VCount(temp, j);
sum += max(vc, h - vc);
}
res = max(res, sum);
}
cout << res << endl;
}
return 0;
}
|
[["-", 3, 4, 0, 2, 3, 4, 0, 69, 28, 22], ["+", 3, 4, 0, 2, 3, 4, 0, 69, 28, 22], ["-", 3, 4, 0, 2, 63, 118, 28, 69, 28, 22], ["+", 3, 4, 0, 2, 63, 118, 28, 69, 28, 22]]
| 1
| 373
|
#include <algorithm>
#include <iostream>
using namespace std;
const int MAX_Y = 10000;
const int MAX_X = 10;
int a[MAX_X][MAX_Y] = {0};
int n, m;
void solve() {
while (cin >> n >> m && n && m) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
int d = 0, r = 0;
// 1 << n 种情况
for (int i = 0; i < (1 << n); i++) {
//每种情况统计每一列该不该反面
int s = 0;
for (int j = 0; j < m; j++) {
int c = 0;
for (int k = 0; k < n; k++) {
d = (i >> k) & 1;
c += a[k][j] ^ d;
}
s += max(c, m - c);
}
r = max(r, s);
}
cout << r << endl;
}
}
int main() { solve(); }
|
#include <algorithm>
#include <iostream>
using namespace std;
const int MAX_Y = 10000;
const int MAX_X = 10;
int a[MAX_X][MAX_Y] = {0};
int n, m;
void solve() {
while (cin >> n >> m && n && m) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> a[i][j];
}
}
int d = 0, r = 0;
// 1 << n 种情况
for (int i = 0; i < (1 << n - 1); i++) {
//每种情况统计每一列该不该反面
int s = 0;
for (int j = 0; j < m; j++) {
int c = 0;
for (int k = 0; k < n; k++) {
d = (i >> k) & 1;
c += a[k][j] ^ d;
}
s += max(c, n - c);
}
r = max(r, s);
}
cout << r << endl;
}
}
int main() { solve(); }
|
[["+", 15, 16, 12, 23, 0, 16, 12, 16, 17, 33], ["+", 15, 16, 12, 23, 0, 16, 12, 16, 12, 13], ["-", 0, 11, 12, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 31, 22]]
| 1
| 231
|
#include <stdio.h>
int main() {
int ha, ma, sa, hb, mb, sb, seca, secb, sum, i;
for (i = 0; i < 3; i++) {
scanf("%d %d %d %d %d %d\n", &ha, &ma, &sa, &hb, &mb, &sb);
seca = ha * 3600 + ma * 60 + sa;
secb = hb * 3600 + mb * 60 * mb;
sum = secb - seca;
ha = sum / 3600;
ma = (sum % 3600) / 60;
sa = (sum % 3600) % 60;
printf("%d %d %d\n", ha, ma, sa);
}
return 0;
}
|
#include <stdio.h>
int main() {
int ha, ma, sa, hb, mb, sb, seca, secb, sum, i;
for (i = 0; i < 3; i++) {
scanf("%d %d %d %d %d %d\n", &ha, &ma, &sa, &hb, &mb, &sb);
seca = ha * 3600 + ma * 60 + sa;
secb = hb * 3600 + mb * 60 + sb;
sum = secb - seca;
ha = sum / 3600;
ma = (sum % 3600) / 60;
sa = (sum % 3600) % 60;
printf("%d %d %d\n", ha, ma, sa);
}
return 0;
}
|
[["-", 0, 1, 0, 11, 12, 16, 12, 16, 17, 48], ["-", 0, 1, 0, 11, 12, 16, 12, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22]]
| 0
| 143
|
#include <stdio.h>
int main() {
int h1, m1, s1, h2, m2, s2, i;
for (i = 0; i < 3; i++) {
scanf(" %d %d %d %d %d %d", &h1, &m1, &s1, &h2, &m2, &s2);
s2 -= s1;
if (s2 < 0) {
s2 += 60;
m2--;
}
m2 -= 1;
if (m2 < 0) {
m2 += 60;
h2--;
}
h2 -= h1;
printf("%d %d %d\n", h2, m2, s2);
}
return 0;
}
|
#include <stdio.h>
int main() {
int h1, m1, s1, h2, m2, s2, i;
for (i = 0; i < 3; i++) {
scanf(" %d %d %d %d %d %d", &h1, &m1, &s1, &h2, &m2, &s2);
s2 -= s1;
if (s2 < 0) {
s2 += 60;
m2--;
}
m2 -= m1;
if (m2 < 0) {
m2 += 60;
h2--;
}
h2 -= h1;
printf("%d %d %d\n", h2, m2, s2);
}
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 12, 22]]
| 0
| 122
|
#include <stdio.h>
int main() {
int h[3][2], m[3][2], s[3][2], i, k, koh[3], kom[3], kos[3], da = 0, de = 0;
for (k = 0; k < 3; k++) {
scanf("%d %d %d %d %d %d", &h[k][0], &m[k][0], &s[k][0], &h[k][1], &m[k][1],
&s[k][1]);
}
for (i = 0; i < 3; i++) {
if (s[i][0] <= s[i][1]) {
kos[i] = s[i][1] - s[i][0];
} else {
kos[i] = s[i][1] + 60 - s[i][0];
m[i][1] - 1;
}
if (m[i][0] <= m[i][1]) {
kom[i] = m[i][1] - m[i][0];
} else {
kom[i] = m[i][1] + 60 - m[i][0];
h[i][1] - 1;
}
koh[i] = h[i][1] - h[i][0];
printf("%d %d %d\n", koh[i] - de, kom[i] - da, kos[i]);
}
return 0;
}
|
#include <stdio.h>
int main() {
int h[3][2], m[3][2], s[3][2], i, k, koh[3], kom[3], kos[3], da = 0, de = 0;
for (k = 0; k < 3; k++) {
scanf("%d %d %d %d %d %d", &h[k][0], &m[k][0], &s[k][0], &h[k][1], &m[k][1],
&s[k][1]);
}
for (i = 0; i < 3; i++) {
if (s[i][0] <= s[i][1]) {
kos[i] = s[i][1] - s[i][0];
} else {
kos[i] = s[i][1] + 60 - s[i][0];
m[i][1]--;
}
if (m[i][0] <= m[i][1]) {
kom[i] = m[i][1] - m[i][0];
} else {
kom[i] = m[i][1] + 60 - m[i][0];
h[i][1]--;
}
koh[i] = h[i][1] - h[i][0];
printf("%d %d %d\n", koh[i] - de, kom[i] - da, kos[i]);
}
return 0;
}
|
[["-", 75, 76, 0, 9, 0, 1, 0, 16, 17, 33], ["-", 75, 76, 0, 9, 0, 1, 0, 16, 12, 13], ["+", 75, 76, 0, 9, 0, 1, 0, 27, 17, 68]]
| 0
| 356
|
#include "stdio.h"
typedef struct {
int Arrive[3];
int Leave[3];
} Time;
void timecal(int arrive[3], int leave[3], int result[3]) {
int temp;
for (temp = 2; temp > 0; temp--) {
result[temp] = (leave[temp] - arrive[temp]);
if (result[temp] < 0) {
result[temp] = 60 + result[temp];
leave[temp - 1]--;
}
result[0] = leave[0] - arrive[0];
}
}
int main(void) {
int temp;
int res1[3], res2[3], res3[3];
Time A;
Time B;
Time C;
for (temp = 0; temp < 3; temp++) {
scanf("%d", &A.Arrive[temp]);
}
for (temp = 0; temp < 3; temp++) {
scanf("%d", &A.Leave[temp]);
}
for (temp = 0; temp < 3; temp++) {
scanf("%d", &B.Arrive[temp]);
}
for (temp = 0; temp < 3; temp++) {
scanf("%d", &B.Leave[temp]);
}
for (temp = 0; temp < 3; temp++) {
scanf("%d", &C.Arrive[temp]);
}
for (temp = 0; temp < 3; temp++) {
scanf("%d", &C.Leave[temp]);
}
timecal(A.Arrive, A.Leave, res1);
printf("%d %d %d", res1[0], res1[1], res1[2]);
timecal(B.Arrive, B.Leave, res2);
printf("%d %d %d", res2[0], res2[1], res2[2]);
timecal(C.Arrive, C.Leave, res3);
printf("%d %d %d", res3[0], res3[1], res3[2]);
return 0;
}
|
#include "stdio.h"
typedef struct {
int Arrive[3];
int Leave[3];
} Time;
void timecal(int arrive[3], int leave[3], int result[3]) {
int temp;
for (temp = 2; temp > 0; temp--) {
result[temp] = (leave[temp] - arrive[temp]);
if (result[temp] < 0) {
result[temp] = 60 + result[temp];
leave[temp - 1]--;
}
result[0] = leave[0] - arrive[0];
}
}
int main(void) {
int temp;
int res1[3], res2[3], res3[3];
Time A;
Time B;
Time C;
for (temp = 0; temp < 3; temp++) {
scanf("%d", &A.Arrive[temp]);
}
for (temp = 0; temp < 3; temp++) {
scanf("%d", &A.Leave[temp]);
}
for (temp = 0; temp < 3; temp++) {
scanf("%d", &B.Arrive[temp]);
}
for (temp = 0; temp < 3; temp++) {
scanf("%d", &B.Leave[temp]);
}
for (temp = 0; temp < 3; temp++) {
scanf("%d", &C.Arrive[temp]);
}
for (temp = 0; temp < 3; temp++) {
scanf("%d", &C.Leave[temp]);
}
timecal(A.Arrive, A.Leave, res1);
printf("%d %d %d\n", res1[0], res1[1], res1[2]);
timecal(B.Arrive, B.Leave, res2);
printf("%d %d %d\n", res2[0], res2[1], res2[2]);
timecal(C.Arrive, C.Leave, res3);
printf("%d %d %d\n", res3[0], res3[1], res3[2]);
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 449
|
#include <stdio.h>
int main() {
int h1[3], m1[3], s1[3];
int h2[3], m2[3], s2[3];
int h[3], m[3], s[3];
int i;
for (i = 0; i < 3; i++) {
scanf("%d%d%d%d%d%d", &h1[i], &m1[i], &s1[i], &h2[i], &m2[i], &s2[i]);
}
for (i = 0; i < 3; i++) {
int x[3];
int y[3];
y[i] = h2[i] * 3600 + m2[i] * 60 + s2[i];
x[i] = h1[i] * 3600 + m1[i] * 60 + s1[i];
int z[3];
z[i] = y[i] - x[i];
h[i] = z[i] / 3600;
z[i] -= h[i] * 3600;
m[i] = z[i] / 60;
z[i] -= m[i] * 60;
s[i] = z[i];
printf("%d%d%d\n", h[i], m[i], s[i]);
}
return 0;
}
|
#include <stdio.h>
int main() {
int h1[3], m1[3], s1[3];
int h2[3], m2[3], s2[3];
int h[3], m[3], s[3];
int i;
for (i = 0; i < 3; i++) {
scanf("%d%d%d%d%d%d", &h1[i], &m1[i], &s1[i], &h2[i], &m2[i], &s2[i]);
}
for (i = 0; i < 3; i++) {
int x[3];
int y[3];
y[i] = h2[i] * 3600 + m2[i] * 60 + s2[i];
x[i] = h1[i] * 3600 + m1[i] * 60 + s1[i];
int z[3];
z[i] = y[i] - x[i];
h[i] = z[i] / 3600;
z[i] -= h[i] * 3600;
m[i] = z[i] / 60;
z[i] -= m[i] * 60;
s[i] = z[i];
printf("%d %d %d\n", h[i], m[i], s[i]);
}
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 297
|
#include <stdio.h>
int main() {
int ah;
int am;
int as;
int bh;
int bm;
int bs;
int h;
int hh;
int m;
int mm;
int mmm;
int s;
int i;
for (i = 2; i >= 0; i--) {
scanf("%d %d %d", ah, am, as);
scanf("%d %d %d", bh, bm, bs);
h = bh - ah;
if (am > bm) {
hh = h - 1;
m = bm + 60 - am;
if (as > bs) {
mm = m - 1;
s = bs + 60 - as;
printf("%d %d %d\n", hh, mm, s);
} else {
s = bs - as;
printf("%d %d %d\n", hh, m, s);
}
} else {
m = bm - am;
if (as > bs) {
mm = m - 1;
s = bs + 60 - as;
if (mm < 0) {
hh = h - 1;
mmm = 59;
printf("%d %d %d\n", hh, mmm, s);
} else {
printf("%d %d %d\n", h, mm, s);
}
} else {
s = bs - as;
printf("%d %d %d\n", h, m, s);
}
}
}
return 0;
}
|
#include <stdio.h>
int main() {
int ah;
int am;
int as;
int bh;
int bm;
int bs;
int h;
int hh;
int m;
int mm;
int mmm;
int s;
int i;
for (i = 2; i >= 0; i--) {
scanf("%d %d %d", &ah, &am, &as);
scanf("%d %d %d", &bh, &bm, &bs);
h = bh - ah;
if (am > bm) {
hh = h - 1;
m = bm + 60 - am;
if (as > bs) {
mm = m - 1;
s = bs + 60 - as;
printf("%d %d %d\n", hh, mm, s);
} else {
s = bs - as;
printf("%d %d %d\n", hh, m, s);
}
} else {
m = bm - am;
if (as > bs) {
mm = m - 1;
s = bs + 60 - as;
if (mm < 0) {
hh = h - 1;
mmm = 59;
printf("%d %d %d\n", hh, mmm, s);
} else {
printf("%d %d %d\n", h, mm, s);
}
} else {
s = bs - as;
printf("%d %d %d\n", h, m, s);
}
}
}
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]]
| 0
| 281
|
#include <stdio.h>
int main(void) {
int a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, V, w, x, y,
z, A, B, C, D, E, F, G, H, I, J;
scanf("%d %d %d %d %d %d\n%d %d %d %d %d %d\n%d %d %d %d %d %d", &a, &b, &c,
&d, &e, &f, &g, &h, &i, &j, &k, &l, &m, &n, &o, &p, &q, &r);
s = 3600 * a + 60 * b + c;
t = 3600 * d + 60 * e + f;
u = 3600 * g + 60 * h + i;
V = 3600 * j + 60 * k + l;
w = 3600 * m + 60 * n + o;
x = 3600 * p + 60 * q + r;
y = t - x;
z = V - u;
A = x - w;
B = y / 3600;
C = y / 60 - B * 60;
D = y - B * 3600 - C * 60;
E = z / 3600;
F = z / 60 - E * 60;
G = z - E * 3600 - F * 60;
H = A / 3600;
I = A / 60 - H * 60;
J = A - H * 3600 - I * 60;
printf("%d %d %d\n%d %d %d\n%d %d %d\n", B, C, D, E, F, G, H, I, J);
return 0;
}
|
#include <stdio.h>
int main(void) {
int a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, V, w, x, y,
z, A, B, C, D, E, F, G, H, I, J;
scanf("%d %d %d %d %d %d\n%d %d %d %d %d %d\n%d %d %d %d %d %d", &a, &b, &c,
&d, &e, &f, &g, &h, &i, &j, &k, &l, &m, &n, &o, &p, &q, &r);
s = 3600 * a + 60 * b + c;
t = 3600 * d + 60 * e + f;
u = 3600 * g + 60 * h + i;
V = 3600 * j + 60 * k + l;
w = 3600 * m + 60 * n + o;
x = 3600 * p + 60 * q + r;
y = t - s;
z = V - u;
A = x - w;
B = y / 3600;
C = y / 60 - B * 60;
D = y - B * 3600 - C * 60;
E = z / 3600;
F = z / 60 - E * 60;
G = z - E * 3600 - F * 60;
H = A / 3600;
I = A / 60 - H * 60;
J = A - H * 3600 - I * 60;
printf("%d %d %d\n%d %d %d\n%d %d %d\n", B, C, D, E, F, G, H, I, J);
return 0;
}
|
[["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22]]
| 0
| 354
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ALL(co) co.begin(), co.end()
#define tpl(...) make_tuple(__VA_ARGS__)
typedef long long LL;
typedef pair<int, int> P;
typedef pair<int, P> IP;
typedef pair<P, P> PP;
typedef vector<int> Array;
typedef vector<vector<int>> Array2;
typedef vector<LL> LArray;
typedef vector<P> PArray;
typedef vector<string> SArray;
const int INF = 1 << 29;
const LL LINF = 1LL << 60;
inline int getInt() {
int itiv;
return (cin >> itiv, itiv);
}
template <typename T> void readAll(vector<T> &vec) {
for (int i = 0, size = vec.size(); i < size; i++)
cin >> vec[i];
}
template <typename T, typename U> void readAll(vector<pair<T, U>> &vec) {
for (int i = 0, size = vec.size(); i < size; i++)
cin >> vec[i].first >> vec[i].second;
}
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
};
inline bool between(int min, int max, int n) { return min <= n && n <= max; }
inline bool inRange(int begin, int end, int n) { return begin <= n && n < end; }
inline bool inRange(int size, int n) { return 0 <= n && n < size; }
int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
int dr[] = {0, -1, 0, 1}, dc[] = {-1, 0, 1, 0};
int m, n;
int main(void) {
string str;
for (int i = 0; i < 3; i++) {
int h1, m1, s1, h2, m2, s2;
cin >> h1 >> m1 >> s1 >> h2 >> m2 >> s2;
int hs = h2 - h1, ms = m2 - m1, ss = s2 - s1;
if (ss < 0)
(ms - 1, ss = 60 + ss);
if (ms < 0)
(hs - 1, ms = 60 + ms);
cout << hs << ' ' << ms << ' ' << ss << endl;
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ALL(co) co.begin(), co.end()
#define tpl(...) make_tuple(__VA_ARGS__)
typedef long long LL;
typedef pair<int, int> P;
typedef pair<int, P> IP;
typedef pair<P, P> PP;
typedef vector<int> Array;
typedef vector<vector<int>> Array2;
typedef vector<LL> LArray;
typedef vector<P> PArray;
typedef vector<string> SArray;
const int INF = 1 << 29;
const LL LINF = 1LL << 60;
inline int getInt() {
int itiv;
return (cin >> itiv, itiv);
}
template <typename T> void readAll(vector<T> &vec) {
for (int i = 0, size = vec.size(); i < size; i++)
cin >> vec[i];
}
template <typename T, typename U> void readAll(vector<pair<T, U>> &vec) {
for (int i = 0, size = vec.size(); i < size; i++)
cin >> vec[i].first >> vec[i].second;
}
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
};
inline bool between(int min, int max, int n) { return min <= n && n <= max; }
inline bool inRange(int begin, int end, int n) { return begin <= n && n < end; }
inline bool inRange(int size, int n) { return 0 <= n && n < size; }
int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
int dr[] = {0, -1, 0, 1}, dc[] = {-1, 0, 1, 0};
int m, n;
int main(void) {
string str;
for (int i = 0; i < 3; i++) {
int h1, m1, s1, h2, m2, s2;
cin >> h1 >> m1 >> s1 >> h2 >> m2 >> s2;
int hs = h2 - h1, ms = m2 - m1, ss = s2 - s1;
if (ss < 0)
(ms -= 1, ss = 60 + ss);
if (ms < 0)
(hs -= 1, ms = 60 + ms);
cout << hs << ' ' << ms << ' ' << ss << endl;
}
return 0;
}
|
[["-", 64, 1, 0, 23, 0, 34, 31, 16, 17, 33], ["+", 64, 1, 0, 23, 0, 34, 0, 42, 0, 110]]
| 1
| 550
|
#include <fstream>
#include <iostream>
using namespace std;
int main() {
// ifstream cin("INPUT.txt");
// ofstream cout("OUTPUT.txt");
int i, h, m, s, t;
for (i = 0; i < 3; i++) {
cin >> h >> m >> s;
t = (h * 3600) + (m * 60) + s;
cin >> h >> m >> s;
t = ((h * 3600) + (m * 60) + s) - t;
cout << t / 3600 << " " << (t / 3600) % 60 << " " << t % 60 << endl;
}
return 0;
}
|
#include <fstream>
#include <iostream>
using namespace std;
int main() {
// ifstream cin("INPUT.txt");
// ofstream cout("OUTPUT.txt");
int i, h, m, s, t;
for (i = 0; i < 3; i++) {
cin >> h >> m >> s;
t = (h * 3600) + (m * 60) + s;
cin >> h >> m >> s;
t = ((h * 3600) + (m * 60) + s) - t;
cout << t / 3600 << " " << (t % 3600) / 60 << " " << t % 60 << endl;
}
return 0;
}
|
[["-", 31, 16, 12, 16, 31, 23, 0, 16, 17, 85], ["+", 31, 16, 12, 16, 31, 23, 0, 16, 17, 109], ["-", 31, 16, 31, 16, 31, 16, 12, 16, 17, 109], ["+", 31, 16, 31, 16, 31, 16, 12, 16, 17, 85]]
| 1
| 125
|
#include <algorithm>
#include <bits/stdc++.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
for (int i = 0; i < 2; i++) {
int a[6];
for (int j = 0; j < 6; j++)
scanf("%d", &a[j]);
int x = a[0] * 3600 + a[1] * 60 + a[2];
int y = a[3] * 3600 + a[4] * 60 + a[5];
int res = y - x;
int c = res / 60;
printf("%d %d %d\n", c / 60, c % 60, res % 60);
}
}
|
#include <algorithm>
#include <bits/stdc++.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
for (int i = 0; i <= 2; i++) {
int a[6];
for (int j = 0; j < 6; j++)
scanf("%d", &a[j]);
int x = a[0] * 3600 + a[1] * 60 + a[2];
int y = a[3] * 3600 + a[4] * 60 + a[5];
int res = y - x;
int c = res / 60;
printf("%d %d %d\n", c / 60, c % 60, res % 60);
}
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]]
| 1
| 150
|
#include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
for (int i = 0; i < 3; i++) {
int t1, t2;
cin >> a >> b >> c;
t1 = a * 3600 + b * 60 + c;
cin >> a >> b >> c;
t2 = a * 3600 + b * 60 + c;
int t3 = t2 - t1;
cout << t3 / 3600 << ' ' << t2 / 60 % 60 << ' ' << t2 % 60 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a, b, c;
int main() {
for (int i = 0; i < 3; i++) {
int t1, t2;
cin >> a >> b >> c;
t1 = a * 3600 + b * 60 + c;
cin >> a >> b >> c;
t2 = a * 3600 + b * 60 + c;
int t3 = t2 - t1;
cout << t3 / 3600 << ' ' << t3 / 60 % 60 << ' ' << t3 % 60 << endl;
}
return 0;
}
|
[["-", 31, 16, 31, 16, 12, 16, 31, 16, 31, 22], ["+", 31, 16, 31, 16, 12, 16, 31, 16, 31, 22], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 31, 22], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 31, 22]]
| 1
| 116
|
#include <iostream>
using namespace std;
int main() {
int sh, sm, ss, eh, em, es;
int h, m, s;
for (int i = 0; i < 4; i++) {
cin >> sh >> sm >> ss >> eh >> em >> es;
if (es < ss) {
em = em - 1;
es = es + 60;
}
s = es - ss;
if (em < sm) {
eh = eh - 1;
em = em + 60;
}
m = em - sm;
h = eh - sh;
cout << h << " " << m << " " << s << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int sh, sm, ss, eh, em, es;
int h, m, s;
for (int i = 0; i < 3; i++) {
cin >> sh >> sm >> ss >> eh >> em >> es;
if (es < ss) {
em = em - 1;
es = es + 60;
}
s = es - ss;
if (em < sm) {
eh = eh - 1;
em = em + 60;
}
m = em - sm;
h = eh - sh;
cout << h << " " << m << " " << s << endl;
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]]
| 1
| 141
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main(void) {
int a, aa, aaa, b, bb, bbb, T, TT, TTT;
for (int i = 0; i < 4; i++) {
cin >> a >> aa >> aaa >> b >> bb >> bbb;
if (aaa > bbb) {
if (aa < bb) {
bb--;
bbb += 60;
} else if (aa >= bb) {
bb--;
bbb += 60;
b--;
bb += 60;
} else if (aaa <= bbb) {
if (aa <= bb) {
} else if (aa > bb) {
b--;
bb += 60;
}
}
T = b - a;
TT = bb - aa;
TTT = bbb - aaa;
cout << T << " " << TT << " " << TTT << endl;
}
}
}
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main(void) {
int a, aa, aaa, b, bb, bbb, T, TT, TTT;
for (int i = 0; i < 3; i++) {
cin >> a >> aa >> aaa >> b >> bb >> bbb;
if (aaa > bbb) {
if (aa < bb) {
bb--;
bbb += 60;
} else if (aa >= bb) {
bb--;
bbb += 60;
b--;
bb += 60;
}
} else if (aaa <= bbb) {
if (aa <= bb) {
} else if (aa > bb) {
b--;
bb += 60;
}
}
T = b - a;
TT = bb - aa;
TTT = bbb - aaa;
cout << T << " " << TT << " " << TTT << endl;
}
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 57, 75, 76, 0, 57, 64, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]]
| 1
| 193
|
#include <bits/stdc++.h>
using namespace std;
int h, m, s, h2, m2, s2;
void res(int &h, int &m, int &s, int &h2, int &m2, int &s2) {
int sa;
sa = (h2 * 3600 + m2 * 60 + s2) - (h * 3600 + m * 60 + s);
h = sa / 3600;
m = (sa - h * 3600) / 60;
s = sa - h * 3600 - m * 60;
}
int main() {
for (int i = 0; i < 3; i++) {
cin >> h >> m >> s;
cin >> h2 >> m2 >> s2;
res(h, m, s, h2, m2, s2);
cout << h << " " << m << " " << s;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int h, m, s, h2, m2, s2;
void res(int &h, int &m, int &s, int &h2, int &m2, int &s2) {
int sa;
sa = (h2 * 3600 + m2 * 60 + s2) - (h * 3600 + m * 60 + s);
h = sa / 3600;
m = (sa - h * 3600) / 60;
s = sa - h * 3600 - m * 60;
}
int main() {
for (int i = 0; i < 3; i++) {
cin >> h >> m >> s;
cin >> h2 >> m2 >> s2;
res(h, m, s, h2, m2, s2);
cout << h << " " << m << " " << s << endl;
}
return 0;
}
|
[["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 179
|
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
static const double EPS = 1e-5;
#define FOR(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
int main(void) {
int a, b, c, d, e, f;
REP(i, 3) {
cin >> a >> b >> c >> d >> e >> f;
int t1 = a * 3600 + b * 60 + c;
int t2 = d * 3600 + e * 60 + f;
int ans = t2 - t1;
int h, m, s;
h = ans / 3600;
ans %= 3600;
m = ans / 60;
m %= 60;
s = ans;
printf("%d %d %d\n", h, m, s);
}
return 0;
}
|
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
static const double EPS = 1e-5;
#define FOR(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
int main(void) {
int a, b, c, d, e, f;
REP(i, 3) {
cin >> a >> b >> c >> d >> e >> f;
int t1 = a * 3600 + b * 60 + c;
int t2 = d * 3600 + e * 60 + f;
int ans = t2 - t1;
int h, m, s;
h = ans / 3600;
ans %= 3600;
m = ans / 60;
ans %= 60;
s = ans;
printf("%d %d %d\n", h, m, s);
}
return 0;
}
|
[["-", 8, 9, 0, 9, 0, 1, 0, 11, 31, 22], ["+", 8, 9, 0, 9, 0, 1, 0, 11, 31, 22]]
| 1
| 205
|
#include <cstdio>
int main() {
for (int i = 0; i < 3; ++i) {
int l[3], r[3];
for (int j = 0; j < 3; ++j)
scanf("%d", l + j);
for (int j = 0; j < 3; ++j)
scanf("%d", r + j);
int h, m, s;
s = r[0] - l[0];
if (s < 0) {
s += 60;
r[1] -= 1;
}
m = r[1] - l[1];
if (m < 0) {
m += 60;
r[2] -= 1;
}
h = r[2] - l[2];
printf("%d %d %d\n", h, m, s);
}
return 0;
}
|
#include <cstdio>
int main() {
for (int i = 0; i < 3; ++i) {
int l[3], r[3];
for (int j = 0; j < 3; ++j)
scanf("%d", l + j);
for (int j = 0; j < 3; ++j)
scanf("%d", r + j);
int h, m, s;
s = r[2] - l[2];
if (s < 0) {
s += 60;
r[1] -= 1;
}
m = r[1] - l[1];
if (m < 0) {
m += 60;
r[0] -= 1;
}
h = r[0] - l[0];
printf("%d %d %d\n", h, m, s);
}
return 0;
}
|
[["-", 0, 11, 12, 16, 31, 69, 341, 342, 0, 13], ["+", 0, 11, 12, 16, 31, 69, 341, 342, 0, 13], ["-", 0, 11, 12, 16, 12, 69, 341, 342, 0, 13], ["+", 0, 11, 12, 16, 12, 69, 341, 342, 0, 13], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13]]
| 1
| 183
|
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int a[3][6];
for (int i = 0; i < 3; i++)
for (int j = 0; j < 6; j++)
cin >> a[i][j];
for (int i = 0; i < 3; i++)
for (int j = 2; 0 <= j; j--) {
a[i][j + 3] -= a[i][j];
if (a[i][j + 3] < 0) {
a[i][j + 2] -= 1;
a[i][j + 3] += 60;
}
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 2; j++)
cout << a[i][j + 3] << " ";
cout << a[i][5] << " ";
cout << endl;
}
return 0;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int a[3][6];
for (int i = 0; i < 3; i++)
for (int j = 0; j < 6; j++)
cin >> a[i][j];
for (int i = 0; i < 3; i++)
for (int j = 2; 0 <= j; j--) {
a[i][j + 3] -= a[i][j];
if (a[i][j + 3] < 0) {
a[i][j + 2] -= 1;
a[i][j + 3] += 60;
}
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 2; j++)
cout << a[i][j + 3] << " ";
cout << a[i][5] << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 1, 0, 16, 12, 5, 0, 62], ["-", 8, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151]]
| 1
| 217
|
import java.util.*;
class Main {
public static void main(String[] args) {
Solve s = new Solve();
s.solve();
}
}
class Solve {
Solve() {}
Scanner in = new Scanner(System.in);
void solve() {
int[] a = new int[10];
for (int i = 0; i < 10; i++) {
a[i] = in.nextInt();
}
Arrays.sort(a);
int b = a[9] + a[8] + a[7];
System.out.println(b + " ");
for (int i = 0; i < 10; i++) {
a[i] = in.nextInt();
}
Arrays.sort(a);
b = a[9] + a[8] + a[7];
System.out.println(b);
}
}
|
import java.util.*;
class Main {
public static void main(String[] args) {
Solve s = new Solve();
s.solve();
}
}
class Solve {
Solve() {}
Scanner in = new Scanner(System.in);
void solve() {
int[] a = new int[10];
for (int i = 0; i < 10; i++) {
a[i] = in.nextInt();
}
Arrays.sort(a);
int b = a[9] + a[8] + a[7];
System.out.print(b + " ");
for (int i = 0; i < 10; i++) {
a[i] = in.nextInt();
}
Arrays.sort(a);
b = a[9] + a[8] + a[7];
System.out.println(b);
}
}
|
[["-", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22]]
| 3
| 199
|
import java.util.*;
class Main {
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
int w = 0, k = 0;
int ws[] = new int[10], ks[] = new int[10];
for (int i = 0; i < 10; i++)
ws[i] = in.nextInt();
for (int i = 0; i < 10; i++)
ks[k] = in.nextInt();
Arrays.sort(ks);
Arrays.sort(ws);
for (int i = 0; i < 3; i++)
w += ws[9 - i];
for (int i = 0; i < 3; i++)
k += ks[9 - i];
System.out.println(w + " " + k);
}
}
|
import java.util.*;
class Main {
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
int w = 0, k = 0;
int ws[] = new int[10], ks[] = new int[10];
for (int i = 0; i < 10; i++)
ws[i] = in.nextInt();
for (int i = 0; i < 10; i++)
ks[i] = in.nextInt();
Arrays.sort(ks);
Arrays.sort(ws);
for (int i = 0; i < 3; i++)
w += ws[9 - i];
for (int i = 0; i < 3; i++)
k += ks[9 - i];
System.out.println(w + " " + k);
}
}
|
[["-", 0, 7, 8, 1, 0, 11, 31, 504, 71, 22], ["+", 0, 7, 8, 1, 0, 11, 31, 504, 71, 22]]
| 3
| 189
|
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
int[] a = new int[10];
int[] b = new int[10];
for (int i = 0; i < 10; i++) {
a[i] = sc.nextInt();
}
for (int i = 0; i < 10; i++) {
b[i] = sc.nextInt();
}
Arrays.sort(a);
Arrays.sort(b);
System.out.println(a[9] + a[8] + a[7]);
System.out.println(b[9] + b[8] + b[7]);
}
}
}
|
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
int[] a = new int[10];
int[] b = new int[10];
for (int i = 0; i < 10; i++) {
a[i] = sc.nextInt();
}
for (int i = 0; i < 10; i++) {
b[i] = sc.nextInt();
}
Arrays.sort(a);
Arrays.sort(b);
System.out.print(a[9] + a[8] + a[7] + " ");
System.out.println(b[9] + b[8] + b[7]);
}
}
}
|
[["-", 0, 52, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 52, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 1, 0, 492, 3, 4, 0, 16, 17, 72], ["+", 0, 492, 3, 4, 0, 16, 12, 5, 0, 62], ["+", 0, 492, 3, 4, 0, 16, 12, 5, 0, 491]]
| 3
| 179
|
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int wt = 0, kt = 0;
int[] w = new int[9];
int[] k = new int[9];
for (int i = 0; i < 10; i++) {
w[i] = sc.nextInt();
}
for (int i = 0; i < 10; i++) {
k[i] = sc.nextInt();
}
Arrays.sort(w);
wt = w[9] + w[8] + w[7];
Arrays.sort(k);
kt = k[9] + k[8] + k[7];
System.out.println(wt + " " + kt);
}
}
|
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int wt = 0, kt = 0;
int[] w = new int[10];
int[] k = new int[10];
for (int i = 0; i < 10; i++) {
w[i] = sc.nextInt();
}
for (int i = 0; i < 10; i++) {
k[i] = sc.nextInt();
}
Arrays.sort(w);
wt = w[9] + w[8] + w[7];
Arrays.sort(k);
kt = k[9] + k[8] + k[7];
System.out.println(wt + " " + kt);
}
}
|
[["-", 0, 503, 49, 200, 51, 227, 497, 505, 0, 499], ["+", 0, 503, 49, 200, 51, 227, 497, 505, 0, 499]]
| 3
| 183
|
#include <stdio.h>
main() {
int ma;
int a[10];
int b[10];
int aa;
int bb;
int c;
int d;
int counta;
int countb;
for (ma = 0; ma < 10; ma++) {
scanf("%d", &a[ma]);
}
for (ma = 0; ma < 10; ma++) {
scanf("%d", &b[ma]);
}
for (c = 0; c < 10; c++) {
for (d = c - 1; d > 0; d--) {
if (a[d] > a[d - 1]) {
aa = a[d];
a[d] = a[d - 1];
a[d - 1] = aa;
}
if (b[d] > b[d - 1]) {
bb = b[d];
b[d] = b[d - 1];
b[d - 1] = bb;
}
}
}
counta = a[0] + a[1] + a[2];
countb = b[0] + b[1] + b[2];
printf("%d %d\n", counta, countb);
return 0;
}
|
#include <stdio.h>
main() {
int ma;
int a[10];
int b[10];
int aa;
int bb;
int c;
int d;
int counta;
int countb;
for (ma = 0; ma < 10; ma++) {
scanf("%d", &a[ma]);
}
for (ma = 0; ma < 10; ma++) {
scanf("%d", &b[ma]);
}
for (c = 0; c < 10; c++) {
for (d = 10 - 1; d > c; d--) {
if (a[d] > a[d - 1]) {
aa = a[d];
a[d] = a[d - 1];
a[d - 1] = aa;
}
if (b[d] > b[d - 1]) {
bb = b[d];
b[d] = b[d - 1];
b[d - 1] = bb;
}
}
}
counta = a[0] + a[1] + a[2];
countb = b[0] + b[1] + b[2];
printf("%d %d\n", counta, countb);
return 0;
}
|
[["-", 8, 9, 0, 7, 10, 11, 12, 16, 31, 22], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 31, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]]
| 0
| 266
|
#include <stdio.h>
#define num 10
int main(void) {
int w[num], k[num], i, j, temp, W = 0, K = 0;
for (i = 0; i < num; i++) {
scanf("%d", &w[i]);
}
for (i = 0; i < num; i++) {
scanf("%d", &k[i]);
}
for (i = 0; i < num - 1; i++) {
for (j = num - 1; j > i; j--) {
if (w[j] > w[j - 1]) {
temp = w[j - 1];
w[j - 1] = w[j];
w[j] = temp;
}
if (k[j] > k[j - 1]) {
temp = k[j];
k[j] = k[j - 1];
k[j - 1] = temp;
}
}
}
for (i = 0; i < 3; i++) {
W += w[i];
K += k[i];
}
printf("%d\n%d\n", W, K);
return 0;
}
|
#include <stdio.h>
#define num 10
int main(void) {
int w[num], k[num], i, j, temp, W = 0, K = 0;
for (i = 0; i < num; i++) {
scanf("%d", &w[i]);
}
for (i = 0; i < num; i++) {
scanf("%d", &k[i]);
}
for (i = 0; i < num - 1; i++) {
for (j = num - 1; j > i; j--) {
if (w[j] > w[j - 1]) {
temp = w[j - 1];
w[j - 1] = w[j];
w[j] = temp;
}
if (k[j] > k[j - 1]) {
temp = k[j];
k[j] = k[j - 1];
k[j - 1] = temp;
}
}
}
for (i = 0; i < 3; i++) {
W += w[i];
K += k[i];
}
printf("%d %d\n", W, K);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 261
|
#include <stdio.h>
int main(void) {
int w[10], k[10];
int i, j, tmp;
int W = 0, K = 0;
for (i = 0; i < 10; i++) {
scanf("%d", &w[i]);
}
for (i = 0; i < 10; i++) {
scanf("%d", &k[i]);
}
for (i = 0; i < 9; i++) {
for (j = 9; j > i; j--) {
if (w[j - 1] < w[j]) {
tmp = w[j];
w[j] = w[j - 1];
w[j - 1] = w[j];
}
if (k[j - 1] < k[j]) {
tmp = k[j];
k[j] = k[j - 1];
k[j - 1] = tmp;
}
}
}
for (i = 0; i < 3; i++) {
W += w[i];
K += k[i];
}
printf("%d %d\n", W, K);
return 0;
}
|
#include <stdio.h>
int main(void) {
int w[10], k[10];
int i, j, tmp;
int W = 0, K = 0;
for (i = 0; i < 10; i++) {
scanf("%d", &w[i]);
}
for (i = 0; i < 10; i++) {
scanf("%d", &k[i]);
}
for (i = 0; i < 9; i++) {
for (j = 9; j > i; j--) {
if (w[j - 1] < w[j]) {
tmp = w[j];
w[j] = w[j - 1];
w[j - 1] = tmp;
}
if (k[j - 1] < k[j]) {
tmp = k[j];
k[j] = k[j - 1];
k[j - 1] = tmp;
}
}
}
for (i = 0; i < 3; i++) {
W += w[i];
K += k[i];
}
printf("%d %d\n", W, K);
return 0;
}
|
[["-", 64, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["-", 64, 9, 0, 1, 0, 11, 12, 69, 0, 70], ["-", 64, 9, 0, 1, 0, 11, 12, 69, 71, 22], ["-", 64, 9, 0, 1, 0, 11, 12, 69, 0, 73], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]]
| 0
| 257
|
#include <stdio.h>
int main() {
int i, k, a[10], b[10], yo;
for (i = 0; i < 10; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < 10; i++) {
scanf("%d", &b[i]);
}
for (i = 0; i < 10; i++) {
for (k = i + 1; k < 10; k++) {
if (a[i] < a[k]) {
yo = a[i];
a[i] = a[k];
a[k] = yo;
}
}
}
for (i = 0; i < 10; i++) {
for (k = 1; k < 10; k++) {
if (b[i] < b[k]) {
yo = b[i];
b[i] = b[k];
b[k] = yo;
}
}
}
printf("%d %d\n", a[0] + a[1] + a[2], b[0] + b[1] + b[2]);
return 0;
}
|
#include <stdio.h>
int main() {
int i, k, a[10], b[10], yo;
for (i = 0; i < 10; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < 10; i++) {
scanf("%d", &b[i]);
}
for (i = 0; i < 10; i++) {
for (k = i + 1; k < 10; k++) {
if (a[i] < a[k]) {
yo = a[i];
a[i] = a[k];
a[k] = yo;
}
}
}
for (i = 0; i < 10; i++) {
for (k = i + 1; k < 10; k++) {
if (b[i] < b[k]) {
yo = b[i];
b[i] = b[k];
b[k] = yo;
}
}
}
printf("%d %d\n", a[0] + a[1] + a[2], b[0] + b[1] + b[2]);
return 0;
}
|
[["+", 8, 9, 0, 7, 10, 11, 12, 16, 31, 22], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 17, 72]]
| 0
| 260
|
#include <stdio.h>
int main(void) {
int w[10], k[10], wsum, ksum, i, j, n, m;
n = 0;
m = 0;
for (i = 0; i < 10; i++) {
scanf("%d", &w[i]);
}
for (i = 0; i < 10; i++) {
scanf("%d", &k[i]);
}
for (i = 0; i < 10; i++) {
for (j = i + 1; j < 10; j++) {
if (w[i] < k[j]) {
n = w[i];
w[i] = w[j];
w[j] = n;
}
}
}
wsum = w[0] + w[1] + w[2];
for (i = 0; i < 10; i++) {
for (j = i + 1; j < 10; j++) {
if (k[i] < k[j]) {
m = k[i];
k[i] = k[j];
k[j] = m;
}
}
}
ksum = k[0] + k[1] + k[2];
printf("%d %d\n", wsum, ksum);
return 0;
}
|
#include <stdio.h>
int main(void) {
int w[10], k[10], wsum, ksum, i, j, n, m;
n = 0;
m = 0;
for (i = 0; i < 10; i++) {
scanf("%d", &w[i]);
}
for (i = 0; i < 10; i++) {
scanf("%d", &k[i]);
}
for (i = 0; i < 10; i++) {
for (j = i + 1; j < 10; j++) {
if (w[i] < w[j]) {
n = w[i];
w[i] = w[j];
w[j] = n;
}
}
}
wsum = w[0] + w[1] + w[2];
for (i = 0; i < 10; i++) {
for (j = i + 1; j < 10; j++) {
if (k[i] < k[j]) {
m = k[i];
k[i] = k[j];
k[j] = m;
}
}
}
ksum = k[0] + k[1] + k[2];
printf("%d %d\n", wsum, ksum);
return 0;
}
|
[["-", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22]]
| 0
| 285
|
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int a[10], b[10], ah[3], bh[3], as, bs, i, j, store;
as = 0;
bs = 0;
for (i = 0; i < 10; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < 10; i++) {
scanf("%d", &b[i]);
}
for (i = 0; i < 3; i++) {
ah[i] = 0;
bh[i] = 0;
}
for (i = 0; i < 3; i++) {
for (j = 0; j < 10; j++) {
if (ah[i] < a[j]) {
store = ah[i];
ah[i] = a[j];
a[j] = store;
}
if (bh[i] < a[j]) {
store = bh[i];
bh[i] = b[j];
b[j] = store;
}
}
}
for (i = 0; i < 3; i++) {
as += ah[i];
bs += bh[i];
}
printf("%d %d\n", as, bs);
return 0;
}
|
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
int main() {
int a[10], b[10], ah[3], bh[3], as, bs, i, j, store;
as = 0;
bs = 0;
for (i = 0; i < 10; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < 10; i++) {
scanf("%d", &b[i]);
}
for (i = 0; i < 3; i++) {
ah[i] = 0;
bh[i] = 0;
}
for (i = 0; i < 3; i++) {
for (j = 0; j < 10; j++) {
if (ah[i] < a[j]) {
store = ah[i];
ah[i] = a[j];
a[j] = store;
}
if (bh[i] < b[j]) {
store = bh[i];
bh[i] = b[j];
b[j] = store;
}
}
}
for (i = 0; i < 3; i++) {
as += ah[i];
bs += bh[i];
}
printf("%d %d\n", as, bs);
return 0;
}
|
[["-", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 69, 28, 22]]
| 0
| 286
|
#include <stdio.h>
int main() {
int a[10];
int sum[10 * 9 * 8 / 6];
int i, j, k, l;
int max;
for (i = 0; i < 10; i++)
scanf("%d", &a[i]);
l = 0;
for (i = 0; i < 10; i++)
for (j = i + 1; j < 10; j++)
for (k = j + 1; k < 10; k++)
sum[l++] = a[i] + a[j] + a[k];
max = 0;
for (i = 0; i < 10 * 9 * 8 / 6; i++)
if (max < sum[i])
max = sum[i];
printf("%d\n", max);
for (i = 0; i < 10; i++)
scanf("%d", &a[i]);
l = 0;
for (i = 0; i < 10; i++)
for (j = i + 1; j < 10; j++)
for (k = j + 1; k < 10; k++)
sum[l++] = a[i] + a[j] + a[k];
max = 0;
for (i = 0; i < 10 * 9 * 8 / 6; i++)
if (max < sum[i])
max = sum[i];
printf("%d\n", max);
return 0;
}
|
#include <stdio.h>
int main() {
int a[10];
int sum[10 * 9 * 8 / 6];
int i, j, k, l;
int max;
for (i = 0; i < 10; i++)
scanf("%d", &a[i]);
l = 0;
for (i = 0; i < 10; i++)
for (j = i + 1; j < 10; j++)
for (k = j + 1; k < 10; k++)
sum[l++] = a[i] + a[j] + a[k];
max = 0;
for (i = 0; i < 10 * 9 * 8 / 6; i++)
if (max < sum[i])
max = sum[i];
printf("%d ", max);
for (i = 0; i < 10; i++)
scanf("%d", &a[i]);
l = 0;
for (i = 0; i < 10; i++)
for (j = i + 1; j < 10; j++)
for (k = j + 1; k < 10; k++)
sum[l++] = a[i] + a[j] + a[k];
max = 0;
for (i = 0; i < 10 * 9 * 8 / 6; i++)
if (max < sum[i])
max = sum[i];
printf("%d\n", max);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 327
|
#include <stdio.h>
int main(void) {
int w, k;
/*一番目に大きい点数*/
int max1 = 0;
/*二番目に大きい点数*/
int max2 = 0;
/*三番目に大きい点数*/
int max3 = 0;
int i;
for (i = 0; i < 10; i++) {
scanf("%d", &w);
if (max1 <= w) {
max3 = max2;
max2 = max1;
max1 = w;
} else if (max2 <= w) {
max3 = max2;
max2 = w;
} else if (max3 <= w) {
max3 = w;
}
}
printf("%d", max1 + max2 + max3);
max1 = max2 = max3 = 0;
for (i = 0; i < 10; i++) {
scanf("%d", &k);
if (max1 <= k) {
max3 = max2;
max2 = max1;
max1 = k;
} else if (max2 <= k) {
max3 = max2;
max2 = k;
} else if (max3 <= k) {
max3 = k;
}
}
printf("%d\n", max1 + max2 + max3);
return 0;
}
|
#include <stdio.h>
int main(void) {
int w, k;
/*一番目に大きい点数*/
int max1 = 0;
/*二番目に大きい点数*/
int max2 = 0;
/*三番目に大きい点数*/
int max3 = 0;
int i;
for (i = 0; i < 10; i++) {
scanf("%d", &w);
if (max1 <= w) {
max3 = max2;
max2 = max1;
max1 = w;
} else if (max2 <= w) {
max3 = max2;
max2 = w;
} else if (max3 <= w) {
max3 = w;
}
}
printf("%d ", max1 + max2 + max3);
max1 = max2 = max3 = 0;
for (i = 0; i < 10; i++) {
scanf("%d", &k);
if (max1 <= k) {
max3 = max2;
max2 = max1;
max1 = k;
} else if (max2 <= k) {
max3 = max2;
max2 = k;
} else if (max3 <= k) {
max3 = k;
}
}
printf("%d\n", max1 + max2 + max3);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 0
| 223
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int W[10];
int K[10];
int i = 0;
while (i < 10) {
cin >> W[i];
i++;
}
while (i < 20) {
cin >> K[i - 10];
i++;
}
sort(W, W + 10);
sort(K, K + 10);
cout << W[7] + W[8] + W[9] << K[7] + K[8] + K[9] << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int W[10];
int K[10];
int i = 0;
while (i < 10) {
cin >> W[i];
i++;
}
while (i < 20) {
cin >> K[i - 10];
i++;
}
sort(W, W + 10);
sort(K, K + 10);
cout << W[7] + W[8] + W[9] << " " << K[7] + K[8] + K[9] << endl;
return 0;
}
|
[["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]]
| 1
| 124
|
#include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int answer = 0;
int W[10], K[10];
for (int i = 0; i < 10; i++) {
cin >> W[i];
}
for (int i = 0; i < 10; i++) {
cin >> K[i];
}
sort(W, W + 10);
sort(K, K + 10);
cout << W[7] + W[8] + W[9] << endl << K[7] + K[8] + K[9] << endl;
return 0;
}
|
#include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int answer = 0;
int W[10], K[10];
for (int i = 0; i < 10; i++) {
cin >> W[i];
}
for (int i = 0; i < 10; i++) {
cin >> K[i];
}
sort(W, W + 10);
sort(K, K + 10);
cout << W[7] + W[8] + W[9] << ' ' << K[7] + K[8] + K[9] << endl;
return 0;
}
|
[["-", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 16, 31, 16, 12, 103, 0, 104], ["+", 0, 16, 31, 16, 31, 16, 12, 103, 0, 125]]
| 1
| 147
|
#include <iostream>
using namespace std;
int main() {
int big[3];
for (int i = 0; i < 3; i++)
big[i] = 0;
for (int i = 0; i < 10; i++) {
int a;
cin >> a;
if (a > big[0]) {
big[2] = big[1];
big[1] = big[0];
big[0] = a;
} else if (a > big[1]) {
big[2] = big[0];
big[0] = a;
} else if (a > big[2])
big[2] = a;
}
int W = big[0] + big[1] + big[2];
for (int i = 0; i < 3; i++)
big[i] = 0;
for (int i = 0; i < 10; i++) {
int a;
cin >> a;
if (a > big[0]) {
big[2] = big[1];
big[1] = big[0];
big[0] = a;
} else if (a > big[1]) {
big[2] = big[0];
big[0] = a;
} else if (a > big[2])
big[2] = a;
}
int K = big[0] + big[1] + big[2];
cout << W << " " << K << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int big[3];
for (int i = 0; i < 3; i++)
big[i] = 0;
for (int i = 0; i < 10; i++) {
int a;
cin >> a;
if (a > big[0]) {
big[2] = big[1];
big[1] = big[0];
big[0] = a;
} else if (a > big[1]) {
big[2] = big[1];
big[1] = a;
} else if (a > big[2])
big[2] = a;
}
int W = big[0] + big[1] + big[2];
for (int i = 0; i < 3; i++)
big[i] = 0;
for (int i = 0; i < 10; i++) {
int a;
cin >> a;
if (a > big[0]) {
big[2] = big[1];
big[1] = big[0];
big[0] = a;
} else if (a > big[1]) {
big[2] = big[1];
big[1] = a;
} else if (a > big[2])
big[2] = a;
}
int K = big[0] + big[1] + big[2];
cout << W << " " << K << endl;
return 0;
}
|
[["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 13], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 13]]
| 1
| 325
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[10], b[10];
for (int i = 0; i < 10; i++) {
cin >> a[i];
}
for (int i = 0; i < 10; i++) {
cin >> b[i];
}
sort(a, a + 10);
sort(b, b + 10);
cout << a[8] + a[9] + a[7] << endl;
cout << b[8] + b[9] + b[7] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[10], b[10];
for (int i = 0; i < 10; i++) {
cin >> a[i];
}
for (int i = 0; i < 10; i++) {
cin >> b[i];
}
sort(a, a + 10);
sort(b, b + 10);
cout << a[8] + a[9] + a[7] << " ";
cout << b[8] + b[9] + b[7] << endl;
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 12, 5, 0, 62], ["+", 8, 9, 0, 1, 0, 16, 12, 5, 0, 6]]
| 1
| 128
|
#include <cstdio>
#include <iostream>
int main() {
int nowpoint, wran[3] = {0}, kran[3] = {0}, wsum = 0, ksum = 0;
for (int i = 0; i < 10; i++) {
scanf("%d", &nowpoint);
if (wran[0] < nowpoint)
wran[2] = wran[1], wran[1] = wran[0], wran[0] = nowpoint;
else if (wran[1] < nowpoint)
wran[2] = wran[1], wran[1] = nowpoint;
else if (wran[2] < nowpoint)
wran[2] = nowpoint;
}
for (int i = 0; i < 10; i++) {
scanf("%d", &nowpoint);
if (kran[0] < nowpoint)
kran[2] = kran[1], kran[1] = kran[0], kran[0] = nowpoint;
else if (kran[1] < nowpoint)
kran[2] = kran[1], kran[1] = nowpoint;
else if (kran[2] < nowpoint)
kran[2] = nowpoint;
}
for (int i = 0; i < 3; i++)
wsum += wran[i], ksum += kran[i];
printf("%d\n%d\n", wsum, ksum);
return 0;
}
|
#include <cstdio>
#include <iostream>
int main() {
int nowpoint, wran[3] = {0}, kran[3] = {0}, wsum = 0, ksum = 0;
for (int i = 0; i < 10; i++) {
scanf("%d", &nowpoint);
if (wran[0] < nowpoint)
wran[2] = wran[1], wran[1] = wran[0], wran[0] = nowpoint;
else if (wran[1] < nowpoint)
wran[2] = wran[1], wran[1] = nowpoint;
else if (wran[2] < nowpoint)
wran[2] = nowpoint;
}
for (int i = 0; i < 10; i++) {
scanf("%d", &nowpoint);
if (kran[0] < nowpoint)
kran[2] = kran[1], kran[1] = kran[0], kran[0] = nowpoint;
else if (kran[1] < nowpoint)
kran[2] = kran[1], kran[1] = nowpoint;
else if (kran[2] < nowpoint)
kran[2] = nowpoint;
}
for (int i = 0; i < 3; i++)
wsum += wran[i], ksum += kran[i];
printf("%d %d\n", wsum, ksum);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 296
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int m = 0, W[10], T[10], i;
for (i = 0; i < 10; i++) {
cin >> W[i];
}
sort(W, W + 10);
for (i = 7; i < 10; i++)
m += W[i];
cout << m << " ";
for (i = 0; i < 10; i++) {
cin >> T[i];
}
sort(T, T + 10);
for (i = 7; i < 10; i++)
m += T[i];
cout << m << endl;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int m = 0, W[10], T[10], i;
for (i = 0; i < 10; i++) {
cin >> W[i];
}
sort(W, W + 10);
for (i = 7; i < 10; i++)
m += W[i];
cout << m << " ";
m = 0;
for (i = 0; i < 10; i++) {
cin >> T[i];
}
sort(T, T + 10);
for (i = 7; i < 10; i++)
m += T[i];
cout << m << endl;
}
|
[["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]]
| 1
| 147
|
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
int main(void) {
int a[11], b[11], i, s, z;
for (i = 1; i <= 10; i++) {
scanf("%d", &a[i]);
}
sort(a + 1, a + 10, greater<int>());
for (i = 1; i <= 10; i++) {
scanf("%d", &b[i]);
}
sort(b + 1, b + 10, greater<int>());
s = a[1] + a[2] + a[3];
z = b[1] + b[2] + b[3];
printf("%d %d\n", s, z);
return 0;
}
|
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
int main(void) {
int a[11], b[11], i, s, z;
for (i = 1; i <= 10; i++) {
scanf("%d", &a[i]);
}
sort(a + 1, a + 11, greater<int>());
for (i = 1; i <= 10; i++) {
scanf("%d", &b[i]);
}
sort(b + 1, b + 11, greater<int>());
s = a[1] + a[2] + a[3];
z = b[1] + b[2] + b[3];
printf("%d %d\n", s, z);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 175
|
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
int main(void) {
int i, s = 0, z = 0, a[11], aa[11];
for (i = 1; i <= 10; i++) {
scanf("%d", &a[i]);
}
sort(a, a + 10, greater<int>());
for (i = 1; i <= 10; i++) {
scanf("%d", &aa[i]);
}
sort(aa, aa + 10, greater<int>());
s = a[0] + a[1] + a[2];
z = aa[0] + aa[1] + aa[2];
printf("%d %d\n", s, z);
return 0;
}
|
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
int main(void) {
int i, s = 0, z = 0, a[10], aa[10];
for (i = 0; i < 10; i++) {
scanf("%d", &a[i]);
}
sort(a, a + 10, greater<int>());
for (i = 0; i < 10; i++) {
scanf("%d", &aa[i]);
}
sort(aa, aa + 10, greater<int>());
s = a[0] + a[1] + a[2];
z = aa[0] + aa[1] + aa[2];
printf("%d %d\n", s, z);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]]
| 1
| 175
|
#include <bits/stdc++.h>
using namespace std;
int main() {
priority_queue<int> q[2];
int a, sum[2] = {0};
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 10; j++) {
cin >> a;
q[i].push(a);
}
}
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 3; j++)
sum[i] += q[i].top();
q[i].pop();
}
cout << sum[0] << " " << sum[1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
priority_queue<int> q[2];
int a, sum[2] = {0};
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 10; j++) {
cin >> a;
q[i].push(a);
}
}
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 3; j++) {
sum[i] += q[i].top();
q[i].pop();
}
}
cout << sum[0] << " " << sum[1] << endl;
}
|
[["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 150
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <ctype.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int people[21], Total, Total2;
for (int i = 0; i < 20; i++) {
cin >> people[i];
}
sort(people, people + 10, greater<int>());
sort(people + 11, people + 20, greater<int>());
Total = people[0] + people[1] + people[2];
Total2 = people[10] + people[11] + people[12];
cout << Total << " " << Total2 << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <ctype.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int people[21], Total, Total2;
for (int i = 0; i < 20; i++) {
cin >> people[i];
}
sort(people, people + 10, greater<int>());
sort(people + 10, people + 20, greater<int>());
Total = people[0] + people[1] + people[2];
Total2 = people[10] + people[11] + people[12];
cout << Total << " " << Total2 << endl;
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 138
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[10], b[10];
for (int i = 0; i < 10; i++) {
cin >> a[i];
}
for (int i = 0; i < 10; i++) {
cin >> b[i];
}
sort(a, a + 10);
sort(b, b + 10);
cout << a[9] + a[8] + a[7] << b[9] + b[8] + b[7] << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[10], b[10];
for (int i = 0; i < 10; i++) {
cin >> a[i];
}
for (int i = 0; i < 10; i++) {
cin >> b[i];
}
sort(a, a + 10);
sort(b, b + 10);
cout << a[9] + a[8] + a[7] << " " << b[9] + b[8] + b[7] << endl;
return 0;
}
|
[["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]]
| 1
| 126
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <typeinfo>
#include <vector>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef pair<int, P> pip;
typedef vector<pip> vip;
const int inf = 1 << 25;
const double pi = acos(-1);
const double eps = 1e-10;
const vi emp;
vector<ll> a(20);
int main() {
for (auto i = a.begin(); i != a.end(); i++)
cin >> *i;
sort(a.begin(), a.begin() + 10);
sort(a.begin() + 10, a.end());
cout << a[7] + a[8] + a[9] << endl << a[17] + a[18] + a[19] << endl;
}
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <typeinfo>
#include <vector>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef pair<int, P> pip;
typedef vector<pip> vip;
const int inf = 1 << 25;
const double pi = acos(-1);
const double eps = 1e-10;
const vi emp;
vector<ll> a(20);
int main() {
for (auto i = a.begin(); i != a.end(); i++)
cin >> *i;
sort(a.begin(), a.begin() + 10);
sort(a.begin() + 10, a.end());
cout << a[7] + a[8] + a[9] << ' ' << a[17] + a[18] + a[19] << endl;
}
|
[["-", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 16, 31, 16, 12, 103, 0, 104], ["+", 0, 16, 31, 16, 31, 16, 12, 103, 0, 125]]
| 1
| 270
|
#include <stdio.h>
#define N 10
int main(void) {
int wScores[N];
int kScores[N];
int wBests, kBests;
for (int i = 0; i < N; i++)
scanf("%d", &wScores[i]);
for (int i = 0; i < N; i++)
scanf("%d", &kScores[i]);
wBests = 0;
kBests = 0;
for (int i = 0; i < 3; i++) {
int max, p;
max = 0;
for (int j = 0; j < N; j++) {
if (wScores[j] > max) {
max = wScores[j];
p = j;
}
}
wBests += max;
wScores[p] = 0;
}
for (int i = 0; i < 3; i++) {
int max, p;
max = 0;
for (int j = 0; j < N; j++) {
if (wScores[j] > max) {
max = kScores[j];
p = j;
}
}
kBests += max;
kScores[p] = 0;
}
printf("%d %d\n", wBests, kBests);
return 0;
}
|
#include <stdio.h>
#define N 10
int main(void) {
int wScores[N];
int kScores[N];
int wBests, kBests;
for (int i = 0; i < N; i++)
scanf("%d", &wScores[i]);
for (int i = 0; i < N; i++)
scanf("%d", &kScores[i]);
wBests = 0;
kBests = 0;
for (int i = 0; i < 3; i++) {
int max, p;
max = 0;
for (int j = 0; j < N; j++) {
if (wScores[j] > max) {
max = wScores[j];
p = j;
}
}
wBests += max;
wScores[p] = 0;
}
for (int i = 0; i < 3; i++) {
int max, p;
max = 0;
for (int j = 0; j < N; j++) {
if (kScores[j] > max) {
max = kScores[j];
p = j;
}
}
kBests += max;
kScores[p] = 0;
}
printf("%d %d\n", wBests, kBests);
return 0;
}
|
[["-", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22], ["+", 0, 57, 15, 339, 51, 16, 31, 69, 28, 22]]
| 1
| 254
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int sum[2] = {0}, num[10] = {0}, i, j;
for (j = 0; j < 2; j++) {
for (i = 0; i < 10; i++) {
cin >> num[i];
}
sort(num, num + 10);
sum[j] = num[7] + num[8] + num[9];
}
cout << sum[0] << sum[1] << endl;
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int sum[2] = {0}, num[10] = {0}, i, j;
for (j = 0; j < 2; j++) {
for (i = 0; i < 10; i++) {
cin >> num[i];
}
sort(num, num + 10);
sum[j] = num[7] + num[8] + num[9];
}
cout << sum[0] << " " << sum[1] << endl;
return 0;
}
|
[["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]]
| 1
| 124
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<int> w, k;
int a;
for (int i = 0; i < 10; i++) {
cin >> a;
w.emplace_back(a);
}
sort(w.begin(), w.end(), greater<int>());
for (int i = 0; i < 10; i++) {
cin >> a;
k.emplace_back(a);
}
sort(w.begin(), w.end(), greater<int>());
cout << w[0] + w[1] + w[2] << " " << k[0] + k[1] + k[2] << endl;
}
|
#include <algorithm>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<int> w, k;
int a;
for (int i = 0; i < 10; i++) {
cin >> a;
w.emplace_back(a);
}
sort(w.begin(), w.end(), greater<int>());
for (int i = 0; i < 10; i++) {
cin >> a;
k.emplace_back(a);
}
sort(k.begin(), k.end(), greater<int>());
cout << w[0] + w[1] + w[2] << " " << k[0] + k[1] + k[2] << endl;
}
|
[["-", 0, 2, 3, 4, 0, 2, 63, 118, 28, 22], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 28, 22]]
| 1
| 171
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int P[2];
for (int i = 0; i < 2; i++) {
vector<int> point(10);
for (int j = 0; j < 10; j++) {
cin >> point[j];
}
sort(point.begin(), point.end());
P[i] = point[0] + point[1] + point[2];
}
cout << P[0] << " " << P[1] << endl;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int P[2];
for (int i = 0; i < 2; i++) {
vector<int> point(10);
for (int j = 0; j < 10; j++) {
cin >> point[j];
}
sort(point.rbegin(), point.rend());
P[i] = point[0] + point[1] + point[2];
}
cout << P[0] << " " << P[1] << endl;
}
|
[["-", 0, 2, 3, 4, 0, 2, 63, 118, 119, 120], ["+", 0, 2, 3, 4, 0, 2, 63, 118, 119, 120]]
| 1
| 123
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int j, w[11], k[11], i, wg = 0, kg = 0;
for (i = 0; i < 10; i++) {
cin >> w[i];
}
for (i = 0; i < 10; i++) {
cin >> k[i];
}
sort(w, w + 11);
sort(k, k + 11);
wg = w[7] + w[8] + w[9];
kg = k[7] + k[8] + k[9];
cout << wg << " " << kg << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int j, w[11], k[11], i, wg = 0, kg = 0;
for (i = 0; i < 10; i++) {
cin >> w[i];
}
for (i = 0; i < 10; i++) {
cin >> k[i];
}
sort(w, w + 10);
sort(k, k + 10);
wg = w[7] + w[8] + w[9];
kg = k[7] + k[8] + k[9];
cout << wg << " " << kg << endl;
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 148
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
//コンテスト
int W[10], K[10];
for (int i = 0; i < 10; i++) {
cin >> W[i];
}
for (int i = 0; i < 10; i++) {
cin >> K[10];
}
sort(W, W + 10);
reverse(W, W + 10);
sort(K, K + 10);
reverse(K, K + 10);
cout << W[0] + W[1] + W[2] << " " << K[0] + K[1] + K[2] << endl;
//ポイントカード
/*
int N, M;
cin >> N >> M;
int a;
int A[5000];
int b = 0;
int x = 0;
for (int i = 0; i < M; i++) {
cin >> a;
if (a < N) {
A[x]=a;
x++;
}
else
{
b++;
}
cin >> a;
}
int sum = 0;
if (b < M - 1) {
sort(A, A+x);
reverse(A, A+x);
for (int i = 0; i < M - 1 - b; i++) {
sum += N - A[i];
}
}
cout << sum << endl;
*/
//合計時間
/*
int sum=0, n;
for (int i = 0; i < 4; i++) {
cin >> n;
sum += n;
}
cout << sum / 60 << endl;
cout << sum % 60 << endl;
//平均点
/*
int P[5];
int sum=0;
for (int i = 0; i < 5; i++) {
cin >> P[i];
if (P[i] < 40) P[i] = 40;
sum += P[i];
}
cout << sum / 5 << endl;
*/
//投票
/*
int N, M;
cin >> N >> M;
int A[1000], vote[1000];
for (int i = 0; i < N; i++) {
cin >> A[i];
vote[i] = 0;
}
int b;
for (int i = 0; i < M; i++) {
cin >> b;
for (int j = 0; j < N; j++) {
if (A[j] <= b) {
vote[j]++;
break;
}
}
}
int temps = 0, ans;
for (int i = 0; i < N; i++) {
if (vote[i] > temps) {
temps = vote[i];
ans = i;
}
}
cout << ans + 1 << endl;
*/
// 2.すごろく
/*
int n;
cin >> n;
int A, _A = 1;
int k = 0;
int A_count[100];
A_count[0] = 1;
for (int i = 0; i < n; i++)
{
cin >> A;
if (A == 1)
{
if (A == _A)
{
A_count[k]++;
}
else
{
k++;
A_count[k] = 2;
}
}
_A = A;
}
sort(A_count, A_count + k + 1);
cout << A_count[k] << endl;
*/
//タイムカード
/*
int t[2][3];
int x[3][3];
for (int n=0; n < 3; n++)
{
for (int i=0; i < 2; i++)
for (int k=0; k < 3; k++)
cin >> t[i][k];
for (int m = 2; m >= 0; m--)
{
x[n][m] = t[1][m] - t[0][m];
if (t[0][m] > t[1][m])
{
x[n][m] += 60;
t[1][m - 1]--;
}
}
}
for (int n= 0; n < 3; n++)
{
cout << x[n][0] << ' ' << x[n][1] <<' '<< x[n][2] << endl;
}
*/
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
//コンテスト
int W[10], K[10];
for (int i = 0; i < 10; i++) {
cin >> W[i];
}
for (int i = 0; i < 10; i++) {
cin >> K[i];
}
sort(W, W + 10);
reverse(W, W + 10);
sort(K, K + 10);
reverse(K, K + 10);
cout << W[0] + W[1] + W[2] << " " << K[0] + K[1] + K[2] << endl;
//ポイントカード
/*
int N, M;
cin >> N >> M;
int a;
int A[5000];
int b = 0;
int x = 0;
for (int i = 0; i < M; i++) {
cin >> a;
if (a < N) {
A[x]=a;
x++;
}
else
{
b++;
}
cin >> a;
}
int sum = 0;
if (b < M - 1) {
sort(A, A+x);
reverse(A, A+x);
for (int i = 0; i < M - 1 - b; i++) {
sum += N - A[i];
}
}
cout << sum << endl;
*/
//合計時間
/*
int sum=0, n;
for (int i = 0; i < 4; i++) {
cin >> n;
sum += n;
}
cout << sum / 60 << endl;
cout << sum % 60 << endl;
//平均点
/*
int P[5];
int sum=0;
for (int i = 0; i < 5; i++) {
cin >> P[i];
if (P[i] < 40) P[i] = 40;
sum += P[i];
}
cout << sum / 5 << endl;
*/
//投票
/*
int N, M;
cin >> N >> M;
int A[1000], vote[1000];
for (int i = 0; i < N; i++) {
cin >> A[i];
vote[i] = 0;
}
int b;
for (int i = 0; i < M; i++) {
cin >> b;
for (int j = 0; j < N; j++) {
if (A[j] <= b) {
vote[j]++;
break;
}
}
}
int temps = 0, ans;
for (int i = 0; i < N; i++) {
if (vote[i] > temps) {
temps = vote[i];
ans = i;
}
}
cout << ans + 1 << endl;
*/
// 2.すごろく
/*
int n;
cin >> n;
int A, _A = 1;
int k = 0;
int A_count[100];
A_count[0] = 1;
for (int i = 0; i < n; i++)
{
cin >> A;
if (A == 1)
{
if (A == _A)
{
A_count[k]++;
}
else
{
k++;
A_count[k] = 2;
}
}
_A = A;
}
sort(A_count, A_count + k + 1);
cout << A_count[k] << endl;
*/
//タイムカード
/*
int t[2][3];
int x[3][3];
for (int n=0; n < 3; n++)
{
for (int i=0; i < 2; i++)
for (int k=0; k < 3; k++)
cin >> t[i][k];
for (int m = 2; m >= 0; m--)
{
x[n][m] = t[1][m] - t[0][m];
if (t[0][m] > t[1][m])
{
x[n][m] += 60;
t[1][m - 1]--;
}
}
}
for (int n= 0; n < 3; n++)
{
cout << x[n][0] << ' ' << x[n][1] <<' '<< x[n][2] << endl;
}
*/
return 0;
}
|
[["-", 0, 1, 0, 16, 12, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22]]
| 1
| 163
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define INF 2000000000
using namespace std;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
#define ll long long
#define PL pair<long long, long long>
#define P pair<int, int>
#define mk make_pair
#define en endl;
#define WHITE 0
#define BLACK 2
#define GRAY 1
#define RE return 0;
#define HERE \
cout << " " \
<< "HERE" << en
string jj("JOI");
string ii("IOI");
int main() {
priority_queue<int> pq_w;
for (int i = 0; i < 10; i++) {
int n;
cin >> n;
pq_w.push(n);
}
priority_queue<int> pq_k;
for (int i = 0; i < 10; i++) {
int n;
cin >> n;
pq_k.push(n);
}
int w = 0, k = 0;
for (int i = 0; i < 3; i++) {
w += pq_w.top();
pq_w.pop();
k += pq_k.top();
pq_k.pop();
}
cout << w << endl << k << en
}
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define INF 2000000000
using namespace std;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
#define ll long long
#define PL pair<long long, long long>
#define P pair<int, int>
#define mk make_pair
#define en endl;
#define WHITE 0
#define BLACK 2
#define GRAY 1
#define RE return 0;
#define HERE \
cout << " " \
<< "HERE" << en
string jj("JOI");
string ii("IOI");
int main() {
priority_queue<int> pq_w;
for (int i = 0; i < 10; i++) {
int n;
cin >> n;
pq_w.push(n);
}
priority_queue<int> pq_k;
for (int i = 0; i < 10; i++) {
int n;
cin >> n;
pq_k.push(n);
}
int w = 0, k = 0;
for (int i = 0; i < 3; i++) {
w += pq_w.top();
pq_w.pop();
k += pq_k.top();
pq_k.pop();
}
cout << w << " " << k << en
}
|
[["-", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]]
| 1
| 262
|
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
#define dump(n) cout << "# " << #n << "=" << (n) << endl
#define debug(n) \
cout << __FILE__ << "," << __LINE__ << ": #" << #n << "=" << (n) << endl
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, n) repi(i, 0, n)
#define iter(c) __typeof((c).begin())
#define foreach(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define allof(c) (c).begin(), (c).end()
#define mp make_pair
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
int main() {
vi w(10), k(10);
rep(i, 10) cin >> w[i];
rep(i, 10) cin >> k[i];
sort(allof(w), greater<int>());
sort(allof(k), greater<int>());
cout << accumulate(allof(w) - 7, 0) << endl;
cout << accumulate(allof(k) - 7, 0) << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
#define dump(n) cout << "# " << #n << "=" << (n) << endl
#define debug(n) \
cout << __FILE__ << "," << __LINE__ << ": #" << #n << "=" << (n) << endl
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, n) repi(i, 0, n)
#define iter(c) __typeof((c).begin())
#define foreach(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define allof(c) (c).begin(), (c).end()
#define mp make_pair
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
int main() {
vi w(10), k(10);
rep(i, 10) cin >> w[i];
rep(i, 10) cin >> k[i];
sort(allof(w), greater<int>());
sort(allof(k), greater<int>());
cout << accumulate(allof(w) - 7, 0) << " " << accumulate(allof(k) - 7, 0)
<< endl;
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 31, 22], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]]
| 1
| 264
|
#include <algorithm>
#include <iostream>
using namespace std;
main() {
int data1[10], data2[10];
while (cin >> data1[0]) {
for (int i = 1; i < 10; i++) {
cin >> data1[i];
}
for (int i = 0; i < 10; i++) {
cin >> data2[i];
}
sort(data1, data1 + 10);
sort(data2, data2 + 10);
cout << data1[7] + data1[8] + data1[9] << endl;
cout << data2[7] + data2[8] + data2[9] << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
main() {
int data1[10], data2[10];
while (cin >> data1[0]) {
for (int i = 1; i < 10; i++) {
cin >> data1[i];
}
for (int i = 0; i < 10; i++) {
cin >> data2[i];
}
sort(data1, data1 + 10);
sort(data2, data2 + 10);
cout << data1[7] + data1[8] + data1[9] << ' ';
cout << data2[7] + data2[8] + data2[9] << endl;
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 12, 103, 0, 104], ["+", 8, 9, 0, 1, 0, 16, 12, 103, 0, 125]]
| 1
| 140
|
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#ifdef _MSC_VER
#define __typeof__ decltype
template <class T> int __builtin_popcount(T n) {
return n ? 1 + __builtin_popcount(n & (n - 1)) : 0;
}
#endif
#define foreach(it, c) \
for (__typeof__((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define popcount __builtin_popcount
template <class T> void max_swap(T &a, const T b) { a = max(a, b); }
template <class T> void min_swap(T &a, const T b) { a = min(a, b); }
const double EPS = 1e-10;
typedef long long ll;
typedef pair<int, int> pint;
int main() {
for (int t = 0; t < 2; ++t) {
int a[10];
for (int i = 0; i < 10; ++i)
scanf("%d", a + i);
sort(a, a + 10);
printf("%d%c", accumulate(a + 7, a + 10, 0), t ? ' ' : '\n');
}
}
|
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#ifdef _MSC_VER
#define __typeof__ decltype
template <class T> int __builtin_popcount(T n) {
return n ? 1 + __builtin_popcount(n & (n - 1)) : 0;
}
#endif
#define foreach(it, c) \
for (__typeof__((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define popcount __builtin_popcount
template <class T> void max_swap(T &a, const T b) { a = max(a, b); }
template <class T> void min_swap(T &a, const T b) { a = min(a, b); }
const double EPS = 1e-10;
typedef long long ll;
typedef pair<int, int> pint;
int main() {
for (int t = 0; t < 2; ++t) {
int a[10];
for (int i = 0; i < 10; ++i)
scanf("%d", a + i);
sort(a, a + 10);
printf("%d%c", accumulate(a + 7, a + 10, 0), t ? '\n' : ' ');
}
}
|
[["-", 0, 2, 3, 4, 0, 41, 64, 103, 0, 125], ["+", 0, 2, 3, 4, 0, 41, 64, 103, 0, 44], ["-", 0, 2, 3, 4, 0, 41, 75, 103, 0, 44], ["+", 0, 2, 3, 4, 0, 41, 75, 103, 0, 125]]
| 1
| 273
|
#include <algorithm>
#include <cstdio>
#define s(A, B) std::sort(A, B);
int main() {
int W[10], K[10], p;
for (int i = 0; i < 20; i++)
scanf("%d", &p), (i < 10) ? W[i] = p : W[i - 10] = p;
s(W, W + 10);
s(K, K + 10);
int Wp = W[7] + W[8] + W[9], Kp = K[7] + K[8] + K[9];
printf("%d %d\n", Wp, Kp);
}
|
#include <algorithm>
#include <cstdio>
#define s(A, B) std::sort(A, B);
int main() {
int W[10], K[10], p;
for (int i = 0; i < 20; i++)
scanf("%d", &p), (i < 10) ? W[i] = p : K[i - 10] = p;
s(W, W + 10);
s(K, K + 10);
int Wp = W[7] + W[8] + W[9], Kp = K[7] + K[8] + K[9];
printf("%d %d\n", Wp, Kp);
}
|
[["-", 0, 34, 12, 41, 75, 11, 31, 69, 28, 22], ["+", 0, 34, 12, 41, 75, 11, 31, 69, 28, 22]]
| 1
| 142
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> W, K;
for (int i = 0, j; i < 10; i++) {
cin >> j;
W.push_back(j);
}
for (int i = 0, j; i < 10; i++) {
cin >> j;
K.push_back(j);
}
sort(W.begin(), W.end());
sort(K.begin(), K.end());
cout << W[9] + W[8] + W[7] << endl << K[9] + K[8] + K[7] << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> W, K;
for (int i = 0, j; i < 10; i++) {
cin >> j;
W.push_back(j);
}
for (int i = 0, j; i < 10; i++) {
cin >> j;
K.push_back(j);
}
sort(W.begin(), W.end());
sort(K.begin(), K.end());
cout << W[9] + W[8] + W[7] << " " << K[9] + K[8] + K[7] << endl;
return 0;
}
|
[["-", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]]
| 1
| 151
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b;
int w[10], k[10];
for (int i = 0; i < 10; i++) {
cin >> a;
w[i] = a;
}
for (int i = 0; i < 10; i++) {
cin >> b;
k[i] = b;
}
sort(w, w + 9);
sort(k, k + 9);
cout << w[9] + w[8] + w[7] << " " << k[9] + k[8] + k[7] << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b;
int w[10], k[10];
for (int i = 0; i < 10; i++) {
cin >> a;
w[i] = a;
}
for (int i = 0; i < 10; i++) {
cin >> b;
k[i] = b;
}
sort(w, w + 10);
sort(k, k + 10);
cout << w[9] + w[8] + w[7] << " " << k[9] + k[8] + k[7] << endl;
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 143
|
/*
0533:Contest
*/
#include <iostream>
#include <queue>
using namespace std;
int main(void) {
priority_queue<int> W;
priority_queue<int> K;
int WP, KP, tops[2][3];
for (int i = 0; i < 10; i++) {
int p;
cin >> p;
W.push(p);
}
for (int j = 0; j < 3; j++) {
tops[0][j] = W.top();
W.pop();
}
WP = tops[0][0] + tops[0][1] + tops[0][2];
for (int i = 0; i < 10; i++) {
int p;
cin >> p;
K.push(p);
}
for (int j = 0; j < 3; j++) {
tops[1][j] = K.top();
K.pop();
}
KP = tops[1][0] + tops[1][1] + tops[1][2];
cout << WP << endl << KP << endl;
return 0;
}
|
/*
0533:Contest
*/
#include <iostream>
#include <queue>
using namespace std;
int main(void) {
priority_queue<int> W;
priority_queue<int> K;
int WP, KP, tops[2][3];
for (int i = 0; i < 10; i++) {
int p;
cin >> p;
W.push(p);
}
for (int j = 0; j < 3; j++) {
tops[0][j] = W.top();
W.pop();
}
WP = tops[0][0] + tops[0][1] + tops[0][2];
for (int i = 0; i < 10; i++) {
int p;
cin >> p;
K.push(p);
}
for (int j = 0; j < 3; j++) {
tops[1][j] = K.top();
K.pop();
}
KP = tops[1][0] + tops[1][1] + tops[1][2];
cout << WP << ' ' << KP << endl;
return 0;
}
|
[["-", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 16, 31, 16, 12, 103, 0, 104], ["+", 0, 16, 31, 16, 31, 16, 12, 103, 0, 125]]
| 1
| 238
|
W = []
K = []
for i in range(10):
W.append(int(input()))
for i in range(10):
K.append(int(input()))
W.sort(reverse=True)
K.sort(reverse=True)
print(W[0] + W[1] + W[2])
print(K[0] + K[1] + K[2])
|
W = []
K = []
for i in range(10):
W.append(int(input()))
for i in range(10):
K.append(int(input()))
W.sort(reverse=True)
K.sort(reverse=True)
print(W[0] + W[1] + W[2] , K[0] + K[1] + K[2])
|
[["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25], ["-", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 21]]
| 5
| 96
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.