buggy_code
stringlengths 11
625k
| fixed_code
stringlengths 17
625k
| bug_type
stringlengths 2
4.45k
| language
int64 0
8
| token_count
int64 5
200k
|
|---|---|---|---|---|
#include <iostream>
using namespace std;
int main() {
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
cout << i << "*" << j << "=" << i * j << endl;
}
}
return 0;
}
|
/*
* test01.cpp
*
* Created on: 2013-8-2
* Author: lenovo
*/
#include <iostream>
using namespace std;
int main() {
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
cout << i << "x" << j << "=" << (i * j) << endl;
}
}
}
|
[["-", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 23, 0, 24], ["+", 0, 1, 0, 16, 31, 16, 12, 23, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13], ["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 35]]
| 1
| 67
|
package main
import "fmt"
func main() {
for i := 1; i <= 9; i++ {
for i2 := 1; i2 <= 9; i2++ {
fmt.Printf("%d ?? %d = %d\n", i, i2, i*i2)
}
}
}
|
package main
import "fmt"
func main() {
for i := 1; i <= 9; i++ {
for i2 := 1; i2 <= 9; i2++ {
fmt.Printf("%dx%d=%d\n", i, i2, i*i2)
}
}
}
|
[["-", 8, 196, 0, 1, 0, 2, 3, 4, 0, 429], ["-", 0, 1, 0, 2, 3, 4, 0, 429, 0, 44], ["+", 8, 196, 0, 1, 0, 2, 3, 4, 0, 429], ["+", 0, 1, 0, 2, 3, 4, 0, 429, 0, 44]]
| 7
| 60
|
package main
import (
"fmt"
)
func main() {
for i := 0; i < 9; i++ {
for j := 0; j < 9; j++ {
fmt.Printf("%dx%d=%d\n", i, j, i*j)
}
}
}
|
package main
import (
"fmt"
)
func main() {
for i := 1; i < 10; i++ {
for j := 1; j < 10; j++ {
fmt.Printf("%dx%d=%d\n", i, j, i*j)
}
}
}
|
[["-", 0, 7, 0, 430, 10, 431, 12, 432, 0, 433], ["+", 0, 7, 0, 430, 10, 431, 12, 432, 0, 433], ["-", 8, 196, 0, 7, 0, 430, 15, 16, 12, 433], ["+", 8, 196, 0, 7, 0, 430, 15, 16, 12, 433]]
| 7
| 64
|
#include <iostream>
using namespace std;
int main() {
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
cout << i << "*" << j << "=" << i * j << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
for (int i = 1; i < 10; i++)
for (int j = 1; j < 10; j++)
cout << i << "x" << j << "=" << i * j << endl;
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 8, 9, 0, 7, 8, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 7, 8, 7, 15, 16, 12, 13], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 17, 18], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 12, 13], ["-", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6]]
| 1
| 63
|
#include <iostream>
using namespace std;
int main() {
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
cout << i << "*" << j << "=" << i * j << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
for (int i = 1; i < 10; i++)
for (int j = 1; j < 10; j++)
cout << i << "x" << j << "=" << i * j << endl;
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 67
|
var input = '';
process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) { input += chunk; });
process.stdin.on('end', function() { main(input); });
function main(arg) {
var mountains = arg.split('\n');
mountains = mountains.map(function(x) { return parseInt(x); })
var topMountains = [];
iterateTopMountain(function init(i) { topMountains[i] = 0; })
for (var i = 0; i < mountains.length; i += 1) {
var mountain = mountains[i];
iterateTopMountain(function displace(rank) {
if (mountain > topMountains[rank]) {
topMountains.splice(rank, 0, mountain);
return true;
}
})
}
iterateTopMountain(function show(i) { console.log(topMountains[i]); })
}
function iterateTopMountains(func) {
var numTopMountains = 3;
for (var i = 0; i < numTopMountains; i += 1) {
var needBreak = func(i);
if (needBreak) {
break;
}
}
}
|
var input = '';
process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) { input += chunk; });
process.stdin.on('end', function() { main(input) });
function main(arg) {
var mountains = arg.split('\n');
mountains = mountains.map(function(x) { return parseInt(x); })
var topMountains = [];
iterateTopMountains(function init(i) { topMountains[i] = 0; })
for (var i = 0; i < mountains.length; i += 1) {
var mountain = mountains[i];
iterateTopMountains(function displace(rank) {
if (mountain > topMountains[rank]) {
topMountains.splice(rank, 0, mountain);
return true;
}
})
}
iterateTopMountains(function show(i) { console.log(topMountains[i]); })
}
function iterateTopMountains(func) {
var numTopMountains = 3;
for (var i = 0; i < numTopMountains; i += 1) {
var needBreak = func(i);
if (needBreak) {
break;
}
}
}
|
[["-", 3, 3, 0, 63, 8, 556, 0, 1, 0, 35], ["-", 0, 435, 8, 556, 0, 1, 0, 2, 63, 22], ["+", 0, 435, 8, 556, 0, 1, 0, 2, 63, 22], ["-", 0, 7, 8, 556, 0, 1, 0, 2, 63, 22], ["+", 0, 7, 8, 556, 0, 1, 0, 2, 63, 22]]
| 2
| 257
|
var input = require("fs").readFileSync("/dev/stdin", "utf8");
var heights = this.result.split('\n');
heights.sort(function(a, b) { return b - a; }); // compare
for (var i = 0; i < 3; i++) {
console.log(heights[i]);
}
|
var input = require("fs").readFileSync("/dev/stdin", "utf8");
var heights = input.trim().split('\n');
heights.sort(function(a, b) { return b - a; }); // compare
for (var i = 0; i < 3; i++) {
console.log(heights[i]);
}
|
[["-", 0, 200, 51, 2, 63, 558, 500, 558, 500, 274], ["+", 51, 2, 63, 558, 500, 2, 63, 558, 500, 22], ["-", 0, 200, 51, 2, 63, 558, 500, 558, 559, 560], ["+", 51, 2, 63, 558, 500, 2, 63, 558, 559, 560], ["+", 51, 2, 63, 558, 500, 2, 3, 3, 0, 24], ["+", 51, 2, 63, 558, 500, 2, 3, 3, 0, 25]]
| 2
| 81
|
process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) {
var aaa = chunk.toString();
var line = aaa.split("\n")
for (var i in line) {
line[i] = new Number(line[i])
}
line.sort(function(a, b) {
if (a > b)
return -1;
if (a < b)
return 1;
return 0;
});
// line.sort();
for (var i = 0; i < 3; i++) {
console.log(line[i])
}
// console.log(line)
});
|
process.stdin.resume();
process.stdin.setEncoding('utf8');
process.stdin.on('data', function(chunk) {
var aaa = chunk.toString();
var line = aaa.split("\n")
for (var i in line) {
line[i] = new Number(line[i])
}
line.sort(function(a, b) {
if (a > b)
return -1;
if (a < b)
return 1;
return 0;
});
// line.sort();
for (var i = 0; i < 3; i++) {
console.log(line[i].toString());
}
// console.log(line)
});
|
[["+", 0, 2, 3, 3, 0, 2, 63, 558, 0, 131], ["+", 0, 2, 3, 3, 0, 2, 63, 558, 559, 560], ["+", 0, 2, 3, 3, 0, 2, 3, 3, 0, 24], ["+", 8, 556, 0, 1, 0, 2, 3, 3, 0, 25], ["+", 8, 556, 0, 7, 8, 556, 0, 1, 0, 35]]
| 2
| 142
|
var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var hills = (input.trim()).split("\n").map(Number);
mountains.sort(sortNumber);
function sortNumber(a, b) { return b - a; }
for (i = 0; i != 3; i++) {
console.log(mountains[i]);
}
|
var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var mountains = (input.trim()).split("\n").map(Number);
mountains.sort(sortNumber);
function sortNumber(a, b) { return b - a; }
for (i = 0; i != 3; i++) {
console.log(mountains[i]);
}
|
[["-", 36, 36, 0, 493, 0, 198, 0, 200, 141, 22], ["+", 36, 36, 0, 493, 0, 198, 0, 200, 141, 22]]
| 2
| 90
|
#include <iostream>
using namespace std;
int main() {
int i, j, sum;
for (i = 1; i <= 9; i++)
for (j = 1; j <= 9; j++)
cout << i << "*" << j << "=" << i * j << "\n";
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int i, j;
for (i = 1; i <= 9; i++)
for (j = 1; j <= 9; j++)
cout << i << "x" << j << "=" << i * j << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["-", 8, 7, 8, 1, 0, 16, 12, 5, 0, 62], ["-", 8, 7, 8, 1, 0, 16, 12, 5, 0, 44], ["+", 0, 7, 8, 7, 8, 1, 0, 16, 12, 22]]
| 1
| 70
|
<?php
while( TRUE ) {
fscanf(STDIN, "%d", $a);
if( feof(STDIN) )
break;
$c[] = $a;
}
sort($c, SORT_NUMERIC);
foreach(array_slice($c, 0, 3) as $d) {
echo $d, PHP_EOL;
}
|
<?php
while( TRUE ) {
fscanf(STDIN, "%d", $a);
if( feof(STDIN) )
break;
$c[] = $a;
}
rsort($c, SORT_NUMERIC);
foreach(array_slice($c, 0, 3) as $d) {
echo $d, PHP_EOL;
}
|
[["-", 36, 36, 0, 493, 0, 1, 0, 613, 63, 141], ["+", 36, 36, 0, 493, 0, 1, 0, 613, 63, 141]]
| 6
| 67
|
$n = array();
for ($i = 1; $i <= 10; $i++) {
$line = fgets(STDIN);
$n[] = intval($line);
}
rsort($n);
for ($i = 0; $i < 3; $i++) {
echo $n[$i]."\n";
}
|
<?php
$n = array();
for ($i = 1; $i <= 10; $i++) {
$line = fgets(STDIN);
$n[] = intval($line);
}
rsort($n);
for ($i = 0; $i < 3; $i++) {
echo $n[$i]."\n";
}
|
[["+", 36, 36, 36, 36, 36, 36, 0, 493, 0, 605]]
| 6
| 80
|
<?php
$arr = array();
for($i = 0; $i < 10; $i++){
fscanf(STDIN, "%d", $arr[$i]);
}
rsort($arr);
$count = 0;
foreach($arr as $row){
echo $row;
$count++;
if($count >= 3){
break;
}
}
|
<?php
$arr = array();
for($i = 0; $i < 10; $i++){
fscanf(STDIN, "%d", $arr[$i]);
}
rsort($arr);
$count = 0;
foreach($arr as $row){
echo $row."\n";
$count++;
if($count >= 3){
break;
}
}
|
[["+", 0, 614, 8, 9, 0, 608, 0, 16, 17, 131], ["+", 8, 9, 0, 608, 0, 16, 12, 609, 0, 62], ["+", 8, 9, 0, 608, 0, 16, 12, 609, 0, 44]]
| 6
| 82
|
<?php
for($i=0; $i<10; $i++){
fscanf(STDIN, "%d", $data[$i]);
}
rsort($data);
for($i=0; $i<3; $i++){
echo $data[$i];
}
|
<?php
for($i=0; $i<10; $i++){
fscanf(STDIN, "%d", $data[$i]);
}
rsort($data);
for($i=0; $i<3; $i++){
echo $data[$i]."\n";
}
|
[["+", 0, 7, 0, 9, 0, 608, 0, 16, 17, 131], ["+", 0, 9, 0, 608, 0, 16, 12, 609, 0, 62], ["+", 0, 9, 0, 608, 0, 16, 12, 609, 0, 44]]
| 6
| 67
|
<?php
$input = array();
for($i = 0; $i < 10; $i++){
$input[] = fgets(STDIN,4096);
}
rsort($input);
echo $input[0] . PHP_EOL;
echo $input[1] . PHP_EOL;
echo $input[2] . PHP_EOL;
|
<?php
$input = array();
for($i = 0; $i < 10; $i++){
$input[] = (int)fgets(STDIN);
}
rsort($input);
echo $input[0] . PHP_EOL;
echo $input[1] . PHP_EOL;
echo $input[2] . PHP_EOL;
|
[["+", 0, 9, 0, 1, 0, 11, 12, 74, 0, 24], ["+", 0, 9, 0, 1, 0, 11, 12, 74, 39, 615], ["+", 0, 9, 0, 1, 0, 11, 12, 74, 0, 25], ["-", 0, 1, 0, 11, 12, 613, 3, 3, 0, 21], ["-", 0, 11, 12, 613, 3, 3, 0, 28, 0, 612]]
| 6
| 71
|
<?php
$fp = fopen("php://stdin", "r");
$container=array();
$n=10;
while($n>0){
$h=trim(fgets($fp));
array_push($container,$h);
$n--;
}
sort($container);
echo $container[0]."\n";
echo $container[1]."\n";
echo $container[2]."\n";
|
<?php
$fp = fopen("php://stdin", "r");
$container=array();
$n=10;
while($n>0){
$h=trim(fgets($fp));
array_push($container,$h);
$n--;
}
rsort($container);
echo $container[0]."\n";
echo $container[1]."\n";
echo $container[2]."\n";
|
[["-", 36, 36, 0, 493, 0, 1, 0, 613, 63, 141], ["+", 36, 36, 0, 493, 0, 1, 0, 613, 63, 141]]
| 6
| 100
|
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.lang.Exception;
import java.lang.Integer;
import java.lang.String;
import java.lang.System;
import java.util.Arrays;
class Main {
public static void main(String[] a) throws Exception {
BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
int[] mountains = new int[10];
int i = 0;
while (true) {
String s = r.readLine();
mountains[++i] = Integer.valueOf(s);
if (i >= 10)
break;
}
Arrays.sort(mountains);
for (i = 9; i > 6; i--) {
System.out.println(mountains[i]);
}
}
}
|
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.lang.Exception;
import java.lang.Integer;
import java.lang.String;
import java.lang.System;
import java.util.Arrays;
class Main {
public static void main(String[] a) throws Exception {
BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
int[] mountains = new int[10];
int i = 0;
while (true) {
String s = r.readLine();
mountains[i++] = Integer.valueOf(s);
if (i >= 10)
break;
}
Arrays.sort(mountains);
for (i = 9; i > 6; i--) {
System.out.println(mountains[i]);
}
}
}
|
[["-", 0, 1, 0, 11, 31, 504, 71, 27, 0, 29], ["+", 0, 1, 0, 11, 31, 504, 71, 27, 0, 29]]
| 3
| 168
|
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
int[] a = new int[10];
for (int i = 0; i < 10; i++) {
a[i] = stdIn.nextInt();
}
Arrays.sort(a);
for (int i = 0; i < 3; i++) {
System.out.println(a[i]);
}
}
}
|
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
int[] a = new int[10];
for (int i = 0; i < 10; i++) {
a[i] = stdIn.nextInt();
}
Arrays.sort(a);
for (int i = 0; i < 3; i++) {
System.out.println(a[9 - i]);
}
}
}
|
[["+", 0, 492, 3, 4, 0, 504, 71, 16, 31, 499], ["+", 0, 492, 3, 4, 0, 504, 71, 16, 17, 33]]
| 3
| 115
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
int[] hillHeights = new int[10];
// Input.
for (int i = 0; i < 10; i++)
hillHeights[i] = Integer.parseInt(reader.readLine());
// Sort.
Arrays.sort(hillHeights);
// Output.
for (int i = 0; i < 3; i++)
System.out.println(hillHeights[hillHeights.length - i]);
}
}
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader reader =
new BufferedReader(new InputStreamReader(System.in));
int[] hillHeights = new int[10];
// Input.
for (int i = 0; i < 10; i++)
hillHeights[i] = Integer.parseInt(reader.readLine());
// Sort.
Arrays.sort(hillHeights);
// Output.
for (int i = 0; i < 3; i++)
System.out.println(hillHeights[hillHeights.length - i - 1]);
}
}
|
[["+", 0, 492, 3, 4, 0, 504, 71, 16, 17, 33], ["+", 0, 492, 3, 4, 0, 504, 71, 16, 12, 499]]
| 3
| 143
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int[] heights = new int[10];
int hi = 0;
int me = 0;
int low = 0;
for (int i = 0; i < heights.length; i++) {
int height = s.nextInt();
if (height > hi) {
low = me;
me = hi;
hi = height;
}
if (height > me && height <= hi) {
low = me;
me = height;
}
if (height > low && height <= me) {
low = height;
}
}
System.out.println(hi);
System.out.println(me);
System.out.println(low);
}
}
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int[] heights = new int[10];
int hi = 0;
int me = 0;
int low = 0;
for (int i = 0; i < heights.length; i++) {
int height = s.nextInt();
if (height >= hi) {
low = me;
me = hi;
hi = height;
}
if (height >= me && height < hi) {
low = me;
me = height;
}
if (height >= low && height < me) {
low = height;
}
}
System.out.println(hi);
System.out.println(me);
System.out.println(low);
}
}
|
[["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 47], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 20], ["-", 0, 57, 15, 15, 0, 16, 31, 16, 17, 47], ["+", 0, 57, 15, 15, 0, 16, 31, 16, 17, 20], ["-", 0, 57, 15, 15, 0, 16, 12, 16, 17, 19], ["+", 0, 57, 15, 15, 0, 16, 12, 16, 17, 18]]
| 3
| 171
|
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner angi = new Scanner(System.in);
int a[] = new int[10];
for (int cont = 0; cont < 9; cont++) {
a[cont] = angi.nextInt();
}
Arrays.sort(a);
System.out.println(a[9]);
System.out.println(a[8]);
System.out.println(a[7]);
}
}
|
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner angi = new Scanner(System.in);
int a[] = new int[10];
for (int cont = 0; cont < 10; cont++) {
a[cont] = angi.nextInt();
}
Arrays.sort(a);
System.out.println(a[9]);
System.out.println(a[8]);
System.out.println(a[7]);
}
}
|
[["-", 0, 195, 8, 196, 0, 7, 15, 16, 12, 499], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 12, 499]]
| 3
| 123
|
import java.util.Scanner;
class Main {
public static void main(String[] a) {
Scanner scan = new Scanner(System.in);
int[] data = new int[3];
int tmp;
for (int i = 0; i < 10; i++) {
tmp = scan.nextInt();
for (int j = 0; j < 3; j++) {
if (data[j] <= tmp) {
for (int k = 2; k > j; k--) {
data[k] = data[k - 1];
}
data[j] = tmp;
}
}
}
for (int i = 0; i < 3; i++) {
System.out.println(data[i]);
}
}
}
|
import java.util.Scanner;
class Main {
public static void main(String[] a) {
Scanner scan = new Scanner(System.in);
int[] data = new int[3];
int tmp;
for (int i = 0; i < 10; i++) {
tmp = scan.nextInt();
for (int j = 0; j < 3; j++) {
if (data[j] <= tmp) {
for (int k = 2; k > j; k--) {
data[k] = data[k - 1];
}
data[j] = tmp;
break;
}
}
}
for (int i = 0; i < 3; i++) {
System.out.println(data[i]);
}
}
}
|
[["+", 8, 196, 0, 57, 64, 196, 0, 93, 0, 94], ["+", 8, 196, 0, 57, 64, 196, 0, 93, 0, 35]]
| 3
| 162
|
#include <iostream>
using namespace std;
int main() {
int i, j;
for (i = 1; i < 10; i++)
for (j = 1; j < 10; j++)
cout << i << '*' << j << '=' << i * j << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int i, j;
for (i = 1; i < 10; i++)
for (j = 1; j < 10; j++)
cout << i << 'x' << j << '=' << i * j << '\n';
return 0;
}
|
[["-", 31, 16, 31, 16, 31, 16, 12, 103, 0, 125], ["+", 31, 16, 31, 16, 31, 16, 12, 103, 0, 125], ["-", 0, 7, 8, 7, 8, 1, 0, 16, 12, 22], ["+", 8, 7, 8, 1, 0, 16, 12, 103, 0, 104], ["+", 8, 7, 8, 1, 0, 16, 12, 103, 0, 44]]
| 1
| 66
|
import java.util.Arrays;
import java.util.Scanner;
class Main {
public static void main(String[] a) {
Scanner sc = new Scanner(System.in);
int[] mountainHigh = new int[10];
for (int i = 0; i < 10; i++) {
mountainHigh[i] = sc.nextInt();
}
Arrays.sort(mountainHigh);
for (int i = 9; i > 9 - 3; i++) {
System.out.println(mountainHigh[i]);
}
}
}
|
import java.util.Arrays;
import java.util.Scanner;
class Main {
public static void main(String[] a) {
Scanner sc = new Scanner(System.in);
int[] mountainHigh = new int[10];
for (int i = 0; i < 10; i++) {
mountainHigh[i] = sc.nextInt();
}
Arrays.sort(mountainHigh);
for (int i = 9; i > 9 - 3; i--) {
System.out.println(mountainHigh[i]);
}
}
}
|
[["-", 0, 195, 8, 196, 0, 7, 26, 27, 0, 29], ["+", 0, 195, 8, 196, 0, 7, 26, 27, 0, 68]]
| 3
| 116
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = 0, b = 0, c = 0;
int[] n = new int[10];
for (int i = 0; i < 10; i++) {
n[i] = sc.nextInt();
if (n[i] > a) {
b = a;
a = n[i];
} else if (n[i] > b) {
c = b;
b = n[i];
} else if (n[i] > c) {
c = n[i];
}
}
System.out.println(a);
System.out.println(b);
System.out.println(c);
}
}
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = 0, b = 0, c = 0;
int[] n = new int[10];
for (int i = 0; i < 10; i++) {
n[i] = sc.nextInt();
if (n[i] > a) {
c = b;
b = a;
a = n[i];
} else if (n[i] > b) {
c = b;
b = n[i];
} else if (n[i] > c) {
c = n[i];
}
}
System.out.println(a);
System.out.println(b);
System.out.println(c);
}
}
|
[["+", 0, 57, 64, 196, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 196, 0, 1, 0, 11, 12, 22], ["+", 8, 196, 0, 57, 64, 196, 0, 1, 0, 35]]
| 3
| 177
|
// List of Top 3 Hills
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
// int n = Integer.parseInt(in.readLine());
int top = 0;
int second = 0;
int third = 0;
int n;
for (int i = 0; i < 10; i++) {
n = Integer.parseInt(in.readLine());
if (n > third) {
third = n;
if (n > second) {
third = second;
second = n;
if (n > top) {
second = top;
top = n;
}
}
}
System.out.println(top);
System.out.println(second);
System.out.println(third);
}
}
}
|
// List of Top 3 Hills
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class Main {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
// int n = Integer.parseInt(in.readLine());
int top = 0;
int second = 0;
int third = 0;
int n;
for (int i = 0; i < 10; i++) {
n = Integer.parseInt(in.readLine());
if (n > third) {
third = n;
if (n > second) {
third = second;
second = n;
if (n > top) {
second = top;
top = n;
}
}
}
}
System.out.println(top);
System.out.println(second);
System.out.println(third);
}
}
|
[["+", 0, 195, 8, 196, 0, 7, 8, 196, 0, 46], ["-", 0, 195, 8, 196, 0, 7, 8, 196, 0, 46]]
| 3
| 174
|
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line = br.readLine();
List<Integer> ans = new ArrayList<Integer>();
while (line != null) {
ans.add(Integer.parseInt(line));
line = br.readLine();
}
Collections.sort(ans, new Comparator<Integer>() {
public int compare(Integer a, Integer b) { return a - b; }
});
for (int i = 0; i < 3; i++) {
System.out.println(ans.get(i));
}
}
}
|
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String line = br.readLine();
List<Integer> ans = new ArrayList<Integer>();
while (line != null) {
ans.add(Integer.parseInt(line));
line = br.readLine();
}
Collections.sort(ans, new Comparator<Integer>() {
public int compare(Integer a, Integer b) { return b - a; }
});
for (int i = 0; i < 3; i++) {
System.out.println(ans.get(i));
}
}
}
|
[["-", 0, 195, 8, 196, 0, 37, 0, 16, 31, 22], ["-", 0, 195, 8, 196, 0, 37, 0, 16, 17, 33], ["+", 0, 195, 8, 196, 0, 37, 0, 16, 17, 33], ["+", 0, 195, 8, 196, 0, 37, 0, 16, 12, 22]]
| 3
| 170
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] a) {
BufferedReader br;
br = new BufferedReader(new InputStreamReader(System.in));
int[] mountains = new int[10];
for (int i = 0; i < 10; i++) {
try {
String str = br.readLine();
mountains[i] = Integer.parseInt(str);
} catch (IOException e) {
e.printStackTrace();
}
}
for (int h = mountains.length - 1; h > 0; h--) {
for (int i = 1; i <= h; i++) {
if (mountains[i] < mountains[i - 1]) {
int tmp = mountains[i];
mountains[i] = mountains[i - 1];
mountains[i - 1] = tmp;
}
}
}
for (int i = 0; i < 3; i++) {
System.out.println(mountains[i]);
}
}
}
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] a) {
BufferedReader br;
br = new BufferedReader(new InputStreamReader(System.in));
int[] mountains = new int[10];
for (int i = 0; i < 10; i++) {
try {
String str = br.readLine();
mountains[i] = Integer.parseInt(str);
} catch (IOException e) {
e.printStackTrace();
}
}
for (int h = mountains.length - 1; h > 0; h--) {
for (int i = 1; i <= h; i++) {
if (mountains[i] > mountains[i - 1]) {
int tmp = mountains[i];
mountains[i] = mountains[i - 1];
mountains[i - 1] = tmp;
}
}
}
for (int i = 0; i < 3; i++) {
System.out.println(mountains[i]);
}
}
}
|
[["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 18], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 47]]
| 3
| 228
|
import java.io.*;
import java.util.*;
import java.util.Collections;
class Main {
public static void main(String[] a) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
Integer[] mountains = new Integer[10];
for (int i = 0; i < 10; i++) {
mountains[i] = Integer.valueOf(br.readLine());
}
Arrays.sort(mountains, Collections.reverseOrder());
for (int i = 0; i < 3; i++) {
System.out.println(mountains[i] + "\n");
}
}
}
|
import java.io.*;
import java.util.*;
import java.util.Collections;
class Main {
public static void main(String[] a) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
Integer[] mountains = new Integer[10];
for (int i = 0; i < 10; i++) {
mountains[i] = Integer.valueOf(br.readLine());
}
Arrays.sort(mountains, Collections.reverseOrder());
for (int i = 0; i < 3; i++) {
System.out.println(mountains[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, 44]]
| 3
| 142
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
public static void main(String[] a)
throws NumberFormatException, IOException {
int arr[] = new int[10];
BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
for (int i = 1; i < 10; i++) {
arr[i] = Integer.parseInt(read.readLine());
}
Arrays.sort(arr);
for (int i = 9; i > 6; i--) {
System.out.println(arr[i]);
}
}
}
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
public static void main(String[] a)
throws NumberFormatException, IOException {
int arr[] = new int[10];
BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
for (int i = 0; i < 10; i++) {
arr[i] = Integer.parseInt(read.readLine());
}
Arrays.sort(arr);
for (int i = 9; i > 6; i--) {
System.out.println(arr[i]);
}
}
}
|
[["-", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499], ["+", 8, 196, 0, 7, 502, 503, 49, 200, 51, 499]]
| 3
| 142
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
ArrayList<Integer> input = new ArrayList<Integer>();
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
for (int i = 0; i < 10; i++)
input.add(Integer.parseInt(br.readLine()));
Collections.sort(input, Collections.reverseOrder());
for (int i = 0; i < input.size(); i++)
System.out.println(input.get(i));
}
}
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
ArrayList<Integer> input = new ArrayList<Integer>();
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
for (int i = 0; i < 10; i++)
input.add(Integer.parseInt(br.readLine()));
Collections.sort(input, Collections.reverseOrder());
for (int i = 0; i < 3; i++)
System.out.println(input.get(i));
}
}
|
[["-", 8, 196, 0, 7, 15, 16, 12, 492, 500, 22], ["-", 8, 196, 0, 7, 15, 16, 12, 492, 0, 131], ["-", 8, 196, 0, 7, 15, 16, 12, 492, 141, 22], ["-", 0, 7, 15, 16, 12, 492, 3, 4, 0, 24], ["-", 0, 7, 15, 16, 12, 492, 3, 4, 0, 25], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 12, 499]]
| 3
| 166
|
#include <iostream>
using namespace std;
int main() {
int a;
int b;
for (a = 1; a <= 9; a++) {
for (b = 1; b <= 9; b++) {
cout << a << "X" << b << "=" << a * b << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a;
int b;
for (a = 1; a <= 9; a++) {
for (b = 1; b <= 9; b++) {
cout << a << "x" << b << "=" << a * b << endl;
}
}
return 0;
}
|
[["-", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6]]
| 1
| 71
|
#include <stdio.h>
//#include<windows.h>
int main() {
int i, j;
for (i = 1; i <= 9; i++)
for (j = 1; j < 9; j++)
printf("%dx%d=%d\n", i, j, i * j);
// system("pause");
return 0;
}
|
#include <stdio.h>
int main() {
int i, j;
for (i = 1; i < 10; i++)
for (j = 1; j < 10; j++)
printf("%dx%d=%d\n", i, j, i * j);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 8, 9, 0, 7, 8, 7, 15, 16, 12, 13], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 12, 13]]
| 1
| 60
|
#include <stdio.h>
int i, j;
int main() {
for (i = 1; i < 9 + 1; i++) {
for (j = 1; j < 9 + 1; j++) {
printf("%d*%d=%d\n", i, j, i * j);
}
}
return 0;
}
|
#include <stdio.h>
int i, j;
int main() {
for (i = 1; i < 9 + 1; i++) {
for (j = 1; j < 9 + 1; j++) {
printf("%dx%d=%d\n", i, j, i * j);
}
}
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 66
|
#include <bits/stdc++.h>
using namespace std;
int main() {
for (int i = 1; i < 10; i++) {
for (int j = 0; j < 10; j++) {
cout << i << "x" << j << "=" << i * j << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
cout << i << "x" << j << "=" << i * j << endl;
}
}
}
|
[["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]]
| 1
| 64
|
#include <cmath>
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
printf("%dx%d=%d\n", j, j, i * j);
}
}
return 0;
}
|
#include <cmath>
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
printf("%dx%d=%d\n", i, j, i * j);
}
}
return 0;
}
|
[["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]]
| 1
| 68
|
#include <iostream>
using namespace std;
int main(void) {
int x, y, z;
z = 0;
x = 0;
while (1) {
x = x + 1;
while (1) {
z = z + 1;
y = x * z;
cout << x << "*" << z << "=" << y << endl;
if (z >= 9) {
break;
}
}
z = 0;
if (x >= 9) {
break;
}
}
}
|
#include <iostream>
using namespace std;
int main(void) {
int x, y, z;
z = 0;
x = 0;
while (1) {
x = x + 1;
while (1) {
z = z + 1;
y = x * z;
cout << x << "x" << z << "=" << y << endl;
if (z >= 9) {
break;
}
}
z = 0;
if (x >= 9) {
break;
}
}
}
|
[["-", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6]]
| 1
| 100
|
#include <cstdio>
using namespace std;
int main() {
for (int i = 1; i <= 9; ++i) {
for (int j = 1; j <= 9; ++j) {
printf("%dx%d=%d", i, j, i * j);
}
}
return 0;
}
|
#include <cstdio>
using namespace std;
int main() {
for (int i = 1; i <= 9; ++i) {
for (int j = 1; j <= 9; ++j) {
printf("%dx%d=%d\n", i, j, i * j);
}
}
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 62
|
#include <stdio.h>
int main() {
for (int i = 1; i <= 9; ++i)
for (int j = 1; j <= 9; ++j)
printf("%dx%d", i, j, i * j);
}
|
#include <stdio.h>
int main() {
for (int i = 1; i <= 9; ++i)
for (int j = 1; j <= 9; ++j)
printf("%dx%d=%d\n", i, j, i * j);
}
|
[["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 51
|
#include <iostream>
using namespace std;
int main() {
for (int i = 1; i < 10; i++)
for (int j = 1; j < 10; j++)
cout << i << "*" << j << "=" << i * j << endl;
}
|
#include <iostream>
using namespace std;
int main() {
for (int i = 1; i < 10; i++)
for (int j = 1; j < 10; j++)
cout << i << "x" << j << "=" << i * j << endl;
}
|
[["-", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6]]
| 1
| 60
|
#include <iostream>
using namespace std;
int main() {
for (int i = 1; i <= 9; ++i) {
for (int j = 1; j <= 9; ++j) {
printf("%dx%d=%d", i, j, i * j);
}
}
}
|
#include <iostream>
using namespace std;
int main() {
for (int i = 1; i <= 9; ++i) {
for (int j = 1; j <= 9; ++j) {
printf("%dx%d=%d\n", i, j, i * j);
}
}
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 59
|
#include <iostream>
using namespace std;
int main(void) {
for (int i = 0; i < 10; i++)
for (int j = 0; j < 10; j++)
cout << i << "x" << j << "=" << i * j << endl;
}
|
#include <iostream>
using namespace std;
int main(void) {
for (int i = 1; i < 10; i++)
for (int j = 1; j < 10; j++)
cout << i << "x" << j << "=" << i * j << endl;
}
|
[["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 7, 8, 7, 10, 43, 49, 50, 51, 13], ["+", 0, 7, 8, 7, 10, 43, 49, 50, 51, 13]]
| 1
| 61
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
const int MAX = 10000100;
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define all(a) (a).begin(), (a).end()
#define ll long long int
#define gcd(a, b) __gcd(a, b)
#define pb(a) push_back(a)
int GCD(int a, int b) {
if (!b)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main(void) {
rep(i, 10) rep(j, 10) cout << i << "x" << j << "=" << i * j << endl;
}
|
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
const int MAX = 10000100;
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define all(a) (a).begin(), (a).end()
#define ll long long int
#define gcd(a, b) __gcd(a, b)
#define pb(a) push_back(a)
int GCD(int a, int b) {
if (!b)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main(void) {
loop(i, 1, 10) loop(j, 1, 10) cout << i << "x" << j << "=" << i * j << endl;
}
|
[["-", 0, 14, 8, 9, 0, 42, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["+", 31, 16, 31, 16, 31, 16, 31, 2, 63, 22], ["+", 31, 16, 31, 16, 31, 2, 3, 4, 0, 21], ["+", 31, 16, 31, 16, 31, 2, 3, 4, 0, 13]]
| 1
| 164
|
#include <iostream>
using namespace std;
#define N 9
int main() {
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
cout << i << " x " << j << " = " << (i * j) << "\n";
}
}
return 0;
}
|
#include <iostream>
using namespace std;
#define N 9
int main() {
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
cout << i << "x" << j << "=" << (i * j) << "\n";
}
}
return 0;
}
|
[["-", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 16, 31, 16, 31, 16, 12, 5, 0, 6]]
| 1
| 74
|
#include <iostream>
using namespace std;
int main() {
for (int r = 1; r <= 9; r++) {
for (int c = 1; c <= 9; c++) {
cout << r << "×" << c << "=" << r * c << endl;
}
}
return (0);
}
|
#include <iostream>
using namespace std;
int main() {
for (int r = 1; r <= 9; r++) {
for (int c = 1; c <= 9; c++) {
cout << r << "x" << c << "=" << r * c << endl;
}
}
return (0);
}
|
[["-", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6], ["+", 31, 16, 31, 16, 31, 16, 12, 5, 0, 6]]
| 1
| 69
|
#include <cstdio>
int main() {
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
printf("%dx%d=%d?\n", i, j, i * j);
return 0;
}
|
#include <cstdio>
int main() {
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
printf("%dx%d=%d\n", i, j, i * j);
return 0;
}
|
[["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6]]
| 1
| 55
|
// AOJ 0000
// include
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <vector>
// using namespace
using namespace std;
// define
// variable
short a, b;
// function
int main() {
for (a = 1; a <= 9; a++)
for (b = 1; b <= 9; b++)
printf("%dx%d=%d", a, b, a * b);
return 0;
}
|
// AOJ 0000
// include
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <vector>
// using namespace
using namespace std;
// define
// variable
short a, b;
// function
int main() {
for (a = 1; a <= 9; a++)
for (b = 1; b <= 9; b++)
printf("%dx%d=%d\n", a, b, a * b);
return 0;
}
|
[["+", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["+", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 89
|
#include <stdio.h>
int main(void) {
int Mt;
int t[3];
int i, j;
for (i = 0; i < 10; i++) {
scanf("%d", &Mt);
if (i == 0) {
t[0] = Mt;
t[1] = Mt;
t[2] = Mt;
continue;
} else {
if (Mt > t[0]) {
t[2] = t[1];
t[1] = t[0];
t[0] = Mt;
}
else if (Mt > t[1]) {
t[2] = t[1];
t[1] = Mt;
}
else if (Mt > t[2]) {
t[2] = Mt;
}
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", t[i]);
}
return (0);
}
|
#include <stdio.h>
int main(void) {
int Mt;
int t[3];
int i, j;
for (i = 0; i < 10; i++) {
scanf("%d", &Mt);
if (i == 0) {
t[0] = Mt;
t[1] = 0;
t[2] = 0;
continue;
} else {
if (Mt > t[0]) {
t[2] = t[1];
t[1] = t[0];
t[0] = Mt;
}
else if (Mt > t[1]) {
t[2] = t[1];
t[1] = Mt;
}
else if (Mt > t[2]) {
t[2] = Mt;
}
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", t[i]);
}
return (0);
}
|
[["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13]]
| 0
| 201
|
#include <stdio.h>
int main() {
int i = 0, a[3] = {0}, k;
for (;;) {
scanf("%d", &k);
if (a[0] <= k) {
a[2] = a[1];
a[1] = a[0];
a[0] = k;
}
if (a[0] > k && a[1] < k) {
a[2] = a[1];
a[1] = k;
}
if (a[1] > k && a[2] < k) {
a[2] = k;
}
i++;
if (i == 10)
break;
}
printf("%d\n%d\n%d\n", a[0], a[1], a[2]);
return 0;
}
|
#include <stdio.h>
int main() {
int i = 0, a[3] = {0}, k;
for (;;) {
scanf("%d", &k);
if (a[0] <= k) {
a[2] = a[1];
a[1] = a[0];
a[0] = k;
}
if (a[0] > k && a[1] <= k) {
a[2] = a[1];
a[1] = k;
}
if (a[1] > k && a[2] <= k) {
a[2] = k;
}
i++;
if (i == 10)
break;
}
printf("%d\n%d\n%d\n", a[0], a[1], a[2]);
return 0;
}
|
[["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 19]]
| 0
| 180
|
#include <stdio.h>
#define FOR(a, b) for (a = 0; a < b; a++)
int main() {
int mnt[10];
int i, j, buf;
FOR(i, 10) scanf("%d", &mnt[i]);
FOR(i, 10) {
j = i + 1;
FOR(j, 10) {
if (mnt[i] < mnt[j]) {
buf = mnt[i];
mnt[i] = mnt[j];
mnt[j] = buf;
}
}
}
FOR(i, 3) printf("%d\n", mnt[i]);
return 0;
}
|
#include <stdio.h>
#define FOR(a, b) for (a = 0; a < b; a++)
int main() {
int mnt[10];
int i, j, buf;
FOR(i, 10) scanf("%d", &mnt[i]);
FOR(i, 10) {
j = i + 1;
FOR(j, 10) {
if (mnt[i] > mnt[j]) {
buf = mnt[i];
mnt[i] = mnt[j];
mnt[j] = buf;
}
}
}
FOR(i, 3) printf("%d\n", mnt[i]);
return 0;
}
|
[["-", 0, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 0, 9, 0, 57, 15, 23, 0, 16, 17, 47]]
| 0
| 134
|
#include <stdio.h>
int main(void) {
int hight[10];
int i = 0;
int tmp;
int j = 0;
for (i = 0; i < 10; i++) {
scanf("%d", &hight[i]);
}
for (i = 0; i < 10; i++) {
for (j = 0; j < 9; j++) {
if (hight[j] < hight[j + 1]) {
tmp = hight[j];
hight[j] = hight[j + 1];
hight[j + 1] = tmp;
}
}
}
for (i = 0; i < 3; i++) {
printf("%d", hight[i]);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int hight[10];
int i = 0;
int tmp;
int j = 0;
for (i = 0; i < 10; i++) {
scanf("%d", &hight[i]);
}
for (i = 0; i < 10; i++) {
for (j = 0; j < 9; j++) {
if (hight[j] < hight[j + 1]) {
tmp = hight[j];
hight[j] = hight[j + 1];
hight[j + 1] = tmp;
}
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", hight[i]);
}
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 160
|
#include <stdio.h>
int main(void) {
int i, j, temp, mountain[10];
for (i = 0; i < 10; i++) {
scanf("%d", mountain[i]);
}
for (i = 0; i < 10; i++) {
for (j = i + 1; j < 10; j++) {
if (mountain[i] < mountain[j]) {
temp = mountain[j];
mountain[j] = mountain[i];
mountain[i] = temp;
}
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", mountain[i]);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int i, j, temp, mountain[10];
for (i = 0; i < 10; i++) {
scanf("%d", &mountain[i]);
}
for (i = 0; i < 10; i++) {
for (j = i + 1; j < 10; j++) {
if (mountain[i] < mountain[j]) {
temp = mountain[j];
mountain[j] = mountain[i];
mountain[i] = temp;
}
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", mountain[i]);
}
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]]
| 0
| 149
|
#include <stdio.h>
int main(void) {
int a[10] = {0};
int i;
int j;
for (i = 0; i <= 9; i++)
scanf("%d", &a[i]);
for (i = 0; i <= 7; i++) {
for (j = i + 1; j <= 8; j++) {
if (a[i] <= a[j]) {
int temp = 0;
temp = a[j];
a[j] = a[i];
a[i] = temp;
}
}
}
for (i = 0; i <= 2; i++)
printf("%d\n", a[i]);
return 0;
}
|
#include <stdio.h>
int main(void) {
int a[10] = {0};
int i;
int j;
for (i = 0; i <= 9; i++)
scanf("%d", &a[i]);
for (i = 0; i <= 8; i++) {
for (j = i + 1; j <= 9; j++) {
if (a[i] < a[j]) {
int temp = 0;
temp = a[j];
a[j] = a[i];
a[i] = temp;
}
}
}
for (i = 0; i <= 2; i++)
printf("%d\n", a[i]);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18]]
| 0
| 155
|
#include <stdio.h>
void Swap(int x[], int r, int l) {
int temp;
temp = x[r];
x[r] = x[l];
x[l] = temp;
}
void Qsort(int x[], int l, int r) {
int i, j, p;
i = l;
j = r;
p = x[(l + r) / 2];
while (1) {
while (x[i] < p)
i++;
while (x[j] > p)
j--;
if (i >= j)
break;
Swap(x, i, j);
i++;
j--;
}
if (i - l > 2)
Qsort(x, l, i - 1);
if (r - j > 2)
Qsort(x, j + 1, r);
}
int main() {
int h[10], i;
for (i = 0; i < 10; i++)
scanf("%d", &h[i]);
Qsort(h, 0, 9);
// for(i=0; i<10; i++)printf(" %d\n",h[i]);
printf("%d\n%d\n%d\n", h[9], h[8], h[7]);
return 0;
}
|
#include <stdio.h>
void Swap(int x[], int r, int l) {
int temp;
temp = x[r];
x[r] = x[l];
x[l] = temp;
}
void Qsort(int x[], int l, int r) {
int i, j, p;
i = l;
j = r;
p = x[(l + r) / 2];
while (1) {
while (x[i] < p)
i++;
while (x[j] > p)
j--;
if (i >= j)
break;
Swap(x, i, j);
i++;
j--;
}
if (i - l > 1)
Qsort(x, l, i - 1);
if (r - j > 1)
Qsort(x, j + 1, r);
}
int main() {
int h[10], i;
for (i = 0; i < 10; i++)
scanf("%d", &h[i]);
Qsort(h, 0, 9);
// for(i=0; i<10; i++)printf(" %d\n",h[i]);
printf("%d\n%d\n%d\n", h[9], h[8], h[7]);
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13]]
| 0
| 260
|
#include <stdio.h>
int main() {
int i, j, t;
int d[10];
for (i = 0; i < 10; i++) {
scanf("%d", &d[i]);
for (j = i; j; j--) {
if (d[j - 1] > d[j]) {
t = d[j - 1];
d[j - 1] = d[j];
d[j] = t;
}
}
}
for (i = 0; i < 3; i++)
printf("%d\n", d[i]);
return 0;
}
|
#include <stdio.h>
int main() {
int i, j, t;
int d[10];
for (i = 0; i < 10; i++) {
scanf("%d", &d[i]);
for (j = i; j; j--) {
if (d[j - 1] < d[j]) {
t = d[j - 1];
d[j - 1] = d[j];
d[j] = t;
}
}
}
for (i = 0; i < 3; i++)
printf("%d\n", d[i]);
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18]]
| 0
| 135
|
#include <stdio.h>
int main() {
int d[10] = {0};
int i, j, t;
for (i = 0; i < 10; i++) {
scanf("%d", &d[i]);
for (j = i; j; j++) {
if (d[j - 1] < d[j]) {
t = d[j - 1];
d[j - 1] = d[j];
d[j] = t;
}
}
}
printf("%d\n%d\n%d\n", d[0], d[1], d[2]);
return 0;
}
|
#include <stdio.h>
int main() {
int d[10] = {0};
int i, j, t;
for (i = 0; i < 10; i++) {
scanf("%d", &d[i]);
for (j = i; j; j--) {
if (d[j - 1] < d[j]) {
t = d[j - 1];
d[j - 1] = d[j];
d[j] = t;
}
}
}
printf("%d\n%d\n%d\n", d[0], d[1], d[2]);
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 17, 68]]
| 0
| 140
|
#include <stdio.h>
int main(void) {
int a[10], i, N1, N2, N3;
N1 = 0;
N2 = 0;
N3 = 0;
for (i = 0; i < 9; i++) {
scanf("%d\n", &a[i]);
if (a[i] > N1) {
N3 = N2;
N2 = N1;
N1 = a[i];
} else if (a[i] > N2) {
N3 = N2;
N2 = a[i];
} else if (a[i] > N3) {
N3 = a[i];
}
}
printf("%d\n%d\n%d\n", N1, N2, N3);
return 0;
}
|
#include <stdio.h>
int main(void) {
int a[10], i, N1, N2, N3;
N1 = 0;
N2 = 0;
N3 = 0;
for (i = 0; i < 10; i++) {
scanf("%d", &a[i]);
if (a[i] > N1) {
N3 = N2;
N2 = N1;
N1 = a[i];
} else if (a[i] > N2) {
N3 = N2;
N2 = a[i];
} else if (a[i] > N3) {
N3 = a[i];
}
}
printf("%d\n%d\n%d\n", N1, N2, N3);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 153
|
#include <stdio.h>
int main(void) {
int a[10];
int i;
int m1, m2, m3;
m1 = m2 = m3 = -1;
for (i = 0; i < 10; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < 10; i++) {
if (m1 < a[i]) {
m3 = m2;
m2 = m1;
m1 = a[i];
}
else if (m1 > a[i] && m2 < a[i]) {
m3 = m2;
m2 = a[i];
}
else if (m2 > a[i] && m3 < a[i]) {
m3 = a[i];
}
}
printf("%d\n%d\n%d\n", m1, m2, m3);
return 0;
}
|
#include <stdio.h>
int main(void) {
int a[10];
int i;
int m1, m2, m3;
m1 = m2 = m3 = -1;
for (i = 0; i < 10; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < 10; i++) {
if (m1 <= a[i]) {
m3 = m2;
m2 = m1;
m1 = a[i];
}
else if (m1 > a[i] && m2 <= a[i]) {
m3 = m2;
m2 = a[i];
}
else if (m2 > a[i] && m3 <= a[i]) {
m3 = a[i];
}
}
printf("%d\n%d\n%d\n", m1, m2, m3);
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 19]]
| 0
| 179
|
#include <stdio.h>
int main(void) {
int i, j, m, yama[11] = {0};
for (i = 1; i < 10; i++) {
scanf("%d", &yama[i]);
}
for (i = 0; i < 3; i++) {
for (j = i + 1; j < 11; j++) {
if (yama[i] < yama[j]) {
m = yama[i];
yama[i] = yama[j];
yama[j] = m;
}
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", yama[i]);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int i, j, m, yama[11] = {0};
for (i = 1; i < 11; i++) {
scanf("%d", &yama[i]);
}
for (i = 0; i < 3; i++) {
for (j = i + 1; j < 11; j++) {
if (yama[i] < yama[j]) {
m = yama[i];
yama[i] = yama[j];
yama[j] = m;
}
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", yama[i]);
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 154
|
#include <stdio.h>
int main() {
int i, j;
int mt[10];
int max[3] = {0, 0, 0};
int tmp1, tmp2;
for (i = 0; i < 10; i++) {
scanf("%d", &mt[i]);
for (j = 0; j < 3; j++) {
if (mt[i] > max[j]) {
tmp1 = max[j];
max[j] = mt[i];
if (j == 0) {
tmp2 = tmp1;
max[j + 1] = tmp1;
max[j + 2] = tmp2;
}
if (j == 1)
max[j + 1] = tmp1;
break;
}
}
}
for (j = 0; j < 3; j++) {
printf("%d\n", max[j]);
}
return 0;
}
|
#include <stdio.h>
int main() {
int i, j;
int mt[10];
int max[3] = {0, 0, 0};
int tmp1, tmp2;
for (i = 0; i < 10; i++) {
scanf("%d", &mt[i]);
for (j = 0; j < 3; j++) {
if (mt[i] > max[j]) {
tmp1 = max[j];
max[j] = mt[i];
if (j == 0) {
tmp2 = max[j + 1];
max[j + 1] = tmp1;
max[j + 2] = tmp2;
}
if (j == 1)
max[j + 1] = tmp1;
break;
}
}
}
for (j = 0; j < 3; j++) {
printf("%d\n", max[j]);
}
return 0;
}
|
[["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 69, 0, 70], ["+", 0, 1, 0, 11, 12, 69, 71, 16, 31, 22], ["+", 0, 1, 0, 11, 12, 69, 71, 16, 17, 72], ["+", 0, 1, 0, 11, 12, 69, 71, 16, 12, 13], ["+", 64, 9, 0, 1, 0, 11, 12, 69, 0, 73]]
| 0
| 190
|
#include <stdio.h>
int main(void) {
int a[10] = {};
int i;
for (i = 0; i < 9; i++)
scanf("%d", &a[i]);
int k, j;
for (i = 0; i < 8; i++)
for (k = 0; k < 8; k++)
if (a[k] < a[k + 1]) {
j = a[k];
a[k] = a[k + 1];
a[k + 1] = j;
}
for (i = 0; i < 2; i++) {
printf("%d", a[i]);
putchar('\n');
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int a[10] = {};
int i;
for (i = 0; i < 10; i++)
scanf("%d", &a[i]);
int k, j;
for (i = 0; i < 9; i++)
for (k = 0; k < 9; k++)
if (a[k] < a[k + 1]) {
j = a[k];
a[k] = a[k + 1];
a[k + 1] = j;
}
for (i = 0; i < 3; i++) {
printf("%d", a[i]);
putchar('\n');
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 8, 9, 0, 7, 8, 7, 15, 16, 12, 13], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 12, 13]]
| 0
| 159
|
#include <stdio.h>
#define Max 1000
void swap(int *x, int *y) {
int buff;
buff = *x;
*x = *y;
*y = buff;
}
void insertionSort(int A[Max], int N) {
int i, j, v;
for (i = 0; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] < v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
}
}
void insertionSort4(int A[Max]) {
int i, j, v;
i = 3;
v = A[i];
j = i - 1;
while (j >= 0 && A[j] < v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
}
int main() {
int N, i, count;
int num[Max];
int top[4];
N = 10;
for (i = 0; i < N; i++)
scanf("%d", &num[i]);
for (i = 0; i < 3; i++)
top[i] = num[i];
insertionSort(top, 3);
for (i = 3; i < N; i++) {
top[3] = num[i];
insertionSort4(top);
}
for (i = 0; i < 3; i++)
printf("%d ", top[i]);
return 0;
}
|
#include <stdio.h>
#define Max 1000
void swap(int *x, int *y) {
int buff;
buff = *x;
*x = *y;
*y = buff;
}
void insertionSort(int A[Max], int N) {
int i, j, v;
for (i = 0; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] < v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
}
}
void insertionSort4(int A[Max]) {
int i, j, v;
i = 3;
v = A[i];
j = i - 1;
while (j >= 0 && A[j] < v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
}
int main() {
int N, i, count;
int num[Max];
int top[4];
N = 10;
for (i = 0; i < N; i++)
scanf("%d", &num[i]);
for (i = 0; i < 3; i++)
top[i] = num[i];
insertionSort(top, 3);
for (i = 3; i < N; i++) {
top[3] = num[i];
insertionSort4(top);
}
for (i = 0; i < 3; i++)
printf("%d\n", top[i]);
return 0;
}
|
[["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 342
|
#include <stdio.h>
#include <stdlib.h>
int comp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int i, hei[10];
for (i = 0; i < 10; i++) {
scanf("%d", &hei[i]);
}
qsort(hei, 10, sizeof(int), comp);
for (i = 0; i < 3; i++) {
printf("%d\n", hei[i]);
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
int comp(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int main() {
int i, hei[10];
for (i = 0; i < 10; i++) {
scanf("%d", &hei[i]);
}
qsort(hei, 10, sizeof(int), comp);
for (i = 0; i < 3; i++) {
printf("%d\n", hei[i]);
}
return 0;
}
|
[["-", 0, 37, 0, 16, 31, 66, 28, 74, 51, 22], ["+", 0, 37, 0, 16, 31, 66, 28, 74, 51, 22], ["-", 0, 37, 0, 16, 12, 66, 28, 74, 51, 22], ["+", 0, 37, 0, 16, 12, 66, 28, 74, 51, 22]]
| 0
| 121
|
#include <stdio.h>
int main() {
int first = 0, second = 0, third = 0;
int height;
int i;
for (i = 0; i <= 10000; i++) {
scanf("%d", &height);
if (first < height) {
third = second;
second = first;
first = height;
} else if (second < height) {
third = second;
second = height;
} else if (third < height) {
third = height;
}
}
printf("%d\n%d\n%d\n", first, second, third);
return 0;
}
|
#include <stdio.h>
int main() {
int first = 0, second = 0, third = 0;
int height;
int i;
for (i = 0; i < 10; i++) {
scanf("%d", &height);
if (first < height) {
third = second;
second = first;
first = height;
} else if (second < height) {
third = second;
second = height;
} else if (third < height) {
third = height;
}
}
printf("%d\n%d\n%d\n", first, second, third);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 123
|
#include <stdio.h>
int main() {
int big[3] = {0};
int b = 0;
int i;
for (i = 0; i < 10; i++) {
scanf("%d", &b);
if (big[0] < b) {
big[2] = big[1];
big[1] = big[0];
big[0] = b;
} else {
if (big[1] < b) {
big[1] = big[2];
big[1] = b;
} else {
if (big[2] < b) {
big[2] = b;
}
}
}
}
printf("%d\n%d\n%d\n", big[0], big[1], big[2]);
return 0;
}
|
#include <stdio.h>
int main() {
int big[3] = {0};
int b = 0;
int i;
for (i = 0; i < 10; i++) {
scanf("%d", &b);
if (big[0] < b) {
big[2] = big[1];
big[1] = big[0];
big[0] = b;
} else {
if (big[1] < b) {
big[2] = big[1];
big[1] = b;
} else {
if (big[2] < b) {
big[2] = b;
}
}
}
}
printf("%d\n%d\n%d\n", big[0], big[1], big[2]);
return 0;
}
|
[["-", 64, 9, 0, 1, 0, 11, 31, 69, 71, 13], ["+", 64, 9, 0, 1, 0, 11, 31, 69, 71, 13], ["-", 64, 9, 0, 1, 0, 11, 12, 69, 71, 13], ["+", 64, 9, 0, 1, 0, 11, 12, 69, 71, 13]]
| 0
| 171
|
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int i, j, t;
int x[10];
for (i = 0; i < 10; i++) {
scanf("%d", &x[i]);
}
for (i = 0; i < 9; i++) {
for (j = 0; j < 9 - i; j++) {
if (x[j] < x[j + 1]) {
t = x[j];
x[j] = x[j - 1];
x[j - 1] = t;
}
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", x[i]);
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int i, j, t;
int x[10];
for (i = 0; i < 10; i++) {
scanf("%d", &x[i]);
}
for (i = 0; i < 9; i++) {
for (j = 0; j < 9 - i; j++) {
if (x[j] < x[j + 1]) {
t = x[j];
x[j] = x[j + 1];
x[j + 1] = t;
}
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", x[i]);
}
return 0;
}
|
[["-", 0, 1, 0, 11, 12, 69, 71, 16, 17, 33], ["+", 0, 1, 0, 11, 12, 69, 71, 16, 17, 72], ["-", 0, 1, 0, 11, 31, 69, 71, 16, 17, 33], ["+", 0, 1, 0, 11, 31, 69, 71, 16, 17, 72]]
| 0
| 159
|
#include <stdio.h>
int main(void) {
int i, j, a[10], pwd;
for (i = 0; i < 10; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < 3; i++) {
for (j = i + 1; j < 9; j++) {
if (a[i] < a[j]) {
pwd = a[j];
a[j] = a[i];
a[i] = pwd;
}
}
}
printf("%d\n%d\n%d", a[0], a[1], a[2]);
return 0;
}
|
#include <stdio.h>
int main(void) {
int i, j, a[10], pwd;
for (i = 0; i < 10; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < 3; i++) {
for (j = i + 1; j < 10; j++) {
if (a[i] < a[j]) {
pwd = a[j];
a[j] = a[i];
a[i] = pwd;
}
}
}
printf("%d\n%d\n%d\n", a[0], a[1], a[2]);
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 148
|
#include <stdio.h>
int main() {
int a[10];
int i, j;
int tmp;
for (i = 0; i < 10; i++)
scanf("%d", &a[i]);
for (i = 0; i < 9; i++) {
for (j = 9; j > i; j--)
if (a[j] > a[j - 1]) {
tmp = a[j];
a[j] = a[j - 1];
a[j - 1] = tmp;
}
}
printf("%d %d %d\n", a[0], a[1], a[2]);
return 0;
}
|
#include <stdio.h>
int main() {
int a[10];
int i, j;
int tmp;
for (i = 0; i < 10; i++)
scanf("%d", &a[i]);
for (i = 0; i < 9; i++) {
for (j = 9; j > i; j--)
if (a[j] > a[j - 1]) {
tmp = a[j];
a[j] = a[j - 1];
a[j - 1] = tmp;
}
}
printf("%d\n%d\n%d\n", a[0], a[1], a[2]);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 146
|
#include <stdio.h>
int main(void) {
int x[10], i, j;
for (i = 0; i < 10; i++)
scanf("%d", &x[i]);
for (i = 0; i < 9; i++) {
for (j = 9; j > i; j--) {
if (x[j - 1] > x[j]) {
int temp = x[j - 1];
x[j - 1] = x[j];
x[j] = temp;
}
}
}
for (i = 0; i < 3; i++)
printf("%d\n", x[i]);
return 0;
}
|
#include <stdio.h>
int main(void) {
int x[10], i, j;
for (i = 0; i < 10; i++)
scanf("%d", &x[i]);
for (i = 0; i < 9; i++) {
for (j = 9; j > i; j--) {
if (x[j - 1] < x[j]) {
int temp = x[j - 1];
x[j - 1] = x[j];
x[j] = temp;
}
}
}
for (i = 0; i < 3; i++)
printf("%d\n", x[i]);
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18]]
| 0
| 149
|
#include <stdio.h>
int main() {
int i, j, tmp;
int mon[9];
for (i = 0; i < 10; i++) {
scanf("%d\n", &mon[0]);
}
for (i = 0; i < 10; ++i) {
for (j = i + 1; j < 10; ++j) {
if (mon[i] < mon[j]) {
tmp = mon[i];
mon[i] = mon[j];
mon[j] = tmp;
}
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", mon[i]);
}
return 0;
}
|
#include <stdio.h>
int main() {
int i, j, tmp;
int mon[9];
for (i = 0; i < 10; i++) {
scanf("%d\n", &mon[i]);
}
for (i = 0; i < 10; ++i) {
for (j = i + 1; j < 10; ++j) {
if (mon[i] < mon[j]) {
tmp = mon[i];
mon[i] = mon[j];
mon[j] = tmp;
}
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", mon[i]);
}
return 0;
}
|
[["-", 0, 2, 3, 4, 0, 66, 28, 69, 71, 13], ["+", 0, 2, 3, 4, 0, 66, 28, 69, 71, 22]]
| 0
| 151
|
#include <stdio.h>
#define swap(a, b) \
{ \
int tmp; \
tmp = a; \
a = b; \
b = tmp; \
}
int main() {
int data[10];
int i, t;
for (i = 0; i < 10; i++)
scanf("%d ", data + i);
for (i = 10 - 1; i >= 0; i--) {
for (t = i; t < 10 - 1; t++) {
if (data[t] > data[t + 1])
swap(data
[t],
data[t + 1]);
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", data[i]);
}
return 0;
}
|
#include <stdio.h>
#define swap(a, b) \
{ \
int tmp; \
tmp = a; \
a = b; \
b = tmp; \
}
int main() {
int data[10];
int i, t;
for (i = 0; i < 10; i++)
scanf("%d", data + i);
for (i = 10 - 1; i >= 0; i--) {
for (t = i; t < 10 - 1; t++) {
if (data[t] < data[t + 1])
swap(data
[t],
data[t + 1]);
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", data[i]);
}
return 0;
}
|
[["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18]]
| 0
| 146
|
#include <stdio.h>
int main(void) {
int i, ii, ary[10], k;
for (i = 0; i < 10; i++) {
scanf("%d", &ary[i]);
}
for (ii = 0; ii < 9; ii++) {
for (i = ii + 1; i < 9; i++) {
if (ary[ii] < ary[i]) {
k = ary[ii];
ary[ii] = ary[i];
ary[i] = k;
}
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", ary[i]);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int i, ii, ary[10], k;
for (i = 0; i < 10; i++) {
scanf("%d", &ary[i]);
}
for (ii = 0; ii < 10; ii++) {
for (i = ii + 1; i < 10; i++) {
if (ary[ii] < ary[i]) {
k = ary[ii];
ary[ii] = ary[i];
ary[i] = k;
}
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", ary[i]);
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 150
|
#include <stdio.h>
int main(void) {
int high[10];
int i, max = 0, max2 = 0, max3 = 0;
for (i = 0; i < 10; i++) {
scanf("%d", &high[i]);
}
if (max3 < high[i]) {
if (max2 < high[i]) {
if (max < high[i]) {
max3 = max2;
max2 = max;
max = high[i];
}
else {
max3 = max2;
max2 = high[i];
}
}
else {
max3 = high[i];
}
}
printf("%d\n%d\n%d\n", max, max2, max3);
return 0;
}
|
#include <stdio.h>
int main(void) {
int high[10];
int i, max = 0, max2 = 0, max3 = 0;
for (i = 0; i < 10; i++) {
scanf("%d", &high[i]);
if (max3 < high[i]) {
if (max2 < high[i]) {
if (max < high[i]) {
max3 = max2;
max2 = max;
max = high[i];
}
else {
max3 = max2;
max2 = high[i];
}
}
else {
max3 = high[i];
}
}
}
printf("%d\n%d\n%d\n", max, max2, max3);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 64, 9, 0, 57, 75, 76, 0, 9, 0, 46]]
| 0
| 151
|
#include <stdio.h>
int main() {
int hei[10], i, j, temp;
for (i = 0; i < 10; i++) {
scanf("%d", &hei[i]);
}
for (i = 0; i < 10; i++) {
for (j = i + 1; j < 9; j++) {
if (hei[i] < hei[j]) {
temp = hei[i];
hei[i] = hei[j];
hei[j] = temp;
}
}
}
for (i = 0; i < 2; i++) {
printf("%d\n", hei[i]);
}
return (0);
}
|
#include <stdio.h>
int main() {
int hei[10], i, j, temp;
for (i = 0; i < 10; i++) {
scanf("%d", &hei[i]);
}
for (i = 0; i < 10; i++) {
for (j = i + 1; j < 10; j++) {
if (hei[i] < hei[j]) {
temp = hei[i];
hei[i] = hei[j];
hei[j] = temp;
}
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", hei[i]);
}
return (0);
}
|
[["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 151
|
#include <stdio.h>
int main(void) {
int i, j, tmp;
int high[10];
for (i = 0; i < 10; i++)
scanf("%d", high[i]);
for (i = 0; i < 10; i++) {
for (j = i + 1; j < 10; j++) {
if (high[i] < high[j]) {
tmp = high[i];
high[i] = high[j];
high[j] = tmp;
}
}
}
for (i = 0; i < 3; i++)
printf("%d\n", high[i]);
return 0;
}
|
#include <stdio.h>
int main(void) {
int i, j, tmp, high[10];
for (i = 0; i < 10; i++)
scanf("%d", &high[i]);
for (i = 0; i < 10; i++) {
for (j = i + 1; j < 10; j++) {
if (high[i] < high[j]) {
tmp = high[i];
high[i] = high[j];
high[j] = tmp;
}
}
}
for (i = 0; i < 3; i++)
printf("%d\n", high[i]);
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 8, 1, 0, 2, 3, 4, 0, 66, 17, 67]]
| 0
| 146
|
#include <stdio.h>
int compare_int(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int x[10];
int i, j;
int tmp;
for (i = 0; i < 10; i++)
scanf("%d", &x[i]);
qsort(x, 10, sizeof(int), compare_int);
for (i = 0; i < 3; i++)
printf("%d\n", x[10 - i]);
return 0;
}
|
#include <stdio.h>
int compare_int(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int x[10];
int i, j;
int tmp;
for (i = 0; i < 10; i++)
scanf("%d", &x[i]);
qsort(x, 10, sizeof(int), compare_int);
for (i = 0; i < 3; i++)
printf("%d\n", x[9 - i]);
return 0;
}
|
[["-", 0, 2, 3, 4, 0, 69, 71, 16, 31, 13], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 31, 13]]
| 0
| 123
|
#include <stdio.h>
int main() {
int x[10];
int i, j;
int tmp;
for (i = 0; i < 10; i++)
scanf("%d", &x[i]);
for (i = 0; i < 9; i++) {
for (j = i; j < 9; j++) {
if (x[i] < x[j]) {
tmp = x[i];
x[i] = x[j];
x[j] = tmp;
}
}
}
for (i = 0; i < 3; i++)
printf("%d\n", x[i]);
return 0;
}
|
#include <stdio.h>
int main() {
int x[10];
int i, j;
int tmp;
for (i = 0; i < 10; i++)
scanf("%d", &x[i]);
for (i = 0; i < 10; i++) {
for (j = i; j < 10; j++) {
if (x[i] < x[j]) {
tmp = x[i];
x[i] = x[j];
x[j] = tmp;
}
}
}
for (i = 0; i < 3; i++)
printf("%d\n", x[i]);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 145
|
#include <stdio.h>
int main() {
int t[10], i, j, tmp;
for (i = 0; i <= 9; i++)
scanf("%d", &t[i]);
for (i = 0; i < 8; i++) {
for (j = 8; j > i; j--) {
if (t[j - 1] < t[j]) {
tmp = t[j];
t[j] = t[j - 1];
t[j - 1] = tmp;
}
}
}
for (i = 0; i <= 2; i++)
printf("%d\n", t[i]);
return 0;
}
|
#include <stdio.h>
int main() {
int t[10], i, j, tmp;
for (i = 0; i <= 9; i++)
scanf("%d", &t[i]);
for (i = 0; i < 9; i++) {
for (j = 9; j > i; j--) {
if (t[j - 1] < t[j]) {
tmp = t[j];
t[j] = t[j - 1];
t[j - 1] = tmp;
}
}
}
for (i = 0; i <= 2; i++)
printf("%d\n", t[i]);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13]]
| 0
| 149
|
#include <stdio.h>
int main(void) {
int height[10];
int i;
int highest[3];
for (i = 0; i < 10; i++) {
scanf("%d", &height[i]);
}
for (i = 0; i < 3; i++) {
highest[i] = height[0];
}
for (i = 0; i < 10; i++) {
if (height[i] > highest[0]) {
highest[2] = highest[1];
highest[1] = highest[0];
highest[0] = height[i];
} else if (height[i] > highest[1]) {
highest[2] = highest[1];
highest[1] = height[i];
} else if (height[i] > highest[2]) {
highest[2] = height[i];
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", highest[i]);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int height[10];
int i;
int highest[3];
for (i = 0; i < 10; i++) {
scanf("%d", &height[i]);
}
for (i = 0; i < 3; i++) {
highest[i] = 0;
}
for (i = 0; i < 10; i++) {
if (height[i] > highest[0]) {
highest[2] = highest[1];
highest[1] = highest[0];
highest[0] = height[i];
} else if (height[i] > highest[1]) {
highest[2] = highest[1];
highest[1] = height[i];
} else if (height[i] > highest[2]) {
highest[2] = height[i];
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", highest[i]);
}
return 0;
}
|
[["-", 8, 9, 0, 1, 0, 11, 12, 69, 28, 22], ["-", 8, 9, 0, 1, 0, 11, 12, 69, 0, 70], ["-", 8, 9, 0, 1, 0, 11, 12, 69, 0, 73]]
| 0
| 227
|
#include <stdio.h>
void mysort(int *x) {
int i;
int j;
int tmp;
for (i = 0; i < 3; ++i) {
for (j = 0; j < 10 - 1; ++j) {
if (x[j] < x[j + 1]) {
tmp = x[j + 1];
x[j + 1] = x[j];
x[j] = tmp;
}
}
}
}
int main() {
int x[10];
int i;
for (i = 0; i < 10; ++i) {
scanf("%d", &x[i]);
}
mysort(x);
printf("%d\n", x[9]);
printf("%d\n", x[8]);
printf("%d\n", x[7]);
return 0;
}
|
#include <stdio.h>
void mysort(int *x) {
int i;
int j;
int tmp;
for (i = 0; i < 3; ++i) {
for (j = 0; j < 10 - 1; ++j) {
if (x[j] > x[j + 1]) {
tmp = x[j + 1];
x[j + 1] = x[j];
x[j] = tmp;
}
}
}
}
int main() {
int x[10];
int i;
for (i = 0; i < 10; ++i) {
scanf("%d", &x[i]);
}
mysort(x);
printf("%d\n", x[9]);
printf("%d\n", x[8]);
printf("%d\n", x[7]);
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47]]
| 0
| 186
|
#include <stdio.h>
int main(void) {
int m[10];
int a, i, j;
for (i = 0; i < 10; i++) {
scanf("%d", &m[i]);
}
for (i = 0; i < 10; ++i) {
for (j = i + 1; j < 10; ++j) {
if (m[i] < m[j]) {
a = m[i];
m[i] = m[j];
m[j] = a;
}
}
}
for (i = 1; i < 11; i++) {
printf("%d\n", m[i]);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int m[10];
int a, i, j;
for (i = 0; i < 10; i++) {
scanf("%d", &m[i]);
}
for (i = 0; i < 10; ++i) {
for (j = i + 1; j < 10; ++j) {
if (m[i] < m[j]) {
a = m[i];
m[i] = m[j];
m[j] = a;
}
}
}
for (i = 0; i < 3; i++) {
printf("%d\n", m[i]);
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 151
|
#include <stdio.h>
int main() {
int h[10];
int i, j, tmp;
for (i = 0; i < 10; i++)
scanf("%d", &h[i]);
for (i = 0; i < 3; i++) {
for (j = 9; j > 0; j--) {
if (h[j] > h[j - 1]) {
tmp = h[j - 1];
h[j - 1] = h[j];
h[j] = tmp;
}
}
}
printf("%d %d %d\n", h[0], h[1], h[2]);
return 0;
}
|
#include <stdio.h>
int main() {
int h[10];
int i, j, tmp;
for (i = 0; i < 10; i++) {
scanf("%d", &h[i]);
}
for (i = 0; i < 3; i++) {
for (j = 9; j > 0; j--) {
if (h[j] > h[j - 1]) {
tmp = h[j - 1];
h[j - 1] = h[j];
h[j] = tmp;
}
}
}
printf("%d\n%d\n%d\n", h[0], h[1], h[2]);
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 147
|
#include <stdio.h>
#include <stdlib.h>
int compar(const int *val1, const int *val2);
int main(void) {
int ary[10];
int n;
int i;
for (i = 0; i < 10; i++)
scanf("%d", &ary[i]);
n = sizeof(ary) / sizeof(ary[0]);
qsort(ary, n, sizeof(int), (int (*)(const void *, const void *))compar);
for (i = 7; i < n; i++)
printf("%d\n", ary[i]);
return 0;
}
int compar(const int *val1, const int *val2) {
if (*val1 < *val2) {
return -1;
} else if (*val1 == *val2) {
return 0;
} else {
return 1;
}
}
|
#include <stdio.h>
#include <stdlib.h>
int compar(const int *val1, const int *val2);
int main(void) {
int ary[10];
int n;
int i;
for (i = 0; i < 10; i++)
scanf("%d", &ary[i]);
n = sizeof(ary) / sizeof(ary[0]);
qsort(ary, n, sizeof(int), (int (*)(const void *, const void *))compar);
for (i = 9; 6 < i; i--)
printf("%d\n", ary[i]);
return 0;
}
int compar(const int *val1, const int *val2) {
if (*val1 < *val2) {
return -1;
} else if (*val1 == *val2) {
return 0;
} else {
return 1;
}
}
|
[["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 31, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 14, 8, 9, 0, 7, 26, 27, 17, 29], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 17, 68]]
| 0
| 184
|
#include <math.h>
#include <stdio.h>
#define MAX(a, b) ((a) > (b) ? (a) : (b))
int main() {
int hills[10];
int i;
int N1 = 0;
int N2 = 0;
int N3 = 0;
for (i = 0; i < 10; ++i) {
scanf("%d", &hills[i]);
}
for (i = 0; i < 10; ++i) {
if (N3 < hills[i] && N2 < hills[i] && N1 < hills[i]) {
N3 = N2;
N2 = N1;
N1 = hills[i];
} else if (N3 < hills[i] && N2 < hills[i]) {
N3 = N2;
N2 = hills[i];
} else if (N3 < hills[i]) {
N3 = hills[i];
}
}
printf("%d %d %d\n", N1, N2, N3);
return 0;
}
|
#include <math.h>
#include <stdio.h>
#define MAX(a, b) ((a) > (b) ? (a) : (b))
int main() {
int hills[10];
int i;
int N1 = 0;
int N2 = 0;
int N3 = 0;
for (i = 0; i < 10; ++i) {
scanf("%d", &hills[i]);
}
for (i = 0; i < 10; ++i) {
if (N3 < hills[i] && N2 < hills[i] && N1 < hills[i]) {
N3 = N2;
N2 = N1;
N1 = hills[i];
} else if (N3 < hills[i] && N2 < hills[i]) {
N3 = N2;
N2 = hills[i];
} else if (N3 < hills[i]) {
N3 = hills[i];
}
}
printf("%d\n%d\n%d\n", N1, N2, N3);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 191
|
#include <stdio.h>
#define NUMBER 10
int main(void) {
int height[NUMBER];
int i, j;
int top[NUMBER] = {0};
int b_num[NUMBER] = {0};
int judgment = 1;
for (i = 0; i < NUMBER; i++) {
scanf("%d", &height[i]);
}
for (i = 0; i < NUMBER; i++) {
for (j = 0; j < NUMBER; j++) {
if (b_num[j] == 0) {
if (height[j] > top[i]) {
top[i] = height[j];
}
}
}
for (j = 0; j < NUMBER; j++) {
if (b_num[j] == 0) {
if (top[i] == height[j] && judgment == 1) {
b_num[j] = 1;
judgment = 0;
}
}
}
judgment = 1;
}
for (i = 0; i < NUMBER; i++)
printf("%d\n", top[i]);
return 0;
}
|
#include <stdio.h>
#define NUMBER 10
int main(void) {
int height[NUMBER];
int i, j;
int top[NUMBER] = {0};
int b_num[NUMBER] = {0};
int judgment = 1;
for (i = 0; i < NUMBER; i++) {
scanf("%d", &height[i]);
}
for (i = 0; i < NUMBER; i++) {
for (j = 0; j < NUMBER; j++) {
if (b_num[j] == 0) {
if (height[j] > top[i]) {
top[i] = height[j];
}
}
}
for (j = 0; j < NUMBER; j++) {
if (b_num[j] == 0) {
if (top[i] == height[j] && judgment == 1) {
b_num[j] = 1;
judgment = 0;
}
}
}
judgment = 1;
}
for (i = 0; i < 3; i++)
printf("%d\n", top[i]);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 229
|
#include <stdio.h>
int main(void) {
int high[10];
int i, j, tmp;
for (i = 0; i < 10; i++)
scanf("%d", &high[i]);
for (i = 0; i < 3; i++) {
for (j = 9; j > i; j--) {
if (high[j - 1] > high[j]) {
tmp = high[j - 1];
high[j - 1] = high[j];
high[j] = tmp;
}
}
}
for (i = 0; i < 3; i++)
printf("%d\n", high[9 - i]);
return 0;
}
|
#include <stdio.h>
int main(void) {
int high[10];
int i, j, tmp;
for (i = 0; i < 10; i++)
scanf("%d", &high[i]);
for (i = 0; i < 3; i++) {
for (j = 9; j > i; j--) {
if (high[j - 1] < high[j]) {
tmp = high[j - 1];
high[j - 1] = high[j];
high[j] = tmp;
}
}
}
for (i = 0; i < 3; i++)
printf("%d\n", high[i]);
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["-", 0, 2, 3, 4, 0, 69, 71, 16, 31, 13], ["-", 0, 2, 3, 4, 0, 69, 71, 16, 17, 33]]
| 0
| 153
|
#include <stdio.h>
int main() {
int i, j, mountains[10], temp;
for (i = 0; i <= 9; i++) {
scanf(" %d", &mountains[i]);
}
for (i = 0; i <= 9; i++) {
for (j = i; j <= 9; j++) {
if (mountains[i] < mountains[j]) {
temp = mountains[i];
mountains[i] = mountains[j];
mountains[j] = temp;
}
}
}
for (i = 0; i <= 3; i++) {
printf("%d\n", mountains[i]);
}
return 0;
}
|
#include <stdio.h>
int main() {
int i, j, mountains[10], temp;
for (i = 0; i <= 9; i++) {
scanf(" %d", &mountains[i]);
}
for (i = 0; i <= 9; i++) {
for (j = i; j <= 9; j++) {
if (mountains[i] < mountains[j]) {
temp = mountains[i];
mountains[i] = mountains[j];
mountains[j] = temp;
}
}
}
for (i = 0; i <= 2; i++) {
printf("%d\n", mountains[i]);
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 147
|
#include <stdio.h>
int main() {
int a[10];
int i = 0;
int tmp = 0;
int flg = 1;
for (i = 0; i < 10; i++) {
scanf("%d", &a[i]);
}
i = 0;
while (flg) {
flg = 0;
for (i = 0; i < 9; i++) {
if (a[i] > a[i + 1]) {
tmp = a[i];
a[i] = a[i + 1];
a[i + 1] = tmp;
flg = 1;
}
}
}
printf("%d %d %d\n", a[9], a[8], a[7]);
return 0;
}
|
#include <stdio.h>
int main() {
int a[10];
int i = 0;
int tmp = 0;
int flg = 1;
for (i = 0; i < 10; i++) {
scanf("%d", &a[i]);
}
i = 0;
while (flg) {
flg = 0;
for (i = 0; i < 9; i++) {
if (a[i] > a[i + 1]) {
tmp = a[i];
a[i] = a[i + 1];
a[i + 1] = tmp;
flg = 1;
}
}
}
printf("%d\n%d\n%d\n", a[9], a[8], a[7]);
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 0
| 160
|
#include <stdio.h>
int main() {
int i, j;
int a[10];
int temp;
for (i = 0; i < 10; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < 10; i++) {
for (j = i + 1; i < 10; j++) {
if (a[j] > a[i]) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
printf("%d\n%d\n%d\n", a[0], a[1], a[2]);
return 0;
}
|
#include <stdio.h>
int main() {
int i, j;
int a[10];
int temp;
for (i = 0; i < 10; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < 10; i++) {
for (j = i + 1; j < 10; j++) {
if (a[j] > a[i]) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
printf("%d\n%d\n%d\n", a[0], a[1], a[2]);
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22]]
| 0
| 150
|
#include <stdio.h>
int main() {
int n, r, h1 = 0, h2 = 0, h3 = 0;
for (r = 0; r < 10; r++) {
scanf("%d", n);
if (n >= h1) {
h3 = h2;
h2 = h1;
h1 = n;
} else if (n >= h2) {
h3 = h2;
h2 = n;
} else if (n >= h3)
h3 = n;
}
printf("%d\n%d\n%d\n", h1, h2, h3);
return 0;
}
|
#include <stdio.h>
int main() {
int n, r, h1 = 0, h2 = 0, h3 = 0;
for (r = 0; r < 10; r++) {
scanf("%d", &n);
if (n >= h1) {
h3 = h2;
h2 = h1;
h1 = n;
} else if (n >= h2) {
h3 = h2;
h2 = n;
} else if (n >= h3)
h3 = n;
}
printf("%d\n%d\n%d\n", h1, h2, h3);
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]]
| 0
| 118
|
#include <stdio.h>
int main(void) {
int h, i, m;
int mountain[10];
scanf("%d\n%d\n%d\n%d\n%d\n%d\n%d\n%d\n%d\n%d\n", &mountain[0], &mountain[1],
&mountain[2], &mountain[3], &mountain[4], &mountain[5], &mountain[6],
&mountain[7], &mountain[8], &mountain[1]);
for (h = 9; h > 6; h--) {
for (i = 0; i < h; i++) {
if (mountain[i] > mountain[i + 1])
m = mountain[i], mountain[i] = mountain[i + 1], mountain[i + 1] = m;
}
}
printf("%d\n%d\n%d\n", mountain[9], mountain[8], mountain[7]);
return 0;
}
|
#include <stdio.h>
int main(void) {
int h, i, m;
int mountain[10];
scanf("%d\n%d\n%d\n%d\n%d\n%d\n%d\n%d\n%d\n%d\n", &mountain[0], &mountain[1],
&mountain[2], &mountain[3], &mountain[4], &mountain[5], &mountain[6],
&mountain[7], &mountain[8], &mountain[9]);
for (h = 9; h > 6; h--) {
for (i = 0; i < h; i++) {
if (mountain[i] > mountain[i + 1])
m = mountain[i], mountain[i] = mountain[i + 1], mountain[i + 1] = m;
}
}
printf("%d\n%d\n%d\n", mountain[9], mountain[8], mountain[7]);
return 0;
}
|
[["-", 0, 2, 3, 4, 0, 66, 28, 69, 71, 13], ["+", 0, 2, 3, 4, 0, 66, 28, 69, 71, 13]]
| 0
| 210
|
#include <stdio.h>
int main(void) {
int i;
int hight[9];
int first = 0, second = 0, third = 0;
for (i = 0; i <= 9; i++) {
scanf("%d\n", &hight[i]);
if (first < hight[i]) {
third = second;
second = first;
first = hight[i];
}
if (first > hight[i] && second < hight[i]) {
third = second;
second = hight[i];
}
if (second > hight[i] && third < hight[i]) {
third = hight[i];
}
}
printf("%d\n%d\n%d\n", first, second, third);
return 0;
}
|
#include <stdio.h>
int main(void) {
int i;
int hight[9];
int first = 0, second = 0, third = 0;
for (i = 0; i <= 9; i++) {
scanf("%d\n", &hight[i]);
if (first <= hight[i]) {
third = second;
second = first;
first = hight[i];
}
if (first > hight[i] && second <= hight[i]) {
third = second;
second = hight[i];
}
if (second > hight[i] && third <= hight[i]) {
third = hight[i];
}
}
printf("%d\n%d\n%d\n", first, second, third);
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 19], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 18], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 19]]
| 0
| 161
|
#include <stdio.h>
#define NUM 10
int main(void) {
int top1 = 0, top2 = 0, top3 = 0;
int i;
int input;
for (i = 0; i < NUM; i++) {
scanf("%d", &input);
if (top1 < input) {
top2 = top1;
top1 = input;
} else if (top2 < input) {
top3 = top2;
top2 = input;
} else if (top3 < input) {
top3 = input;
}
}
printf("%d\n", top1);
printf("%d\n", top2);
printf("%d\n", top3);
return 0;
}
|
#include <stdio.h>
#define NUM 10
/*
void bsort(int a[], int n){
int i,j;
for(i = 0; i < n - 1; i++){
for(j = 0; j < n - 1 - i; j++){
if(a[j + 1] > a[j]){
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
}
}
int main(void){
int hills[NUM];
int i;
for(i = 0; i < NUM; i++){
scanf("%d", &hills[i]);
}
bsort(hills, NUM);
for(i = 0; i < 3; i++){
printf("%d\n", hills[i]);
}
return 0;
}
*/
int main(void) {
int top1 = 0, top2 = 0, top3 = 0;
int i;
int input;
for (i = 0; i < NUM; i++) {
scanf("%d", &input);
if (top1 < input) {
top3 = top2;
top2 = top1;
top1 = input;
} else if (top2 < input) {
top3 = top2;
top2 = input;
} else if (top3 < input) {
top3 = input;
}
}
printf("%d\n", top1);
printf("%d\n", top2);
printf("%d\n", top3);
return 0;
}
|
[["+", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]]
| 0
| 135
|
for i in range(1,10):
for j in range(1,10):
print(i,"x",j,"=",i*j)
|
for i in range(1,10):
for j in range(1,10):
print(i,"x",j,"=",i*j,sep="")
|
[["+", 8, 196, 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
| 38
|
for a in range(1, 9):
for b in range(1, 10):
print(str(a)+'x'+str(b)+'='+str(a*b))
|
for a in range(1, 10):
for b in range(1, 10):
print(str(a)+'x'+str(b)+'='+str(a*b))
|
[["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612]]
| 5
| 47
|
for i in range(1,9):
for j in range(1,9):
print("{0}x{1}={2}".format(i, j, i*j))
|
for i in range(1,10):
for j in range(1,10):
print("{0}x{1}={2}".format(i, j, i*j))
|
[["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612]]
| 5
| 37
|
for i in range(9):
for j in range(9):
print("%d x %d = %d"%(i+1, j+1, (j+1) * (i+1)))
|
#coding:utf-8
for i in range(9):
for j in range(9):
print("%dx%d=%d"%(i+1, j+1, (j+1) * (i+1)))
|
[["-", 0, 652, 3, 4, 0, 657, 31, 557, 0, 6], ["+", 0, 652, 3, 4, 0, 657, 31, 557, 0, 6]]
| 5
| 44
|
[print('{}x{}={}').format(i, j, i * j) for j in range(1, 10) for i in range(1, 10)]
|
[print('{}x{}={}'.format(i, j, i * j)) for i in range(1, 10) for j in range(1, 10)]
|
[["-", 8, 652, 63, 319, 500, 652, 3, 4, 0, 25], ["+", 0, 1, 0, 658, 8, 652, 3, 4, 0, 25], ["-", 0, 656, 0, 1, 0, 658, 0, 659, 31, 22], ["+", 0, 656, 0, 1, 0, 658, 0, 659, 31, 22]]
| 5
| 37
|
for i in range(10):
for j in range(10):
fmt = format("{0}x{1}={2}")
g = fmt.format(i, j, i*j)
print(g)
|
for i in range(1, 10):
for j in range(1, 10):
fmt = format("{0}x{1}={2}")
g = fmt.format(i, j, i*j)
print(g)
|
[["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 21], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 21]]
| 5
| 42
|
a = 1
b = 1
for count in range(9):
for count in range(9):
print(str(a) + '*' + str(b) + '=' + str(a * b))
b += 1
a += 1
b = 1
|
a = 1
b = 1
for count in range(9):
for count in range(9):
print(str(a) + 'x' + str(b) + '=' + str(a * b))
b += 1
a += 1
b = 1
|
[["-", 31, 657, 31, 657, 31, 657, 12, 557, 0, 6], ["+", 31, 657, 31, 657, 31, 657, 12, 557, 0, 6]]
| 5
| 58
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.