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 math
n=int(input())
A=[0]*n
cnt=0
for i in range(0,n):
A[i]=int(input())
for i in range(0,n):
if A[i]<2: pass
elif A[i]==2 or A[i]==3 or A[i]==5 or A[i]==7:
cnt+=1
else:
x=int(math.sqrt(A[i])+1)
for j in range(2,x):
if A[i]%j==0:
break
... | import math
n=int(input())
A=[0]*n
cnt=0
for i in range(0,n):
A[i]=int(input())
for i in range(0,n):
if A[i]<2: pass
elif A[i]==2 or A[i]==3 or A[i]==5 or A[i]==7:
cnt+=1
else:
x=int(math.sqrt(A[i])+1)
for j in range(2,x):
if A[i]%j==0:
break
... | [["-", 8, 196, 0, 57, 15, 666, 0, 657, 31, 22], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 31, 22]] | 5 | 151 | 2 |
import math
def PrimeNum(a):
x=math.sqrt(a)
x=int(x)
tmp=1
if a==1:
tmp=0
elif a==2:
tmp==1
elif a>3 and a<9:
for i in range(2,a):
st=a%i
if st==0:
tmp=0
break
else:
for i in range(2,x):
st=a%i
if st == 0:
tmp=0
break
#print("::::",a,x,st,tmp)
return tmp
n=int(input())... | import math
def PrimeNum(a):
x=math.sqrt(a)
x=int(x)
tmp=1
if a==1:
tmp=0
elif a==2:
tmp==1
elif a>3 and a<9:
for i in range(2,a):
st=a%i
if st==0:
tmp=0
break
else:
for i in range(2,x+1):
st=a%i
if st == 0:
tmp=0
break
#print("::::",a,x,st,tmp)
#if tmp==1:print("γ»γ»")
... | [["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 21], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22]] | 5 | 152 | 4 |
import math
def is_prime(n):
for j in range(2,math.floor(math.sqrt(n))+1):
if n%i==0:
return False
return True
cnt = 0
n=int(input())
for i in range(n):
k=int(input())
if is_prime(k):
cnt+=1
print(cnt,end="")
| import math
def is_prime(n):
for i in range(2,math.floor(math.sqrt(n))+1):
if n%i==0:
return False
return True
cnt = 0
n=int(input())
for i in range(n):
k=int(input())
if is_prime(k):
cnt+=1
print(cnt)
| [["-", 0, 656, 0, 14, 8, 196, 0, 7, 31, 22], ["+", 0, 656, 0, 14, 8, 196, 0, 7, 31, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 21], ["-", 0, 1, 0, 652, 3, 4, 0, 653, 141, 22], ["-", 0, 1, 0, 652, 3, 4, 0, 653, 0, 32], ["-", 0, 652, 3, 4, 0, 653, 51, 557, 0, 654], ["-", 0, 652, 3, 4, 0, 653, 51, 557, 0, 655]] | 5 | 86 | 7 |
#! python3
# prime_number.py
import math
def is_prime_number(x):
if x < 2: return False
elif x == 2: return True
elif x%2 == 0: return False
sqrt_upper_bound = math.ceil(math.sqrt(x))
for i in range(3, sqrt_upper_bound, 2):
if num % i == 0:
return False
return True
n = i... | #! python3
# prime_number.py
import math
def is_prime_number(x):
if x < 2: return False
elif x == 2: return True
elif x%2 == 0: return False
sqrt_upper_bound = math.floor(math.sqrt(x))+1
for i in range(3, sqrt_upper_bound, 2):
if x % i == 0:
return False
return True
n = ... | [["-", 0, 1, 0, 662, 12, 652, 63, 319, 319, 22], ["+", 0, 662, 12, 657, 31, 652, 63, 319, 319, 22], ["+", 8, 196, 0, 1, 0, 662, 12, 657, 17, 72], ["+", 8, 196, 0, 1, 0, 662, 12, 657, 12, 612], ["-", 8, 196, 0, 57, 15, 666, 0, 657, 31, 22], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 31, 22]] | 5 | 109 | 6 |
n=int(input())
c=0
for i in range(n):
p=int(input())
if pow(2,p-1,p)==1:
c+=1
print(c)
| n=int(input())
c=0
for i in range(n):
p=int(input())
if pow(2,p-1,p)==1 or p==2:
c+=1
print(c)
| [["+", 0, 7, 8, 196, 0, 57, 15, 679, 17, 354], ["+", 8, 196, 0, 57, 15, 679, 12, 666, 0, 22], ["+", 8, 196, 0, 57, 15, 679, 12, 666, 667, 60], ["+", 8, 196, 0, 57, 15, 679, 12, 666, 0, 612]] | 5 | 48 | 4 |
import math
def isPrime(n):
if n <= 2:
return n == 2
if (n % 2 == 0):
return False
for i in range(3, math.sqrt(n) + 1, 2):
if n % i == 0:
return False
return True
N = int(input())
print(len(list(filter(isPrime, [int(input()) for i in range(N)]))))
| import math
def isPrime(n):
if n <= 2:
return n == 2
if (n % 2 == 0):
return False
for i in range(3, int(math.sqrt(n)) + 1, 2):
if n % i == 0:
return False
return True
N = int(input())
print(len(list(filter(isPrime, [int(input()) for i in range(N)]))))
| [["+", 12, 652, 3, 4, 0, 657, 31, 652, 63, 22], ["+", 3, 4, 0, 657, 31, 652, 3, 4, 0, 24], ["+", 31, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 95 | 3 |
import math
def is_prime(n):
if n == 1:
return False
if n % 2 == 0:
return False
for i in range(2, math.ceil(n**0.5)):
if n % i == 0:
return False
return True
def run():
n = int(input())
n_prime = 0
for i in range(n):
if is_prime(int(input())):
... | import math
def is_prime(n):
if n == 1:
return False
if n == 2:
return True
for i in range(2, math.ceil(n**0.5)+1):
if n % i == 0:
return False
return True
def run():
n = int(input())
n_prime = 0
for i in range(n):
if is_prime(int(input())):
... | [["-", 8, 196, 0, 57, 15, 666, 0, 657, 17, 109], ["-", 8, 196, 0, 57, 15, 666, 0, 657, 12, 612], ["-", 0, 14, 8, 196, 0, 57, 15, 666, 0, 612], ["+", 0, 14, 8, 196, 0, 57, 15, 666, 0, 612], ["-", 8, 196, 0, 57, 64, 196, 0, 37, 0, 147], ["+", 8, 196, 0, 57, 64, 196, 0, 37, 0, 146], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, ... | 5 | 104 | 8 |
# Prime Numbers
n = int(input())
def isPrime(a):
if a == 2:
return True
elif a < 2 or a & 2 == 0:
return False
else:
i = 3
j = a ** 0.5
while i < j:
if a % i == 0:
return False
i += 2
return True
primeCount = 0
for i in r... | # Prime Numbers
n = int(input())
def isPrime(a):
# print('a = ' + str(a))
if a == 2:
return True
elif a < 2 or a % 2 == 0:
return False
else:
i = 3
j = a ** 0.5
while i <= j:
if a % i == 0:
return False
i += 2
retu... | [["-", 75, 665, 15, 679, 12, 666, 0, 657, 17, 67], ["+", 75, 665, 15, 679, 12, 666, 0, 657, 17, 109], ["-", 75, 76, 8, 196, 0, 52, 15, 666, 667, 18], ["+", 75, 76, 8, 196, 0, 52, 15, 666, 667, 19]] | 5 | 98 | 4 |
def get_primes(n):
x = [0,0]+[i for i in range(2,n+1)]
for i in range(int(n**0.5+1)):
if x[i] !=0:
for j in range(e*2, n+1,e):
x[j] = 0
return [_f for _f in x if _f]
PRIMES = get_primes(10000)
n = int(eval(input()))
c = 0
for i in range(n):
p = int(eval(input()))
... | def get_primes(n):
x = [0,0]+[i for i in range(2,n+1)]
for i in range(int(n**0.5+1)):
e = x[i]
if e !=0:
for j in range(e*2, n+1,e):
x[j] = 0
return [_f for _f in x if _f]
PRIMES = get_primes(10000)
n = int(eval(input()))
c = 0
for i in range(n):
p = int(eval... | [["-", 8, 196, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 8, 196, 0, 7, 8, 196, 0, 57, 0, 121], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22]] | 5 | 154 | 5 |
import math
def isprime(x):
if x == 2: return True
if x % 2 == 0: return False
for i in range(3, math.ceil(math.sqrt(x)), 2):
if x % i == 0: return False
return True
n = int(input())
count = 0
for i in range(n):
x = int(input())
if isprime(x): count += 1
print(count) | import math
def isprime(x):
if x == 2: return True
if x % 2 == 0: return False
for i in range(3, math.ceil(math.sqrt(x)) + 1, 2):
if x % i == 0: return False
return True
n = int(input())
count = 0
for i in range(n):
x = int(input())
if isprime(x): count += 1
print(count) | [["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 97 | 2 |
package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
var sc = bufio.NewScanner(os.Stdin)
func max(x int, y int) (ret int) {
if x > y {
ret = x
return
}
ret = y
return
}
func min(x int, y int) (ret int) {
if x < y {
ret = x
return
}
ret = y
return
}
func scanNums(len int) (nums []int) {
for i :... | package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
var sc = bufio.NewScanner(os.Stdin)
func max(x int, y int) (ret int) {
if x > y {
ret = x
return
}
ret = y
return
}
func min(x int, y int) (ret int) {
if x < y {
ret = x
return
}
ret = y
return
}
func scanNums(len int) (nums []int) {
for i :... | [["-", 0, 7, 0, 430, 10, 431, 12, 432, 0, 433], ["+", 0, 7, 0, 430, 10, 431, 12, 432, 0, 433]] | 7 | 282 | 2 |
package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
func main() {
stdin := bufio.NewScanner(os.Stdin)
stdin.Scan()
n, err := strconv.Atoi(stdin.Text())
if err != nil {
fmt.Println("err", err)
os.Exit(1)
}
var rmax = 1000000000
var rmin = rmax
stdin.Scan()
r, err := strconv.Atoi(stdin.Text())
if e... | package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
func main() {
stdin := bufio.NewScanner(os.Stdin)
stdin.Scan()
n, err := strconv.Atoi(stdin.Text())
if err != nil {
fmt.Println("err", err)
os.Exit(1)
}
var rmax = 1000000000
var diffMax = -rmax
stdin.Scan()
r, err := strconv.Atoi(stdin.Text())
... | [["-", 0, 435, 8, 196, 0, 440, 0, 441, 141, 22], ["+", 0, 435, 8, 196, 0, 440, 0, 441, 141, 22], ["+", 0, 440, 0, 441, 51, 432, 0, 91, 17, 33], ["-", 0, 440, 0, 441, 51, 432, 0, 91, 17, 33]] | 7 | 243 | 6 |
import java.util.Scanner;
public class Main {
private static int count = 0;
/**
* γγγ«γ½γΌγγγγγγγ°γ©γ
*
* @param args
*/
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int num = scan.nextInt();
int[] value = new int[num];
for (int i = 0; i < num; i++) {
... | import java.util.Scanner;
public class Main {
private static int count = 0;
/**
* γγγ«γ½γΌγγγγγγγ°γ©γ
*
* @param args
*/
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int num = scan.nextInt();
int[] value = new int[num];
for (int i = 0; i < num; i++) {
... | [["-", 0, 1, 0, 492, 3, 4, 0, 16, 17, 72], ["-", 0, 492, 3, 4, 0, 16, 12, 5, 0, 62], ["-", 0, 492, 3, 4, 0, 16, 12, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 16, 17, 72], ["+", 0, 492, 3, 4, 0, 16, 12, 5, 0, 62], ["+", 0, 492, 3, 4, 0, 16, 12, 5, 0, 491]] | 3 | 305 | 8 |
import java.util.Arrays;
import java.util.Scanner;
import java.util.stream.Collectors;
import java.util.stream.Stream;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.nextLine());
Integer[] a = new Integer[n];
Stream.of(sc.... | import java.util.Arrays;
import java.util.Scanner;
import java.util.stream.Collectors;
import java.util.stream.Stream;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.nextLine());
Integer[] a = new Integer[n];
Stream.of(sc.... | [["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 499], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22]] | 3 | 258 | 2 |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringJoiner;
public class Main {
private static BufferedReader br =
new BufferedReader(new InputStreamReader(System.in));
public static void main(String[] args) throws Exception {
int n = Integer.... | import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringJoiner;
public class Main {
private static BufferedReader br =
new BufferedReader(new InputStreamReader(System.in));
public static void main(String[] args) throws Exception {
int n = Integer.... | [["+", 0, 7, 8, 196, 0, 1, 0, 11, 31, 22], ["+", 0, 7, 8, 196, 0, 1, 0, 11, 17, 32], ["+", 0, 7, 8, 196, 0, 1, 0, 11, 12, 147], ["+", 8, 196, 0, 7, 8, 196, 0, 1, 0, 35]] | 3 | 261 | 4 |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
BufferedRea... | import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
BufferedRea... | [["-", 8, 1, 0, 492, 3, 4, 0, 492, 500, 22], ["-", 8, 1, 0, 492, 3, 4, 0, 492, 0, 131], ["-", 8, 1, 0, 492, 3, 4, 0, 492, 141, 22], ["-", 0, 492, 3, 4, 0, 492, 3, 4, 0, 24], ["+", 0, 492, 3, 4, 0, 16, 31, 5, 0, 62], ["+", 0, 492, 3, 4, 0, 16, 31, 5, 0, 491], ["+", 8, 1, 0, 492, 3, 4, 0, 16, 17, 72], ["-", 0, 492, 3, 4,... | 3 | 296 | 9 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int a = s.nextInt();
int[] values = new int[a];
for (int i = 0; i < values.length; i++) {
values[i] = s.nextInt();
}
solve(values);
}
public static void solv... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int a = s.nextInt();
int[] values = new int[a];
for (int i = 0; i < values.length; i++) {
values[i] = s.nextInt();
}
solve(values);
}
public static void solv... | [["+", 0, 1, 0, 492, 3, 4, 0, 16, 17, 72], ["+", 0, 492, 3, 4, 0, 16, 12, 5, 0, 62], ["+", 0, 492, 3, 4, 0, 16, 12, 5, 0, 44], ["-", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22]] | 3 | 258 | 6 |
import java.io.InputStream;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void printArray(List<Integer> array) {
StringBuilder sb = new StringBuilder();
sb.append(array.get(0));
for (int j = 1; j < array.size(); j++) {
sb.append(" ").... | import java.io.InputStream;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void printArray(List<Integer> array) {
StringBuilder sb = new StringBuilder();
sb.append(array.get(0));
for (int j = 1; j < array.size(); j++) {
sb.append(" ").... | [["-", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 25], ["-", 8, 498, 0, 195, 8, 196, 0, 1, 0, 35]] | 3 | 379 | 5 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
*
* @author Y
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.readLine()... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
*
* @author Y
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.readLine()... | [["-", 64, 196, 0, 1, 0, 11, 12, 504, 516, 22], ["-", 64, 196, 0, 1, 0, 11, 12, 504, 0, 70], ["-", 64, 196, 0, 1, 0, 11, 12, 504, 71, 22], ["-", 64, 196, 0, 1, 0, 11, 12, 504, 0, 73], ["+", 0, 57, 64, 196, 0, 1, 0, 11, 12, 22]] | 3 | 279 | 5 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* Created by hwzheng on 2017/3/27.
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader Reader =
new BufferedReader(new InputStreamReader(System.in));
int N ... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* Created by hwzheng on 2017/3/27.
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader Reader =
new BufferedReader(new InputStreamReader(System.in));
int N ... | [["-", 0, 1, 0, 11, 12, 16, 31, 16, 31, 22], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 17, 72]] | 3 | 337 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int num = sc.nextInt();
int[] array = new int[num];
for (int i = 0; i < num; i++) {
array[i] = sc.nextInt();
}
int count = 0;
boolean flag = true;
for (int... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int num = sc.nextInt();
int[] array = new int[num];
for (int i = 0; i < num; i++) {
array[i] = sc.nextInt();
}
int count = 0;
boolean flag = true;
for (int... | [["+", 8, 196, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 196, 0, 7, 15, 16, 12, 16, 12, 499]] | 3 | 237 | 2 |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String str;
str = br.readLine();
int N = Integer.parseInt(str);
str = br.readLine();
String[] strs ... | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String str;
str = br.readLine();
int N = Integer.parseInt(str);
str = br.readLine();
String[] strs ... | [["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 44], ["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 44]] | 3 | 339 | 6 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] array = new int[N];
for (int i = 0; i < N; i++)
array[i] = sc.nextInt();
int num = 0;
for (int i = N; i >= 1; i--) {
for (int j = ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] array = new int[N];
for (int i = 0; i < N; i++)
array[i] = sc.nextInt();
int num = 0;
for (int i = N; i >= 1; i--) {
for (int j = ... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 47], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 18]] | 3 | 231 | 2 |
import java.awt.datatransfer.FlavorEvent;
import java.util.Scanner;
import javax.sound.midi.SysexMessage;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String str = sc.nextLine();
String str2[] = str.split(" ");
int ints[] ... | import java.awt.datatransfer.FlavorEvent;
import java.util.Scanner;
import javax.sound.midi.SysexMessage;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String str = sc.nextLine();
String str2[] = str.split(" ");
int ints[] ... | [["-", 8, 196, 0, 52, 15, 15, 0, 16, 12, 499], ["+", 8, 196, 0, 52, 15, 15, 0, 16, 12, 499], ["-", 0, 52, 8, 196, 0, 7, 15, 16, 12, 499], ["+", 0, 52, 8, 196, 0, 7, 15, 16, 12, 499], ["+", 0, 1, 0, 492, 3, 4, 0, 16, 17, 72], ["+", 0, 492, 3, 4, 0, 16, 12, 5, 0, 62], ["+", 0, 492, 3, 4, 0, 16, 12, 5, 0, 44]] | 3 | 275 | 8 |
import java.util.Scanner;
public class Main {
int n;
int list[];
public static void main(String args[]) { new Main(); }
Main() {
Scanner scan = new Scanner(System.in);
n = scan.nextInt();
list = new int[n];
for (int i = 0; i < n; i++) {
list[i] = scan.nextInt();
}
boolean flag = tr... | import java.util.Scanner;
public class Main {
int n;
int list[];
public static void main(String args[]) { new Main(); }
Main() {
Scanner scan = new Scanner(System.in);
n = scan.nextInt();
list = new int[n];
for (int i = 0; i < n; i++) {
list[i] = scan.nextInt();
}
boolean flag = tr... | [["-", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22]] | 3 | 258 | 2 |
#include <stdio.h>
int main() {
int c, d, n, m, count;
scanf("%d", &n);
int a[n];
for (c = 0; c < n; c++) {
scanf("%d", &a[c]);
}
count = 0;
for (c = 0; c < (n - 1); c++) {
if (a[c] > a[c + 1]) {
d = c;
while (a[d] > a[d + 1]) {
m = a[d];
a[d] = a[d + 1];
a[d... | #include <stdio.h>
int main() {
int c, d, n, m, count;
scanf("%d", &n);
int a[n];
for (c = 0; c < n; c++) {
scanf("%d", &a[c]);
}
count = 0;
for (c = 0; c < (n - 1); c++) {
if (a[c] > a[c + 1]) {
d = c;
while (a[d] > a[d + 1]) {
m = a[d];
a[d] = a[d + 1];
a[d... | [["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 57, 64, 9, 0, 52, 8, 9, 0, 46]] | 0 | 230 | 2 |
#include <stdio.h>
int main(void) {
int i, j, k, a[100], n, l, flag = 1, temp, count = 0;
char buf[2];
scanf("%d", &l);
for (n = 0; n < l && (j = scanf("%d%1[\n]", a + n, buf)) == 1; n++)
;
if (j == 2)
n++;
while (flag) {
flag = 0;
for (j = l - 1; j > 0; j++) {
if (a[j] < a[j - 1]) {... | #include <stdio.h>
int main(void) {
int i, j, k, a[100], n, l, flag = 1, temp, count = 0;
char buf[2];
scanf("%d", &l);
for (n = 0; n < l && (j = scanf("%d%1[\n]", a + n, buf)) == 1; n++)
;
if (j == 2)
n++;
while (flag) {
flag = 0;
for (j = l - 1; j > 0; j--) {
if (a[j] < a[j - 1]) {... | [["-", 0, 52, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 52, 8, 9, 0, 7, 26, 27, 17, 68]] | 0 | 237 | 2 |
#include <stdio.h>
int main(void) {
int i, j, k, a[100], n, l, flag = 1, temp, count = 0;
char buf[2];
scanf("%d", &l);
for (i = 0; i < l; i++) {
scanf("%d", &a[i]);
}
while (flag) {
flag = 0;
for (j = l - 1; j > 0; j--) {
if (a[j] < a[j - 1]) {
temp = a[j];
a[j] = a[j - ... | #include <stdio.h>
int main(void) {
int i, j, k, a[100], n, l, flag = 1, temp, count = 0;
char buf[2];
scanf("%d", &l);
for (i = 0; i < l; i++) {
scanf("%d", &a[i]);
}
while (flag) {
flag = 0;
for (j = l - 1; j > 0; j--) {
if (a[j] < a[j - 1]) {
temp = a[j];
a[j] = a[j - ... | [["-", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22]] | 0 | 221 | 2 |
#include <stdio.h>
void swap(int *a, int *b) { //εεΎε
₯γζΏγγθ‘γ
int temp = *a;
*a = *b;
*b = temp;
}
int bubbleSort(int A[], int N) {
int i, j;
int sw = 0;
unsigned short flag = 1;
for (i = 0; flag; i++) {
flag = 0;
for (j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
swap(&A[j], &... | #include <stdio.h>
void swap(int *a, int *b) { //εεΎε
₯γζΏγγθ‘γ
int temp = *a;
*a = *b;
*b = temp;
}
int bubbleSort(int A[], int N) {
int i, j;
int sw = 0;
unsigned short flag = 1;
for (i = 0; flag; i++) {
flag = 0;
for (j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
swap(&A[j], &... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 0 | 261 | 2 |
#include <stdio.h>
void bubbleSort(int A[], const int N) {
int i, j;
int flag = 1, cnt = 0;
for (i = 0; flag; ++i) {
flag = 0;
for (j = N - 1; i + 1 < j; --j)
if (A[j] < A[j - 1]) {
int tmp = A[j];
A[j] = A[j - 1];
A[j - 1] = tmp;
flag = 1;
++cnt;
}
... | #include <stdio.h>
void bubbleSort(int A[], const int N) {
int i, j;
int flag = 1, cnt = 0;
for (i = 0; flag; ++i) {
flag = 0;
for (j = N - 1; i < j; --j)
if (A[j] < A[j - 1]) {
int tmp = A[j];
A[j] = A[j - 1];
A[j - 1] = tmp;
flag = 1;
++cnt;
}
}
... | [["-", 8, 9, 0, 7, 15, 16, 31, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 31, 16, 12, 13]] | 0 | 231 | 2 |
#include <stdio.h>
main() {
int i, j, c = 0, f, k;
int r[100];
scanf("%d", &k);
for (i = 0; i < k; i++) {
scanf("%d", &r[i]);
}
f = 1;
while (f) {
f = 0;
for (j = k - 1; j >= 1; j--) {
if (r[j] < r[j - 1]) {
i = r[j - 1];
r[j - 1] = r[j];
r[j] = i;
f = 1... | #include <stdio.h>
main() {
int i, j, c = 0, f, k;
int r[100];
scanf("%d", &k);
for (i = 0; i < k; i++) {
scanf("%d", &r[i]);
}
f = 1;
while (f) {
f = 0;
for (j = k - 1; j >= 1; j--) {
if (r[j] < r[j - 1]) {
i = r[j - 1];
r[j - 1] = r[j];
r[j] = i;
f = ... | [["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 0, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 200 | 6 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int i = 0, j, m, k, a;
int *n;
int count = 0;
scanf("%d", &k);
n = malloc(sizeof(int) * k);
while (i < k) {
scanf("%d", &n[i]);
i++;
}
m = 0;
while (m != k - 1) {
for (i = k - 1; i > 0; i--) {
if (n[i] < n[i - 1]) {
... | #include <stdio.h>
#include <stdlib.h>
int main() {
int i = 0, j, m, k, a;
int *n;
int count = 0;
scanf("%d", &k);
n = malloc(sizeof(int) * k);
while (i < k) {
scanf("%d", &n[i]);
i++;
}
m = 0;
while (m != k - 1) {
for (i = k - 1; i > 0; i--) {
if (n[i] < n[i - 1]) {
... | [["-", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 27, 17, 68], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 250 | 3 |
#include <stdio.h>
void bubbleSort(int *, int);
#define N 100
int main(void) {
int i, n, A[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
bubbleSort(&A, n);
return 0;
}
void bubbleSort(int *a, int k) {
int i, j, con, temp;
for (i = 0; i < k - 1; i++) {
for (j = k - 1; j... | #include <stdio.h>
void bubbleSort(int *, int);
#define N 100
int main(void) {
int i, n, A[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
bubbleSort(&A, n);
return 0;
}
void bubbleSort(int *a, int k) {
int i, j, con = 0, temp;
for (i = 0; i < k - 1; i++) {
for (j = k - ... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 238 | 4 |
#include <stdio.h>
int main() {
int N, i, j, k, ch = 0;
int _N[100];
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &_N[i]);
for (i = 0; i < N; i++) {
for (j = N - 1; j >= i + 1; j--) {
if (_N[j] < _N[j - 1]) {
k = _N[j];
_N[j] = _N[j - 1];
_N[j - 1] = k;
ch... | #include <stdio.h>
int main() {
int N, i, j, k, ch = 0;
int _N[100];
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &_N[i]);
for (i = 0; i < N; i++) {
for (j = N - 1; j >= i + 1; j--) {
if (_N[j] < _N[j - 1]) {
k = _N[j];
_N[j] = _N[j - 1];
_N[j - 1] = k;
ch... | [["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 197 | 2 |
#include <stdio.h>
//???????????????????????????????????????
int main() {
int N, i, j, k, l, m, v;
int A[100];
int count = 0; //???????????Β°
scanf("%d\n", N);
for (i = 0; i <= N - 1; i++) {
scanf("%d", A[i]);
}
j = N - 1;
while (j > 0) {
for (k = N - 1; k >= 1; k--) {
v = A[k];
l ... | #include <stdio.h>
//???????????????????????????????????????
int main() {
int N, i, j, k, l, m, v;
int A[100];
int count = 0; //???????????Β°
scanf("%d\n", &N);
for (i = 0; i <= N - 1; i++) {
scanf("%d", &A[i]);
}
j = N - 1;
while (j > 0) {
for (k = N - 1; k >= 1; k--) {
v = A[k];
... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 227 | 2 |
#include <stdio.h>
int main() {
int i, flag, n, tmp, count = 0;
int A[100];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
flag = 1;
while (flag) {
flag = 0;
for (i = n - 1; i >= 1; i--) {
if (A[i] < A[i - 1]) {
tmp = A[i];
A[i] = A[i - 1];
A[i... | #include <stdio.h>
int main() {
int i, flag, n, tmp, count = 0;
int A[100];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
flag = 1;
while (flag) {
flag = 0;
for (i = n - 1; i >= 1; i--) {
if (A[i] < A[i - 1]) {
tmp = A[i];
A[i] = A[i - 1];
A[i... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 79], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 201 | 3 |
#include <stdio.h>
int main() {
int n, i, A[100], B, flag = 1, j = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
while (flag) {
flag = 0;
for (i = n - 1; i >= 1; i--) {
if (A[i] < A[i - 1]) {
B = A[i];
A[i] = A[i - 1];
A[i - 1] = B;
fl... | #include <stdio.h>
int main() {
int n, i, A[100], B, flag = 1, j = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
while (flag) {
flag = 0;
for (i = n - 1; i >= 1; i--) {
if (A[i] < A[i - 1]) {
B = A[i];
A[i] = A[i - 1];
A[i - 1] = B;
fl... | [["+", 0, 2, 3, 4, 0, 69, 71, 16, 17, 33], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 12, 13]] | 0 | 199 | 2 |
#include <stdio.h>
#define X 100
int main() {
int N, i, A[X], flag = 1, j, temp, count = 0;
scanf("%d", &N);
if (N >= 1 && N <= 100) {
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
i = 0;
while (flag == 1) {
flag = 0;
for (j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j ... | #include <stdio.h>
#define X 100
int main() {
int N, i, A[X], flag = 1, j, temp, count = 0;
scanf("%d", &N);
if (N >= 1 && N <= 100) {
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
i = 0;
while (flag == 1) {
flag = 0;
for (j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j ... | [["-", 0, 57, 64, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 57, 64, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 17, 33], ["+", 0, 2, 3, 4, 0, 69, 71, 16... | 0 | 237 | 8 |
#include <stdio.h>
#define N 100
int main() {
int i, j, num, count = 0, flag, data[N], change;
scanf("%d", &num);
for (i = 0; i < num; i++) {
scanf("%d", &data[i]);
}
flag = 1;
while (flag) {
flag = 0;
for (j = num - 1; j >= 1; j--) {
if (data[j] < data[j - 1]) {
change = data[... | #include <stdio.h>
#define N 100
int main() {
int i, j, num, count = 0, flag, data[N], change;
scanf("%d", &num);
for (i = 0; i < num; i++) {
scanf("%d", &data[i]);
}
flag = 1;
while (flag) {
flag = 0;
for (j = num - 1; j >= 1; j--) {
if (data[j] < data[j - 1]) {
change = data[... | [["-", 0, 7, 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, 6], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 0 | 214 | 7 |
#include <stdio.h>
#define N 100
int main() {
int i;
int n, a[N], tmp;
int sum = 0, flag = 1;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
while (flag) {
flag = 0;
for (i = n - 1; i > 0; i--) {
if (a[i] < a[i - 1]) {
tmp = a[i];
a[i] = a[i - 1];
... | #include <stdio.h>
#define N 100
int main() {
int i;
int n, a[N], tmp;
int sum = 0, flag = 1;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
while (flag) {
flag = 0;
for (i = n - 1; i > 0; i--) {
if (a[i] < a[i - 1]) {
tmp = a[i];
a[i] = a[i - 1];
... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18]] | 0 | 205 | 2 |
#include <stdio.h>
int main() {
int N, data[100], i;
int flag, c = 0, x;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &data[i]);
flag = 1;
while (flag == 1) {
flag = 0;
for (i = N - 1; i > 0; i--) {
if (data[i] < data[i - 1]) {
x = data[i];
data[i] = data[i - 1];... | #include <stdio.h>
int main() {
int N, data[100], i;
int flag, c = 0, x;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &data[i]);
flag = 1;
while (flag == 1) {
flag = 0;
for (i = N - 1; i > 0; i--) {
if (data[i] < data[i - 1]) {
x = data[i];
data[i] = data[i - 1];... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 207 | 4 |
#include <stdio.h>
void swap(int *a, int *b);
int main() {
int i, n, A[100], counter = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
int flag = 1;
while (flag = 0) {
flag = 0;
for (i = n - 1; i >= 1; i--) {
if (A[i] < A[i - 1])
swap(&A[i], &A[i - 1]);
... | #include <stdio.h>
void swap(int *a, int *b);
int main() {
int i, n, A[100], counter = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
int flag = 1;
while (flag) {
flag = 0;
for (i = n - 1; i >= 1; i--) {
if (A[i] < A[i - 1]) {
swap(&A[i], &A[i - 1]);
... | [["-", 8, 9, 0, 52, 15, 23, 0, 11, 17, 32], ["-", 8, 9, 0, 52, 15, 23, 0, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 0 | 232 | 4 |
#include <stdio.h>
int bubbleSort(int n, int A[]) {
int count = 0;
int i, j;
for (i = 0; i < n; i++) {
for (j = n; j > 0; j--) {
if (A[j - 1] > A[j]) {
int tmp = A[j];
A[j] = A[j - 1];
A[j - 1] = tmp;
count++;
}
}
}
return count;
}
int main() {
int i;
... | #include <stdio.h>
int bubbleSort(int n, int A[]) {
int count = 0;
int i, j;
for (i = 0; i < n; i++) {
for (j = n - 1; j > 0; j--) {
if (A[j - 1] > A[j]) {
int tmp = A[j];
A[j] = A[j - 1];
A[j - 1] = tmp;
count++;
}
}
}
return count;
}
int main() {
int i... | [["+", 8, 9, 0, 7, 10, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 10, 11, 12, 16, 12, 13]] | 0 | 226 | 2 |
#include <stdio.h>
void printArray(int *as, int n) {
int i;
for (i = 0; i < n - 1; i++) {
printf("%d ", as[i]);
}
printf("%d\n", as[n - 1]);
}
void bubbleSort(int *as, int n) {
int i, j;
int x, y;
int count;
for (i = 0; i < n; i++) {
for (j = n - 1; j > i; j--) {
x = as[j];
y = as... | #include <stdio.h>
void printArray(int *as, int n) {
int i;
for (i = 0; i < n - 1; i++) {
printf("%d ", as[i]);
}
printf("%d\n", as[n - 1]);
}
void bubbleSort(int *as, int n) {
int i, j;
int x, y;
int count = 0;
for (i = 0; i < n; i++) {
for (j = n - 1; j > i; j--) {
x = as[j];
y ... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 0 | 262 | 5 |
#include <stdio.h>
int bsort(int a[], int n) {
int i, j, num = 0;
for (i = 0; i < n - 1; i++) {
for (j = 0; j < n - i - 1; j++) {
if (a[j + 1] > a[j]) {
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
num++;
}
}
}
return num;
}
int main(void) {
int i, n, ... | #include <stdio.h>
int bsort(int a[], int n) {
int i, j, num = 0;
for (i = 0; i < n - 1; i++) {
for (j = 0; j < n - i - 1; j++) {
if (a[j + 1] < a[j]) {
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
num++;
}
}
}
return num;
}
int main(void) {
int i, n, ... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18]] | 0 | 230 | 2 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int i = 0, p = 0, t = 0, flag = 0, count = 0;
scanf("%d", &p);
int *bubblesort = (int *)malloc(sizeof(int) * p);
for (i = 0; i < p; i++) {
scanf("%d", &bubblesort[i]);
}
flag = 1;
while (flag) {
flag = 0;
for (i = p - 1; i > 0; i--) {
... | #include <stdio.h>
#include <stdlib.h>
int main() {
int i = 0, p = 0, t = 0, flag = 0, count = 0;
scanf("%d", &p);
int *bubblesort = (int *)malloc(sizeof(int) * p);
for (i = 0; i < p; i++) {
scanf("%d", &bubblesort[i]);
}
flag = 1;
while (flag) {
flag = 0;
for (i = p - 1; i > 0; i--) {
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 239 | 2 |
#include <stdio.h>
int bubbleSort(int A[], int N) {
int flag = 1;
int i = 0, j, token, time;
while (flag) {
flag = 0;
for (j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
token = A[j - 1];
A[j - 1] = A[j];
A[j] = token;
flag = 1;
time++;
}
}
... | #include <stdio.h>
int bubbleSort(int A[], int N) {
int flag = 1;
int i = 0, j, token, time = 0;
while (flag) {
flag = 0;
for (j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
token = A[j - 1];
A[j - 1] = A[j];
A[j] = token;
flag = 1;
time++;
}
... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 267 | 2 |
#include <stdio.h>
int bubbleSort(int A[], int N) {
int sw = 0;
int flag = 1;
int i, j, tmp;
for (i = 0; flag; i++) {
flag = 0;
for (j = N - 1; i >= i + 1; j--) {
if (A[j] < A[j - 1]) {
tmp = A[j];
A[j] = A[j - 1];
A[j - 1] = tmp;
flag = 1;
sw++;
}
... | #include <stdio.h>
int bubbleSort(int A[], int N) {
int sw = 0;
int flag = 1;
int i, j, tmp;
for (i = 0; flag; i++) {
flag = 0;
for (j = N - 1; j >= i + 1; j--) {
if (A[j] < A[j - 1]) {
tmp = A[j];
A[j] = A[j - 1];
A[j - 1] = tmp;
flag = 1;
sw++;
}
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22]] | 0 | 245 | 2 |
#include <stdio.h>
int cnt = 0, B[101];
void BubbleSort(int n);
int main(void) {
int i, n;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &B[i]);
for (i = 0; i < n; i++) {
if (i)
printf(" ");
printf("%d", B[i]);
}
printf("\n%d\n", cnt);
return 0;
}
void BubbleSort(int n) {
int i... | #include <stdio.h>
int cnt = 0, B[101];
void BubbleSort(int n);
int main(void) {
int i, n;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &B[i]);
BubbleSort(n);
for (i = 0; i < n; i++) {
if (i)
printf(" ");
printf("%d", B[i]);
}
printf("\n%d\n", cnt);
return 0;
}
void BubbleSort... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 215 | 5 |
// 2016/11/2
#include <ctype.h>
#include <stdio.h>
#include <string.h>
int main(void) {
int i;
int n, a[101] = {0}, flag = 1, count = 0, temp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
while (flag) {
flag = 0;
for (i = n - 1; i > 0; i--) {
if (a[i] < a[i - 1]) ... | // 2016/11/2
#include <ctype.h>
#include <stdio.h>
#include <string.h>
int main(void) {
int i;
int n, a[101] = {0}, flag = 1, count = 0, temp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
while (flag) {
flag = 0;
for (i = n - 1; i > 0; i--) {
if (a[i] < a[i - 1]) ... | [["-", 64, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["-", 64, 9, 0, 1, 0, 11, 12, 69, 0, 70], ["-", 64, 9, 0, 1, 0, 11, 12, 69, 71, 22], ["-", 64, 9, 0, 1, 0, 11, 12, 69, 0, 73], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 0 | 224 | 5 |
#include <stdio.h>
int main() {
int n, i, j, R[20000], maxv, minv, a;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", R[i]);
}
maxv = R[1] - R[0];
minv = R[0];
for (i = 1; i <= n - 1; i++) {
a = R[i] - minv;
if (maxv < a)
maxv = a;
if (minv > R[i])
minv = R[i];
}
... | #include <stdio.h>
int main() {
int n, i, R[200000], maxv, minv, a;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
maxv = R[1] - R[0];
minv = R[0];
for (i = 1; i <= n - 1; i++) {
a = R[i] - minv;
if (maxv < a)
maxv = a;
if (minv > R[i])
minv = R[i];
}
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 146 | 6 |
#include <stdio.h>
int main() {
int N, val[200000];
int i, j;
int maxv, minv, benefit;
scanf("%d", &N);
for (i = 0; i < N; ++i) {
scanf("%d", &val[i]);
}
maxv = val[1] - val[0];
minv = val[0];
for (i = 2; i < N; ++i) {
if (maxv < val[i] - minv)
maxv = val[i] - minv;
if (minv > v... | #include <stdio.h>
int main() {
int N, val[200000];
int i, j;
int maxv, minv, benefit;
scanf("%d", &N);
for (i = 0; i < N; ++i) {
scanf("%d", &val[i]);
}
maxv = val[1] - val[0];
minv = val[0];
for (i = 1; i < N; ++i) {
if (maxv < val[i] - minv)
maxv = val[i] - minv;
if (minv > v... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 149 | 2 |
#include <stdio.h>
int main(void) {
int j, minv, maxv, n;
int R[200000];
scanf("%d", &n);
for (j = 0; j < n; j++) {
scanf("%d", &R[j]);
}
minv = R[0];
maxv = R[1] - R[0];
for (j = 1; j < n - 1; j++) {
if (maxv > R[j] - minv)
maxv = maxv;
else
maxv = R[j] - minv;
if (minv > ... | #include <stdio.h>
int main(void) {
int j, minv, maxv, n;
int R[200000];
scanf("%d", &n);
for (j = 0; j < n; j++) {
scanf("%d", &R[j]);
}
minv = R[0];
maxv = R[1] - R[0];
for (j = 1; j < n; j++) {
if (maxv > R[j] - minv)
maxv = maxv;
else
maxv = R[j] - minv;
if (minv > R[j]... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 157 | 2 |
//============================================================================
//
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
//============================================================================
long maxval(long x, long y) {
if (x < y)
return y;
return x;
}
long minval(long x, long y) {
... | //============================================================================
//
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
//============================================================================
long maxval(long x, long y) {
if (x < y)
return y;
return x;
}
long minval(long x, long y) {
... | [["-", 0, 7, 10, 34, 12, 34, 12, 11, 12, 22], ["+", 10, 34, 12, 34, 12, 11, 12, 66, 17, 48], ["+", 10, 34, 12, 34, 12, 11, 12, 66, 28, 22]] | 0 | 205 | 3 |
#include <stdio.h>
int main() {
int R[200000];
int n, i;
int maxv = -1;
int minv;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
minv = R[0];
for (i = 1; i < n; i++) {
if (maxv <= R[i] - minv) {
maxv = R[i] - minv;
}
if (minv >= R[i]) {
minv = R[i];
... | #include <stdio.h>
int main() {
int R[200000];
int n, i;
int maxv = -2000000000;
int minv;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
minv = R[0];
for (i = 1; i < n; i++) {
if (maxv < R[i] - minv) {
maxv = R[i] - minv;
}
if (minv > R[i]) {
minv = R[... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47]] | 0 | 140 | 6 |
#include <stdio.h>
int main() {
int n, i, s[200000], max, min;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
}
min = s[0];
max = s[1] - s[0];
for (i = 2; i < n; i++) {
max = (max >= s[i] - min) ? max : s[i] - min;
min = (min <= s[i]) ? min : s[i];
}
printf("%d?\n", max... | #include <stdio.h>
int main() {
int n, i, s[200000], max, min;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
}
min = s[0];
max = s[1] - s[0];
for (i = 1; i < n; i++) {
max = (max >= s[i] - min) ? max : s[i] - min;
min = (min <= s[i]) ? min : s[i];
}
printf("%d\n", max)... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 147 | 4 |
#include <stdio.h>
int main(void) {
int n, i;
int min, max;
int r[200000];
scanf("%d\n", &n);
for (i = 0; i < n - 1; i++) {
scanf("%d\n", &r[i]);
}
max = -9999999;
min = r[0];
for (i = 1; i < n; i++) {
if (r[i] - min > max) {
max = r[i] - min;
}
if (r[i] < min) {
min ... | #include <stdio.h>
int main(void) {
int n, i;
int min, max;
int r[200000];
scanf("%d\n", &n);
for (i = 0; i < n; i++) {
scanf("%d\n", &r[i]);
}
max = -2000000000;
min = r[0];
for (i = 1; i < n; i++) {
if (r[i] - min > max) {
max = r[i] - min;
}
if (r[i] < min) {
min =... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 0 | 146 | 4 |
#include <stdio.h>
#define n 200000
int main() {
int num, i, minv, maxv, a[n];
scanf("%d", &num);
for (i = 0; i < num; i++) {
scanf("%d", &a[i]);
}
maxv = a[1] - a[0];
minv = a[0];
for (i = 0; i < num; i++) {
if (maxv <= (a[i] - minv)) {
maxv = a[i] - minv;
}
if (minv >= a[i])... | #include <stdio.h>
#define n 200000
int main() {
int num, i, minv, maxv, a[n];
scanf("%d", &num);
for (i = 0; i < num; i++) {
scanf("%d", &a[i]);
}
maxv = a[1] - a[0];
minv = a[0];
for (i = 1; i < num; i++) {
if (maxv <= (a[i] - minv)) {
maxv = a[i] - minv;
}
if (minv >= a[i])... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 152 | 2 |
#include <stdio.h>
#define N 200000
int n, j, maxv, minv;
int R[N];
int main(void) {
scanf("%d", &n);
for (j = 0; j < n - 1; j++) {
scanf("%d\n", &R[j]);
}
maxv = R[1] - R[0];
minv = R[0];
for (j = 1; j < n; j++) {
if (maxv < R[j] - minv) {
maxv = R[j] - minv;
} else {
maxv = ... | #include <stdio.h>
#define N 200000
int n, j, maxv, minv;
int R[N];
int main(void) {
scanf("%d", &n);
for (j = 0; j < n; j++) {
scanf("%d", &R[j]);
}
maxv = R[1] - R[0];
minv = R[0];
for (j = 1; j < n; j++) {
if (maxv < R[j] - minv) {
maxv = R[j] - minv;
} else {
maxv = maxv;
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 169 | 3 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <stdlib.h>
int main() {
int *R, i, n, pr, vMin = 0;
scanf("%d", &n);
R = (int *)malloc(sizeof(int) * n);
for (i = n; i > 0; --i)
scanf("%d", R + n - i);
vMin = R[0];
pr = R[1] - R[0];
for (i = 0; i < n; i++) {
... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <stdlib.h>
int main() {
int *R, i, n, pr, vMin = 0;
scanf("%d", &n);
R = (int *)malloc(sizeof(int) * n);
for (i = n; i > 0; --i)
scanf("%d", R + n - i);
vMin = R[0];
pr = R[1] - R[0];
for (i = 1; i < n; i++) {
... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 167 | 2 |
#include <stdio.h>
int main(void) {
int i, n, minr, nowr, maxd, nowd;
scanf("%d", &n); /*n >= 2*/
scanf("%d %d", &minr, &nowr);
maxd = nowd = nowr - minr;
for (i = 3; i < n; i++) {
if (nowr < minr)
minr = nowr;
scanf("%d", &nowr);
nowd = nowr - minr;
if (nowd > maxd)
maxd = nowd;
... | #include <stdio.h>
int main(void) {
int i, n, minr, nowr, maxd, nowd;
scanf("%d", &n); /*n >= 2*/
scanf("%d %d", &minr, &nowr);
maxd = nowd = nowr - minr;
for (i = 3; i <= n; i++) {
if (nowr < minr)
minr = nowr;
scanf("%d", &nowr);
nowd = nowr - minr;
if (nowd > maxd)
maxd = nowd;
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 118 | 2 |
#include <stdio.h>
#define N 200000
int main(void) {
int n, i, R[N];
int maxv, minv;
scanf("%d", &n);
for (i = 0; i < n; i++)
;
scanf("%d", &R[i]);
minv = R[0];
maxv = R[1] - R[0];
for (i = 1; i < n - 1; i++) {
if (R[i] - minv > maxv)
maxv = R[i] - minv;
if (R[i] < minv)
min... | #include <stdio.h>
#define N 200000
int main(void) {
int n, i, R[N];
int maxv, minv;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &R[i]);
minv = R[0];
maxv = R[1] - R[0];
for (i = 1; i < n; i++) {
if (R[i] - minv > maxv)
maxv = R[i] - minv;
if (R[i] < minv)
minv = R[i]... | [["-", 0, 14, 8, 9, 0, 7, 8, 1, 0, 35], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 149 | 3 |
#include <stdio.h>
int main(int argc, const char *argv[]) {
int R[200000];
int i = 0;
int a;
int maxv, min;
scanf("%d", &a);
while (i < a) {
scanf("%d", &R[i]);
i++;
}
min = R[0];
maxv = R[1] - R[0];
for (i = 0; i < a; i++) {
if ((R[i] - min) > maxv) {
maxv = R[i] - min;
}
... | #include <stdio.h>
int main(int argc, const char *argv[]) {
int R[200000];
int i = 0;
int a;
int maxv, min;
scanf("%d", &a);
while (i < a) {
scanf("%d", &R[i]);
i++;
}
min = R[0];
maxv = R[1] - R[0];
for (i = 1; i < a; i++) {
if ((R[i] - min) > maxv) {
maxv = R[i] - min;
}
... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 159 | 2 |
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int i, n, *R, min, max;
scanf("%d", &n);
R = (int *)malloc(sizeof(int) * n);
if (R == NULL) {
printf("?????Β’????Β’??????Β¨??????\n");
return -1;
}
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
min = R[0];
max = R[1] - R[0];
for (i... | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int i, n, *R, min, max;
scanf("%d", &n);
R = (int *)malloc(sizeof(int) * n);
if (R == NULL) {
printf("?????Β’????Β’??????Β¨??????\n");
return -1;
}
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
min = R[0];
max = R[1] - R[0];
for (i... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 188 | 2 |
#include <stdio.h>
int main(void) {
int i, j;
int n;
int maxv = -1000000001, minv;
scanf("%d", &n);
int A[n];
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
minv = A[0];
for (i = 0; i < n - 1; i++) {
if (maxv < A[i] - minv) {
maxv = A[i] - minv;
}
if (minv > A[i]) {
minv... | #include <stdio.h>
int main(void) {
int i, j;
int n;
int maxv = -1000000001, minv;
scanf("%d", &n);
int A[n];
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
minv = A[0];
for (i = 1; i < n; i++) {
if (maxv < A[i] - minv) {
maxv = A[i] - minv;
}
if (minv > A[i]) {
minv = A... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 145 | 4 |
#include <stdio.h>
int main() {
int N, i, num, Min, Max = 0;
scanf("%d", &N);
scanf("%d", &num);
Min = num;
scanf("%d", &num);
Max = num - Min;
if (Min > num)
Min = num;
for (i = 2; i < N; i++) {
scanf("%d", &num);
if (Max > num - Min)
Max = num - Min;
if (Min > num)
Min = ... | #include <stdio.h>
int main() {
int N, i, num, Min, Max = 0;
scanf("%d", &N);
scanf("%d", &num);
Min = num;
scanf("%d", &num);
Max = num - Min;
if (Min > num)
Min = num;
for (i = 2; i < N; i++) {
scanf("%d", &num);
if (Max < num - Min)
Max = num - Min;
if (Min > num)
Min = ... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18]] | 0 | 133 | 2 |
#include <stdio.h>
int main() {
int max, min, n, i, j, a[200000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
i = a[0];
max = a[1] - i;
for (j = 2; j < n; j++) {
min = i;
if (a[j] < min)
i = a[j];
if (a[j] - min > max)
max = a[j] - min;
}
printf("... | #include <stdio.h>
int main() {
int max, min, n, i, j, a[200000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
i = a[0];
max = a[1] - i;
for (j = 1; j < n; j++) {
min = i;
if (a[j] <= min)
i = a[j];
if (a[j] - min >= max)
max = a[j] - min;
}
printf... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20]] | 0 | 146 | 6 |
#include <stdio.h>
int main() {
int i, n, maxv, minv;
scanf("%d", &n);
int R[n];
for (i = 0; i < n; i++)
scanf("%d", &R[i]);
maxv = R[1] - R[0];
minv = R[0];
for (i = 1; i < n - 1; i++) {
if (maxv < R[i] - minv)
maxv = R[i] - minv;
if (minv > R[i])
minv = R[i];
}
printf("... | #include <stdio.h>
int main() {
int i, n, maxv, minv;
scanf("%d", &n);
int R[n];
for (i = 0; i < n; i++)
scanf("%d", &R[i]);
maxv = R[1] - R[0];
minv = R[0];
for (i = 1; i <= n - 1; i++) {
if (maxv < R[i] - minv)
maxv = R[i] - minv;
if (minv > R[i])
minv = R[i];
}
printf(... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 144 | 2 |
#include <stdio.h>
int main() {
int n, i, j;
int r[200000];
int max, min;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &r[i]);
max = r[1] - r[0];
min = r[0];
for (i = 1; i < n - 1; i++) {
if ((r[i] - min) > max)
max = r[i] - min;
if (r[i] < min)
min = r[i];
}
pr... | #include <stdio.h>
int main() {
int n, i, j;
int r[200000];
int max, min;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &r[i]);
max = r[1] - r[0];
min = r[0];
for (i = 1; i < n; i++) {
if ((r[i] - min) > max)
max = r[i] - min;
if (r[i] < min)
min = r[i];
}
printf... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 149 | 2 |
#include <stdio.h>
int main() {
int n, r[200000];
int i, j, maxv, minv;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &r[i]);
maxv = r[1] - r[0];
minv = r[0];
for (j = 0; j < n; j++) {
if (r[j] - minv > maxv)
maxv = r[j] - minv;
if (r[j] < minv)
minv = r[j];
}
/* for(i... | #include <stdio.h>
int main() {
int n, r[200000];
int i, j, maxv, minv;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &r[i]);
maxv = r[1] - r[0];
minv = r[0];
for (j = 1; j < n; j++) {
if (r[j] - minv > maxv)
maxv = r[j] - minv;
if (r[j] < minv)
minv = r[j];
}
/* for(i... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 152 | 2 |
#include <stdio.h>
#define N 200000
int main() {
int max;
int min;
int R[N];
int i, j;
int n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
for (j = 1; j < n - 1; j++) {
for (i = 0; i < j - 1; i++) {
if (max < R[j] - R[i]) {
max = R[j] - R[i];
}
... | #include <stdio.h>
#define N 200000
int main() {
int max;
int min;
int R[N];
int i, j;
int n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
for (j = 1; j <= n - 1; j++) {
for (i = 0; i <= j - 1; i++) {
if (max < R[j] - R[i]) {
max = R[j] - R[i];
}
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 220 | 6 |
#include <stdio.h>
int main(void) {
long n;
long num[200000];
long i;
long max = -2000000000;
long min;
scanf("%ld", &n);
for (i = 0; i < n; i++) {
scanf("%ld", &num[i]);
}
min = num[0];
for (i = 0; i < n; i++) {
if (max < num[i] - min)
max = num[i];
if (num[i] < min)
min... | #include <stdio.h>
int main(void) {
long n;
long num[200000];
long i;
long max = -2000000000;
long min;
scanf("%ld", &n);
for (i = 0; i < n; i++) {
scanf("%ld", &num[i]);
}
min = num[0];
for (i = 1; i < n; i++) {
if (max < num[i] - min)
max = num[i] - min;
if (num[i] < min)
... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 57, 64, 1, 0, 11, 12, 16, 17, 33], ["+", 0, 57, 64, 1, 0, 11, 12, 16, 12, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22]] | 0 | 138 | 6 |
#include <math.h>
#include <stdio.h>
#define MAX 200000
int main(void) {
int R[MAX], n;
int maxv = -2000000000;
int minv;
int i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
minv = R[0];
for (i = 0; i < n; i++) {
maxv = fmax(maxv, R[i] - minv);
minv = fmin(minv, R... | #include <math.h>
#include <stdio.h>
#define MAX 200000
int main(void) {
int R[MAX], n;
int maxv = -2000000000;
int minv;
int i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
minv = R[0];
for (i = 1; i < n; i++) {
maxv = fmax(maxv, R[i] - minv);
minv = fmin(minv, R... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 132 | 2 |
#include <stdio.h>
#define MAX 1000000000
int main() {
int i;
int n, A[MAX];
int maxv, minv = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
minv = A[0];
maxv = A[1] - A[0];
for (i = 1; i < n; i++) {
if (maxv < A[i] - minv) {
maxv = A[i] - minv;
}
if (min... | #include <stdio.h>
#define MAX 200005
int main() {
int i;
int n, A[MAX];
int maxv, minv = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
minv = A[0];
maxv = A[1] - A[0];
for (i = 1; i < n; i++) {
if (maxv < A[i] - minv) {
maxv = A[i] - minv;
}
if (minv > ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 154 | 2 |
#include <stdio.h>
int main() {
int max = -2000000000, data[200000] = {};
int n, i, r, min;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &data[i]);
}
min = data[0];
max = data[1] - data[0];
for (r = 0; r < n; r++) {
if (data[r] - min > max) {
max = data[r] - min;
}
if (da... | #include <stdio.h>
int main() {
int max = -2000000000, data[200000] = {};
int n, i, r, min;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &data[i]);
}
min = data[0];
max = data[1] - data[0];
for (r = 1; r < n; r++) {
if (data[r] - min > max) {
max = data[r] - min;
}
if (da... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 155 | 2 |
#include <math.h>
#include <stdio.h>
#define MAX 100
int main() {
int R[MAX], n, i = 0;
int maxv = 0, minv = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
minv = R[0];
for (i = 1; i < n; i++) {
maxv = fmax(maxv, R[i] - minv);
minv = fmin(minv, R[i]);
}
printf("... | #include <math.h>
#include <stdio.h>
#define MAX 200000
int main() {
int R[MAX], n, i = 0;
int maxv = -2000000000, minv = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
minv = R[0];
for (i = 1; i < n; i++) {
maxv = fmax(maxv, R[i] - minv);
minv = fmin(minv, R[i]);
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 133 | 4 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int n;
int i;
int Ans;
int Max, Min;
int *A;
int *R;
scanf("%d", &n);
A = malloc(n * sizeof(int));
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
Max = A[0];
Min = A[0];
Ans = A[1] - A[0];
for (i = 1; i < n; i++) {
... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
int n;
int i;
int Ans;
int Max, Min;
int *A;
int *R;
scanf("%d", &n);
A = malloc(n * sizeof(int));
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
Max = A[0];
Min = A[0];
Ans = A[1] - A[0];
for (i = 1; i < n; i++) {
... | [["+", 0, 57, 64, 9, 0, 57, 75, 76, 0, 95], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 75, 76, 0, 1, 0, 11, 12, 13], ["+", 64, 9, 0, 57, 75, 76, 0, 1, 0, 35]] | 0 | 201 | 5 |
#include <stdio.h>
int main(int argc, const char *argv[]) {
int count, max = 1, min = 1000000000, j, i;
scanf("%d", &count);
int x[count];
for (i = 0; i < count; i++) {
scanf("%d", &x[i]);
}
for (j = 0; j < count; j++) {
if (max < x[j] - min) {
max = x[j] - min;
}
if (min > x[j]) {
... | #include <stdio.h>
int main(int argc, const char *argv[]) {
int count, max = -2000000000, min = 2000000000, j, i;
scanf("%d", &count);
int x[count];
for (i = 0; i < count; i++) {
scanf("%d", &x[i]);
}
for (j = 0; j < count; j++) {
if (max < x[j] - min) {
max = x[j] - min;
}
if (min > x... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 144 | 4 |
#include <stdio.h>
#define N 200000
int main() {
int minv, maxv, n, i;
int R[N];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &R[i]);
minv = R[0];
maxv = R[1] - R[0];
for (i = 1; i < n - 1; i++) {
if (maxv < R[i] - minv)
maxv = R[i] - minv;
if (minv > R[i])
minv = R[i]... | #include <stdio.h>
#define N 200000
int main() {
int minv, maxv, n, i;
int R[N];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &R[i]);
minv = R[0];
maxv = R[1] - R[0];
for (i = 1; i < n; i++) {
if (maxv < R[i] - minv)
maxv = R[i] - minv;
if (minv > R[i])
minv = R[i];
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 147 | 2 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
int main(void) {
int *r;
int n;
int maxv;
int minr;
int j;
maxv = -1000000000;
minr = 1;
scanf("%d", &n);
r = (int *)malloc(sizeof(int) * n);
for (j = 0; j... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))
int main(void) {
int *r;
int n;
int maxv;
int minr;
int j;
maxv = -1000000000;
minr = 1000000000;
scanf("%d", &n);
r = (int *)malloc(sizeof(int) * n);
for ... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 0 | 163 | 2 |
int main() {
int R[200000], n, i, max, min;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &R[i]);
max = -100000000000;
min = R[0];
for (i = 1; i < n; i++) {
if (max < R[i] - min)
max = R[i] - min;
if (min < R[i])
min = R[i];
}
printf("%d", max);
return 0;
} | int main() {
int R[200000], n, i, max, min;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &R[i]);
max = -100000000000;
min = R[0];
for (i = 1; i < n; i++) {
if (max < R[i] - min)
max = R[i] - min;
if (min > R[i])
min = R[i];
}
printf("%d\n", max);
return 0;
} | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 130 | 3 |
#include <stdio.h>
int main() {
int n, a[200000], mini, maxi = -10, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
mini = a[0];
for (i = 1; i < n - 1; i++) {
if (maxi < a[i] - mini)
maxi = a[i] - mini;
if (mini > a[i])
mini = a[i];
}
printf("%d?\n", maxi);
retur... | #include <stdio.h>
int main() {
int n, a[200000], mini, maxi = -1000000001, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
mini = a[0];
for (i = 1; i < n; i++) {
if (maxi < a[i] - mini)
maxi = a[i] - mini;
if (mini > a[i])
mini = a[i];
}
printf("%d\n", maxi);
re... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 133 | 6 |
#include <stdio.h>
int main() {
int a[200000], n, i, max, min;
scanf("%d", &n);
for (i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
max = -2000000000;
min = a[0];
for (i = 0; i < n; ++i) {
if (max < a[i] - min)
max = a[i] - min;
if (min > a[i])
min = a[i];
}
printf("%d\n", m... | #include <stdio.h>
int main() {
int a[200000], n, i, max, min;
scanf("%d", &n);
for (i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
max = -2000000000;
min = a[0];
for (i = 1; i < n; ++i) {
if (max < a[i] - min)
max = a[i] - min;
if (min > a[i])
min = a[i];
}
printf("%d\n", m... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 135 | 2 |
#include <stdio.h>
int main() {
int n, i, min, dmax;
int r[200000];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &r[i]);
min = r[0];
dmax = r[1] = r[0];
for (i = 1; i < n; i++) {
if (r[i] - min > dmax)
dmax = r[i] - min;
if (r[i] < min)
min = r[i];
}
printf("%d?\n"... | #include <stdio.h>
int main() {
int n, i, min, dmax;
int r[200000];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &r[i]);
min = r[0];
dmax = r[1] - r[0];
for (i = 1; i < n; i++) {
if (r[i] - min > dmax)
dmax = r[i] - min;
if (r[i] < min)
min = r[i];
}
printf("%d\n",... | [["-", 8, 9, 0, 1, 0, 11, 12, 11, 17, 32], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 139 | 4 |
#include <stdio.h>
int main() {
int h, i, j, n, min, max;
max = 0;
scanf("%d", &n);
scanf("%d", &h);
min = h;
for (j = 1; j < n; j++) {
scanf("%d", &i);
if (max > i - min)
max = max;
else
max = i - min;
if (i > min)
min = min;
else
min = i;
}
printf("%d... | #include <stdio.h>
int main() {
int h, i, j, n, min, max;
max = -9999999999;
scanf("%d", &n);
scanf("%d", &h);
min = h;
for (j = 1; j < n; j++) {
scanf("%d", &i);
if (max > i - min)
max = max;
else
max = i - min;
if (i > min)
min = min;
else
min = i;
}
... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 0 | 121 | 2 |
#include <stdio.h>
int main(void) {
int min, max, n, R[200000];
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
min = R[0];
max = R[1] - R[0];
for (j = 1; j < n - 1; j++) {
if (max < R[j] - min) {
max = R[j] - min;
}
if (R[j] < min) {
min = ... | #include <stdio.h>
int main(void) {
int min, max, n, R[200000];
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
min = R[0];
max = R[1] - R[0];
for (j = 1; j < n; j++) {
if (max < R[j] - min) {
max = R[j] - min;
}
if (R[j] < min) {
min = R[j]... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 153 | 2 |
#include <stdio.h>
int main() {
int n, i, j;
scanf("%d", &n);
int r[200000];
for (i = 0; i < n; i++) {
scanf("%d", &r[i]);
}
int maxv = r[1] - r[0];
int minv = r[0];
for (j = 1; j < n - 1; ++j) {
if (maxv < r[j] - minv) {
maxv = r[j] - minv;
} else {
maxv = maxv;
}
if... |
#include <stdio.h>
int main() {
int n, i, j;
scanf("%d", &n);
int r[200000];
for (i = 0; i < n; i++) {
scanf("%d", &r[i]);
}
int maxv = r[1] - r[0];
int minv = r[0];
for (j = 1; j < n; ++j) {
if (maxv < (r[j] - minv)) {
maxv = r[j] - minv;
} else {
maxv = maxv;
}
if (... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 57, 15, 23, 0, 16, 12, 23, 0, 24], ["+", 0, 57, 15, 23, 0, 16, 12, 23, 0, 25]] | 0 | 164 | 4 |
#include <stdio.h>
int main(void) {
int i, j, n, max, min, a[200000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
max = -1;
min = a[0];
for (i = 1; i < n; i++) {
if (a[i] - min > max)
max = a[i] - min;
if (a[i] < min)
min = a[i];
}
printf("%d\n", max);
... | #include <stdio.h>
int main(void) {
int i, j, n, max, min, a[200000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
max = -1000000000;
min = a[0];
for (i = 1; i < n; i++) {
if (a[i] - min > max)
max = a[i] - min;
if (a[i] < min)
min = a[i];
}
printf("%d\n",... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 0 | 138 | 2 |
#include <stdio.h>
int main(void) {
int i, n;
scanf("%d", &n);
int r[n];
for (i = 0; i < n; i++) {
scanf("%d", &r[i]);
}
int max = -2147483647;
int min = r[0];
for (i = 1; i < n - 1; i++) {
if (r[i] - min > max) {
max = r[i] - min;
}
if (r[i] < min) {
min = r[i];
}
}
... | #include <stdio.h>
int main(void) {
int i, n;
scanf("%d", &n);
int r[n];
for (i = 0; i < n; i++) {
scanf("%d", &r[i]);
}
int max = -2147483647;
int min = r[0];
for (i = 1; i < n; i++) {
if (r[i] - min > max) {
max = r[i] - min;
}
if (r[i] < min) {
min = r[i];
}
}
prin... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 141 | 2 |
#include <stdio.h>
int main(void) {
int i;
int max = 2147483648;
scanf("%d\n", &i);
int min = scanf("%d\n", &i);
while ((scanf("%d\n", &i)) != EOF) {
if ((i - min) > max)
max = i - min;
if (i < min)
min = i;
}
printf("%d\n", max);
return 0;
} | #include <stdio.h>
int main(void) {
int i;
int max = -2147483648;
scanf("%d\n", &i);
int min = 0;
scanf("%d\n", &min);
while ((scanf("%d\n", &i)) != EOF) {
if ((i - min) > max)
max = i - min;
if (i < min)
min = i;
}
printf("%d\n", max);
return 0;
} | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 49, 50, 51, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22]] | 0 | 100 | 6 |
#include <stdio.h>
int main(void) {
int max = -1, bottom, now, before;
scanf("%d", &before);
scanf("%d", &before);
bottom = before;
while (scanf("%d", &now) != EOF) {
if (max < now - bottom)
max = now - bottom;
if (now < before && bottom > now)
bottom = now;
before = now;
}
print... | #include <stdio.h>
int main(void) {
int max = -0x80000000, bottom, now, before;
scanf("%d", &before);
scanf("%d", &before);
bottom = before;
while (scanf("%d", &now) != EOF) {
if (max < now - bottom)
max = now - bottom;
if (now < before && bottom > now)
bottom = now;
before = now;
}... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 0 | 102 | 2 |
#include <stdio.h>
int R[200000];
int main() {
int n, i, temp;
int minnum, maxsub;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
minnum = R[0];
maxsub = R[1] - minnum;
if (minnum > R[1])
minnum = R[1];
for (i = 2; i < n; i++) {
if (R[i] - minnum < maxsub)
maxsub... | #include <stdio.h>
int R[200000];
int main() {
int n, i, temp;
int minnum, maxsub;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
minnum = R[0];
maxsub = R[1] - minnum;
if (minnum > R[1])
minnum = R[1];
for (i = 2; i < n; i++) {
if (R[i] - minnum > maxsub)
maxsub... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47]] | 0 | 160 | 2 |
#include <stdio.h>
#define SIZE 200001
#define MIN -1000000000
int main() {
int i, j;
int max = MIN, min;
int a[SIZE];
while (scanf("%d", &a[i]) != EOF) {
i++;
}
/*
for(i=1;i<=a[0];i++){
max=MIN;
for(j=i+;j<=a[0];j++)
if(max<a[j])
max=a[j];
if(max-a[i]>x)
x=max-a[i];... | #include <stdio.h>
#define SIZE 200001
#define MIN -1000000000
int main() {
int i, j;
int max = MIN, min;
int a[SIZE];
while (scanf("%d", &a[i]) != EOF) {
i++;
}
min = a[1];
for (i = 2; i <= a[0]; i++) {
if (max < a[i] - min)
max = a[i] - min;
if (min > a[i])
min = a[i];
}
... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 129 | 2 |
#include <stdio.h>
int main(void) {
int d, i, s;
int saidai, hikaku, saisyou;
int a[200000];
i = 0;
saidai = -50000000000;
saisyou = 6000000;
scanf("%d", &d);
while (d > i) {
scanf("%d", &a[i]);
i++;
}
saisyou = a[0];
for (i = 0; i < d; i++) {
while (a[i] > saisyou) {
i++;
}... | #include <stdio.h>
int main(void) {
int d, i, s;
int saidai, hikaku, saisyou;
int a[200000];
i = 0;
saidai = -10000000000;
saisyou = 6000000;
scanf("%d", &d);
while (d > i) {
scanf("%d", &a[i]);
i++;
}
saisyou = a[0];
for (i = 0; i < d; i++) {
while (a[i] > saisyou) {
i++;
}... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 0 | 172 | 2 |
#include <stdio.h>
int main(void) {
int N;
scanf("%d", &N);
int num[N];
int i;
for (i = 0; i < N; i++) {
scanf("%d", &num[i]);
i++;
}
int maxv = -1000000000;
int minv = num[0];
for (i = 1; i < N; i++) {
if (maxv < num[i] - minv)
maxv = num[i] - minv;
if (minv > num[i])
min... | #include <stdio.h>
int main(void) {
int N;
scanf("%d", &N);
int num[N];
int i;
for (i = 0; i < N; i++)
scanf("%d", &num[i]);
int maxv = -1000000000;
int minv = num[0];
for (i = 1; i < N; i++) {
if (maxv < num[i] - minv)
maxv = num[i] - minv;
if (minv > num[i])
minv = num[i];
}... | [["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 0, 7, 8, 9, 0, 1, 0, 27, 28, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 27, 17, 29], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 139 | 5 |
#include <stdio.h>
int main() {
int n;
int tmp;
int max = -2000000000, min;
scanf("%d", &n);
scanf("%d", &tmp);
min = tmp;
int i;
for (i = 0; i < n - 1; i++) {
scanf("%d", &tmp);
if (max < tmp - min) {
max = tmp;
}
if (min > tmp) {
min = tmp;
}
}
printf("%d\n", ma... | #include <stdio.h>
int main() {
int n;
int tmp;
int max = -2000000000, min;
scanf("%d", &n);
scanf("%d", &tmp);
min = tmp;
int i;
for (i = 0; i < n - 1; i++) {
scanf("%d", &tmp);
if (max < tmp - min) {
max = tmp - min;
}
if (min > tmp) {
min = tmp;
}
}
printf("%d\... | [["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 0 | 114 | 2 |
#include <math.h>
#include <stdio.h>
int main(void) {
int a, n, c = 0, i, j, f, r, min, max = -100000000;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (i == 1) {
min = f;
max = a - min;
}
if (min > a && i != 0) {
min = f;
}
if (max < a - min) {
m... | #include <math.h>
#include <stdio.h>
int main(void) {
int a, n, c = 0, i, j, f, r, min, max = -100000000;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (i == 1) {
min = f;
max = a - min;
}
if (min > f && i != 0) {
min = f;
}
if (max < a - min) {
m... | [["-", 0, 57, 15, 23, 0, 16, 31, 16, 12, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 12, 22]] | 0 | 137 | 2 |
#include <stdio.h>
int max(int a, int b);
int min(int a, int b);
int main(void) {
int a[2000000], m, i, maxv;
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf("%d", &a[i]);
}
maxv = -200000000;
int minv = a[0];
for (i = 0; i < m; i++) {
maxv = max(maxv, a[i] - minv);
minv = min(minv, a[i]);
... | #include <stdio.h>
int max(int a, int b);
int min(int a, int b);
int main(void) {
int a[200000], m, i, maxv;
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf("%d", &a[i]);
}
maxv = -2000000000;
int minv = a[0];
for (i = 1; i < m; i++) {
maxv = max(maxv, a[i] - minv);
minv = min(minv, a[i]);
... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 185 | 6 |
#include <stdio.h>
int main(void) {
int n, R[200000], i, j, maxv, minv;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
minv = R[0];
maxv = -200000;
for (j = 1; j < n - 1; j++) {
if (maxv < (R[j] - minv)) {
maxv = R[j] - minv;
}
if (minv > R[j]) {
minv = R[j];
... | #include <stdio.h>
int main(void) {
int n, R[200000], i, j, maxv, minv;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
minv = R[0];
maxv = -2000000000;
for (j = 1; j <= n - 1; j++) {
if (maxv < (R[j] - minv)) {
maxv = R[j] - minv;
}
if (minv > R[j]) {
minv = R... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 146 | 4 |
#include <stdio.h>
int main(void) {
int i, N;
int maxv, minv;
int R[200000] = {0};
scanf("%d", &N);
for (int I = 0; I < N; I++) {
scanf("%d", &R[I]);
}
maxv = -2000000000;
minv = R[0];
for (i = 1; i < N; i++) {
if (maxv < (R[i] - minv)) {
maxv = (R[i] - minv);
} else if (minv > ... | #include <stdio.h>
int main(void) {
int i, N;
int maxv, minv;
int R[200000] = {0};
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &R[i]);
}
maxv = -2000000000;
minv = R[0];
for (i = 1; i < N; i++) {
if (maxv < (R[i] - minv)) {
maxv = (R[i] - minv);
}
if (minv > R[i])... | [["-", 0, 14, 8, 9, 0, 7, 10, 43, 39, 40], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22], ["-", 0, 2, 3, 4, 0, 66,... | 0 | 152 | 10 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.