buggy_code
stringlengths 11
625k
| fixed_code
stringlengths 17
625k
| bug_type
stringlengths 2
4.45k
| language
int64 0
8
| token_count
int64 5
200k
| change_count
int64 0
100
|
|---|---|---|---|---|---|
import java.util.Scanner;
public class Main {
public static Scanner sc;
public static void main(String[] args) {
sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt(), ap = 0, bp = 0;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
int a = sc.nextInt();
int b = sc.nextInt();
if (a > b)
ap += a + b;
if (a < b)
bp += a + b;
if (a == b)
ap += a;
bp += b;
}
System.out.println(ap + " " + bp);
}
}
}
|
import java.util.Scanner;
public class Main {
public static Scanner sc;
public static void main(String[] args) {
sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
int ap = 0, bp = 0;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
int a = sc.nextInt();
int b = sc.nextInt();
if (a > b)
ap += a + b;
if (a < b)
bp += a + b;
if (a == b) {
ap += a;
bp += b;
}
}
System.out.println(ap + " " + bp);
}
}
}
|
[["-", 8, 196, 0, 52, 8, 196, 0, 503, 0, 21], ["+", 8, 196, 0, 52, 8, 196, 0, 503, 0, 35], ["+", 0, 52, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 7, 8, 196, 0, 57, 64, 196, 0, 45], ["+", 0, 7, 8, 196, 0, 57, 64, 196, 0, 46]]
| 3
| 157
| 5
|
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(bf.readLine());
// System.out.println(n);
while (n != 0) {
Score s = new Score();
for (int i = 0; i < n; i++) {
String new_line = bf.readLine();
String[] data = new_line.split(" ");
int a = Integer.parseInt(data[0]);
int b = Integer.parseInt(data[1]);
s.openCard(a, b);
// System.out.println("a = " + a + " b = " + b);
}
s.print();
n = Integer.parseInt(bf.readLine());
}
// System.out.print("finish");
}
}
class Score {
int A = 0, B = 0;
public Score() {}
public void openCard(int a, int b) {
if (a > b) {
A += (a + b);
return;
}
if (b > a) {
B += (a + b);
return;
}
A += a;
B += b;
}
public void print() { System.out.print(A + " " + B); }
}
|
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(bf.readLine());
// System.out.println(n);
while (n != 0) {
Score s = new Score();
for (int i = 0; i < n; i++) {
String new_line = bf.readLine();
String[] data = new_line.split(" ");
int a = Integer.parseInt(data[0]);
int b = Integer.parseInt(data[1]);
s.openCard(a, b);
// System.out.println("a = " + a + " b = " + b);
}
s.print();
n = Integer.parseInt(bf.readLine());
}
// System.out.print("finish");
}
}
class Score {
int A = 0, B = 0;
public Score() {}
public void openCard(int a, int b) {
if (a > b) {
A += (a + b);
return;
}
if (b > a) {
B += (a + b);
return;
}
A += a;
B += b;
}
public void print() { System.out.println(A + " " + B); }
}
|
[["-", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22]]
| 3
| 271
| 2
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
BufferedReader bufferedReader =
new BufferedReader(new InputStreamReader(System.in));
int counter = 0;
ArrayList<Integer[]> alResult = new ArrayList<Integer[]>();
while ((counter = Integer.parseInt(bufferedReader.readLine())) != 0) {
int playerA = 0;
int playerB = 0;
for (int i = 0; i < counter; i++) {
String[] arrCard = bufferedReader.readLine().split(" ");
int playerACard = Integer.parseInt(arrCard[0]);
int playerBCard = Integer.parseInt(arrCard[1]);
if (playerACard < playerBCard)
playerA += playerACard + playerBCard;
else if (playerACard < playerBCard)
playerA += playerACard + playerBCard;
else {
playerA += playerACard;
playerB += playerBCard;
}
}
Integer[] arrResult = new Integer[2];
arrResult[0] = playerA;
arrResult[1] = playerB;
alResult.add(arrResult);
}
for (int i = 0; i < alResult.size(); i++)
System.out.println(alResult.get(i)[0] + " " + alResult.get(i)[1]);
}
}
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
BufferedReader bufferedReader =
new BufferedReader(new InputStreamReader(System.in));
int counter = 0;
ArrayList<Integer[]> alResult = new ArrayList<Integer[]>();
while ((counter = Integer.parseInt(bufferedReader.readLine())) != 0) {
int playerA = 0;
int playerB = 0;
for (int i = 0; i < counter; i++) {
String[] arrCard = bufferedReader.readLine().split(" ");
int playerACard = Integer.parseInt(arrCard[0]);
int playerBCard = Integer.parseInt(arrCard[1]);
if (playerACard > playerBCard)
playerA += playerACard + playerBCard;
else if (playerACard < playerBCard)
playerB += playerACard + playerBCard;
else {
playerA += playerACard;
playerB += playerBCard;
}
}
Integer[] arrResult = new Integer[2];
arrResult[0] = playerA;
arrResult[1] = playerB;
alResult.add(arrResult);
}
for (int i = 0; i < alResult.size(); i++)
System.out.println(alResult.get(i)[0] + " " + alResult.get(i)[1]);
}
}
|
[["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 18], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 47], ["-", 0, 57, 75, 57, 64, 1, 0, 11, 31, 22], ["+", 0, 57, 75, 57, 64, 1, 0, 11, 31, 22]]
| 3
| 295
| 4
|
import java.util.*;
class Main {
static List<LinkedList<Integer>> kaito;
/*
public static void kurikaesi(int x) {
int[][] card = new int[x][2];
for(int i=0; i<x; i++){
Scanner sc = new Scanner(System.in);
String line = sc.nextLine();
String[] data = line.split(" ");
card[i][0] = Integer.parseInt(data[0]);
card[i][1] = Integer.parseInt(data[1]);
}
int goukei_A = 0, goukei_B = 0;
for(int[] item : card){
if(item[0] > item[1]){
goukei_A += item[0] + item[1];
}else if(item[0] < item[1]){
goukei_B += item[0] + item[1];
}else{
goukei_A += item[0];
goukei_B += item[0];
}
}
LinkedList<Integer> kari = new LinkedList<Integer>();
kari.add(goukei_A);
kari.add(goukei_B);
kaito.add(kari);
}*/
public static void main(String[] args) {
kaito = new LinkedList<>();
Scanner sc = new Scanner(System.in);
while (true) {
String line = sc.nextLine();
int n = Integer.parseInt(line);
if (n == 0) {
break;
} else {
int[][] card = new int[n][2];
for (int i = 0; i < n; i++) {
String line1 = sc.nextLine();
String[] data = line1.split(" ");
card[i][0] = Integer.parseInt(data[0]);
card[i][1] = Integer.parseInt(data[1]);
}
int goukei_A = 0, goukei_B = 0;
for (int[] item : card) {
if (item[0] > item[1]) {
goukei_A += item[0] + item[1];
} else if (item[0] < item[1]) {
goukei_B += item[0] + item[1];
} else {
goukei_A += item[0];
goukei_B += item[0];
}
}
LinkedList<Integer> kari = new LinkedList<Integer>();
kari.add(goukei_A);
kari.add(goukei_B);
kaito.add(kari);
}
}
for (LinkedList<Integer> item : kaito) {
int c = 0;
for (int it : item) {
System.out.print(it);
if (c == 0) {
System.out.print("???");
c += 1;
}
}
System.out.println();
}
}
}
|
import java.util.*;
class Main {
static List<LinkedList<Integer>> kaito;
/*
public static void kurikaesi(int x) {
int[][] card = new int[x][2];
for(int i=0; i<x; i++){
Scanner sc = new Scanner(System.in);
String line = sc.nextLine();
String[] data = line.split(" ");
card[i][0] = Integer.parseInt(data[0]);
card[i][1] = Integer.parseInt(data[1]);
}
int goukei_A = 0, goukei_B = 0;
for(int[] item : card){
if(item[0] > item[1]){
goukei_A += item[0] + item[1];
}else if(item[0] < item[1]){
goukei_B += item[0] + item[1];
}else{
goukei_A += item[0];
goukei_B += item[0];
}
}
LinkedList<Integer> kari = new LinkedList<Integer>();
kari.add(goukei_A);
kari.add(goukei_B);
kaito.add(kari);
}*/
public static void main(String[] args) {
kaito = new LinkedList<>();
Scanner sc = new Scanner(System.in);
while (true) {
String line = sc.nextLine();
int n = Integer.parseInt(line);
if (n == 0) {
break;
} else {
int[][] card = new int[n][2];
for (int i = 0; i < n; i++) {
String line1 = sc.nextLine();
String[] data = line1.split(" ");
card[i][0] = Integer.parseInt(data[0]);
card[i][1] = Integer.parseInt(data[1]);
}
int goukei_A = 0, goukei_B = 0;
for (int[] item : card) {
if (item[0] > item[1]) {
goukei_A += item[0] + item[1];
} else if (item[0] < item[1]) {
goukei_B += item[0] + item[1];
} else {
goukei_A += item[0];
goukei_B += item[0];
}
}
LinkedList<Integer> kari = new LinkedList<Integer>();
kari.add(goukei_A);
kari.add(goukei_B);
kaito.add(kari);
}
}
for (LinkedList<Integer> item : kaito) {
int c = 0;
for (int it : item) {
System.out.print(it);
if (c == 0) {
System.out.print(" ");
c += 1;
}
}
System.out.println();
}
}
}
|
[["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491]]
| 3
| 374
| 2
|
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
while (sc.hasNext()) {
int n = Integer.parseInt(sc.next());
if (n == 0) {
break;
} else {
judge(n);
}
}
sc.close();
}
private static void judge(int n) {
int a = 0;
int b = 0;
int A = 0;
int B = 0;
for (int i = 0; i < n; i++) {
a = Integer.parseInt(sc.next());
b = Integer.parseInt(sc.next());
if (a > b) {
A += a + b;
} else if (a < b) {
B += a + b;
} else {
A = a;
B = b;
}
}
System.out.printf("%d %d\n", A, B);
}
}
|
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
while (sc.hasNext()) {
int n = Integer.parseInt(sc.next());
if (n == 0) {
break;
} else {
judge(n);
}
}
sc.close();
}
private static void judge(int n) {
int a = 0;
int b = 0;
int A = 0;
int B = 0;
for (int i = 0; i < n; i++) {
a = Integer.parseInt(sc.next());
b = Integer.parseInt(sc.next());
if (a > b) {
A += a + b;
} else if (a < b) {
B += a + b;
} else {
A += a;
B += b;
}
}
System.out.printf("%d %d\n", A, B);
}
}
|
[["-", 75, 57, 75, 196, 0, 1, 0, 11, 17, 32], ["+", 75, 57, 75, 196, 0, 1, 0, 11, 17, 107]]
| 3
| 212
| 4
|
import java.io.*;
class Main {
public static void main(String[] args) {
try {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int je, x, y, z;
int[] ini = new int[100];
z = 0;
while (true) {
je = Integer.valueOf(br.readLine());
if (je == 0)
break;
for (int i = 0; i < je; i++) {
String s = br.readLine();
x = Integer.parseInt(s.substring(0, s.indexOf(" ")));
y = Integer.parseInt(s.substring(s.indexOf(" ") + 1, s.length()));
if (x > y)
ini[z] += (x + y);
else if (x == y) {
ini[z] = x;
ini[z + 1] = y;
} else
ini[z + 1] += (x + y);
}
z += 2;
}
for (x = 0; x < z; x = x + 2)
System.out.println(ini[x] + " " + ini[x + 1]);
} catch (Exception e) {
System.out.println("Error");
}
}
}
|
import java.io.*;
class Main {
public static void main(String[] args) {
try {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int je, x, y, z;
int[] ini = new int[100];
z = 0;
while (true) {
je = Integer.valueOf(br.readLine());
if (je == 0)
break;
for (int i = 0; i < je; i++) {
String s = br.readLine();
x = Integer.parseInt(s.substring(0, s.indexOf(" ")));
y = Integer.parseInt(s.substring(s.indexOf(" ") + 1, s.length()));
if (x > y)
ini[z] += (x + y);
else if (x == y) {
ini[z] += x;
ini[z + 1] += y;
} else
ini[z + 1] += (x + y);
}
z += 2;
}
for (x = 0; x < z; x = x + 2)
System.out.println(ini[x] + " " + ini[x + 1]);
} catch (Exception e) {
System.out.println("Error");
}
}
}
|
[["-", 75, 57, 64, 196, 0, 1, 0, 11, 17, 32], ["+", 75, 57, 64, 196, 0, 1, 0, 11, 17, 107]]
| 3
| 286
| 4
|
#include <stdio.h>
int main() {
int n, a, b, x, y, i;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
a = 0;
b = 0;
for (i = 0; i < n; i++) {
scanf("%d%d", &x, &y);
if (x > y)
a = a + x + y;
else if (x < y)
b = b + x + y;
else {
a = a + x;
b = b + y;
}
printf("%d %d\n", a, b);
}
}
return 0;
}
|
#include <stdio.h>
int main() {
int n, a, b, x, y, i;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
a = 0;
b = 0;
for (i = 0; i < n; i++) {
scanf("%d%d", &x, &y);
if (x > y)
a = a + x + y;
else if (x < y)
b = b + x + y;
else {
a = a + x;
b = b + y;
}
}
printf("%d %d\n", a, b);
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46]]
| 0
| 140
| 2
|
#include <assert.h>
#include <stdio.h>
const int N = 10000;
void judge_score(int *a_score, int *b_score, const int a_card,
const int b_card);
void CardGame(const int n);
int main(int argc, char *argv[]) {
int n;
for (; 1;) {
scanf("%d", &n);
assert(n <= N && "exceed n threshold");
if (n) {
CardGame(n);
} else {
break;
}
}
return 0;
}
void judge_score(int *a_score, int *b_score, const int a_card,
const int b_card) {
if (a_card > b_card) {
*a_score += a_card + b_card;
} else if (a_card < b_card) {
*b_score += a_card + b_card;
} else {
*a_score += a_card;
*b_score += b_card;
}
return;
}
void CardGame(const int n) {
int i;
int a_score = 0, b_score = 0;
int a_card, b_card;
for (i = 0; i < n; i++) {
scanf("%*c%d %d", &a_card, &b_card);
judge_score(&a_score, &b_score, a_card, b_card);
}
printf("%d %d", a_score, b_score);
}
|
#include <assert.h>
#include <stdio.h>
const int N = 10000;
void judge_score(int *a_score, int *b_score, const int a_card,
const int b_card);
void CardGame(const int n);
int main(int argc, char *argv[]) {
int n;
for (; 1;) {
scanf("%d", &n);
assert(n <= N && "exceed n threshold");
if (n) {
CardGame(n);
} else {
break;
}
}
return 0;
}
void judge_score(int *a_score, int *b_score, const int a_card,
const int b_card) {
if (a_card > b_card) {
*a_score += a_card + b_card;
} else if (a_card < b_card) {
*b_score += a_card + b_card;
} else {
*a_score += a_card;
*b_score += b_card;
}
return;
}
void CardGame(const int n) {
int i;
int a_score = 0, b_score = 0;
int a_card, b_card;
for (i = 0; i < n; i++) {
scanf("%*c%d %d", &a_card, &b_card);
judge_score(&a_score, &b_score, a_card, b_card);
}
printf("%d %d\n", a_score, b_score);
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 248
| 1
|
#include <stdio.h>
int main() {
int k = 1, a, b, A = 0, B = 0, i;
while (1) {
scanf("%d", &k);
if (k == 0) {
break;
}
for (i = 0; i < k; i++) {
scanf("%d %d", &a, &b);
if (a > b) {
A += a + b;
} else if (a < b) {
B += a + b;
} else {
A = +a;
B = +b;
}
}
printf("%d %d\n", A, B);
A = 0;
B = 0;
}
return 0;
}
|
#include <stdio.h>
int main() {
int k = 1, a, b, A = 0, B = 0, i;
while (1) {
scanf("%d", &k);
if (k == 0) {
break;
}
for (i = 0; i < k; i++) {
scanf("%d %d", &a, &b);
if (a > b) {
A += a + b;
} else if (a < b) {
B += a + b;
} else {
A += a;
B += b;
}
}
printf("%d %d\n", A, B);
A = 0;
B = 0;
}
return 0;
}
|
[["-", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["-", 0, 9, 0, 1, 0, 11, 12, 91, 17, 72], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 17, 107]]
| 0
| 146
| 6
|
#include <stdio.h>
int main(void) {
int n, a, b, i;
int suma = 0, sumb = 0;
while (scanf("%d", &n), n) {
suma = 0;
sumb = 0;
for (i = 0; i < n; i++) {
scanf("%d%d", &a, &b);
a > b ? (suma += a + b)
: a < b ? (sumb += a + b)
: (suma += a, sumb += b);
}
}
printf("%d %d\n", suma, sumb);
return 0;
}
|
#include <stdio.h>
int main(void) {
int n, a, b, i;
int suma = 0, sumb = 0;
while (scanf("%d", &n) && n != 0) {
suma = 0;
sumb = 0;
for (i = 0; i < n; i++) {
scanf("%d%d", &a, &b);
a > b ? (suma += a + b)
: a < b ? (sumb += a + b)
: (suma += a, sumb += b);
}
printf("%d %d\n", suma, sumb);
}
return 0;
}
|
[["-", 8, 9, 0, 52, 15, 23, 0, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 98], ["+", 0, 52, 15, 23, 0, 16, 12, 16, 17, 79], ["+", 0, 52, 15, 23, 0, 16, 12, 16, 12, 13], ["-", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 0
| 128
| 6
|
#include <stdio.h>
int main(void) {
int n, a, b, a1, b1, i;
while (1) {
a1 = 0;
b1 = 0;
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d%d", &a, &b);
if (a > b) {
a1 = a + b;
} else if (b > a) {
b1 = a + b;
} else {
a1 += a;
b1 += b;
}
}
printf("%d %d\n", a1, b1);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int n, a, b, a1, b1, i;
while (1) {
a1 = 0;
b1 = 0;
scanf("%d", &n);
if (n == 0) {
break;
}
for (i = 0; i < n; i++) {
scanf("%d%d", &a, &b);
if (a > b) {
a1 += a + b;
} else if (b > a) {
b1 += a + b;
} else {
a1 += a;
b1 += b;
}
}
printf("%d %d\n", a1, b1);
}
return 0;
}
|
[["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 107]]
| 0
| 139
| 4
|
#include <stdio.h>
int main() {
int n;
int i;
int s, t;
int A, B;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
A = 0;
B = 0;
for (i = 0; i < n; i++) {
scanf("%d %d", &s, &t);
if (s > t)
A += s + t;
else if (s < t)
B += s + t;
else {
A += s;
B += t;
}
}
printf("%d %d", A, B);
}
return 0;
}
|
#include <stdio.h>
int main() {
int n;
int i;
int s, t;
int A, B;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
A = 0;
B = 0;
for (i = 0; i < n; i++) {
scanf("%d %d", &s, &t);
if (s > t)
A += s + t;
else if (s < t)
B += s + t;
else {
A += s;
B += t;
}
}
printf("%d %d\n", A, B);
}
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 134
| 1
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int i, j, k;
int n, a, b, ans1, ans2;
int main() {
scanf("%d", &n);
while (n != 0) {
ans1 = 0;
ans2 = 0;
for (i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
if (a > b)
ans1 += a + b;
else if (a < b)
ans2 += a + b;
else if (a == b)
ans1 += a, ans2 += b;
}
printf("%d %d\n", a, b);
scanf("%d", &n);
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int i, j, k;
int n, a, b, ans1, ans2;
int main() {
scanf("%d", &n);
while (n != 0) {
ans1 = 0;
ans2 = 0;
for (i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
if (a > b)
ans1 += a + b;
else if (a < b)
ans2 += a + b;
else if (a == b)
ans1 += a, ans2 += b;
}
printf("%d %d\n", ans1, ans2);
scanf("%d", &n);
}
return 0;
}
|
[["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]]
| 0
| 149
| 4
|
#include <stdio.h>
int main() {
int i, n, a[10000], b[10000], a_score = 0, b_score = 0;
while (1) {
a_score = 0;
b_score = 0;
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d %d", &a[i], &b[i]);
}
for (i = 0; i < n; i++) {
if (a[i] > b[i])
a_score += a[i] + b[i];
if (a[i] == b[i]) {
a_score += a[i];
b_score += b[i];
}
if (a[i] < b[i])
b_score += a[i] + b[i];
}
printf("%d %d\n", a_score, b_score);
printf("\n");
}
return 0;
}
|
#include <stdio.h>
int main() {
int i, n, a[10000], b[10000], a_score = 0, b_score = 0;
while (1) {
a_score = 0;
b_score = 0;
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf("%d %d", &a[i], &b[i]);
}
for (i = 0; i < n; i++) {
if (a[i] > b[i])
a_score += a[i] + b[i];
if (a[i] == b[i]) {
a_score += a[i];
b_score += b[i];
}
if (a[i] < b[i])
b_score += a[i] + b[i];
}
printf("%d %d\n", a_score, b_score);
}
return 0;
}
|
[["-", 0, 52, 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], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 0
| 210
| 7
|
#include <stdio.h>
int main() {
int n, a, b, i, p, q;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
p = 0;
q = 0;
for (i = 0; i < n; i++) {
scanf("%d%d", &a, &b);
if (a > b)
p = p + a + b;
else if (a < b)
q = p + a + b;
else if (a == b) {
p = a;
q = a;
}
}
printf("%d %d\n", p, q);
}
return 0;
}
|
#include <stdio.h>
int main() {
int n, a, b, i, p, q;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
p = 0;
q = 0;
for (i = 0; i < n; i++) {
scanf("%d%d", &a, &b);
if (a > b)
p = p + a + b;
else if (a < b)
q = q + a + b;
else if (a == b) {
p = p + a;
q = q + a;
}
}
printf("%d %d\n", p, q);
}
return 0;
}
|
[["-", 64, 1, 0, 11, 12, 16, 31, 16, 31, 22], ["+", 64, 1, 0, 11, 12, 16, 31, 16, 31, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72]]
| 0
| 142
| 6
|
#include <stdio.h>
int main(void) {
int n, a, b, sum_a, sum_b;
int i;
n = 1;
while (scanf("%d", &n) != EOF && n != 0) {
sum_a = sum_b = 0;
for (i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
if (a > b) {
sum_a += a + b;
} else if (a < b) {
sum_b += a + b;
} else {
sum_a = a;
sum_b = b;
}
}
printf("%d %d\n", sum_a, sum_b);
}
return (0);
}
|
#include <stdio.h>
int main(void) {
int n, a, b, sum_a, sum_b;
int i;
while (scanf("%d", &n) != EOF && n != 0) {
sum_a = sum_b = 0;
for (i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
if (a > b) {
sum_a += a + b;
} else if (a < b) {
sum_b += a + b;
} else {
sum_a += a;
sum_b += b;
}
}
printf("%d %d\n", sum_a, sum_b);
}
return (0);
}
|
[["-", 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], ["-", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 17, 107]]
| 0
| 138
| 8
|
#include <stdio.h>
int main() {
int i, n;
int A, B;
int sumA, sumB;
while (scanf("%d", &n) != EOF) {
if (n > 10000)
break;
sumA = 0;
sumB = 0;
for (i = 0; i < n; i++) {
scanf("%d %d", &A, &B);
if (A < B) {
sumB += A + B;
} else if (A > B) {
sumA += A + B;
} else {
sumA += A;
sumB += B;
}
}
printf("%d %d\n", sumA, sumB);
}
return 0;
}
|
#include <stdio.h>
int main() {
int i, n;
int A, B;
int sumA, sumB;
while (scanf("%d", &n) != EOF) {
if (n > 10000 || n == 0)
break;
sumA = 0;
sumB = 0;
for (i = 0; i < n; i++) {
scanf("%d %d", &A, &B);
if (A < B) {
sumB += A + B;
} else if (A > B) {
sumA += A + B;
} else {
sumA += A;
sumB += B;
}
}
printf("%d %d\n", sumA, sumB);
}
return 0;
}
|
[["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 106], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 60], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]]
| 0
| 138
| 4
|
#include <stdio.h>
int main(void) {
int n;
int i;
int a, b;
int a_score, b_score;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
a_score = b_score = 0;
for (i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
if (a > b) {
a_score += a + b;
} else if (a < b) {
b_score += a + b;
} else {
a_score = a;
b_score = b;
}
}
printf("%d %d\n", a_score, b_score);
}
return (0);
}
|
#include <stdio.h>
int main(void) {
int n;
int i;
int a, b;
int a_score, b_score;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
a_score = b_score = 0;
for (i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
if (a > b) {
a_score += a + b;
} else if (a < b) {
b_score += a + b;
} else {
a_score += a;
b_score += b;
}
}
printf("%d %d\n", a_score, b_score);
}
return (0);
}
|
[["-", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 17, 107]]
| 0
| 142
| 4
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
using namespace std;
typedef long long Int;
#define REP(i, x) for (int i = 0; i < x; ++i)
Int Ap, Bp;
int main() {
int n;
int a, b;
while (cin >> n, n) {
REP(i, n) {
cin >> a >> b;
if (a > b) {
Ap += a;
Ap += b;
} else if (a < b) {
Bp += a;
Bp += b;
} else {
Ap += a;
Bp += b;
}
}
cout << Ap << " " << Bp << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
using namespace std;
typedef long long Int;
#define REP(i, x) for (int i = 0; i < x; ++i)
Int Ap, Bp;
int main() {
int n;
int a, b;
while (cin >> n, n) {
Ap = Bp = 0;
REP(i, n) {
cin >> a >> b;
if (a > b) {
Ap += a;
Ap += b;
} else if (a < b) {
Bp += a;
Bp += b;
} else {
Ap += a;
Bp += b;
}
}
cout << Ap << " " << Bp << endl;
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 129
| 6
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int a, b, c, d;
for (int i = 0; i < n; ++i) {
cin >> c >> d;
if (c > d)
a += c + d;
else if (d > c)
b += c + d;
else
a += c, b += d;
}
printf("%d %d\n", a, b);
}
return 0;
}
|
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int a = 0, b = 0, c, d;
for (int i = 0; i < n; ++i) {
cin >> c >> d;
if (c > d)
a += c + d;
else if (d > c)
b += c + d;
else
a += c, b += d;
}
printf("%d %d\n", a, b);
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 13]]
| 1
| 107
| 4
|
#include <iostream>
using namespace std;
int main() {
while (1) {
int i, n, x, y;
cin >> n;
if (n == 0) {
break;
} else {
x = 0;
y = 0;
int a[n], b[n];
for (i = 1; i <= n; i++) {
cin >> a[i] >> b[i];
if (a[i] > b[i]) {
x += a[i] + b[i];
} else if (a[i] < b[i]) {
y += a[i] + b[i];
} else {
x += a[i];
y += b[i];
}
cout << x << " " << y << "\n";
}
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
while (1) {
int i, n, x, y;
cin >> n;
if (n == 0) {
break;
} else {
x = 0;
y = 0;
int a[n], b[n];
for (i = 1; i <= n; i++) {
cin >> a[i] >> b[i];
if (a[i] > b[i]) {
x += a[i] + b[i];
} else if (a[i] < b[i]) {
y += a[i] + b[i];
} else {
x += a[i];
y += b[i];
}
}
cout << x << " " << y << "\n";
}
}
return 0;
}
|
[["+", 75, 76, 0, 9, 0, 7, 8, 9, 0, 46], ["-", 75, 76, 0, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 177
| 2
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (x > y)
a += x + y;
else if (x == y) {
a += x;
b += y;
} else
b += x + y;
}
cout << a << " " << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n) {
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (x > y)
a += x + y;
else if (x == y) {
a += x;
b += y;
} else
b += x + y;
}
cout << a << " " << b << endl;
}
}
|
[["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151]]
| 1
| 107
| 2
|
#include <iostream>
using namespace std;
int main(void) {
int a, b;
int n;
while (cin >> n, n) {
a = b = 0;
while (n--) {
int c, d;
cin >> c >> d;
if (c == d) {
a += c + d;
b += c + d;
} else if (c > d)
a += c + d;
else
b += c + d;
}
cout << a << " " << b << endl;
}
}
|
#include <iostream>
using namespace std;
int main(void) {
int a, b;
int n;
while (cin >> n, n) {
a = b = 0;
while (n--) {
int c, d;
cin >> c >> d;
if (c == d) {
a += c;
b += c;
} else if (c > d)
a += c + d;
else
b += c + d;
}
cout << a << " " << b << endl;
}
}
|
[["-", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 12, 22]]
| 1
| 107
| 4
|
#include <stdio.h>
int main() {
int N;
int A, B, SA = 0, SB = 0;
while (1) {
SA = 0, SB = 0;
scanf("%d", &N);
if (N == 0)
break;
for (int i = 0; i < N; i++) {
scanf("%d %d", &A, &B);
if (A > B)
SA = SA + A + B;
else if (B > A)
SB = SB + A + B;
else
SA += A;
SB += B;
}
printf("%d %d\n", SA, SB);
}
return 0;
}
|
#include <stdio.h>
int main() {
int N;
int A, B, SA = 0, SB = 0;
while (1) {
SA = 0, SB = 0;
scanf("%d", &N);
if (N == 0)
break;
for (int i = 0; i < N; i++) {
scanf("%d %d", &A, &B);
if (A > B)
SA = SA + A + B;
else if (B > A)
SB = SB + A + B;
else {
SA += A;
SB += B;
}
}
printf("%d %d\n", SA, SB);
}
return 0;
}
|
[["+", 75, 76, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 75, 76, 0, 57, 75, 76, 0, 9, 0, 46]]
| 1
| 138
| 2
|
#include <iostream>
using namespace std;
int main() {
int a;
int uma;
int ushi;
int b;
int c;
int i;
while (true) {
cin >> a;
if (a == 0) {
break;
} else {
while (true) {
if (i < a) {
cin >> b >> c;
if (b > c) {
uma = uma + b + c;
}
if (b == c) {
uma = uma + b;
ushi = ushi + c;
} else {
ushi = ushi + b + c;
}
i++;
}
if (i == a) {
break;
}
}
cout << uma << " " << ushi << endl;
uma = 0;
ushi = 0;
i = 0;
}
}
}
|
#include <iostream>
using namespace std;
int main() {
int a;
int uma;
int ushi;
int b;
int c;
int i;
while (true) {
cin >> a;
if (a == 0) {
break;
} else {
while (true) {
if (i < a) {
cin >> b;
cin >> c;
if (b > c) {
uma = uma + b + c;
} else if (b == c) {
uma = uma + b;
ushi = ushi + c;
} else {
ushi = ushi + b + c;
}
i = i + 1;
}
if (i == a) {
break;
}
}
cout << uma << " " << ushi << endl;
uma = 0;
ushi = 0;
i = 0;
}
}
}
|
[["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 0, 57, 64, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 57, 64, 9, 0, 57, 75, 76, 0, 95], ["-", 0, 57, 64, 9, 0, 1, 0, 27, 17, 29], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 13]]
| 1
| 157
| 8
|
#include <iostream>
using namespace std;
int main() {
int n;
int a[10001], b[10001];
int scoreA = 0, scoreB = 0;
int i;
while (1) {
cin >> n;
if (n == 0)
break;
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
if (a[i] > b[i]) {
scoreA += a[i] + b[i];
} else if (a[i] < b[i]) {
scoreB += a[i] + b[i];
} else {
scoreA += a[i];
scoreB += b[i];
}
}
cout << scoreA << " " << scoreB << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
int a[10001], b[10001];
int scoreA = 0, scoreB = 0;
int i;
while (1) {
cin >> n;
if (n == 0)
break;
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
if (a[i] > b[i]) {
scoreA += a[i] + b[i];
} else if (a[i] < b[i]) {
scoreB += a[i] + b[i];
} else {
scoreA += a[i];
scoreB += b[i];
}
}
cout << scoreA << " " << scoreB << endl;
scoreA = scoreB = 0;
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 168
| 6
|
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, a, b) for (i = a; i < b; ++i)
#define rep(i, n) REP(i, 0, n)
#define ll long long
#define ull unsigned ll
typedef long double ld;
#define SQR(X) ((X) * (X))
#define CUBE(X) ((X) * (X) * (X))
// #define int ll
using namespace std;
bool test = 0;
/* ?????????????????¬??¨ */
int main() {
int i, j, k, l;
int n;
while (scanf("%d", &n) != EOF) {
if (n == 0)
break;
int score[2] = {0};
for (i = 0; i < n; i++) {
int num[2];
cin >> num[0] >> num[1];
auto sum = num[0] + num[1];
if (num[0] > num[1])
score[0] += sum;
else if (num[0] < num[1])
score[1] += sum;
else {
for (j = 0; j < 2; j++)
score[i] += num[i];
}
}
printf("%d %d\n", score[0], score[1]);
}
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, a, b) for (i = a; i < b; ++i)
#define rep(i, n) REP(i, 0, n)
#define ll long long
#define ull unsigned ll
typedef long double ld;
#define SQR(X) ((X) * (X))
#define CUBE(X) ((X) * (X) * (X))
// #define int ll
using namespace std;
bool test = 0;
/* ?????????????????¬??¨ */
int main() {
int i, j, k, l;
int n;
while (scanf("%d", &n) != EOF) {
if (n == 0)
break;
int score[2] = {0};
for (i = 0; i < n; i++) {
int num[2];
cin >> num[0] >> num[1];
auto sum = num[0] + num[1];
if (num[0] > num[1])
score[0] += sum;
else if (num[0] < num[1])
score[1] += sum;
else {
for (j = 0; j < 2; j++)
score[j] += num[j];
}
}
printf("%d %d\n", score[0], score[1]);
}
return 0;
}
|
[["-", 8, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 8, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["-", 8, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["+", 8, 1, 0, 11, 12, 69, 341, 342, 0, 22]]
| 1
| 254
| 4
|
#include <iostream>
using namespace std;
#define repi(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
ios::sync_with_stdio(false);
int n;
int sa, sb, a, b;
while (1) {
cin >> n;
if (!n)
break;
sa = 0;
sb = 0;
rep(i, n) {
cin >> a >> b;
if (a > b)
sa += a + b;
else if (b > a)
sb += a + b;
else {
sa += a;
sb += b;
}
}
cout << sa << sb << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
#define repi(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
ios::sync_with_stdio(false);
int n;
int sa, sb, a, b;
while (1) {
cin >> n;
if (!n)
break;
sa = 0;
sb = 0;
rep(i, n) {
cin >> a >> b;
if (a > b)
sa += a + b;
else if (b > a)
sb += a + b;
else {
sa += a;
sb += b;
}
}
cout << sa << " " << sb << 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
| 135
| 4
|
#include <iostream>
using namespace std;
int main() {
int n, a, b;
while (cin >> n, n) {
a = 0;
b = 0;
for (int i = 0; i < n; i++) {
int sa, sb;
cin >> sa >> sb;
if (sa > sb)
a += sa + sb;
else if (sb > sa)
b += sa + sb;
else {
a += sa;
b += sb;
}
}
cout << a << b << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, a, b;
while (cin >> n, n) {
a = 0;
b = 0;
for (int i = 0; i < n; i++) {
int sa, sb;
cin >> sa >> sb;
if (sa > sb)
a += sa + sb;
else if (sb > sa)
b += sa + sb;
else {
a += sa;
b += sb;
}
}
cout << a << " " << b << 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
| 111
| 4
|
#include <iostream>
using namespace std;
int main() {
int a = 1, e = 0, f = 0, c, d;
while (1) {
cin >> a;
if (a != 0) {
break;
}
e = 0;
f = 0;
for (int b = 0; b < a; b++) {
cin >> c;
cin >> d;
if (c > d) {
e += c;
e += d;
} else if (d > c) {
f += c;
f += d;
} else {
e += c;
f += d;
}
}
cout << e << " " << f << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a = 1, e = 0, f = 0, c, d;
while (1) {
cin >> a;
if (a == 0) {
break;
}
e = 0;
f = 0;
for (int b = 0; b < a; b++) {
cin >> c;
cin >> d;
if (c > d) {
e += c;
e += d;
} else if (d > c) {
f += c;
f += d;
} else {
e += c;
f += d;
}
}
cout << e << " " << f << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60]]
| 1
| 140
| 2
|
#include <iostream>
using namespace std;
int n, a, b, c, d;
int main() {
while (true) {
cin >> n;
if (n == 0)
break;
a = 0;
b = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (a > b)
c += (a + b);
if (a < b)
d += (a + b);
if (a == b) {
c += a;
d += b;
}
}
cout << c << ' ' << d << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int n, a, b, c, d;
int main() {
while (true) {
cin >> n;
if (n == 0)
break;
c = 0;
d = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (a > b)
c += (a + b);
if (a < b)
d += (a + b);
if (a == b) {
c += a;
d += b;
}
}
cout << c << ' ' << d << endl;
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22]]
| 1
| 130
| 4
|
#include <iostream>
using namespace std;
int main() {
int cnt[2];
while (1) {
int n;
cin >> n;
if (n == 0)
break;
cnt[0] = 0;
cnt[1] = 0;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (a > b) {
cnt[0] += a + b;
} else if (a < b) {
cnt[1] += a + b;
} else {
cnt[0] += a;
cnt[1] += b;
}
}
cout << cnt[0] << cnt[1] << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int cnt[2];
while (1) {
int n;
cin >> n;
if (n == 0)
break;
cnt[0] = 0;
cnt[1] = 0;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (a > b) {
cnt[0] += a + b;
} else if (a < b) {
cnt[1] += a + b;
} else {
cnt[0] += a;
cnt[1] += b;
}
}
cout << cnt[0] << " " << cnt[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
| 149
| 4
|
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, anum, bnum;
int as, bs;
as = bs = 0;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (int i = 0; i < n; i++) {
scanf("%d%d", &anum, &bnum);
if (anum == bnum) {
as += anum;
bs += bnum;
}
else if (anum > bnum) {
as += anum;
as += bnum;
}
else if (anum < bnum) {
bs += anum;
bs += bnum;
}
}
printf("%d %d\n", as, bs);
}
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, anum, bnum;
int as, bs;
as = bs = 0;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (int i = 0; i < n; i++) {
scanf("%d%d", &anum, &bnum);
if (anum == bnum) {
as += anum;
bs += bnum;
}
else if (anum > bnum) {
as += anum;
as += bnum;
}
else if (anum < bnum) {
bs += anum;
bs += bnum;
}
}
printf("%d %d\n", as, bs);
as = bs = 0;
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 158
| 6
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n > 0) {
int a, b;
int res_a = 0, res_b = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (a > b)
res_a += (a + b);
else if (a < b)
res_b += (a + b);
else {
res_a += a;
res_b += b;
}
}
cout << res_a << res_b << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n > 0) {
int a, b;
int res_a = 0, res_b = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (a > b)
res_a += (a + b);
else if (a < b)
res_b += (a + b);
else {
res_a += a;
res_b += b;
}
}
cout << res_a << " " << res_b << endl;
}
}
|
[["+", 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
| 111
| 4
|
#include <stdio.h>
int main(void) {
int i, a, b, c, d, e;
while (1) {
scanf("%d", &a);
if (a == 0)
break;
d = 0;
e = 0;
for (i = 0; i < a; i++) {
scanf("%d %d", &b, &c);
if (b == c) {
d += b;
e += c;
} else if (b > c) {
d += b + c;
} else if (b < c) {
e += b + c;
}
}
}
printf("%d %d\n", d, e);
return 0;
}
|
#include <stdio.h>
int main(void) {
int i, a, b, c, d, e;
while (1) {
scanf("%d", &a);
if (a == 0)
break;
d = 0;
e = 0;
for (i = 0; i < a; i++) {
scanf("%d %d", &b, &c);
if (b == c) {
d += b;
e += c;
} else if (b > c) {
d += b + c;
} else if (b < c) {
e += b + c;
}
}
printf("%d %d\n", d, e);
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 143
| 2
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i, n) for (int i = 0; i < n; i++)
#define CC puts("-------ok--------");
#define all(in) in.begin(), in.end()
#define bv vector<bool>
using namespace std;
typedef pair<int, int> PA;
using namespace std;
#define MAX 1e7
int main() {
int n;
while (cin >> n, n) {
vi v(n + 1, 0);
vi v2(n + 1, 0);
int ans1 = 0;
int ans2 = 0;
rep(i, n) {
cin >> v[i] >> v2[i];
if (v[i] > v2[i])
ans1 += v[i] + v2[i];
else if (v[i] < v2[i])
ans2 += v[i] + v2[i];
else if (v[i] == v2[i]) {
ans1 += v[i];
ans2 = v2[i];
}
}
cout << ans1 << " " << ans2 << endl;
}
}
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i, n) for (int i = 0; i < n; i++)
#define CC puts("-------ok--------");
#define all(in) in.begin(), in.end()
#define bv vector<bool>
using namespace std;
typedef pair<int, int> PA;
using namespace std;
#define MAX 1e7
int main() {
int n;
while (cin >> n, n) {
vi v(n + 1, 0);
vi v2(n + 1, 0);
int ans1 = 0;
int ans2 = 0;
rep(i, n) {
cin >> v[i] >> v2[i];
if (v[i] > v2[i])
ans1 += v[i] + v2[i];
if (v[i] < v2[i])
ans2 += v[i] + v2[i];
if (v[i] == v2[i]) {
ans1 += v[i];
ans2 += v2[i];
}
}
cout << ans1 << " " << ans2 << endl;
}
}
|
[["-", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["-", 0, 57, 75, 76, 0, 57, 75, 76, 0, 95], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 107]]
| 1
| 245
| 4
|
#include <iostream>
using namespace std;
int main() {
int q[10001], w[10001];
int x = 1;
while (1) {
int n;
int a = 0;
int b = 0;
cin >> n;
if (n == 0) {
break;
}
for (int i = 1; i <= n; ++i) {
int c, d;
cin >> c >> d;
if (c == d) {
a = a + c;
b = b + d;
} else if (c > d) {
a = a + c + d;
} else {
b = b + c + d;
}
}
q[x] = a;
w[x] = b;
x = x + 1;
}
for (int j = 1; j <= x - 1; ++j) {
cout << q[j] << endl;
cout << w[j] << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int q[10001], w[10001];
int x = 1;
while (1) {
int n;
int a = 0;
int b = 0;
cin >> n;
if (n == 0) {
break;
}
for (int i = 1; i <= n; ++i) {
int c, d;
cin >> c >> d;
if (c == d) {
a = a + c;
b = b + d;
} else if (c > d) {
a = a + c + d;
} else {
b = b + c + d;
}
}
q[x] = a;
w[x] = b;
x = x + 1;
}
for (int j = 1; j <= x - 1; ++j) {
cout << q[j] << " " << w[j] << endl;
}
}
|
[["-", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 7, 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
| 192
| 6
|
//
// main.cpp
// program
//
// Created by h3032906 on 2016/11/24.
// Copyright ?? 2016??´ h3032906. All rights reserved.
//
#include <iostream>
int main(int argc, const char *argv[]) {
int n, a, b;
int at = 0;
int bt = 0;
for (;;) {
std::cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
std::cin >> a >> b;
if (a > b) {
at = at + a + b;
} else if (b > a) {
bt = bt + a + b;
} else {
at = at + a;
bt = bt + b;
}
}
std::cout << at << bt << std::endl;
at = 0;
bt = 0;
}
return 0;
}
|
//
// main.cpp
// program
//
// Created by h3032906 on 2016/11/24.
// Copyright ?? 2016??´ h3032906. All rights reserved.
//
#include <iostream>
int main(int argc, const char *argv[]) {
int n, a, b;
int at = 0;
int bt = 0;
for (;;) {
std::cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
std::cin >> a >> b;
if (a > b) {
at = at + a + b;
} else if (b > a) {
bt = bt + a + b;
} else {
at = at + a;
bt = bt + b;
}
}
std::cout << at << " " << bt << std::endl;
at = 0;
bt = 0;
}
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
| 159
| 4
|
#include <iostream>
using namespace std;
int main() {
int n, a, b;
while (true) {
int point_a = 0, point_b = 0;
cin >> n;
if (cin.eof() || n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (a == b) {
point_a += a;
point_b += b;
} else if (a > b) {
point_a += a + b;
} else {
point_b += a + b;
}
}
cout << a << " " << b << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int n, a, b;
while (true) {
int point_a = 0, point_b = 0;
cin >> n;
if (cin.eof() || n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (a == b) {
point_a += a;
point_b += b;
} else if (a > b) {
point_a += a + b;
} else {
point_b += a + b;
}
}
cout << point_a << " " << point_b << endl;
}
}
|
[["-", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]]
| 1
| 128
| 4
|
#include <iostream>
using namespace std;
int main() {
int n;
int a = 0, b = 0;
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (x > y) {
a += (x + y);
} else if (x < y) {
b += (x + y);
} else {
a += x;
b += y;
}
}
cout << a << b << endl;
a = 0;
b = 0;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
int a = 0, b = 0;
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (x > y) {
a += (x + y);
} else if (x < y) {
b += (x + y);
} else {
a += x;
b += y;
}
}
cout << a << ' ' << b << endl;
a = 0;
b = 0;
}
return 0;
}
|
[["+", 0, 16, 31, 16, 31, 16, 12, 103, 0, 104], ["+", 0, 16, 31, 16, 31, 16, 12, 103, 0, 125], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]]
| 1
| 124
| 4
|
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, a, b;
while (cin >> n) {
int apt = 0, bpt = 0;
rep(i, n) {
cin >> a >> b;
if (a > b) {
apt += a + b;
} else if (a < b) {
bpt += a + b;
} else {
apt += a;
bpt += b;
}
}
cout << apt << " " << bpt << endl;
}
return 0;
}
|
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, a, b;
while (cin >> n && n) {
int apt = 0, bpt = 0;
rep(i, n) {
cin >> a >> b;
if (a > b) {
apt += a + b;
} else if (a < b) {
bpt += a + b;
} else {
apt += a;
bpt += b;
}
}
cout << apt << " " << bpt << endl;
}
return 0;
}
|
[["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22]]
| 1
| 113
| 2
|
#include <iostream>
using namespace std;
int main() {
int a;
int r, l;
while (cin >> a && (a != 0)) {
int rsum, lsum;
rsum = 0;
lsum = 0;
for (int i = a; i > 0; i--) {
cin >> r;
cin >> l;
if (r > l) {
rsum += r + l;
} else if (l > r) {
lsum += r + l;
} else {
rsum += r;
lsum += l;
}
}
cout << rsum << ' ' << lsum << endl;
}
cout << "end";
}
|
#include <iostream>
using namespace std;
int main() {
int a;
int r, l;
while (cin >> a && (a != 0)) {
int rsum, lsum;
rsum = 0;
lsum = 0;
for (int i = a; i > 0; i--) {
cin >> r;
cin >> l;
if (r > l) {
rsum += r + l;
} else if (l > r) {
lsum += r + l;
} else {
rsum += r;
lsum += l;
}
}
cout << rsum << ' ' << lsum << endl;
}
}
|
[["-", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 8, 9, 0, 1, 0, 16, 12, 5, 0, 62], ["-", 8, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]]
| 1
| 129
| 6
|
#include <iostream>
using namespace std;
int main() {
int n, i, Apoint, Bpoint;
int A[10000], B[10000];
while (cin >> n, n) {
Apoint, Bpoint = 0, 0;
for (i = 0; i < n; i++) {
cin >> A[i] >> B[i];
}
for (i = 0; i < n; i++) {
if (A[i] > B[i])
Apoint += A[i] + B[i];
else if (A[i] < B[i])
Bpoint += B[i] + A[i];
else {
Apoint += A[i];
Bpoint += B[i];
}
}
cout << Apoint << " " << Bpoint << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, i, Apoint, Bpoint;
int A[10000], B[10000];
while (cin >> n, n) {
Apoint = 0;
Bpoint = 0;
for (i = 0; i < n; i++) {
cin >> A[i] >> B[i];
}
for (i = 0; i < n; i++) {
if (A[i] > B[i])
Apoint += A[i] + B[i];
else if (A[i] < B[i])
Bpoint += B[i] + A[i];
else {
Apoint += A[i];
Bpoint += B[i];
}
}
cout << Apoint << " " << Bpoint << endl;
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 1, 0, 34, 0, 21], ["-", 0, 1, 0, 34, 12, 34, 31, 11, 31, 22], ["-", 8, 9, 0, 1, 0, 34, 12, 34, 0, 21], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32]]
| 1
| 173
| 6
|
#include <bits/stdc++.h>
#define int long long int
#define main signed main()
#define bye return 0
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define each(p, v) for (auto p = (v).begin(); p != (v).end(); p++)
#define all(v) (v).begin(), (v).end()
#define prec(n) fixed << setprecision(n)
#define dump(x) cerr << "(L" << __LINE__ << ") " << #x << " = " << (x) << endl
#define clr(x, a) memset(x, a, sizeof(x))
#define sum(v) accumulate(all(v), 0)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define odd(n) ((n) % 2)
#define even(n) (!odd(n))
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define vi vector<int>
#define vb vector<bool>
#define vc vector<char>
using namespace std;
main {
int n;
for (;;) {
cin >> n;
if (n == 0)
break;
int a = 0, b = 0;
rep(i, n) {
int c, d;
cin >> c >> d;
if (c > d)
a += c + d;
else if (c < d)
b += c + d;
else {
a = c;
b = d;
}
}
cout << a << ' ' << b << endl;
}
bye;
}
|
#include <bits/stdc++.h>
#define int long long int
#define main signed main()
#define bye return 0
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define each(p, v) for (auto p = (v).begin(); p != (v).end(); p++)
#define all(v) (v).begin(), (v).end()
#define prec(n) fixed << setprecision(n)
#define dump(x) cerr << "(L" << __LINE__ << ") " << #x << " = " << (x) << endl
#define clr(x, a) memset(x, a, sizeof(x))
#define sum(v) accumulate(all(v), 0)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define odd(n) ((n) % 2)
#define even(n) (!odd(n))
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define vi vector<int>
#define vb vector<bool>
#define vc vector<char>
using namespace std;
main {
int n;
for (;;) {
cin >> n;
if (n == 0)
break;
int a = 0, b = 0;
rep(i, n) {
int c, d;
cin >> c >> d;
if (c > d)
a += c + d;
else if (c < d)
b += c + d;
else {
a += c;
b += d;
}
}
cout << a << ' ' << b << endl;
}
bye;
}
|
[["-", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 17, 107]]
| 1
| 226
| 4
|
#include <iostream>
void Game(int round, std::istream &in, std::ostream &out) {
int scoreA = 0;
int scoreB = 0;
for (int i = 0; i < round; ++i) {
int a, b;
in >> a >> b;
if (a > b) {
scoreA += a + b;
} else if (a < b) {
scoreB += a + b;
} else {
scoreA += a;
scoreB += b;
}
}
out << scoreA << " " << scoreB;
}
int main() {
int n;
std::cin >> n;
while (n) {
Game(n, std::cin, std::cout);
std::cin >> n;
}
return 0;
}
|
#include <iostream>
void Game(int round, std::istream &in, std::ostream &out) {
int scoreA = 0;
int scoreB = 0;
for (int i = 0; i < round; ++i) {
int a, b;
in >> a >> b;
if (a > b) {
scoreA += a + b;
} else if (a < b) {
scoreB += a + b;
} else {
scoreA += a;
scoreB += b;
}
}
out << scoreA << " " << scoreB << std::endl;
}
int main() {
int n;
std::cin >> n;
while (n) {
Game(n, std::cin, std::cout);
std::cin >> n;
}
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 1, 0, 16, 12, 343, 345, 348], ["+", 8, 9, 0, 1, 0, 16, 12, 343, 0, 349], ["+", 8, 9, 0, 1, 0, 16, 12, 343, 141, 22]]
| 1
| 152
| 4
|
#include <iostream>
using namespace std;
int main() {
int n = 0;
int aa, bb = 0;
while (cin >> n, n != 0) {
aa = 0;
bb = 0;
}
int a[10000] = {};
int b[10000] = {};
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
for (int j = 0; j < n; j++) {
if (a[j] > b[j]) {
aa += a[j] + b[j];
} else if (a[j] < b[j]) {
bb += a[j] + b[j];
} else if (a[j] == b[j]) {
aa += a[j];
bb += b[j];
}
}
cout << aa << bb << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n = 0;
int aa, bb = 0;
while (cin >> n, n != 0) {
aa = 0;
bb = 0;
int a[10000] = {};
int b[10000] = {};
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
for (int j = 0; j < n; j++) {
if (a[j] > b[j]) {
aa += a[j] + b[j];
} else if (a[j] < b[j]) {
bb += a[j] + b[j];
} else if (a[j] == b[j]) {
aa += a[j];
bb += b[j];
}
}
cout << aa << " " << bb << endl;
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 17, 151], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 62], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 199
| 6
|
#include <iostream>
using std::cin;
using std::cout;
using std::endl;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0) {
break;
}
int sa = 0, sb = 0;
while (n--) {
int a, b;
cin >> a >> b;
if (a > b) {
sa += a + b;
} else if (a < b) {
sb += a + b;
} else {
sa += a;
sb += b;
}
cout << sa << " " << sb << endl;
}
}
}
|
#include <iostream>
using std::cin;
using std::cout;
using std::endl;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0) {
break;
}
int sa = 0, sb = 0;
while (n--) {
int a, b;
cin >> a >> b;
if (a > b) {
sa += a + b;
} else if (a < b) {
sb += a + b;
} else {
sa += a;
sb += b;
}
}
cout << sa << " " << sb << endl;
}
}
|
[["+", 0, 52, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 0, 52, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 125
| 2
|
#include <stdio.h>
int main() {
for (;;) {
int n, i, j, k;
int A = {0}, B = {0};
scanf("%d", &n);
if (n == 0) {
return 0;
}
for (i = 0; i < n; i++) {
scanf(" %d %d", &j, &k);
if (j > k) {
A += (j + k);
} else if (j < k) {
B += (j + k);
} else if (j == k) {
A += j;
B += k;
}
printf("%d %d\n", A, B);
}
}
}
|
#include <stdio.h>
int main() {
for (;;) {
int n, i, j, k;
int A = {0}, B = {0};
scanf("%d", &n);
if (n == 0) {
return 0;
}
for (i = 0; i < n; i++) {
scanf(" %d %d", &j, &k);
if (j > k) {
A += (j + k);
} else if (j < k) {
B += (j + k);
} else if (j == k) {
A += j;
B += k;
}
}
printf("%d %d\n", A, B);
}
}
|
[["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 148
| 2
|
#include <iostream>
using namespace std;
int main() {
int n, a, b, pointA, pointB;
cin >> n;
while (n != 0) {
pointA = 0;
pointB = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (a > b) {
pointA += (a + b);
} else if (a < b) {
pointB += (a + b);
} else {
pointA += a;
pointB += b;
}
}
cout << a << ' ' << b << endl;
cin >> n;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, a, b, pointA, pointB;
cin >> n;
while (n != 0) {
pointA = 0;
pointB = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (a > b) {
pointA += (a + b);
} else if (a < b) {
pointB += (a + b);
} else {
pointA += a;
pointB += b;
}
}
cout << pointA << ' ' << pointB << endl;
cin >> n;
}
return 0;
}
|
[["-", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]]
| 1
| 128
| 4
|
#include <iostream>
using namespace std;
int main(void) {
for (;;) {
int a, b, c, d;
int e = 0;
int f = 0;
cin >> a;
if (a == 0) {
break;
}
for (b = 0; b < a; b++) {
cin >> c >> d;
if (c > d) {
e = e + c + d;
} else if (c < d) {
f = f + d + c;
} else if (c == d) {
e = e + c + d;
f = f + d + c;
}
}
cout << e << " " << f << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
for (;;) {
int a, b, c, d;
int e = 0;
int f = 0;
cin >> a;
if (a == 0) {
break;
}
for (b = 0; b < a; b++) {
cin >> c >> d;
if (c > d) {
e = e + c + d;
} else if (c < d) {
f = f + d + c;
} else if (c == d) {
e = e + c;
f = f + d;
}
}
cout << e << " " << f << endl;
}
return 0;
}
|
[["-", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 12, 22]]
| 1
| 147
| 4
|
#include <iostream>
using namespace std;
int i, n, pA, pB, tA = 0, tB = 0;
int main() {
while (cin >> n) {
if (n == 0) {
break;
}
for (i = 1; i <= n; i++) {
cin >> pA >> pB;
if (pA > pB) {
tA += pA + pB;
} else {
if (pA < pB) {
tB += pA + pB;
} else {
tA += pA;
tB += pB;
}
}
}
cout << tA << "" << tB << endl;
tA = 0;
tB = 0;
}
return 0;
}
|
#include <iostream>
using namespace std;
int i, n, pA, pB, tA = 0, tB = 0;
int main() {
while (cin >> n) {
if (n == 0) {
break;
}
for (i = 1; i <= n; i++) {
cin >> pA >> pB;
if (pA > pB) {
tA += pA + pB;
} else {
if (pA < pB) {
tB += pA + pB;
} else {
tA += pA;
tB += pB;
}
}
}
cout << tA << " " << tB << endl;
tA = 0;
tB = 0;
}
return 0;
}
|
[["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]]
| 1
| 132
| 1
|
#include <iostream>
using namespace std;
int main(void) {
int n;
while (1) {
cin >> n;
if (n == 0)
break;
int sumA = 0, sumB = 0;
int pointA, pointB;
for (int i = 0; i < n; i++) {
cin >> pointA >> pointB;
if (pointA > pointB) {
sumA += (pointA + pointB);
} else if (pointB > pointA) {
sumB += (pointA + pointB);
} else {
sumA += pointA;
sumB += pointA;
}
}
cout << sumA << " " << sumB;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int n;
while (1) {
cin >> n;
if (n == 0)
break;
int sumA = 0, sumB = 0;
int pointA, pointB;
for (int i = 0; i < n; i++) {
cin >> pointA >> pointB;
if (pointA > pointB) {
sumA += (pointA + pointB);
} else if (pointB > pointA) {
sumB += (pointA + pointB);
} else {
sumA += pointA;
sumB += pointA;
}
}
cout << sumA << " " << sumB << endl;
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 127
| 2
|
#include <stdio.h>
int main() {
int a, b, n, scorea, scoreb;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
while (n--) {
scanf("%d %d", &a, &b);
if (a == b) {
scorea += a;
scoreb += b;
} else if (a > b) {
scorea += a + b;
} else {
scoreb += a + b;
}
}
printf("%d %d\n", scorea, scoreb);
}
return 0;
}
|
#include <stdio.h>
int main() {
int a, b, n, scorea, scoreb;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
scorea = scoreb = 0;
while (n--) {
scanf("%d %d", &a, &b);
if (a == b) {
scorea += a;
scoreb += b;
} else if (a > b) {
scorea += a + b;
} else {
scoreb += a + b;
}
}
printf("%d %d\n", scorea, scoreb);
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 118
| 6
|
#include <iostream>
using namespace std;
int main() {
int N;
while (scanf("%d ", &N) == 1) {
if (N == 0) {
break;
}
int a = 0, b = 0, ta, tb;
for (int i = 0; i < N; i++) {
scanf("%d %d ", &ta, &tb);
if (ta > tb) {
a += ta + tb;
} else if (ta < tb) {
b += ta + tb;
} else {
a = ta, b = tb;
}
}
printf("%d %d\n", a, b);
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int N;
while (scanf("%d ", &N) == 1) {
if (N == 0) {
break;
}
int a = 0, b = 0, ta, tb;
for (int i = 0; i < N; i++) {
scanf("%d %d ", &ta, &tb);
if (ta > tb) {
a += ta + tb;
} else if (ta < tb) {
b += ta + tb;
} else {
a += ta, b += tb;
}
}
printf("%d %d\n", a, b);
}
return 0;
}
|
[["-", 0, 9, 0, 1, 0, 34, 31, 11, 17, 32], ["+", 0, 9, 0, 1, 0, 34, 31, 11, 17, 107], ["-", 0, 9, 0, 1, 0, 34, 12, 11, 17, 32], ["+", 0, 9, 0, 1, 0, 34, 12, 11, 17, 107]]
| 1
| 138
| 4
|
#include <stdio.h>
int main() {
int a, b, c, d, e;
while (1) {
scanf("%d", &a);
if (a == 0)
break;
d = e = 0;
for (int i = 0; i < a; i++) {
scanf("%d%d", &b, &c);
if (b < c)
e = e + b + c;
else if (b > c)
d = d + b + c;
else {
d = d + b;
e = e + c;
}
}
printf("%d %d\n", c, d);
}
return 0;
}
|
#include <stdio.h>
int main() {
int a, b, c, d, e;
while (1) {
scanf("%d", &a);
if (a == 0)
break;
d = e = 0;
for (int i = 0; i < a; i++) {
scanf("%d%d", &b, &c);
if (b < c)
e = e + b + c;
else if (b > c)
d = d + b + c;
else {
d = d + b;
e = e + c;
}
}
printf("%d %d\n", d, e);
}
return 0;
}
|
[["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]]
| 1
| 137
| 4
|
#include <stdio.h>
int main() {
int a, b, as, bs, n;
scanf("%d", &n);
while (n != 0) {
as = 0;
bs = 0;
for (int i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
if (a > b) {
as += a + b;
} else if (a < b) {
bs += a + b;
} else {
as += a;
bs += b;
}
printf("%d %d\n", as, bs);
}
scanf("%d", &n);
}
return 0;
}
|
#include <stdio.h>
int main() {
int a, b, as, bs, n;
scanf("%d", &n);
while (n != 0) {
as = 0;
bs = 0;
for (int i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
if (a > b) {
as += a + b;
} else if (a < b) {
bs += a + b;
} else {
as += a;
bs += b;
}
}
printf("%d %d\n", as, bs);
scanf("%d", &n);
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 139
| 2
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1 << 29;
int main() {
int n;
while (cin >> n) {
int a = 0, b = 0;
REP(i, n) {
int c, d;
cin >> c >> d;
if (c > d) {
a += c + d;
} else if (c < d)
b += c + d;
else {
a += c;
b += c;
}
}
cout << a << " " << b << endl;
}
}
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1 << 29;
int main() {
int n;
while (cin >> n, n) {
int a = 0, b = 0;
REP(i, n) {
int c, d;
cin >> c >> d;
if (c > d) {
a += c + d;
} else if (c < d)
b += c + d;
else {
a += c;
b += c;
}
}
cout << a << " " << b << endl;
}
}
|
[["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]]
| 1
| 150
| 2
|
#include <stdio.h>
int main() {
int n;
int a = 0;
int b = 0;
int apoint = 0;
int bpoint = 0;
int i;
scanf("%d", &n);
while (n != 0) {
for (i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
if (a < b) {
bpoint = bpoint + a + b;
}
if (a > b) {
apoint = apoint + a + b;
}
if (a == b) {
apoint = apoint + a;
bpoint = bpoint + b;
}
}
printf("%d %d", apoint, bpoint);
apoint = 0;
bpoint = 0;
scanf("%d", &n);
}
}
|
#include <stdio.h>
int main() {
int n;
int a = 0;
int b = 0;
int apoint = 0;
int bpoint = 0;
int i;
scanf("%d", &n);
while (n != 0) {
for (i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
if (a < b) {
bpoint = bpoint + a + b;
}
if (a > b) {
apoint = apoint + a + b;
}
if (a == b) {
apoint = apoint + a;
bpoint = bpoint + b;
}
}
printf("%d %d\n", apoint, bpoint);
apoint = 0;
bpoint = 0;
scanf("%d", &n);
}
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 161
| 1
|
#include <cstdio>
main() {
int n;
while (scanf("%d", &n), n) {
int a, b, c = 0, d = 0;
while (n--)
scanf("%d%d", &a, &b);
c += a > b ? a + b : a == b ? a : 0;
d += b > a ? a + b : a == b ? b : 0;
printf("%d %d\n", c, d);
}
}
|
#include <cstdio>
main() {
int n;
while (scanf("%d", &n), n) {
int a, b, c = 0, d = 0;
while (n--) {
scanf("%d%d", &a, &b);
c += a > b ? a + b : a == b ? a : 0;
d += b > a ? a + b : a == b ? b : 0;
}
printf("%d %d\n", c, d);
}
}
|
[["+", 0, 52, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 52, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 105
| 2
|
#include <iostream>
using namespace std;
int main() {
int n, a, b;
int sumA = 0, sumB = 0;
while (cin >> n) {
if (n == 0)
break;
sumA = 0, sumB = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (a > b) {
sumA += a;
sumA += b;
}
if (a == b) {
sumA += a;
sumB += b;
}
if (a < b) {
sumB += a;
sumB += b;
}
}
printf("%d %d", sumA, sumB);
}
}
|
#include <iostream>
using namespace std;
int main() {
int n, a, b;
int sumA = 0, sumB = 0;
while (cin >> n) {
if (n == 0)
break;
sumA = 0, sumB = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b;
if (a > b) {
sumA += a;
sumA += b;
}
if (a == b) {
sumA += a;
sumB += b;
}
if (a < b) {
sumB += a;
sumB += b;
}
}
printf("%d %d\n", sumA, sumB);
}
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 133
| 1
|
#include <iostream>
using namespace std;
int main() {
int n, a, b, at, bt;
loop:
scanf("%d\n", &n); // 各人のカード枚数
if (n == 0)
goto end_scope;
at = 0;
bt = 0;
labl_testloop:
scanf("%d %d\n", a, b);
if (a > b)
at += a + b;
else if (a == b) {
at += a;
bt += b;
} else
bt += a + b;
n--;
if (n > 0)
goto labl_testloop;
printf("%d %d\n", at, bt);
goto loop;
end_scope:
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n, a, b, at, bt;
loop:
scanf("%d\n", &n); // 各人のカード枚数
if (n == 0)
goto end_scope;
at = 0;
bt = 0;
labl_testloop:
scanf("%d %d\n", &a, &b);
if (a > b)
at += a + b;
else if (a == b) {
at += a;
bt += b;
} else
bt += a + b;
n--;
if (n > 0)
goto labl_testloop;
printf("%d %d\n", at, bt);
goto loop;
end_scope:
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]]
| 1
| 136
| 2
|
#include <cstdio>
int main(void) {
while (1) {
int n;
scanf("%d", &n);
if (!n)
break;
int ap = 0, bp = 0;
for (int i = 0; i < n; i++) {
int a, b;
scanf("%d %d", &a, &b);
if (a > b)
ap += a + b;
else if (a < b)
bp += a + b;
else {
ap += a;
bp += b;
}
}
printf("%d %d", ap, bp);
}
}
|
#include <cstdio>
int main(void) {
while (1) {
int n;
scanf("%d", &n);
if (!n)
break;
int ap = 0, bp = 0;
for (int i = 0; i < n; i++) {
int a, b;
scanf("%d %d", &a, &b);
if (a > b)
ap += a + b;
else if (a < b)
bp += a + b;
else {
ap += a;
bp += b;
}
}
printf("%d %d\n", ap, bp);
}
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 125
| 1
|
#include <stdio.h>
int N;
int a;
int b;
int point[2];
void init();
int main() {
while (scanf("%d", &N) == 1) {
init();
for (int i = 0; i < N; i++) {
scanf("%d %d", &a, &b);
if (a > b) {
point[0] += (a + b);
} else if (a == b) {
point[0] += a;
point[1] += b;
} else {
point[1] += (a + b);
}
}
printf("%d %d\n", point[0], point[1]);
}
return 0;
}
void init() { point[0] = point[1] = 0; }
|
#include <stdio.h>
int N;
int a;
int b;
int point[2];
void init();
int main() {
while (scanf("%d", &N) == 1 && N) {
init();
for (int i = 0; i < N; i++) {
scanf("%d %d", &a, &b);
if (a > b) {
point[0] += (a + b);
} else if (a == b) {
point[0] += a;
point[1] += b;
} else {
point[1] += (a + b);
}
}
printf("%d %d\n", point[0], point[1]);
}
return 0;
}
void init() { point[0] = point[1] = 0; }
|
[["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22]]
| 1
| 172
| 2
|
#include <stdio.h>
int main(void) {
int ans_a, ans_b;
int n;
int a, b;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
ans_a = ans_b = 0;
while (n) {
scanf("%d %d", &a, &b);
if (a > b) {
ans_a += (a + b);
} else if (a < b) {
ans_b += (a + b);
} else {
ans_a += a;
ans_b += b;
}
n--;
}
}
printf("%d %d\n", ans_a, ans_b);
return (0);
}
|
#include <stdio.h>
int main(void) {
int ans_a, ans_b;
int n;
int a, b;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
}
ans_a = ans_b = 0;
while (n) {
scanf("%d %d", &a, &b);
if (a > b) {
ans_a += (a + b);
} else if (a < b) {
ans_b += (a + b);
} else {
ans_a += a;
ans_b += b;
}
n--;
}
printf("%d %d\n", ans_a, ans_b);
}
return (0);
}
|
[["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 137
| 2
|
#include <stdio.h>
int main(void) {
int n, m, i, j, flag;
char a;
int sb[62] = {0}, sa[62] = {0};
while (scanf("%d%*c", &n), n != 0) {
for (i = 0; i < n; i++) {
scanf("%c %c", &sb[i], &sa[i]);
getchar();
}
scanf("%d%*c", &m);
for (i = 0; i < m; i++) {
flag = 0;
scanf("%c", &a);
getchar();
// printf("%d %c %d %c\n",sb[0],sb[0],a,a);
for (j = 0; j < n; j++) {
if (sb[j] == a) {
printf("%c", sa[j]);
flag = 1;
break;
}
}
if (!flag)
printf("%c", a);
}
}
puts("");
return 0;
}
|
#include <stdio.h>
int main(void) {
int n, m, i, j, flag;
char a, b;
char sb[62] = {0}, sa[62] = {0};
while (scanf("%d%*c", &n), n != 0) {
for (i = 0; i < n; i++) {
// for(scanf("%c",&b);b==' ';scanf("%c",&b));
scanf("%c %c", &sb[i], &sa[i]);
getchar();
// for(scanf("%c",&b);b==' ';scanf("%c",&b));
}
scanf("%d%*c", &m);
// for(scanf("%c",&b);b==' ';scanf("%c",&b));
for (i = 0; i < m; i++) {
flag = 0;
scanf("%c", &a);
getchar();
// for(scanf("%c",&b);b==' ';scanf("%c",&b));
for (j = 0; j < n; j++) {
if (sb[j] == a) {
printf("%c", sa[j]);
flag = 1;
break;
}
}
if (!flag)
printf("%c", a);
}
puts("");
}
return 0;
}
|
[["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 0
| 209
| 6
|
a[99], n, x;
main(i) {
while (scanf("%d ", &n), n) {
memset(a, 0, 99);
while (n--)
scanf("%c %c ", &x, a), a[x] = *a;
scanf("%d ", &n);
while (n--)
scanf("%c ", &x), putchar(a[x] ? a[x] : x);
puts("");
}
}
|
a[256], n, x;
main(i) {
while (scanf("%d ", &n), n) {
memset(a, 0, 999);
while (n--)
scanf("%c %c ", &x, a), a[x] = *a;
scanf("%d ", &n);
while (n--)
scanf("%c ", &x), putchar(a[x] ? a[x] : x);
puts("");
}
}
|
[["-", 36, 36, 0, 30, 0, 1, 0, 69, 71, 13], ["+", 36, 36, 0, 30, 0, 1, 0, 69, 71, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]]
| 0
| 111
| 4
|
n, a[99], x;
main(i) {
while (scanf("%d ", &n), n) {
for (memset(a, 0, 99); n--; a[x] = *a)
scanf("%c %c ", &x, a);
for (scanf("%d ", &n); n--; putchar(a[x] ? a[x] : x))
scanf("%c ", &x);
puts("");
}
}
|
a[256], n, x;
main(i) {
while (scanf("%d ", &n), n) {
for (memset(a, 0, 999); n--; a[x] = *a)
scanf("%c %c ", &x, a);
for (scanf("%d ", &n); n--; putchar(a[x] ? a[x] : x))
scanf("%c ", &x);
puts("");
}
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 78], ["-", 36, 36, 0, 30, 0, 43, 0, 42, 0, 21], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 1, 0, 69, 71, 13], ["+", 36, 36, 0, 30, 0, 1, 0, 42, 0, 21], ["+", 36, 36, 0, 30, 0, 1, 0, 42, 0, 22], ["-", 8, 9, 0, 7, 10, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 7, 10, 2, 3, 4, 0, 13]]
| 0
| 111
| 6
|
n, x, a[256];
main(i) {
while (scanf("%d ", &n), n) {
for (i = 0; i < 99; ++i)
a[i] = i;
for (; n--; a[x] = *a)
scanf("%c %c ", &x, a);
for (scanf("%d ", &n); n--; putchar(a[x]))
scanf("%c ", &x);
puts("");
}
}
|
n, x, a[123];
main(i) {
while (scanf("%d ", &n), n) {
for (i = 0; i < 123; ++i)
a[i] = i;
for (; n--; a[x] = *a)
scanf("%c %c ", &x, a);
for (scanf("%d ", &n); n--; putchar(a[x]))
scanf("%c ", &x);
puts("");
}
}
|
[["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 116
| 4
|
n, a[99], x;
main(i) {
while (scanf("%d ", &n), n) {
for (memset(a, 0, 99); n--; a[x] = *a)
scanf("%c %c ", &x, a);
for (scanf("%d ", &n); n--; putchar(a[x] ? a[x] : x))
scanf("%c ", &x);
puts("");
}
}
|
n, a[256], x;
main() {
while (scanf("%d ", &n), n) {
for (memset(a, 0, 999); n--; a[x] = *a)
scanf("%c %c ", &x, a);
for (scanf("%d ", &n); n--; putchar(a[x] ? a[x] : x))
scanf("%c ", &x);
puts("");
}
}
|
[["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 36, 36, 0, 30, 0, 14, 49, 65, 0, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["-", 8, 9, 0, 7, 10, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 7, 10, 2, 3, 4, 0, 13]]
| 0
| 111
| 6
|
n, t[999];
int main(i) {
for (; n *= scanf("%d", &n); puts("")) {
for (i = 999; t[i] = i--;)
;
for (; n--; t[i] = *t)
scanf(" %c %c", &i, t);
for (scanf("%d", &n); n--; putchar(t[i]))
scanf(" %c", &i);
}
}
|
n, t[999];
int main(i) {
for (; n *= scanf("%d", &n); puts("")) {
for (i = 999; t[--i] = i;)
;
for (; n--; t[i] = *t)
scanf(" %c %c", &i, t);
for (scanf("%d", &n); n--; putchar(t[i]))
scanf(" %c", &i);
}
}
|
[["+", 0, 7, 15, 11, 31, 69, 71, 27, 17, 68], ["-", 8, 9, 0, 7, 15, 11, 12, 27, 17, 68]]
| 0
| 112
| 2
|
n, t[];
int main(i) {
for (; n *= scanf("%d", &n); bzero(t, 99)) {
for (; n--; t[i] = *t)
scanf(" %c %c", &i, t);
for (scanf("%d", &n); n--; putchar(t[i] ?: i))
scanf(" %c", &i);
puts("");
}
}
|
n, t[];
main(i) {
for (; n *= scanf("%d", &n); bzero(t, 999)) {
for (; n--; t[i] = *t)
scanf(" %c %c", &i, t);
for (scanf("%d", &n); n--; putchar(t[i] ?: i))
scanf(" %c", &i);
puts("");
}
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["-", 8, 9, 0, 7, 26, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 7, 26, 2, 3, 4, 0, 13]]
| 0
| 105
| 3
|
#include <stdio.h>
char table[256];
void clearTable(void) {
int i;
for (i = 0; i < 256; i++) {
table[i] = 0;
}
}
int main(void) {
int i;
int n;
int m;
while (1) {
char str[16];
fgets(str, 16, stdin);
sscanf(str, "%d", &n);
if (n == 0) {
break;
}
clearTable();
for (i = 0; i < n; i++) {
char c1;
char c2;
char str[32];
fgets(str, 32, stdin);
c1 = str[0];
c2 = str[2];
table[c1] = c2;
}
fgets(str, 16, stdin);
sscanf(str, "%d", &m);
for (i = 0; i < m; i++) {
char c;
char str[32];
fgets(str, 32, stdin);
c = str[0];
if (table[c] != 0) {
printf("%c", table[c]);
} else {
printf("%c", c);
}
}
}
return (0);
}
|
#include <stdio.h>
char table[256];
void clearTable(void) {
int i;
for (i = 0; i < 256; i++) {
table[i] = 0;
}
}
int main(void) {
int i;
int n;
int m;
while (1) {
char str[16];
fgets(str, 16, stdin);
sscanf(str, "%d", &n);
if (n == 0) {
break;
}
clearTable();
for (i = 0; i < n; i++) {
char c1;
char c2;
char str[32];
fgets(str, 32, stdin);
c1 = str[0];
c2 = str[2];
table[c1] = c2;
}
fgets(str, 16, stdin);
sscanf(str, "%d", &m);
for (i = 0; i < m; i++) {
char c;
char str[32];
fgets(str, 32, stdin);
c = str[0];
if (table[c] != 0) {
printf("%c", table[c]);
} else {
printf("%c", c);
}
}
puts("");
}
return (0);
}
|
[["+", 0, 52, 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], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 0
| 261
| 6
|
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
while (1) {
int n, m;
vector<char> vSource, vDest;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
char a, b;
cin >> a >> b;
vSource.push_back(a);
vDest.push_back(b);
}
cin >> m;
for (int i = 0; i < m; i++) {
char a;
cin >> a;
for (int j = 0; j < vSource.size(); j++) {
if (a == vSource[j])
a = vDest[j];
}
cout << a;
}
cout << endl;
}
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
while (1) {
int n, m;
vector<char> vSource, vDest;
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
char a, b;
cin >> a >> b;
vSource.push_back(a);
vDest.push_back(b);
}
cin >> m;
for (int i = 0; i < m; i++) {
char a;
cin >> a;
for (int j = 0; j < vSource.size(); j++) {
if (a == vSource[j]) {
a = vDest[j];
break;
}
}
cout << a;
}
cout << endl;
}
return 0;
}
|
[["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]]
| 1
| 164
| 4
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(), in.end()
const double PI = acos(-1);
const double EPS = 1e-10;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
int n;
while (cin >> n, n) {
map<char, vector<char>> in;
rep(i, n) {
char a, b;
cin >> a >> b;
in[a].pb(b);
}
cin >> n;
rep(i, 10) {
char d;
cin >> d;
if (in[d].size())
d = in[d][0];
cout << d;
}
cout << endl;
}
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(), in.end()
const double PI = acos(-1);
const double EPS = 1e-10;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
int n;
while (cin >> n, n) {
map<char, vector<char>> in;
rep(i, n) {
char a, b;
cin >> a >> b;
in[a].pb(b);
}
cin >> n;
rep(i, n) {
char d;
cin >> d;
if (in[d].size())
d = in[d][0];
cout << d;
}
cout << endl;
}
}
|
[["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]]
| 1
| 191
| 3
|
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
map<char, char> mp;
int n, m;
char od, nw;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
while (n--) {
scanf(" %c %c", &od, &nw);
mp[od] = nw;
}
scanf(" %d", &m);
char ans[m];
for (int i = 0; i < m; i++) {
scanf(" %c", &od);
if (mp.find(od) != mp.end()) { // map内を検索する
ans[i] = mp[od]; //あったとき
} else {
ans[i] = od; //なかったとき
}
}
for (int i = 0; i < m; i++)
printf("%c", ans[i]);
printf("\n");
}
}
|
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
map<char, char> mp;
int n, m;
char od, nw;
while (1) {
mp.clear();
scanf("%d", &n);
if (n == 0)
break;
while (n--) {
scanf(" %c %c", &od, &nw);
mp[od] = nw;
}
scanf(" %d", &m);
char ans[m];
for (int i = 0; i < m; i++) {
scanf(" %c", &od);
if (mp.find(od) != mp.end()) { // map内を検索する
ans[i] = mp[od]; //あったとき
} else {
ans[i] = od; //なかったとき
}
}
for (int i = 0; i < m; i++)
printf("%c", ans[i]);
printf("\n");
}
}
|
[["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 202
| 6
|
#include <iostream>
#include <map>
using namespace std;
int main() {
while (true) {
int n = 0;
cin >> n;
if (n == 0) {
break;
}
map<char, char> convert;
for (int i = 0; i < n; i++) {
char key, value;
cin >> key;
cin >> value;
convert[key] = value;
}
int m = 0;
cin >> m;
for (int i = 0; i < m; i++) {
char val;
cin >> val;
if (convert.find(val) == convert.end()) {
cout << convert[val];
} else {
cout << val;
}
}
cout << '\n';
}
return 0;
}
|
#include <iostream>
#include <map>
using namespace std;
int main() {
while (true) {
int n = 0;
cin >> n;
if (n == 0) {
break;
}
map<char, char> convert;
for (int i = 0; i < n; i++) {
char key, value;
cin >> key;
cin >> value;
convert[key] = value;
}
int m = 0;
cin >> m;
for (int i = 0; i < m; i++) {
char val;
cin >> val;
if (convert.find(val) != convert.end()) {
cout << convert[val];
} else {
cout << val;
}
}
cout << '\n';
}
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79]]
| 1
| 155
| 2
|
#include <bits/stdc++.h>
using namespace std;
char before[70], after[70];
int n, m;
int search(char c) {
before[n] = c;
int i = 0;
while (before[i] != c)
i++;
return i;
}
int main() {
char buf;
int ans;
cin >> n;
if (n == 0)
return 0;
for (int i = 0; i < n; i++) {
cin >> before[i] >> after[i];
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> buf;
if ((ans = search(buf)) == n) {
printf("%c", buf);
} else {
printf("%c", after[ans]);
}
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char before[70], after[70];
int n, m;
int search(char c) {
before[n] = c;
int i = 0;
while (before[i] != c)
i++;
return i;
}
int main() {
char buf;
int ans;
while (1) {
cin >> n;
if (n == 0)
return 0;
for (int i = 0; i < n; i++) {
cin >> before[i] >> after[i];
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> buf;
if ((ans = search(buf)) == n) {
printf("%c", buf);
} else {
printf("%c", after[ans]);
}
}
printf("\n");
}
return 0;
}
|
[["+", 0, 30, 0, 14, 8, 9, 0, 52, 0, 89], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 24], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 51, 13], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 183
| 6
|
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, a, b) for (i = a; i < b; ++i)
#define rep(i, n) REP(i, 0, n)
#define ll long long
#define ull unsigned ll
typedef long double ld;
#define SQR(X) ((X) * (X))
#define CUBE(X) ((X) * (X) * (X))
// #define int ll
using namespace std;
bool test = 0;
/* ?????????????????¬??¨ */
int main() {
int i, j, k, l;
int n;
while (scanf("%d", &n) != EOF) {
map<char, char> m;
if (n == 0)
break;
rep(i, n) {
char a, b;
cin >> a >> b;
m[a] = b;
}
cin >> n;
rep(i, n) {
char c;
cin >> c;
if (m.find(c) == m.end()) {
putchar(c);
} else
putchar(m[c]);
}
}
return 0;
}
|
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, a, b) for (i = a; i < b; ++i)
#define rep(i, n) REP(i, 0, n)
#define ll long long
#define ull unsigned ll
typedef long double ld;
#define SQR(X) ((X) * (X))
#define CUBE(X) ((X) * (X) * (X))
// #define int ll
using namespace std;
bool test = 0;
/* ?????????????????¬??¨ */
int main() {
int i, j, k, l;
int n;
while (scanf("%d", &n) != EOF) {
map<char, char> m;
if (n == 0)
break;
rep(i, n) {
char a, b;
cin >> a >> b;
m[a] = b;
}
cin >> n;
rep(i, n) {
char c;
cin >> c;
if (m.find(c) == m.end()) {
putchar(c);
} else
putchar(m[c]);
}
putchar('\n');
}
return 0;
}
|
[["+", 0, 52, 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, 103, 0, 104], ["+", 0, 1, 0, 2, 3, 4, 0, 103, 0, 44], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 199
| 7
|
#include <bits/stdc++.h>
using namespace std;
int N;
char m;
void solve() {
int M;
map<char, char> changer;
char f, t;
for (int i = 0; i < N; i++) {
cin >> f;
cin >> t;
changer[f] = t;
}
cin >> M;
for (int i = 0; i < M; i++) {
cin >> m;
if (changer.find(m) != changer.end())
cout << changer[m];
else
cout << m;
}
printf("/n");
}
int main() {
while (cin >> N, N)
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
char m;
void solve() {
int M;
map<char, char> changer;
char f, t;
for (int i = 0; i < N; i++) {
cin >> f;
cin >> t;
changer[f] = t;
}
cin >> M;
for (int i = 0; i < M; i++) {
cin >> m;
if (changer.find(m) != changer.end())
cout << changer[m];
else
cout << m;
}
printf("\n");
}
int main() {
while (cin >> N, N)
solve();
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 144
| 2
|
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int n;
char a, b;
map<char, char> m;
string s;
while (cin >> n, n) {
while (n--) {
cin >> a >> b;
m[a] = b;
}
cin >> n;
s = "";
while (n--) {
cin >> a;
if (m.find(a) == m.end())
s += a;
else
s += m[a];
}
cout << s << endl;
}
return 0;
}
|
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main() {
int n;
char a, b;
map<char, char> m;
string s;
while (cin >> n, n) {
m.clear();
while (n--) {
cin >> a >> b;
m[a] = b;
}
cin >> n;
s = "";
while (n--) {
cin >> a;
if (m.find(a) == m.end())
s += a;
else
s += m[a];
}
cout << s << endl;
}
return 0;
}
|
[["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 121
| 6
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, i, j;
while (1) {
cin >> a;
if (a == 0)
break;
vector<char> from(a);
vector<char> to(a);
for (i = 0; i < a; i++) {
cin >> from[i] >> to[i];
}
cin >> b;
vector<char> v(b);
for (i = 0; i < b; i++) {
cin >> v[i];
for (j = 0; j < a; j++) {
if (v[i] == from[j]) {
v[i] = to[j];
break;
}
}
}
for (i = 0; i < b; i++) {
cout << v[i];
}
cout << "\n";
return 0;
}
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b, i, j;
while (1) {
cin >> a;
if (a == 0)
break;
vector<char> from(a);
vector<char> to(a);
for (i = 0; i < a; i++) {
cin >> from[i] >> to[i];
}
cin >> b;
vector<char> v(b);
for (i = 0; i < b; i++) {
cin >> v[i];
for (j = 0; j < a; j++) {
if (v[i] == from[j]) {
v[i] = to[j];
break;
}
}
}
for (i = 0; i < b; i++) {
cout << v[i];
}
cout << "\n";
}
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 193
| 2
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
while (cin >> n && n != 0) {
char conv[n][2];
for (int i = 0; i < n; i++) {
cin >> conv[i][0] >> conv[i][1];
}
cin >> m;
char inp[m];
for (int i = 0; i < m; i++) {
cin >> inp[i];
for (int j = 0; j < n; j++) {
if (inp[i] == conv[j][0]) {
inp[i] = conv[j][1];
break;
}
}
}
for (int i = 0; i < m; i++) {
cout << inp[i];
}
}
cout << endl;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, m;
while (cin >> n && n != 0) {
char conv[n][2];
for (int i = 0; i < n; i++) {
cin >> conv[i][0] >> conv[i][1];
}
cin >> m;
char inp[m];
for (int i = 0; i < m; i++) {
cin >> inp[i];
for (int j = 0; j < n; j++) {
if (inp[i] == conv[j][0]) {
inp[i] = conv[j][1];
break;
}
}
}
for (int i = 0; i < m; i++) {
cout << inp[i];
}
cout << endl;
}
}
|
[["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 182
| 2
|
#include <algorithm>
#include <iostream>
#include <map>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int n;
map<char, char> c;
int main() {
while (1) {
cin >> n;
if (!n) {
break;
}
rep(i, n) {
char a, b;
cin >> a >> b;
c[a] = b;
}
int q;
cin >> q;
rep(i, q) {
char p;
cin >> p;
cout << (c[p] ? c[p] : p);
}
cout << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <map>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int n;
map<char, char> c;
int main() {
while (1) {
cin >> n;
if (!n) {
break;
}
rep(i, n) {
char a, b;
cin >> a >> b;
c[a] = b;
}
int q;
cin >> q;
rep(i, q) {
char p;
cin >> p;
cout << (c[p] ? c[p] : p);
}
cout << endl;
c.clear();
}
return 0;
}
|
[["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 125
| 6
|
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, m;
string s;
while (cin >> n, n) {
char a[n][3], d;
r(i, n) { cin >> a[i][0] >> a[i][1]; }
cin >> m;
char s[m];
r(i, m) cin >> s[i];
r(i, m) {
r(j, n) if (s[i] == a[j][0]) {
s[i] = a[j][1];
break;
}
}
r(i, m) cout << s[i];
}
}
|
#include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n, m;
string s;
while (cin >> n, n) {
char a[n][3], d;
r(i, n) { cin >> a[i][0] >> a[i][1]; }
cin >> m;
char s[m];
r(i, m) cin >> s[i];
r(i, m) {
r(j, n) if (s[i] == a[j][0]) {
s[i] = a[j][1];
break;
}
}
r(i, m) cout << s[i];
cout << endl;
}
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 158
| 4
|
#include <iostream>
using namespace std;
int main() {
int listnum, strnum, i, j;
char temp;
char lista[256];
char listb[256];
while (cin >> listnum) {
for (i = 0; i < listnum; i++) {
cin >> lista[i];
cin >> listb[i];
}
cin >> strnum;
for (i = 0; i < strnum; i++) {
cin >> temp;
for (j = 0; j < listnum; j++) {
if (temp == lista[j]) {
temp = listb[j];
break;
}
}
cout << temp;
}
cout << "\n";
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int listnum, strnum, i, j;
char temp;
char lista[256];
char listb[256];
while (cin >> listnum && listnum) {
for (i = 0; i < listnum; i++) {
cin >> lista[i];
cin >> listb[i];
}
cin >> strnum;
for (i = 0; i < strnum; i++) {
cin >> temp;
for (j = 0; j < listnum; j++) {
if (temp == lista[j]) {
temp = listb[j];
break;
}
}
cout << temp;
}
cout << "\n";
}
return 0;
}
|
[["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22]]
| 1
| 144
| 2
|
#include <cstdio>
#include <string>
int main() {
int n, m;
char a[100001], b[100001];
while (scanf("%d", &n), n != 0) {
char f;
for (int i = 0; i < n; i++) {
scanf(" %c %c", &a[i], &b[i]);
}
scanf("%d", &m);
for (int i = 0; i < m; i++) {
scanf(" %c", &f);
int flag = 1;
for (int j = 0; a[j] != '\0' && flag == 1; j++) {
if (a[j] == f) {
printf("%c", b[j]);
flag = 0;
}
}
if (flag == 1)
printf("%c", f);
}
}
printf("\n");
return 0;
}
|
#include <cstdio>
#include <string>
int main() {
int n, m;
char a[100001], b[100001];
while (scanf("%d", &n), n != 0) {
char f;
for (int i = 0; i < n; i++) {
scanf(" %c %c", &a[i], &b[i]);
}
scanf("%d", &m);
for (int i = 0; i < m; i++) {
scanf(" %c", &f);
int flag = 1;
for (int j = 0; a[j] != '\0' && flag == 1; j++) {
if (a[j] == f) {
printf("%c", b[j]);
flag = 0;
}
}
if (flag == 1)
printf("%c", f);
}
printf("\n");
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 200
| 2
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L + R) / 2, N * 2 + 1
#define rseg (L + R) / 2 + 1, R, N * 2 + 2
#define ub upper_bound
#define lb lower_bound
#define p_q priority_queue
#define MN 1000000009
int n, q;
char a, b;
map<char, char> m;
int main() {
while (cin >> n) {
m.clear();
if (n == 0)
break;
for (int l = 0; l < n; ++l) {
cin >> a >> b;
m[a] = b;
}
cin >> q;
for (int l = 0; l < q; ++l) {
cin >> a;
if (m.count(a) == 0)
cout << a;
else
cout << m[a];
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L + R) / 2, N * 2 + 1
#define rseg (L + R) / 2 + 1, R, N * 2 + 2
#define ub upper_bound
#define lb lower_bound
#define p_q priority_queue
#define MN 1000000009
int n, q;
char a, b;
map<char, char> m;
int main() {
while (cin >> n) {
m.clear();
if (n == 0)
break;
for (int l = 0; l < n; ++l) {
cin >> a >> b;
m[a] = b;
}
cin >> q;
for (int l = 0; l < q; ++l) {
cin >> a;
if (m.count(a) == 0)
cout << a;
else
cout << m[a];
}
cout << endl;
}
return 0;
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 176
| 4
|
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 999999
#define EPS 1.0e-6
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, m;
int k = 0;
while (1) {
cin >> n;
cin >> n;
if (n == 0)
break;
char a, b;
map<char, char> mp;
for (int i = 0; i < n; i++) {
cin >> a >> b;
mp[a] = b;
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> a;
auto itr = mp.find(a);
if (itr != mp.end()) {
cout << mp[a];
} else
cout << a;
}
cout << endl;
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 999999
#define EPS 1.0e-6
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, m;
int k = 0;
while (1) {
cin >> n;
if (n == 0)
break;
char a, b;
map<char, char> mp;
for (int i = 0; i < n; i++) {
cin >> a >> b;
mp[a] = b;
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> a;
auto itr = mp.find(a);
if (itr != mp.end()) {
cout << mp[a];
} else
cout << a;
}
cout << endl;
}
return 0;
}
|
[["-", 0, 52, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 17, 152], ["-", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 191
| 4
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
for (;;) {
char todoset[2][51];
int n, m;
bool flg = 0;
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> todoset[0][i];
cin >> todoset[1][i];
}
cin >> m;
vector<char> str(m);
for (int i = 0; i < m; i++) {
cin >> str[i];
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (str[i] == todoset[0][j]) {
cout << todoset[1][j];
flg = 1;
break;
}
}
if (flg != 1) {
cout << str[i];
}
flg = 0;
}
}
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
for (;;) {
char todoset[2][51];
int n, m;
bool flg = 0;
cin >> n;
if (n == 0) {
break;
}
for (int i = 0; i < n; i++) {
cin >> todoset[0][i];
cin >> todoset[1][i];
}
cin >> m;
vector<char> str(m);
for (int i = 0; i < m; i++) {
cin >> str[i];
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (str[i] == todoset[0][j]) {
cout << todoset[1][j];
flg = 1;
break;
}
}
if (flg != 1) {
cout << str[i];
}
flg = 0;
}
cout << endl;
}
}
|
[["+", 0, 7, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]]
| 1
| 210
| 4
|
#include <cstdio>
#include <map>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define mp make_pair
int main() {
while (1) {
int n;
scanf(" %d", &n);
if (n == 0)
break;
map<char, char> data;
rep(i, n) {
char a, b;
scanf(" %c %c", &a, &b);
data.insert(mp(a, b));
}
scanf("%d", &n);
rep(i, n) {
char t;
scanf(" %c", &t);
if (data.find(t) == data.end()) {
putchar(t);
} else {
putchar(data[t]);
}
}
}
return 0;
}
|
#include <cstdio>
#include <map>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define mp make_pair
int main() {
while (1) {
int n;
scanf(" %d", &n);
if (n == 0)
break;
map<char, char> data;
rep(i, n) {
char a, b;
scanf(" %c %c", &a, &b);
data.insert(mp(a, b));
}
scanf("%d", &n);
rep(i, n) {
char t;
scanf(" %c", &t);
if (data.find(t) == data.end()) {
putchar(t);
} else {
putchar(data[t]);
}
}
puts("");
}
return 0;
}
|
[["+", 0, 52, 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], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 165
| 6
|
#include <stdio.h>
char hantei(char);
int n;
char chana[1000000000], chanb[1000000000];
int main() {
int i, j, m;
char w;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf(" %c %c", &chana[i], &chanb[i]);
}
scanf("%d", &m);
for (j = 0; j < m; j++) {
scanf(" %c", &w);
printf("%c", hantei(w));
}
printf("\n");
}
return 0;
}
char hantei(char w) {
int i;
for (i = 0; i < n; i++) {
if (w == chana[i])
return chanb[i];
}
return w;
}
|
#include <stdio.h>
char hantei(char);
int n;
char chana[1000], chanb[1000];
int main() {
int i, j, m;
char w;
while (1) {
scanf("%d", &n);
if (n == 0)
break;
for (i = 0; i < n; i++) {
scanf(" %c %c", &chana[i], &chanb[i]);
}
scanf("%d", &m);
for (j = 0; j < m; j++) {
scanf(" %c", &w);
printf("%c", hantei(w));
}
printf("\n");
}
return 0;
}
char hantei(char w) {
int i;
for (i = 0; i < n; i++) {
if (w == chana[i])
return chanb[i];
}
return w;
}
|
[["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13]]
| 1
| 197
| 4
|
#include <cstring>
#include <iostream>
using namespace std;
char s[100000000];
int main() {
int n, m, i, j, k;
char a[80], b[80], c;
bool f = false;
while (cin >> n && n) {
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
cin >> m;
strcpy(s, "");
for (i = k = 0; i < m; i++) {
cin >> c;
for (j = f = 0; j < n && !f; j++) {
if (c == a[j]) {
s[i] = b[j];
f = true;
}
}
if (!f)
s[i] = c;
}
s[m - 1] = '\0';
cout << s << endl;
}
return 0;
}
|
#include <cstring>
#include <iostream>
using namespace std;
char s[100000000];
int main() {
int n, m, i, j, k;
char a[80], b[80], c;
bool f = false;
while (cin >> n && n) {
for (i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
cin >> m;
strcpy(s, "");
for (i = k = 0; i < m; i++) {
cin >> c;
for (j = f = 0; j < n && !f; j++) {
if (c == a[j]) {
s[i] = b[j];
f = true;
}
}
if (!f)
s[i] = c;
}
s[m] = '\0';
cout << s << endl;
}
return 0;
}
|
[["-", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]]
| 1
| 196
| 2
|
#include <cstdio>
int main() {
int a, b, n;
while (scanf("%d", &n) != EOF) {
int asum = 0, bsum = 0;
for (int i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
if (a > b) {
asum += a + b;
} else if (a < b) {
bsum += a + b;
} else {
asum += a;
bsum += b;
}
}
printf("%d %d\n", asum, bsum);
}
return 0;
}
|
#include <cstdio>
int main() {
int a, b, n;
while (scanf("%d", &n), n) {
int asum = 0, bsum = 0;
for (int i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
if (a > b) {
asum += a + b;
} else if (a < b) {
bsum += a + b;
} else {
asum += a;
bsum += b;
}
}
printf("%d %d\n", asum, bsum);
}
return 0;
}
|
[["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 79], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]]
| 1
| 124
| 4
|
#include <cstdio>
int n, a, b, c, d, i;
int main(void) {
scanf("%d", &n);
while (n) {
c = 0;
d = 0;
for (i = 0; i < n; i++) {
scanf("%d%d", &a, &b);
if (a > b)
c += a + b;
else if (a < b)
d += a + b;
else {
c += a;
d += b;
}
}
printf("%d %d\n", &c, &d);
scanf("%d", &n);
}
return 0;
}
|
#include <cstdio>
int n, a, b, c, d, i;
int main(void) {
scanf("%d", &n);
while (n) {
c = 0;
d = 0;
for (i = 0; i < n; i++) {
scanf("%d%d", &a, &b);
if (a > b)
c += a + b;
else if (a < b)
d += a + b;
else {
c += a;
d += b;
}
}
printf("%d %d\n", c, d);
scanf("%d", &n);
}
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]]
| 1
| 137
| 2
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
bool solve() {
int n;
cin >> n;
if (!n)
return false;
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (x == y) {
a += x;
b += y;
}
x > y ? a += (x + y) : b += (x + y);
}
cout << a << " " << b << endl;
return true;
}
int main() {
cout.setf(ios::fixed);
cout.precision(10);
while (solve()) {
};
return 0;
}
|
#include <algorithm>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
bool solve() {
int n;
cin >> n;
if (!n)
return false;
int a = 0, b = 0;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (x == y) {
a += x;
b += y;
continue;
}
x > y ? a += (x + y) : b += (x + y);
}
cout << a << " " << b << endl;
return true;
}
int main() {
cout.setf(ios::fixed);
cout.precision(10);
while (solve()) {
};
return 0;
}
|
[["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 117], ["+", 8, 9, 0, 57, 64, 9, 0, 116, 0, 35]]
| 1
| 166
| 2
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int N = 0;
while (cin >> N && N != 0) {
vector<int> A(N), B(N);
for (int i = 0; i < N; ++i)
cin >> A[i] >> B[i];
int ret_a = 0, ret_b = 0;
for (int i = 0; i < N; ++i) {
if (A[i] < B[i]) {
ret_b += A[i] + B[i];
} else if (A[i] > B[i]) {
ret_a += A[i] + B[i];
} else {
ret_a += A[i];
ret_b = B[i];
}
}
cout << ret_a << " " << ret_b << endl;
}
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int main() {
int N = 0;
while (cin >> N && N != 0) {
vector<int> A(N), B(N);
for (int i = 0; i < N; ++i)
cin >> A[i] >> B[i];
int ret_a = 0, ret_b = 0;
for (int i = 0; i < N; ++i) {
if (A[i] < B[i]) {
ret_b += A[i] + B[i];
} else if (A[i] > B[i]) {
ret_a += A[i] + B[i];
} else {
ret_a += A[i];
ret_b += B[i];
}
}
cout << ret_a << " " << ret_b << endl;
}
}
|
[["-", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 17, 107]]
| 1
| 186
| 2
|
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int n;
int a, b;
int A, B;
while (1) {
cin >> n;
if (n == 0)
break;
A = 0;
B = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b;
// cout << "a = " << a << " : b = " << b << "\n";
if (a > b) {
A += a;
} else if (a < b) {
B += b;
} else if (a == b) {
A += a;
B += b;
}
}
cout << A << " " << B << "\n";
}
}
|
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int n;
int a, b;
int A, B;
while (1) {
cin >> n;
if (n == 0)
break;
A = 0;
B = 0;
for (int i = 0; i < n; i++) {
cin >> a >> b;
// cout << "a = " << a << " : b = " << b << "\n";
if (a > b) {
A += a + b;
} else if (a < b) {
B += a + b;
} else if (a == b) {
A += a;
B += b;
}
}
cout << A << " " << B << "\n";
}
}
|
[["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 31, 22]]
| 1
| 138
| 4
|
#include <stdio.h>
int main(void) {
int n;
int a, b;
int a1, b1;
int i;
scanf("%d", &n);
while (n != 0) {
a1 = 0;
b1 = 0;
for (i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
if (a > b) {
a1 += a;
a1 += b;
} else if (a < b) {
b1 += a;
b1 += b;
} else {
a1 += 1;
b1 += 1;
}
}
printf("%d %d\n", a1, b1);
scanf("%d", &n);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int n;
int a, b;
int a1, b1;
int i;
scanf("%d", &n);
while (n != 0) {
a1 = 0;
b1 = 0;
for (i = 0; i < n; i++) {
scanf("%d %d", &a, &b);
if (a > b) {
a1 += a;
a1 += b;
} else if (a < b) {
b1 += a;
b1 += b;
} else {
a1 += a;
b1 += b;
}
}
printf("%d %d\n", a1, b1);
scanf("%d", &n);
}
return 0;
}
|
[["-", 75, 76, 0, 9, 0, 1, 0, 11, 12, 13], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 12, 22]]
| 1
| 148
| 4
|
while(n=gets.to_i)>0
a=b=0
n.times{i,j=gets.split.map &:to_i;i>j ?a+=i+j :i<j ?b+=i+j :a+=i&&b+=j}
puts"#{a} #{b}"
end
|
while(n=gets.to_i)>0
a=b=0
n.times{i,j=gets.split.map &:to_i;i>j ?a+=i+j :i<j ?b+=i+j :(a+=i)&&(b+=j)}
puts"#{a} #{b}"
end
|
[["+", 0, 754, 75, 754, 75, 738, 31, 739, 0, 24], ["+", 0, 754, 75, 754, 75, 738, 31, 739, 0, 25], ["+", 0, 754, 75, 754, 75, 738, 12, 739, 0, 24], ["+", 0, 754, 75, 754, 75, 738, 12, 739, 0, 25]]
| 4
| 70
| 2
|
while(n=gets.to_i)>0
a=b=0
n.times{i,j=gets.split.map &:to_i;i>j ?a+=i+j :i<j ?b+=i+j :a+=i&&b+=j}
puts"#{a} #{b}"
end
|
while(n=gets.to_i)>0
a=b=0
n.times{i,j=gets.split.map &:to_i;i>j ?a+=i+j :i<j ?b+=i+j :(a+=i)&&b+=j}
puts"#{a} #{b}"
end
|
[["+", 0, 754, 75, 754, 75, 738, 31, 739, 0, 24], ["+", 0, 754, 75, 754, 75, 738, 31, 739, 0, 25]]
| 4
| 70
| 2
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.