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 |
|---|---|---|---|---|---|
ansli=[]
while 1:
a=input().split()
if a[0]=="0" and a[1]=="0" and a[2]=="0":
break
for i in range(len(a)):
a[i]=int(a[i])
x=[]
for i in range(a[0]):
x.append(int(input()))
sum0=0
for i in x:
sum0+=i
sum=sum0*100*((100-a[2])/100)
hit=x[a[1]-1]
if... | ansli=[]
while 1:
a=input().split()
if a[0]=="0" and a[1]=="0" and a[2]=="0":
break
for i in range(len(a)):
a[i]=int(a[i])
x=[]
for i in range(a[0]):
x.append(int(input()))
sum0=0
for i in x:
sum0+=i
sum=sum0*(100-a[2])
hit=x[a[1]-1]
if hit==0:
... | [["-", 0, 1, 0, 662, 12, 657, 31, 657, 12, 612], ["-", 8, 196, 0, 1, 0, 662, 12, 657, 17, 48], ["-", 0, 1, 0, 662, 12, 657, 12, 23, 0, 24], ["-", 12, 657, 12, 23, 0, 657, 31, 23, 0, 25], ["-", 0, 662, 12, 657, 12, 23, 0, 657, 17, 85], ["-", 0, 662, 12, 657, 12, 23, 0, 657, 12, 612]] | 5 | 167 | 6 |
import static java.lang.Integer.parseInt;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
/**
* Princess's Marriage - Accepted
*/
public class Main {
public static void main(String[] args) throws IOException {
... | import static java.lang.Integer.parseInt;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
/**
* Princess's Marriage - Accepted
*/
public class Main {
public static void main(String[] args) throws IOException {
... | [["+", 0, 57, 75, 196, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 75, 196, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 75, 196, 0, 1, 0, 11, 12, 499], ["+", 64, 196, 0, 57, 75, 196, 0, 1, 0, 35]] | 3 | 364 | 4 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
int m = sc.nextInt();
if (n == 0 && m == 0)
break;
int[][] map = new int[n][2];
for (int i = 0; i < n; i++) {
... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (true) {
int n = sc.nextInt();
int m = sc.nextInt();
if (n == 0 && m == 0)
break;
int[][] map = new int[n][2];
for (int i = 0; i < n; i++) {
... | [["-", 8, 196, 0, 37, 0, 16, 31, 504, 71, 499], ["+", 8, 196, 0, 37, 0, 16, 31, 504, 71, 499], ["-", 8, 196, 0, 37, 0, 16, 12, 504, 71, 499], ["+", 8, 196, 0, 37, 0, 16, 12, 504, 71, 499]] | 3 | 294 | 4 |
import java.util.Collections;
import java.util.LinkedList;
import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
public void run() {
while (sc.hasNext()) {
int n = sc.nextInt();
int m = sc.nextInt();
if (n == 0 && m == 0)
break;
calc(n, m);
}
... | import java.util.Collections;
import java.util.LinkedList;
import java.util.Scanner;
public class Main {
Scanner sc = new Scanner(System.in);
public void run() {
while (sc.hasNext()) {
int n = sc.nextInt();
int m = sc.nextInt();
if (n == 0 && m == 0)
break;
calc(n, m);
}
... | [["+", 0, 57, 75, 57, 75, 196, 0, 93, 0, 94], ["+", 0, 57, 75, 57, 75, 196, 0, 93, 0, 35]] | 3 | 289 | 2 |
from collections import defaultdict
def getArray(a):
d = defaultdict(int)
n = len(a)
for i in range(n):
s = 0
for j in range(i,n):
s += a[i]
d[s] += 1
return d
while True:
N,M = list(map(int,input().split()))
if N == 0: break
h = [int(input()) for _ ... | from collections import defaultdict
def getArray(a):
d = defaultdict(int)
n = len(a)
for i in range(n):
s = 0
for j in range(i,n):
s += a[j]
d[s] += 1
return d
while True:
N,M = list(map(int,input().split()))
if N == 0: break
h = [int(input()) for _ ... | [["-", 8, 196, 0, 1, 0, 677, 12, 206, 206, 22], ["+", 8, 196, 0, 1, 0, 677, 12, 206, 206, 22]] | 5 | 151 | 2 |
while True :
n, m = list(map(int,input().split(" ")))
if (n, m) == (0,0):
break
Lon = [0 for _ in range(1000 * n + 1)]
Lat = [0 for _ in range(1000 * m + 1)]
Lon_sum = []
Lat_sum = []
for _ in range(0,n):
h = int(input())
Lon_sum = [h + j for j in Lon_sum] + [h]
for j in Lon_sum[1:]:
Lon[j] += 1
for ... | while True :
n, m = list(map(int,input().split(" ")))
if (n, m) == (0,0):
break
Lon = [0 for _ in range(1000 * n + 1)]
Lat = [0 for _ in range(1000 * m + 1)]
Lon_sum = []
Lat_sum = []
for _ in range(0,n):
h = int(input())
Lon_sum = [h + j for j in Lon_sum] + [h]
for j in Lon_sum:
Lon[j] += 1
for _ in... | [["-", 0, 7, 8, 196, 0, 7, 12, 206, 0, 70], ["-", 8, 196, 0, 7, 12, 206, 206, 663, 0, 612], ["-", 8, 196, 0, 7, 12, 206, 206, 663, 0, 102], ["-", 0, 7, 8, 196, 0, 7, 12, 206, 0, 73]] | 5 | 213 | 4 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF... | [["-", 0, 1, 0, 662, 12, 657, 31, 206, 51, 22], ["+", 0, 1, 0, 662, 12, 657, 31, 206, 51, 22]] | 5 | 472 | 4 |
def solve(lis_height,lis_width):
h=len(lis_height)
w=len(lis_width)
dic = {}
for i in range(h):
k=0
for j in range(i,h):
k+=lis_height[j]
if k in dic:
dic[k]+=1
else:
dic[k]=1
ans = 0
for i in range(w):
k... | def solve(lis_height,lis_width):
h=len(lis_height)
w=len(lis_width)
dic = {}
for i in range(h):
k=0
for j in range(i,h):
k+=lis_height[j]
if k in dic:
dic[k]+=1
else:
dic[k]=1
ans = 0
#print(dic)
#print(w,'a'... | [["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 22], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 22]] | 5 | 200 | 2 |
import java.util.Scanner;
public class Main {
static Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
int N, M, P;
while ((N = scan.nextInt()) != 0 && (M = scan.nextInt()) != 0 &&
(P = scan.nextInt()) != 0) {
int member = 0;
int[] voteNum = new int[N +... | import java.util.Scanner;
public class Main {
static Scanner scan = new Scanner(System.in);
public static void main(String[] args) {
int N, M, P;
while ((N = scan.nextInt()) != 0 | (M = scan.nextInt()) != 0 |
(P = scan.nextInt()) != 0) {
int member = 0;
int[] voteNum = new int[N + 1... | [["-", 0, 52, 15, 15, 0, 16, 31, 16, 17, 98], ["+", 0, 52, 15, 15, 0, 16, 31, 16, 17, 139], ["-", 8, 196, 0, 52, 15, 15, 0, 16, 17, 98], ["+", 8, 196, 0, 52, 15, 15, 0, 16, 17, 139]] | 3 | 184 | 4 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while (true) {
int n = in.nextInt();
int m = in.nextInt();
int p = in.nextInt();
int xm = 0;
if (n == 0)
break;
int sum = 0;
for (int i... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while (true) {
int n = in.nextInt();
int m = in.nextInt();
int p = in.nextInt();
int xm = 0;
if (n == 0)
break;
int sum = 0;
for (int i... | [["-", 0, 503, 49, 200, 51, 510, 15, 16, 31, 22], ["+", 0, 503, 49, 200, 51, 510, 15, 16, 31, 22]] | 3 | 160 | 2 |
/*
AizuOnline A2018
Princess's Gamble
*/
#include <float.h>
#include <stdio.h>
int M, N, P;
int hyousuu[100];
long int sousuu;
long int haitou;
main() {
int i;
while (EOF != scanf("%d %d %d", &N, &M, &P) && (N || M || P)) {
sousuu = 0;
for (i = 0; i < N; i++) {
scanf("%d", &hyousuu[i]);
sousu... | /*
AizuOnline A2018
Princess's Gamble
*/
#include <float.h>
#include <stdio.h>
int M, N, P;
int hyousuu[100];
long int sousuu;
long int haitou;
main() {
int i;
while (EOF != scanf("%d %d %d", &N, &M, &P) && (N || M || P)) {
sousuu = 0;
for (i = 0; i < N; i++) {
scanf("%d", &hyousuu[i]);
sousu... | [["+", 0, 11, 12, 16, 12, 74, 51, 23, 0, 24], ["+", 12, 16, 12, 74, 51, 23, 0, 16, 31, 13], ["+", 12, 16, 12, 74, 51, 23, 0, 16, 17, 33], ["+", 0, 11, 12, 16, 12, 74, 51, 23, 0, 25]] | 0 | 155 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int N, M, P;
int sum, ans;
int X[1001];
while (scanf("%d %d %d", &N, &M, &P) != EOF && (!N && !M && !P)) {
sum = 0;
for (int i = 0; i < N; i++) {
cin >> X[i];
sum += X[i];
}
P = 100 - P;
if (X[M - 1]... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int N, M, P;
int sum, ans;
int X[1001];
while (scanf("%d %d %d", &N, &M, &P) != EOF) {
if (!N && !M && !P)
break;
sum = 0;
for (int i = 0; i < N; i++) {
cin >> X[i];
sum += X[i];
}
P = 100 - P;
... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 8, 9, 0, 52, 8, 9, 0, 57, 0, 121], ["-", 0, 52, 15, 339, 51, 16, 12, 23, 0, 25], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 45], ["+", 0, 52, 8, 9, 0, 57, 64, 93, 0, 94], ["+", 0, 52, 8, 9, 0, ... | 1 | 144 | 8 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int N, M, P;
int sum, ans;
int X[1001];
while (scanf("%d %d %d", &N, &M, &P) != EOF) {
if (N != 0 && M != 0 && P != 0)
break;
sum = 0;
for (int i = 0; i < N; i++) {
cin >> X[i];
sum += X[i];
}
P... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int N, M, P;
int sum, ans;
int X[1001];
while (scanf("%d %d %d", &N, &M, &P) != EOF) {
if (N == 0 && M == 0 && P == 0)
break;
sum = 0;
for (int i = 0; i < N; i++) {
cin >> X[i];
sum += X[i];
}
P... | [["-", 15, 339, 51, 16, 31, 16, 31, 16, 17, 79], ["+", 15, 339, 51, 16, 31, 16, 31, 16, 17, 60], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 79], ["+", 15, 339, 51, 16, 31, 16, 12, 16, 17, 60], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 79], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60]] | 1 | 149 | 6 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define fori(i, k, n) for (int i = k; i < n; i++)
using namespace std;
const int dx[4] = {0, 1... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define fori(i, k, n) for (int i = k; i < n; i++)
using namespace std;
const int dx[4] = {0, 1... | [["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 98], ["+", 0, 52, 15, 339, 51, 16, 31, 16, 17, 106], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 106]] | 1 | 265 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, p, x, d, a;
while (cin >> n >> m >> p, n, m, p) {
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> x;
if (i + 1 == m)
d = x;
sum += x;
}
a = sum * 100 * (100 - p) / 100;
if (d != 0)
cout << a / ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, p, x, d, a;
while (cin >> n >> m >> p, n) {
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> x;
if (i + 1 == m)
d = x;
sum += x;
}
a = sum * 100 * (100 - p) / 100;
if (d != 0)
cout << a / d << e... | [["-", 0, 52, 15, 339, 51, 34, 12, 34, 0, 21], ["-", 15, 339, 51, 34, 12, 34, 12, 34, 31, 22], ["-", 15, 339, 51, 34, 12, 34, 12, 34, 0, 21], ["-", 15, 339, 51, 34, 12, 34, 12, 34, 12, 22]] | 1 | 119 | 4 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
for (int N, M, P; cin >> N >> M >> P, N, M, P;) {
int bet = 0;
vector<int> l;
for (int i = 0; i < N; i++) {
int X;
cin >> X;
l.push_back(X);
bet += X;
}
if (l[M - 1]) {
cout << (bet * (100 - P) ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
for (int N, M, P; cin >> N >> M >> P, N;) {
int bet = 0;
vector<int> l;
for (int i = 0; i < N; i++) {
int X;
cin >> X;
l.push_back(X);
bet += X;
}
if (l[M - 1]) {
cout << (bet * (100 - P) / l[M ... | [["-", 8, 9, 0, 7, 15, 34, 12, 34, 0, 21], ["-", 0, 7, 15, 34, 12, 34, 12, 34, 31, 22], ["-", 0, 7, 15, 34, 12, 34, 12, 34, 0, 21], ["-", 0, 7, 15, 34, 12, 34, 12, 34, 12, 22]] | 1 | 129 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, m, p;
while (cin >> n >> m >> p, n, m, p) {
int ans = 0, d[n];
double sum = 0.0;
for (int i = 0; i < n; i++) {
cin >> d[i];
sum += d[i];
}
sum *= 100;
sum -= sum * (p * 1.0 / 100);
if (d[m - 1]) {
ans = sum / ... | #include <iostream>
using namespace std;
int main() {
int n, m, p;
while (cin >> n >> m >> p, n) {
int ans = 0, d[n];
double sum = 0.0;
for (int i = 0; i < n; i++) {
cin >> d[i];
sum += d[i];
}
sum *= 100;
sum -= sum * (p * 1.0 / 100);
if (d[m - 1]) {
ans = sum / d[m - ... | [["-", 0, 52, 15, 339, 51, 34, 12, 34, 0, 21], ["-", 15, 339, 51, 34, 12, 34, 12, 34, 31, 22], ["-", 15, 339, 51, 34, 12, 34, 12, 34, 0, 21], ["-", 15, 339, 51, 34, 12, 34, 12, 34, 12, 22]] | 1 | 133 | 4 |
#include <iostream>
using namespace std;
int main() {
int N, M, P;
int x[100];
while (cin >> N >> M >> P, N) {
int winner = 0;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> x[i];
if (i + 1 == M)
winner = x[i];
sum += x[i] * P;
}
cout << (winner ? sum / winner : ... | #include <iostream>
using namespace std;
int main() {
int N, M, P;
int x[100];
while (cin >> N >> M >> P, N) {
int winner = 0;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> x[i];
if (i + 1 == M)
winner = x[i];
sum += x[i] * (100 - P);
}
cout << (winner ? sum / w... | [["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 24], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 31, 13], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 17, 33], ["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 25]] | 1 | 110 | 4 |
#include <stdio.h>
int main() {
int N, M, P;
while (1) {
scanf("%d %d %d", &N, &M, &P);
if (N == 0 && M == 0 && P == 0)
break;
int x, s = 0, y = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &x);
s += x;
if (M == i + 1)
y = x;
}
if (y != 0) {
int t = ... | #include <stdio.h>
int main() {
int N, M, P;
while (1) {
scanf("%d %d %d", &N, &M, &P);
if (N == 0 && M == 0 && P == 0)
break;
int x, s = 0, y = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &x);
s += x;
if (M == i + 1)
y = x;
}
if (y != 0) {
double t... | [["-", 8, 9, 0, 57, 64, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 57, 64, 9, 0, 43, 39, 40], ["+", 0, 1, 0, 2, 3, 4, 0, 74, 0, 24], ["+", 0, 2, 3, 4, 0, 74, 39, 77, 39, 40], ["+", 0, 1, 0, 2, 3, 4, 0, 74, 0, 25]] | 1 | 157 | 5 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (true) {
int N, M, P;
cin >> N >> M >> P;
if (N == 0) {
break;
}
int atari_count;
int ticket_count = 0;
for (int i = 0; i < N; i++) {
int input;
cin >> input;
ticket_count += input;
... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
while (true) {
int N, M, P;
cin >> N >> M >> P;
if (N == 0) {
break;
}
int atari_count;
int ticket_count = 0;
for (int i = 0; i < N; i++) {
int input;
cin >> input;
ticket_count += input;
... | [["+", 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 | 136 | 6 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define pb(n) push_back(n)
#define mp(n, m) make_pair(n, m)
#def... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define pb(n) push_back(n)
#define mp(n, m) make_pair(n, m)
#def... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 108], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 297 | 4 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a[100], x, p, s;
while (1) {
cin >> n >> x >> p;
if ((n == 0) && (x == 0) && (p == 0)) {
return 0;
}
s = 0;
for (int i = 0; i < n; i++) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, a[100], x, p, s;
while (1) {
cin >> n >> x >> p;
if ((n == 0) && (x == 0) && (p == 0)) {
return 0;
}
s = 0;
for (int i = 0; i < n; i++) ... | [["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46], ["-", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46]] | 1 | 157 | 2 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int n, m, p;
while (cin >> n >> m >> p && n != 0) {
int a[104] = {0};
int sum = 0;
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
sum = sum + a[i];
}
int... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int n, m, p;
while (cin >> n >> m >> p && n != 0) {
int a[104] = {0};
int sum = 0;
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
sum = sum + a[i];
}
int... | [["+", 0, 43, 49, 50, 51, 16, 12, 23, 0, 24], ["+", 49, 50, 51, 16, 12, 23, 0, 16, 31, 13], ["+", 49, 50, 51, 16, 12, 23, 0, 16, 17, 33], ["+", 0, 43, 49, 50, 51, 16, 12, 23, 0, 25]] | 1 | 131 | 4 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, h;
int data[110];
while (1) {
cin >> n >> m >> h;
if (n == 0 && m == 0 && h == 0)
break;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> data[i];
sum += data[i];
}
if (data[m - 1] == 0) {
cout <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, h;
int data[110];
while (1) {
cin >> n >> m >> h;
if (n == 0 && m == 0 && h == 0)
break;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> data[i];
sum += data[i];
}
if (data[m - 1] == 0) {
cout <... | [["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 24], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 31, 13], ["+", 0, 11, 12, 16, 12, 23, 0, 16, 17, 33], ["+", 0, 1, 0, 11, 12, 16, 12, 23, 0, 25]] | 1 | 144 | 4 |
#include <cstdio>
int N, M, P, S, X[101];
int main() {
while (true) {
scanf("%d%d%d", &N, &M, &P);
if (N == 0) {
break;
}
for (int i = 1; i <= N; i++) {
scanf("%d", &X[i]);
S += X[i];
}
printf("%d\n", X[M] == 0 ? 0 : (100 - P) * S / X[M]);
}
return 0;
} | #include <cstdio>
int N, M, P, S, X[101];
int main() {
while (true) {
S = 0;
scanf("%d%d%d", &N, &M, &P);
if (N == 0) {
break;
}
for (int i = 1; i <= N; i++) {
scanf("%d", &X[i]);
S += X[i];
}
printf("%d\n", X[M] == 0 ? 0 : (100 - P) * S / X[M]);
}
return 0;
} | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 123 | 11 |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <stack>
#define rep(i, x) for (int i = 0; i < x; i++)
#define rrep(i, x) for (int i = x - 1; i >= 0; i--)
#define rep_to(a, i, x) for (int i = a; i < x; i++)
using namespace std;
int main() {
in... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <stack>
#define rep(i, x) for (int i = 0; i < x; i++)
#define rrep(i, x) for (int i = x - 1; i >= 0; i--)
#define rep_to(a, i, x) for (int i = a; i < x; i++)
using namespace std;
int main() {
in... | [["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40], ["+", 64, 1, 0, 16, 31, 16, 12, 2, 63, 22], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 25]] | 1 | 148 | 5 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, l, n) for (lint i = l; i < n; i++)
#define rer(i, l, n) for (lint i = l; i <= n; i++)
#define all(a) a.begin(), a.end()
#define o(a) cout << a <... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, l, n) for (lint i = l; i < n; i++)
#define rer(i, l, n) for (lint i = l; i <= n; i++)
#define all(a) a.begin(), a.end()
#define o(a) cout << a <... | [["+", 0, 41, 75, 16, 31, 16, 31, 23, 0, 24], ["+", 75, 16, 31, 16, 31, 23, 0, 16, 31, 13], ["+", 75, 16, 31, 16, 31, 23, 0, 16, 17, 33], ["+", 0, 41, 75, 16, 31, 16, 31, 23, 0, 25]] | 1 | 206 | 4 |
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 1; i <= n; i++)
int main() {
while (true) {
int n, m, p;
cin >> n >> m >> p;
if (n == 0 && m == 0 && p == 0)
break;
int x;
int hito = 0, sum = 0;
;
rep(i, n) {
cin >> x;
sum += x;
if (i == m) ... | #include <iostream>
using namespace std;
#define rep(i, n) for (int i = 1; i <= n; i++)
int main() {
while (true) {
int n, m, p;
cin >> n >> m >> p;
if (n == 0 && m == 0 && p == 0)
break;
int x;
int hito = 0, sum = 0;
;
rep(i, n) {
cin >> x;
sum += x;
if (i == m) ... | [["+", 0, 52, 8, 9, 0, 14, 8, 9, 0, 46], ["-", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46]] | 1 | 133 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, m, p;
int num[101];
while (cin >> n >> m >> p, n | m | p) {
int total = 0;
for (int i = 1; i <= n; i++) {
cin >> num[i];
total += num[i] * (100 - p);
}
if (!num[n]) {
cout << 0 << endl;
continue;
}
cout ... | #include <iostream>
using namespace std;
int main() {
int n, m, p;
int num[101];
while (cin >> n >> m >> p, n | m | p) {
int total = 0;
for (int i = 1; i <= n; i++) {
cin >> num[i];
total += num[i] * (100 - p);
}
if (!num[m]) {
cout << 0 << endl;
continue;
}
cout ... | [["-", 15, 339, 51, 91, 28, 69, 341, 342, 0, 22], ["+", 15, 339, 51, 91, 28, 69, 341, 342, 0, 22]] | 1 | 118 | 2 |
#include <iostream>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int nextInt() {
int d;
cin >> d;
return d;
}
int main() {
while (true) {
int N = nextInt();
int M = nextInt() - 1;
int P = nextInt();
if (N + M + P == -1)
break;
int sum = 0;
int xm = 0;... | #include <iostream>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int nextInt() {
int d;
cin >> d;
return d;
}
int main() {
while (true) {
int N = nextInt();
int M = nextInt() - 1;
int P = nextInt();
if (N + M + P == -1)
break;
int sum = 0;
int xm = 0;... | [["+", 75, 76, 0, 9, 0, 1, 0, 16, 17, 151], ["+", 75, 76, 0, 9, 0, 1, 0, 16, 12, 22]] | 1 | 148 | 2 |
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX / 2 - 1
using namespace std;
int main() {
int n, m, p, x, sum, num;
while (cin >> n >> m >> p, n | m | p) {
sum = 0;
for (int i = 0; i ... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define el endl
#define fd fixed
#define INF INT_MAX / 2 - 1
using namespace std;
int main() {
int n, m, p, x, sum, num;
while (cin >> n >> m >> p, n | m | p) {
sum = 0;
for (int i = 0; i ... | [["-", 0, 57, 64, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 57, 64, 1, 0, 16, 31, 16, 12, 22]] | 1 | 129 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, m, p;
while (cin >> n >> m >> p) {
if (n == 0 && m == 0 && p == 0)
break;
int x[n];
for (int i = 0; i < n; i++) {
cin >> x[i];
}
if (x[m - 1] == 0) {
cout << 0 << endl;
break;
}
int t = 0;
for (int i... | #include <iostream>
using namespace std;
int main() {
int n, m, p;
while (cin >> n >> m >> p) {
if (n == 0 && m == 0 && p == 0)
break;
int x[n];
for (int i = 0; i < n; i++) {
cin >> x[i];
}
if (x[m - 1] == 0) {
cout << 0 << endl;
} else {
int t = 0;
for (int i =... | [["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35], ["+", 0, 52, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46]] | 1 | 151 | 5 |
#include <stdio.h>
int main() {
int m, n, p, i, sum = 0, ans = 0;
int x[100] = {};
for (;;) {
scanf("%d %d %d", &n, &m, &p);
if (n == 0 && m == 0 && p == 0) {
break;
}
for (i = 1; i <= n; i++) {
scanf("%d", &x[i]);
sum += x[i];
}
if (x[m] != 0) {
ans = (100 * s... | #include <stdio.h>
int main() {
int m, n, p, i, sum = 0, ans = 0;
int x[100] = {};
for (;;) {
scanf("%d %d %d", &n, &m, &p);
if (n == 0 && m == 0 && p == 0) {
break;
}
for (i = 1; i <= n; i++) {
scanf("%d", &x[i]);
sum += x[i];
}
if (x[m] != 0) {
ans = ((double... | [["+", 31, 23, 0, 16, 31, 16, 31, 74, 0, 24], ["+", 0, 16, 31, 16, 31, 74, 39, 77, 39, 40], ["+", 31, 23, 0, 16, 31, 16, 31, 74, 0, 25]] | 1 | 209 | 3 |
#include <iostream>
using namespace std;
int main() {
int n, m, p, x;
int s, winner;
int result;
cin >> n >> m >> p;
while (n || m || p) {
s = 0;
for (int i = 0; i < n; ++i) {
cin >> x;
if (i + 1 == m)
winner = x;
s += x;
}
if (winner) {
result = (s * p) / winn... | #include <iostream>
using namespace std;
int main() {
int n, m, p, x;
int s, winner;
int result;
cin >> n >> m >> p;
while (n || m || p) {
s = 0;
for (int i = 0; i < n; ++i) {
cin >> x;
if (i + 1 == m)
winner = x;
s += x;
}
if (winner) {
result = (s * (100 - p)... | [["+", 12, 16, 31, 23, 0, 16, 12, 23, 0, 24], ["+", 31, 23, 0, 16, 12, 23, 0, 16, 31, 13], ["+", 31, 23, 0, 16, 12, 23, 0, 16, 17, 33], ["+", 12, 16, 31, 23, 0, 16, 12, 23, 0, 25]] | 1 | 124 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
int m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
int m... | [["+", 0, 11, 12, 16, 31, 16, 12, 23, 0, 24], ["+", 12, 16, 31, 16, 12, 23, 0, 16, 31, 13], ["+", 12, 16, 31, 16, 12, 23, 0, 16, 17, 33], ["+", 0, 11, 12, 16, 31, 16, 12, 23, 0, 25]] | 1 | 204 | 4 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (int i = (int)a; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (int i = (int)a; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#de... | [["-", 49, 50, 51, 23, 0, 16, 31, 16, 12, 13], ["-", 0, 43, 49, 50, 51, 23, 0, 16, 17, 48], ["-", 51, 23, 0, 16, 12, 23, 0, 16, 31, 13], ["+", 51, 23, 0, 16, 12, 23, 0, 16, 31, 13], ["-", 0, 16, 12, 23, 0, 16, 12, 16, 17, 85], ["-", 0, 16, 12, 23, 0, 16, 12, 16, 12, 13]] | 1 | 219 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for (int i = 0; i < N; i++)
#define Reps(i, x, N) for (int i = x; i < N; i++)
const int LLINF = 1LL << 60;
signed main() {
int N, M, P;
while (cin >> N >> M >> P, N || M || P) {
int A[105];
P = 100 - P;
Rep(i, N) c... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for (int i = 0; i < N; i++)
#define Reps(i, x, N) for (int i = x; i < N; i++)
const int LLINF = 1LL << 60;
signed main() {
int N, M, P;
while (cin >> N >> M >> P, N || M || P) {
int A[105];
P = 100 - P;
Rep(i, N) c... | [["+", 31, 16, 12, 16, 31, 16, 31, 16, 17, 48], ["+", 31, 16, 12, 16, 31, 16, 31, 16, 12, 22], ["-", 0, 16, 31, 16, 12, 16, 31, 16, 17, 48], ["-", 0, 16, 31, 16, 12, 16, 31, 16, 12, 22]] | 1 | 138 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
main() {
int N, M, P;
while (cin >> N >> M >> P, N && M && P) {
int X[100];
int sum = 0;
for (int i = 0; i < N; i++)
cin >> X[i], sum += X[i] * 100;
sum *= (100 - P);
if (X[M - 1] == 0)
cout << 0 << endl;
else
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, P;
while (cin >> N >> M >> P, N + M + P) {
int X[100];
int sum = 0;
for (int i = 0; i < N; i++)
cin >> X[i], sum += X[i] * 100;
sum *= (100 - P);
if (X[M - 1] == 0)
cout << 0 << endl;
else
cout << sum / X... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 15, 339, 51, 34, 12, 16, 31, 16, 17, 98], ["+", 15, 339, 51, 34, 12, 16, 31, 16, 17, 72], ["-", 0, 52, 15, 339, 51, 34, 12, 16, 17, 98], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 17, 72]] | 1 | 121 | 6 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
int main() {
int n, m, p;
while (cin >> n >> m >> p and n and m and p) {
int sum = 0, hit = 0;
rep(i, n) {
int t;
cin >> t;
sum += 100 * t;
if (i == m - ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
int main() {
int n, m, p;
while (cin >> n >> m >> p and (n or m or p)) {
int sum = 0, hit = 0;
rep(i, n) {
int t;
cin >> t;
sum += 100 * t;
if (i == m - ... | [["+", 0, 52, 15, 339, 51, 16, 12, 23, 0, 24], ["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 355], ["+", 51, 16, 12, 23, 0, 16, 31, 16, 17, 354], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 355], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 17, 354], ["+", 0, 14, 8, 9, 0, 52, 15, 339, 0, 25], ["-", 12, 74, 51, 23, 0, 16, 31, 16, 12, ... | 1 | 130 | 8 |
#include <iostream>
using namespace std;
int main() {
int N, M, P;
while (cin >> N >> M >> P, N != 0) {
int num = 0;
int sum = 0;
for (int i = 0; i < N; i++) {
int X;
cin >> X;
if (i == M - 1) {
num = X;
}
sum += X;
}
cout << (num != 0 ? sum * 100 / num... | #include <iostream>
using namespace std;
int main() {
int N, M, P;
while (cin >> N >> M >> P, N != 0) {
int num = 0;
int sum = 0;
for (int i = 0; i < N; i++) {
int X;
cin >> X;
if (i == M - 1) {
num = X;
}
sum += X;
}
cout << (num != 0 ? sum * (100 - P)... | [["-", 64, 16, 31, 16, 31, 16, 31, 16, 12, 13], ["-", 0, 41, 64, 16, 31, 16, 31, 16, 17, 85], ["-", 0, 41, 64, 16, 31, 16, 31, 16, 12, 22], ["-", 12, 23, 0, 41, 64, 16, 31, 16, 17, 48], ["-", 31, 16, 12, 23, 0, 41, 64, 16, 12, 13], ["+", 31, 16, 12, 23, 0, 41, 64, 16, 12, 22]] | 1 | 115 | 6 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstr... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstr... | [["+", 8, 9, 0, 52, 15, 339, 51, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22]] | 1 | 559 | 2 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m && n | m) {
vector<pair<int, int>> dp; // 期待値,距離
for (int i = 0; i < n; i++) {
int d, p;
cin >> d >> p;
dp.push_back(make_pair(p, d));
}
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m && n | m) {
vector<pair<int, int>> dp; // 期待値,距離
for (int i = 0; i < n; i++) {
int d, p;
cin >> d >> p;
dp.push_back(make_pair(p, d));
}
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 0, 57, 15, 339, 51, 16, 31, 118, 119, 120], ["+", 0, 57, 15, 339, 51, 16, 31, 118, 119, 120]] | 1 | 219 | 6 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 100000000
#define EPS 1e-10
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
int n, m;
P x[10000];
void solve() {
rep(i, n) cin >> x[i].second >> x[i].first;
sort(x, x + n, greater<P>());
int ans = 0;
rep(i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 100000000
#define EPS 1e-10
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
int n, m;
P x[10000];
void solve() {
rep(i, n) cin >> x[i].second >> x[i].first;
sort(x, x + n, greater<P>());
int ans = 0;
rep(i... | [["+", 75, 76, 0, 9, 0, 1, 0, 11, 31, 22], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 75, 76, 0, 9, 0, 1, 0, 35]] | 1 | 188 | 4 |
#include <algorithm>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
const int INF = (1 << 30) - 1;
int main() {
// ios::sync_with_stdio(fal... | #include <algorithm>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
const int INF = (1 << 30) - 1;
int main() {
// ios::sync_with_stdio(fal... | [["-", 8, 1, 0, 16, 31, 16, 12, 118, 119, 120], ["+", 8, 1, 0, 16, 31, 16, 12, 118, 119, 120], ["-", 0, 7, 8, 1, 0, 16, 12, 118, 119, 120], ["+", 0, 7, 8, 1, 0, 16, 12, 118, 119, 120], ["-", 49, 50, 51, 2, 3, 4, 0, 118, 119, 120], ["+", 49, 50, 51, 2, 3, 4, 0, 118, 119, 120], ["-", 0, 1, 0, 11, 12, 16, 31, 118, 119, 12... | 1 | 195 | 10 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int N;
long long int M;
while (1) {
cin >> N >> M;
if (N == 0 && M == 0)
break;
int D[10002][2] = {};
int P[10001] = {};
for (int i = 0; i < N; i++)
cin >> D[i][0] >> D[i][1];
int c = 0;
for (int i =... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int N;
long long int M;
while (1) {
cin >> N >> M;
if (N == 0 && M == 0)
break;
int D[10002][2] = {};
int P[10001] = {};
for (int i = 0; i < N; i++)
cin >> D[i][0] >> D[i][1];
int c = 0;
for (int i =... | [["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 13], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 13]] | 1 | 360 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef l... |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef l... | [["-", 0, 52, 15, 339, 51, 16, 12, 23, 0, 24], ["-", 15, 339, 51, 16, 12, 23, 0, 16, 17, 106], ["-", 15, 339, 51, 16, 12, 23, 0, 16, 12, 22], ["-", 0, 52, 15, 339, 51, 16, 12, 23, 0, 25], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22]] | 1 | 433 | 6 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N, M;
while (cin >> N >> M && N != 0 && M != 0) {
vector<pair<int, int>> dp(N);
long long ans = 0;
for (int i = 0; i < N; i++) {
cin >> dp[i].second >> dp[i].first;
ans += dp[i].second * dp[i].f... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N, M;
while (cin >> N >> M && N != 0 || M != 0) {
vector<pair<int, int>> dp(N);
long long ans = 0;
for (int i = 0; i < N; i++) {
cin >> dp[i].second >> dp[i].first;
ans += dp[i].second * dp[i].f... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 106]] | 1 | 226 | 2 |
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int main() {
int n, money;
while (cin >> n >> money && n > 0 && money > 0) {
pair<int, int> PD[10010];
int p, d;
for (int i = 0; i < n; i++) {
cin >> d >> p;
PD[i] = make_pair(p, d);
}
sort(PD, PD + n... | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int main() {
int n, money;
while (cin >> n >> money && (n > 0 || money > 0)) {
pair<int, int> PD[10010];
int p, d;
for (int i = 0; i < n; i++) {
cin >> d >> p;
PD[i] = make_pair(p, d);
}
sort(PD, PD +... | [["+", 0, 52, 15, 339, 51, 16, 12, 23, 0, 24], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 15, 339, 51, 16, 12, 23, 0, 16, 17, 106], ["+", 0, 52, 15, 339, 51, 16, 12, 23, 0, 25]] | 1 | 231 | 4 |
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int n, m;
int kitaichi(pair<int, int> *pd, int size) {
int sum = 0;
for (int i = 0; i < n; i++) {
sum += pd[i].first * pd[i].second;
}
return sum;
}
int solve() {
pair<int, int> pd[10000];
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int n, m;
int kitaichi(pair<int, int> *pd, int size) {
int sum = 0;
for (int i = 0; i < n; i++) {
sum += pd[i].first * pd[i].second;
}
return sum;
}
int solve() {
pair<int, int> pd[10000];
for (int i = 0; i < n; i++) {
... | [["-", 0, 52, 15, 339, 51, 16, 12, 16, 17, 18], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 19]] | 1 | 275 | 2 |
#include <bits/stdc++.h>
#include <cstdint>
#include <sys/time.h>
typedef std::int_fast32_t s32;
typedef std::uint_fast32_t u32;
typedef std::int_fast64_t s64;
typedef std::uint_fast64_t u64;
const unsigned long mod = 1000000007;
const double EPS = 0.00000001;
const int INF = (1 << 29);
typedef std::pair<int, int> p... | #include <bits/stdc++.h>
#include <cstdint>
#include <sys/time.h>
typedef std::int_fast32_t s32;
typedef std::uint_fast32_t u32;
typedef std::int_fast64_t s64;
typedef std::uint_fast64_t u64;
const unsigned long mod = 1000000007;
const double EPS = 0.00000001;
const int INF = (1 << 29);
typedef std::pair<int, int> p... | [["-", 12, 16, 31, 118, 28, 69, 341, 342, 0, 22], ["+", 12, 16, 31, 118, 28, 69, 341, 342, 0, 22], ["-", 12, 16, 12, 118, 28, 69, 341, 342, 0, 22], ["+", 12, 16, 12, 118, 28, 69, 341, 342, 0, 22]] | 1 | 373 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n_intervals, budget;
// read in number of intervals, and budget
cin >> n_intervals >> budget;
// pair with probability of attack and distance (of each interval)
pair<int, int> PD[10010];
int p, d;
while (n_intervals != 0 &... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n_intervals, budget;
// read in number of intervals, and budget
cin >> n_intervals >> budget;
// pair with probability of attack and distance (of each interval)
pair<int, int> PD[10010];
int p, d;
while (!(n_intervals == 0... | [["+", 8, 9, 0, 52, 15, 339, 51, 91, 17, 111], ["+", 0, 52, 15, 339, 51, 91, 28, 23, 0, 24], ["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 79], ["+", 51, 91, 28, 23, 0, 16, 31, 16, 17, 60], ["-", 0, 52, 15, 339, 51, 16, 12, 16, 17, 79], ["+", 51, 91, 28, 23, 0, 16, 12, 16, 17, 60], ["+", 0, 52, 15, 339, 51, 91, 28, 23, 0, ... | 1 | 215 | 7 |
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, m, d, p, o;
typedef pair<int, int> ma;
int i, j, k;
cin >> n >> m;
while (n != 0 && m != 0) {
vector<ma> map;
ma b;
for (i = 0; i < n; i++) {
cin >> d >> p;
b.first = p;
... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n, m, d, p, o;
typedef pair<int, int> ma;
int i, j, k;
cin >> n >> m;
while (n != 0 || m != 0) {
vector<ma> map;
ma b;
for (i = 0; i < n; i++) {
cin >> d >> p;
b.first = p;
... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 106]] | 1 | 242 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m && (n || m)) {
vector<pair<int, int>> dp;
for (int i = 0; i < n; ++i) {
int d, p;
cin >> d >> p;
dp.push_back(make_pair(p, d));
}
sort(dp.begin(), dp.end(), greater<pair<int, int>>());
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
while (cin >> n >> m && (n || m)) {
vector<pair<int, int>> dp;
for (int i = 0; i < n; ++i) {
int d, p;
cin >> d >> p;
dp.push_back(make_pair(p, d));
}
sort(dp.begin(), dp.end(), greater<pair<int, int>>());
... | [["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 199 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
vector<pii> ans;
int main() {
while (1) {
int N, M;
cin >> N >> M;
if (!N)
break;
ans.clear();
for (int i = 0; i < N; i++) {
int d, p;
cin >> d >> p;
ans.push_back(pii(p, d));
}
sort(ans.be... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
vector<pii> ans;
int main() {
while (1) {
int N, M;
cin >> N >> M;
if (!N)
break;
ans.clear();
for (int i = 0; i < N; i++) {
int d, p;
cin >> d >> p;
ans.push_back(pii(p, d));
}
sort(ans.be... | [["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 355], ["+", 15, 339, 51, 16, 12, 2, 63, 118, 28, 22], ["+", 15, 339, 51, 16, 12, 2, 63, 118, 17, 131], ["+", 15, 339, 51, 16, 12, 2, 63, 118, 119, 120], ["+", 15, 339, 51, 16, 12, 2, 3, 4, 0, 24], ["+", 15, 339, 51, 16, 12, 2, 3, 4, 0, 25]] | 1 | 211 | 6 |
#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M, D, P;
while (cin >> N >> M, N || M) {
vector<int> dp(11);
for (int i = 0; i < N; i++) {
cin >> D >> P;
dp[P] += D;
}
int res = 0;
for (int i = 10; i >= 0; i--) {... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M, D, P;
while (cin >> N >> M, N || M) {
vector<int> dp(11);
for (int i = 0; i < N; i++) {
cin >> D >> P;
dp[P] += D;
}
int res = 0;
for (int i = 10; i >= 0; i--) {... | [["+", 75, 76, 0, 9, 0, 1, 0, 11, 31, 22], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 75, 76, 0, 9, 0, 1, 0, 35]] | 1 | 143 | 4 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, k, n) for (int(i) = (k); (i) < (n); ++(i))
#define ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, k, n) for (int(i) = (k); (i) < (n); ++(i))
#define ... | [["-", 0, 52, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 52, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 15, 339, 51, 16, 12, 74, 51, 118, 119, 120], ["+", 15, 339, 51, 16, 12, 74, 51, 118, 119, 120]] | 1 | 372 | 4 |
#include "bits/stdc++.h"
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define debug(x) cout << #x << " : " << x << " ------------"
using namespace std;
using Info = tuple<int, int>;
int main() {
int n, m;
while (cin >> n >> m, n && m) {
vector<Info> ... | #include "bits/stdc++.h"
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define debug(x) cout << #x << " : " << x << " ------------"
using namespace std;
using Info = tuple<int, int>;
int main() {
int n, m;
while (cin >> n >> m, n | m) {
vector<Info> s... | [["-", 0, 52, 15, 339, 51, 34, 12, 16, 17, 98], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 17, 139]] | 1 | 206 | 2 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
P h[100000];
int main() {
int n, m;
while (scanf("%d%d", &n, &m), n) {
int ans = 0;
rep(i, n) {
int d, p;
scanf("%d%d", &d, &p);
ans += d * p;
h[i] = P(p, d);
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
P h[100000];
int main() {
int n, m;
while (scanf("%d%d", &n, &m), n) {
int ans = 0;
rep(i, n) {
int d, p;
scanf("%d%d", &d, &p);
ans += d * p;
h[i] = P(p, d);
}
... | [["-", 0, 1, 0, 2, 3, 4, 0, 2, 63, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 2, 63, 22]] | 1 | 208 | 2 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | [["-", 0, 52, 15, 339, 51, 34, 12, 16, 17, 98], ["-", 0, 52, 15, 339, 51, 34, 12, 16, 12, 22]] | 1 | 448 | 2 |
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define EPS 1e-10
using namespace std;
typedef long long llong;
class load {
public:
llong d, p;
bool operator<(const load &other) { return this->p > other.p; }
};
int main() {
int n, m;
while (cin >> n >> m, m) {
vector<load> v(n);
for (int i = 0; i < ... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define EPS 1e-10
using namespace std;
typedef long long llong;
class load {
public:
int d, p;
bool operator<(const load &other) { return this->p > other.p; }
};
int main() {
int n, m;
while (cin >> n >> m, n) {
vector<load> v(n);
for (int i = 0; i < n;... | [["-", 0, 30, 0, 353, 8, 123, 0, 124, 39, 78], ["+", 0, 30, 0, 353, 8, 123, 0, 124, 39, 40], ["-", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22], ["+", 8, 9, 0, 52, 15, 339, 51, 34, 12, 22], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 78], ["+", 8, 9, 0, 52, 8, 9, 0, 43, 39, 40]] | 1 | 238 | 6 |
#include <bits/stdc++.h>
#define REP(i, n, N) for (int i = n; i < N; i++)
#define p(S) cout << S << endl
using namespace std;
int main() {
int N, M;
while (cin >> N >> M && N && M) {
int P[11] = {0};
int d, p;
long long int ans = 0;
REP(i, 0, N) {
cin >> d >> p;
P[p] += d;
}
for... | #include <bits/stdc++.h>
#define REP(i, n, N) for (int i = n; i < N; i++)
#define p(S) cout << S << endl
using namespace std;
int main() {
int N, M;
while (cin >> N >> M && N) {
int P[11] = {0};
int d, p;
long long int ans = 0;
REP(i, 0, N) {
cin >> d >> p;
P[p] += d;
}
for (int... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 12, 22]] | 1 | 174 | 2 |
#include <stdio.h>
int main(void) {
int a, b, n, m, k, p[11];
while (scanf("%d %d", &n, &m) != EOF) {
k = 0;
for (int i = 0; i < 11; i++)
p[i] = 0;
while (n--) {
scanf("%d %d", &a, &b);
p[b] += a;
}
for (int i = 10; i >= 0; i--) {
if (m >= p[i]) {
m -= p[i];
... | #include <stdio.h>
int main(void) {
int a, b, n, m, k, p[11];
while (scanf("%d %d", &n, &m), n || m) {
k = 0;
for (int i = 0; i < 11; i++)
p[i] = 0;
while (n--) {
scanf("%d %d", &a, &b);
p[b] += a;
}
for (int i = 10; i >= 0; i--) {
if (m >= p[i]) {
m -= p[i];
... | [["-", 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], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 31, 22], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 17, 106], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 12, 22]] | 1 | 189 | 6 |
#include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define REP(i, n) for (int i = 0; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 29
#define LINF LLONG_MAX / 3
#define MP make_pair
#define PB push_back
#define pb push_back
#define EB emplace_back
#define ALL(v) (v).begin(), ... | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define REP(i, n) for (int i = 0; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 29
#define LINF LLONG_MAX / 3
#define MP make_pair
#define PB push_back
#define pb push_back
#define EB emplace_back
#define ALL(v) (v).begin(), ... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 39, 40], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 39, 78], ["+", 0, 57, 75, 76, 0, 9, 0, 1, 0, 35], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 31, 22], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 17, 32], ["+", 75, 76, 0, 9, 0, 1, 0, 11, 12, 13]] | 1 | 499 | 6 |
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
void calc_danger(int res, int i, pair<int, int> b[], int n) {
int danger = 0;
danger += res * (-1) * b[i].first;
for (int j = 0; j < i; j++) {
danger += b[j].first * b[j].second;
}
cout << danger << endl;
return;
}
int ma... | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
void calc_danger(int res, int i, pair<int, int> b[], int n) {
int danger = 0;
danger += res * (-1) * b[i].first;
for (int j = 0; j < i; j++) {
danger += b[j].first * b[j].second;
}
cout << danger << endl;
return;
}
int ma... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 282 | 4 |
// princess marriage1
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int main() {
pair<int, int> road[20000];
int i, n, money, a, b, j = 0, kitai = 0;
cin >> n; // road????????°
cin >> money; // money
while (n != 0 || money != 0) {
for (i = 0; i < n; i++) {
cin... | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int main() {
pair<int, int> road[20000];
int i, n, money, a, b, j = 0, kitai = 0;
cin >> n; // road????????°
cin >> money; // money
while (n != 0 || money != 0) {
for (i = 0; i < n; i++) {
cin >> a >> b;
road[... | [["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 98], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 31, 22], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 17, 47], ["+", 0, 52, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 222 | 4 |
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int main() {
int N, M;
while (cin >> N >> M && N != 0 && M != 0) {
pair<int, int> *road = new pair<int, int>[N];
for (int i = 0; i < N; ++i) {
cin >> road[i].second >> road[i].first; //(P,D)
}
sort(road, road + N... | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
int main() {
int N, M;
while (cin >> N >> M && !(N == 0 && M == 0)) {
pair<int, int> *road = new pair<int, int>[N];
for (int i = 0; i < N; ++i) {
cin >> road[i].second >> road[i].first; //(P,D)
}
sort(road, road ... | [["+", 0, 52, 15, 339, 51, 16, 12, 91, 17, 111], ["+", 15, 339, 51, 16, 12, 91, 28, 23, 0, 24], ["-", 15, 339, 51, 16, 31, 16, 12, 16, 17, 79], ["+", 12, 91, 28, 23, 0, 16, 31, 16, 17, 60], ["-", 0, 52, 15, 339, 51, 16, 12, 16, 17, 79], ["+", 12, 91, 28, 23, 0, 16, 12, 16, 17, 60], ["+", 15, 339, 51, 16, 12, 91, 28, 23... | 1 | 220 | 7 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <utility>
using namespace std;
int main() {
int N, M;
pair<int, int> PD[10010];
while (cin >> N >> M && N > 0) {
int d, p;
for (int i = 0; i < N; i++) {
cin >> d >> p;
PD[i] = make_pair(p, d);
}
sort(PD, PD + N);
re... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <utility>
using namespace std;
int main() {
int N, M;
pair<int, int> PD[10010];
while (cin >> N >> M && N > 0) {
int d, p;
for (int i = 0; i < N; i++) {
cin >> d >> p;
PD[i] = make_pair(p, d);
}
sort(PD, PD + N);
re... | [["+", 0, 52, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 52, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 203 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> P;
//-----------------------------------------------------------------------
int main() {
cin.tie(0);
ios::sync_wi... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> P;
//-----------------------------------------------------------------------
int main() {
cin.tie(0);
ios::sync_wi... | [["-", 0, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 207 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 31, 22], ["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 20]] | 1 | 239 | 4 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
long long int N, M;
while (1) {
scanf("%lld %lld", &N, &M);
if (N == 0 && M == 0)
break;
else {
vector<pair<long long int, long long int>> buri;
for (... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
long long int N, M;
while (1) {
scanf("%lld %lld", &N, &M);
if (N == 0 && M == 0)
break;
else {
vector<pair<long long int, long long int>> buri;
for (... | [["+", 0, 57, 75, 76, 0, 9, 0, 93, 0, 94], ["+", 0, 57, 75, 76, 0, 9, 0, 93, 0, 35]] | 1 | 273 | 2 |
#include <bits/stdc++.h>
using namespace std;
const int Ex = 11;
vector<int> v;
int main() {
while (1) { // start
int n, m;
cin >> n >> m;
if (n == 0 and m == 0)
break;
v.resize(Ex);
// input data
for (int i = 0; i < n; i++) {
int d, p;
cin >> d >> p;
v[p] += d;
}... | #include <bits/stdc++.h>
using namespace std;
const int Ex = 11;
vector<int> v;
int main() {
while (1) { // start
int n, m;
cin >> n >> m;
if (n == 0 and m == 0)
break;
v.resize(Ex);
// input data
for (int i = 0; i < n; i++) {
int d, p;
cin >> d >> p;
v[p] += d;
}... | [["+", 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 | 195 | 6 |
#include <stdio.h>
int main() {
int n, m, d, p, a, i;
for (; scanf("%d%d", &n, &m), n | m; printf("%d\n", a)) {
a = 0;
int f[12] = {0};
for (i = n; i--; f[p] += d)
scanf("%d%d", &d, &p);
for (i = 10; i >= 0; i--) {
for (; f[i] & m;) {
m--, f[i]--;
}
a += f[i] * i;
... | #include <stdio.h>
int main() {
int n, m, d, p, a, i;
for (; scanf("%d%d", &n, &m), n | m; printf("%d\n", a)) {
a = 0;
int f[12] = {0};
for (i = n; i--; f[p] += d)
scanf("%d%d", &d, &p);
for (i = 10; i >= 0; i--) {
for (; f[i] && m;) {
m--, f[i]--;
}
a += f[i] * i;
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 67], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 98]] | 1 | 142 | 24 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using nam... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using nam... | [["+", 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 | 388 | 6 |
// AOJ 2019
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, m;
while (cin >> n >> m, n && m) {
vector<pair<int, int>> data;
int d, p;
int ret = 0;
for (int i = 0; i < n; i++) {
cin >> d >> p;
data.push_back(make_pair(p, d));
... | // AOJ 2019
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n, m;
while (cin >> n >> m, n || m) {
vector<pair<int, int>> data;
int d, p;
int ret = 0;
for (int i = 0; i < n; i++) {
cin >> d >> p;
data.push_back(make_pair(p, d));
... | [["-", 0, 52, 15, 339, 51, 34, 12, 16, 17, 98], ["+", 0, 52, 15, 339, 51, 34, 12, 16, 17, 106], ["+", 64, 9, 0, 1, 0, 11, 12, 23, 0, 24], ["+", 64, 9, 0, 1, 0, 11, 12, 23, 0, 25], ["+", 0, 9, 0, 1, 0, 11, 12, 23, 0, 24], ["+", 0, 9, 0, 1, 0, 11, 12, 23, 0, 25]] | 1 | 200 | 6 |
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
typedef pair<int, int> P;
int n, m;
P info[10001];
int main() {
while (cin >> n >> m, n || m) {
long long ans = 0;
for (int i = 0; i < n; i++)
cin >> info[i].second >> info[i].first;
sort(info, info + n);
for (in... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
typedef pair<int, int> P;
int n, m;
P info[10001];
int main() {
while (cin >> n >> m, n || m) {
long long ans = 0;
for (int i = 0; i < n; i++)
cin >> info[i].second >> info[i].first;
sort(info, info + n);
for (in... | [["-", 8, 9, 0, 57, 75, 76, 0, 57, 0, 121], ["-", 0, 57, 75, 76, 0, 57, 15, 339, 0, 24], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 0, 57, 75, 76, 0, 57, 15, 339, 0, 25]] | 1 | 175 | 6 |
#include <algorithm>
#include <iostream>
#include <utility>
bool greaterfirst(std::pair<int, int> i, std::pair<int, int> j) {
return (i.second > j.second);
}
int main() {
while (1) {
// 入力
int N, M;
std::cin >> N >> M;
if (N == 0 && M == 0)
return 0;
int D, P;
std::pair<int, int> DP[... | #include <algorithm>
#include <iostream>
#include <utility>
bool greaterfirst(std::pair<int, int> i, std::pair<int, int> j) {
return (i.second > j.second);
}
int main() {
while (1) {
// 入力
int N, M;
std::cin >> N >> M;
if (N == 0 && M == 0)
return 0;
int D, P;
std::pair<int, int> DP[... | [["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 98], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 31, 22], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 18], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 22]] | 1 | 275 | 4 |
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int N, M;
for (;;) {
scanf("%d%d", &N, &M);
if (N == 0 && M == 0)
break;
int d, p, len = 0;
vector<pair<int, int>> ds(N);
for (auto &pa : ds) {
scanf("%d%d", &d, &p);
pa = make_pair(p, d... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int N, M;
for (;;) {
scanf("%d%d", &N, &M);
if (N == 0 && M == 0)
break;
int d, p, len = 0;
vector<pair<int, int>> ds(N);
for (auto &pa : ds) {
scanf("%d%d", &d, &p);
pa = make_pair(p, d... | [["+", 8, 9, 0, 43, 49, 50, 51, 2, 63, 22], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 24], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 21], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 25]] | 1 | 188 | 5 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static Scanner s = new Scanner(System.in);
public static void main(String[] args) {
while (true) {
int n = s.nextInt();
if (n == 0)
break;
int trainNum = 0;
int maxNum = 0;
int[] startTrain = new int[n... | import java.util.Arrays;
import java.util.Scanner;
public class Main {
static Scanner s = new Scanner(System.in);
public static void main(String[] args) {
while (true) {
int n = s.nextInt();
if (n == 0)
break;
int trainNum = 0;
int maxNum = 0;
int[] startTrain = new int[n... | [["-", 49, 200, 51, 492, 3, 4, 0, 504, 71, 499], ["+", 49, 200, 51, 492, 3, 4, 0, 504, 71, 499]] | 3 | 366 | 8 |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
static PrintWriter ... | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
static PrintWriter ... | [["+", 3, 4, 0, 227, 51, 518, 0, 16, 17, 48], ["+", 3, 4, 0, 227, 51, 518, 0, 16, 12, 499], ["+", 0, 227, 51, 518, 0, 16, 31, 16, 17, 48], ["+", 0, 227, 51, 518, 0, 16, 31, 16, 12, 499], ["+", 3, 4, 0, 227, 51, 518, 0, 16, 17, 33]] | 3 | 1,218 | 6 |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
for (;;) {
int N = sc.nextInt();
if (N == 0)
break;
int[][] is = new int[N][2];
int[] time = new int[86400];
for (int i = 0; i < N; i+... | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
for (;;) {
int N = sc.nextInt();
if (N == 0)
break;
int[][] is = new int[N][2];
int[] time = new int[86400];
for (int i = 0; i < N; i+... | [["-", 0, 7, 8, 196, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 196, 0, 7, 15, 16, 17, 18], ["-", 8, 196, 0, 7, 15, 16, 12, 504, 71, 499], ["+", 8, 196, 0, 7, 15, 16, 12, 504, 71, 499]] | 3 | 311 | 4 |
#define _USE_MATH_DEFINES
#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define inf 100000000
#define INF 9223372036854775807
#define EPS 1e-10
#define sq(n) ((n) * (n))
#define rep(i, n) for (i = 0; i < n; i++)
#define rev(i, n) for (i = n - 1; i >=... | #define _USE_MATH_DEFINES
#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define inf 100000000
#define INF 9223372036854775807
#define EPS 1e-10
#define sq(n) ((n) * (n))
#define rep(i, n) for (i = 0; i < n; i++)
#define rev(i, n) for (i = n - 1; i >=... | [["-", 0, 11, 31, 2, 3, 4, 0, 16, 31, 13], ["+", 0, 11, 31, 2, 3, 4, 0, 16, 31, 13]] | 0 | 712 | 2 |
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
int comp(const void *a, const void *b) {
int x, y;
x = *(int *)a;
y = *(int *)b;
return (x - y);
}
int main(void) {
int n;
int i, j;
int groupA[16192], groupB[16192];
int h, m, s, hh, mm, ss;
int ans;
int prev;
while (1) {
scanf("%... | #include <limits.h>
#include <stdio.h>
#include <stdlib.h>
int comp(const void *a, const void *b) {
int x, y;
x = *(int *)a;
y = *(int *)b;
return (x - y);
}
int main(void) {
int n;
int i, j;
int groupA[16192], groupB[16192];
int h, m, s, hh, mm, ss;
int ans;
int prev;
while (1) {
scanf("%... | [["-", 0, 11, 12, 16, 31, 16, 12, 16, 31, 22], ["+", 0, 11, 12, 16, 31, 16, 12, 16, 31, 22], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 0 | 326 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int in() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++)
s[i] -= '0';
int h = s[0] * 10 + s[1];
int m = s[3] * 10 + s[4];
int ret = s[6] * 10 + s[7];
ret += m * 60 + h * 60 * 60;
return ret;
}
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int in() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++)
s[i] -= '0';
int h = s[0] * 10 + s[1];
int m = s[3] * 10 + s[4];
int ret = s[6] * 10 + s[7];
ret += m * 60 + h * 60 * 60;
return ret;
}
... | [["-", 0, 27, 28, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 246 | 2 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(obj) obj.begin(), obj.end()
#define fcout cout << setprecision(10)
const int iINF = 1e9;
const long long llINF = 1e18;
const int MOD = 1e9 + 7;
using namespace std;
template <typename T> void debug(vector<T> &vec) {
for (auto x : v... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(obj) obj.begin(), obj.end()
#define fcout cout << setprecision(10)
const int iINF = 1e9;
const long long llINF = 1e18;
const int MOD = 1e9 + 7;
using namespace std;
template <typename T> void debug(vector<T> &vec) {
for (auto x : v... | [["-", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 417 | 2 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define ALL(s) s.begin(), s.end()
#define P pair<ll, ll>
#define vl vector<ll>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vvl vector<vector<ll>>
#define print(n) cout << n << endl
const int M = 100010;
const ... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define ALL(s) s.begin(), s.end()
#define P pair<ll, ll>
#define vl vector<ll>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vvl vector<vector<ll>>
#define print(n) cout << n << endl
const int M = 100010;
const ... | [["-", 8, 9, 0, 9, 0, 1, 0, 16, 17, 60], ["+", 8, 9, 0, 9, 0, 1, 0, 11, 17, 32]] | 1 | 408 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
//#include <stack>
//#include <queue>
//#include <map>
#include <cmath>
//#include <string>
//#include <sstream>
#include <iomanip>
//#include <complex>
#include <stdio.h>
//小数制度 cout << fixed << setprecision(5) << tmp << endl;
using namespace std;
#define ll... | #include <algorithm>
#include <iostream>
#include <vector>
//#include <stack>
//#include <queue>
//#include <map>
#include <cmath>
//#include <string>
//#include <sstream>
#include <iomanip>
//#include <complex>
#include <stdio.h>
//小数制度 cout << fixed << setprecision(5) << tmp << endl;
using namespace std;
#define ll... | [["+", 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 | 252 | 6 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
vector<pii> train;
const int H = 60 * 60;
const int M = 60;
const int S = 1;
int unit[3] = {H, M, S};
int getTime(string s) {
string tmp;
int res = 0;
for (int i = 0; i < 3; i++) {
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
vector<pii> train;
const int H = 60 * 60;
const int M = 60;
const int S = 1;
int unit[3] = {H, M, S};
int getTime(string s) {
string tmp;
int res = 0;
for (int i = 0; i < 3; i++) {
... | [["+", 8, 9, 0, 1, 0, 2, 63, 118, 28, 22], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 17, 131], ["+", 8, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 304 | 6 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13]] | 1 | 268 | 4 |
#include <algorithm>
#include <cstdio>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, h, m, s;
while (scanf("%d", &n), n) {
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
scanf("%d:%d:%d", &h, &m, &s);
v.push_back(make_pair(h * 3600 + m * 60 + s, 1));
... | #include <algorithm>
#include <cstdio>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, h, m, s;
while (scanf("%d", &n), n) {
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
scanf("%d:%d:%d", &h, &m, &s);
v.push_back(make_pair(h * 3600 + m * 60 + s, 1));
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 15, 16, 12, 2, 63, 118, 28, 22], ["+", 0, 7, 15, 16, 12, 2, 63, 118, 17, 131], ["+", 0, 7, 15, 16, 12, 2, 63, 118, 119, 120], ["+", 0, 7, 15, 16, 12, 2, 3, 4, 0, 24], ["+", 0, 7, 15, 16, 12, 2, 3, 4, 0, 25]] | 1 | 219 | 6 |
#include <cstdlib>
#include <iostream>
using namespace std;
int Hen(char s, char t) { return ((s - '0') * 10 + (t - '0')); }
int main() {
string s, f;
int n, a, b, max, T[86401] = {};
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> s >> f;
a = (Hen(s[0]... | #include <cstdlib>
#include <iostream>
using namespace std;
int Hen(char s, char t) { return ((s - '0') * 10 + (t - '0')); }
int main() {
string s, f;
int n, a, b, max, T[86401] = {};
while (1) {
cin >> n;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> s >> f;
a = (Hen(s[0]... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 274 | 2 |
#include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
#define MAX_N 100000
int x[MAX_N];
int main() {
int n, a, b, c, d, e, maxn = 0;
;
while (true) {
for (int i = 0; i < MAX_N; i++) {
x[i] = 0;
}
cin >> n;
maxn = 0;
if (n == 0) {
break;
}
for (in... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
#define MAX_N 100000
int x[MAX_N];
int main() {
int n, a, b, c, d, e, maxn = 0;
;
while (true) {
for (int i = 0; i < MAX_N; i++) {
x[i] = 0;
}
cin >> n;
maxn = 0;
if (n == 0) {
break;
}
for (in... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 214 | 6 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, h, m, s, time, ans, cnt;
char q;
vector<pair<int, int>> ti;
while (1) {
cin >> n;
ans = 0, cnt = 0;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> h >> q >> m >> q >> s;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, h, m, s, time, ans, cnt;
char q;
vector<pair<int, int>> ti;
while (1) {
cin >> n;
ans = 0, cnt = 0;
if (n == 0)
break;
for (int i = 0; i < n; i++) {
cin >> h >> q >> m >> q >> s;
... | [["+", 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 | 219 | 6 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define mp make_pair
#... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<pint> vpint;
#define mp make_pair
#... | [["-", 0, 1, 0, 2, 3, 4, 0, 69, 28, 22], ["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 70], ["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 13], ["-", 0, 2, 3, 4, 0, 69, 341, 342, 0, 73], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 406 | 5 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int n;
int imos[86400];
void solve() {
rep(i, n) {
int s[3];
int t[3];
scanf("%d:%d:%d", &s[0], &s[1], &s[2]);
scanf("%d:%d:%d", &t[0], &t[1], &t[2]);
// hh:mm:ss を 秒に変換
int S = s[2] + 60 * (s[1]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int n;
int imos[86400];
void solve() {
rep(i, n) {
int s[3];
int t[3];
scanf("%d:%d:%d", &s[0], &s[1], &s[2]);
scanf("%d:%d:%d", &t[0], &t[1], &t[2]);
// hh:mm:ss を 秒に変換
int S = s[2] + 60 * (s[1]... | [["-", 0, 27, 28, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 253 | 2 |
#include <cstdio>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int n;
int add[24 * 60 * 60 + 10];
void solve() {
rep(i, 24 * 60 * 60 + 5) add[i] = 0;
rep(i, n) {
int s1, s2, s3;
int t1, t2, t3;
scanf("%d:%d:%d", &s1, &s2, &s3);
scanf("%d:%d:%d", &t1, &t... | #include <cstdio>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int n;
int add[24 * 60 * 60 + 10];
void solve() {
rep(i, 24 * 60 * 60 + 5) add[i] = 0;
rep(i, n) {
int s1, s2, s3;
int t1, t2, t3;
scanf("%d:%d:%d", &s1, &s2, &s3);
scanf("%d:%d:%d", &t1, &t... | [["-", 0, 16, 31, 16, 31, 16, 31, 16, 12, 13], ["+", 0, 16, 31, 16, 31, 16, 31, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107], ["-", 31, 16, 31, 16, 31, 16, 31, 16, 12, 13], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 240 | 10 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
int main() {
int n;
while (cin >> n, n) {
int hws[24][60][60];
rep(i, 24) rep(j, 60) rep(k, 60) hws[i][j][k] = 0;
rep(i, n) {
string s, e;
cin >> s >> e;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
int main() {
int n;
while (cin >> n, n) {
int hws[24][60][60];
rep(i, 24) rep(j, 60) rep(k, 60) hws[i][j][k] = 0;
rep(i, n) {
string s, e;
cin >> s >> e;
... | [["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22]] | 1 | 279 | 4 |
//#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b)... | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b)... | [["-", 0, 27, 28, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 27, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 288 | 2 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#define REP(i, n) for (int i = 0; i < n; i++)
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
#define mod 1000000007 // 1e9+7(prime number)
#define INF 1000000000 // 1e9
#define SIZE 86400 // 60*60*24
using nam... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#define REP(i, n) for (int i = 0; i < n; i++)
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
#define mod 1000000007 // 1e9+7(prime number)
#define INF 1000000000 // 1e9
#define SIZE 86400 // 60*60*24
using nam... | [["-", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["+", 0, 52, 8, 9, 0, 14, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 52, 8, 9, 0, 14, 8, 9, 0, 46]] | 1 | 237 | 7 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int N;
string In[10000], Out[10000];
int main() {
while (cin >> N && N > 0) {
for (int i = 0; i < N; ++i) {
cin >> Out[i] >> In[i];
sort(In, In + N);
sort(Out, Out + N);
// for (int i=0; i<N; ++i)
// ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int N;
string In[10000], Out[10000];
int main() {
while (cin >> N && N > 0) {
for (int i = 0; i < N; ++i) {
cin >> Out[i] >> In[i];
// for (int i=0; i<N; ++i)
// cout << Out[i] << ' ' << In[i] << endl;
}... | [["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 171 | 2 |
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(n) rep(i, n)
#define all(n) n.begin(), n.end()
const int H = 60 * 60, M = 60, CHAKU = 0, HATU = 1;
typedef pair<int, int> pp;
... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(n) rep(i, n)
#define all(n) n.begin(), n.end()
const int H = 60 * 60, M = 60, CHAKU = 0, HATU = 1;
typedef pair<int, int> pp;
... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 48], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 241 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.