Datasets:
TheFinAI
/
ibm-project-codenet

Dataset card Data Studio Files
xet
 Community
Source
stringclasses
1 value
Date
int64
2.01k
2.02k
Text
stringlengths
22
783k
Token_count
int64
20
394k
Project_CodeNet
2,019
import Data.List main = do xs <- (map read) . words <$> getLine let xs' = sort xs print $ (xs !! 0) * (xs !! 1) `div` 2
50
Project_CodeNet
2,019
main :: IO () main = do [a, b, _] <- fmap (map read . words) getLine :: IO [Int] print $ a * b `div` 2
43
Project_CodeNet
2,019
main :: IO () main = do [c, a, _] <- map read . words <$> getLine print $ div (c * a) 2
37
Project_CodeNet
2,020
import Control.Applicative main :: IO () main = do [a, b, _] <- map read . words <$> getLine putStrLn $ show (solve a b) solve :: Int -> Int -> Int solve a b = a * b `div` 2
60
Project_CodeNet
2,020
parseInput input = map read $ words input :: [Int] solve a b c = ans where area = div (a * b) 2 ans = area main = do input <- getLine let [a, b, c] = parseInput input print $ solve a b c
65
Project_CodeNet
2,019
import Control.Arrow import Control.Monad import Data.List import qualified Data.ByteString.Char8 as B main :: IO () main = readLine >>= print . solve solve :: [Int] -> Int solve (x : y : _) = (x * y) `div` 2 readLine :: IO [Int] readLine = unfoldr (fmap (second (maybe B.empty snd . B.uncons)) . B.readInt) <$> B.get...
114
Project_CodeNet
2,019
main = do [a,b,_] <- map read . words <$> getLine print $ a * b `div` 2
30
Project_CodeNet
2,019
calc :: [Int] -> Int calc (x:xs) = (head (map ((*) x) xs)) `div` 2 main :: IO() main = getLine >>= \s -> print $ calc $ (map read . words :: String -> [Int]) s
59
Project_CodeNet
2,019
main :: IO () main = do [a,b,c] <- map read . words <$> getLine :: IO [Int] print $ a * b `div` 2
38
Project_CodeNet
2,019
main=interact$show.f.map read.words f[x,y,_]=div(x*y)2
21
Project_CodeNet
2,019
main = (`div` 2) . product . take 2 . fmap read . words <$> getLine >>= print
24
Project_CodeNet
2,019
main::IO () main = do [ab,bc,ca] <- map read . words <$> getLine print $ div (ab*bc) 2
36
Project_CodeNet
2,019
main = do [a,b,c] <- map read . words <$> getLine :: IO [Int] print $ a * b `div` 2
35
Project_CodeNet
2,019
main = do [ab,bc,ca] <- map read . words <$> getLine print $ truncate $ ab*bc/2
31
Project_CodeNet
2,019
main=getLine>>=print.f.map read.words f [ab,bc,cd]=(ab*bc)`div`2
26
Project_CodeNet
2,019
main = (`div`2) . product . take 2 . map read . words <$> getLine >>= print
23
Project_CodeNet
2,019
import Control.Applicative main :: IO () main = do [ab, bc, _] <- map read . words <$> getLine putStrLn $ show (solve ab bc) solve :: Int -> Int -> Int solve ab bc = (ab * bc) `div` 2
62
Project_CodeNet
2,019
main :: IO () main = do ss <- fmap (map read . words) getLine :: IO [Int] print $ solve ss solve :: [Int] -> Int solve (a:b:c:_) = a * b `div` 2
55
Project_CodeNet
2,019
import Control.Monad import Data.List import Data.Bits import Debug.Trace import Data.Maybe import qualified Data.ByteString.Char8 as C main :: IO () main = do [ab, bc, ca] <- readInts print $ solve ab bc ca solve :: Int -> Int -> Int -> Int solve ab bc ca = (if ab > bc && ab > ca then bc * ca else ...
519
Project_CodeNet
2,020
--{-# LANGUAGE BangPatterns #-} --{-# LANGUAGE ScopedTypeVariables #-} --{-# LANGUAGE FlexibleContexts #-} --{-# LANGUAGE ViewPatterns #-} --{-# LANGUAGE OverloadedStrings #-} --{-# LANGUAGE Strict #-} --{-# LANGUAGE NumericUnderscores #-} --{-# LANGUAGE BlockArguments #-} {-# LANGUAGE MultiWayIf #-} import qualified ...
1,282
Project_CodeNet
2,019
import Data.List main = do e<-getLine let (x:y:_)=sort $ map read (words e)::[Int] putStrLn $ show $ (x * y) `div` 2
47
Project_CodeNet
2,019
import Data.List(sort) main = (map read . words <$> getLine) >>= print.(\x -> product ((init.sort) x) `div` 2)
35
Project_CodeNet
2,019
{-# LANGUAGE FlexibleContexts #-} import Control.Monad import Control.Monad.State import Control.Monad.Reader import Control.Arrow -- import Control.Comonad import Data.Maybe import Data.List import Data.Either import Data.Bool import Data.Fixed import Data.Tuple import Data.Ratio import qualified Data.Map.Strict as M ...
658
Project_CodeNet
2,020
{-# LANGUAGE FlexibleInstances #-} {-# LANGUAGE TypeSynonymInstances #-} import Control.Applicative import Control.DeepSeq import Control.Monad import Control.Monad.ST import qualified Data.Array as A import qualified Data.Array.IArray as IA import ...
617
Project_CodeNet
2,019
import Control.Monad import Control.Applicative import Data.List getBysplit = map read . words <$> getLine main :: IO() main = do lst <- getBysplit :: IO [Int] let (a:b:c) = sort lst print $ a * b `div` 2
69
Project_CodeNet
2,020
import Control.Applicative main :: IO () main = solve <$> f >>= print where f = map read <$> words <$> getLine solve :: [Int] -> Int solve [a, b, _] = a * b `div` 2
57
Project_CodeNet
2,019
import Control.Applicative import Control.Monad import Data.List import Data.Array main = do [a, b, c] <- map (read::String -> Int) . words <$> getLine print $ (a * b) `div` 2
57
Project_CodeNet
2,019
import Data.List main :: IO () main = do [a, b, c] <- sort . map read . words <$> getLine print $ a * b `div` 2
43
Project_CodeNet
2,019
main=getLine>>=print.(\[a,b,c]->a*b*c`div`2`div`(max a(max b c))).map read.words
32
Project_CodeNet
2,019
main = print =<< flip div 2 . product . take 2 . map read . words <$> getLine
23
Project_CodeNet
2,020
main = do [ab,bc,_] <- map read . words <$> getLine print $ div (ab*bc) 2
31
Project_CodeNet
2,020
import Control.Monad import Data.Maybe import qualified Data.ByteString.Char8 as BS import Data.List readInt = fst . fromJust . BS.readInt readIntList = map readInt . BS.words getInt = readInt <$> BS.getLine getIntList = readIntList <$> BS.getLine main = do [x,y,_] <- getIntList print $ div (x*y) 2
85
Project_CodeNet
2,020
main=map read.words<$>getLine>>=print.(\(a:b:[c])->quot(a*b)2)
26
Project_CodeNet
2,019
main = do [x,y,_] <- map read . words <$> getLine print $ x*y `div` 2
30
Project_CodeNet
2,019
main = do [ab, bc, ca] <- map read . words <$> getLine print $ div (ab * bc) 2
32
Project_CodeNet
2,019
main = map read . words <$> getLine >>= print . (`div`2) . product . take 2
23
Project_CodeNet
2,019
import Control.Applicative main = do x <- words <$> getLine let xi = map read x :: [Int] putStrLn $ show $ div ((head xi) * (head $ tail xi)) 2
49
Project_CodeNet
2,019
main = do [ab, bc, _] <- map read .words <$> getLine print $ ab * bc `div` 2
32
Project_CodeNet
2,019
main = do [a,b,c] <- map read . words <$> getLine print $ a*b`div`2
28
Project_CodeNet
2,019
program main implicit None integer::a,b,c read*,a,b,c print"(i0)",a*b/2 end program main
32
Project_CodeNet
2,019
integer a,b read*,a,b print"(i0)",a*b/2 end
20
Project_CodeNet
2,020
program right_triangle implicit none integer :: a, b, c read(*,*) a, b, c write(*,'(i0)') a*b/2 end program right_triangle
46
Project_CodeNet
2,019
program aaa implicit none integer :: c, a, b read*, c, a, b write(*,'(i0)') a*c/2 end program
37
Project_CodeNet
2,020
program sample implicit none integer(8) :: a,b,c read(*,*) a,b,c if (a<=b .and. b<=c) then write(*,*) (a*b)/2 else if (b <=a .and. a<=c) then write(*,*) (a*b)/2 else if (a <=c .and. c<=b) then write(*,*) (a*c)/2 else if (b <=c .and. c<=a) then write(*,*) (c...
198
Project_CodeNet
2,020
program main use,intrinsic :: iso_fortran_env implicit none integer(int32):: a,b,c read*, a,b,c print'(i0)', a*b*c/max(a,b,c)/2 end program main
53
Project_CodeNet
2,020
program prob27 implicit none integer :: a,b,c read(*,*) a,b,c write(*,*) a*b/2 stop contains end program prob27
43
Project_CodeNet
2,019
program jihanki implicit none integer :: a, b, c read(*,*)a,b,c write(*,*)a*b/2 end program jihanki
45
Project_CodeNet
2,020
program main implicit none integer::a,b,c read(*,*)a,b,c write(*,*)a*b/2 stop end program main
39
Project_CodeNet
2,019
integer :: piyo1,piyo2 read*,piyo1,piyo2 print*,piyo1*piyo2/2 end
32
Project_CodeNet
2,019
program ABC116A implicit none integer(8)::i integer(8),dimension(3)::A read(5,*)(A(i),i=1,3) A=iqsort(A) print'(i0)',A(1)*A(2)/2 contains recursive function iqsort(ix) result(ires) integer(8), allocatable :: ires(:) integer(8), intent(in) :: ix(:) integer :: k if (s...
186
Project_CodeNet
2,019
program main implicit none integer i,j ! character ! integer,allocatable,dimension(:)::a integer a,b,c integer n read(*,*)a,b,c ! allocate(a(n)) ! read(*,*)a write(*,*)a*b/2 end program main
75
Project_CodeNet
2,020
program main implicit none integer :: a(3) read *, a print "(i0)", minval((/a(1) * a(2), a(2) * a(3), a(3) * a(1)/)) / 2 end program main
65
Project_CodeNet
2,019
`r ```?3`@i`d ```? `@i`d.6 ```?0i`d ```? `@i`d ```?1`@i`d``.2.4.0 ```?4i`d``.6.0.0 ```?7i`d```.1.0.8.0 i i ```?2i`d ```? `@i`d ```?2`@i`d``.3.8.4 ```?6i`d``.9.6.0 i i ```?3i`d ```? `@i`d ```?4`@i`d``.7.2.6 ```?5i`d``.9.2.4 i i ```?5i`d ```? `@i`d ```?1`@i`d``.2.1.0 ...
2,464
Project_CodeNet
2,019
import Foundation;let i=readLine()!.componentsSeparatedByString(" ");print(Int(i[0])!*Int(i[1])!/2)
30
Project_CodeNet
2,020
let cab: [Int] = readLine()!.split(separator: " ").map { Int($0)! } print(Int(cab[0]*cab[1]/2))
36
Project_CodeNet
2,020
import scala.collection.mutable.{HashSet => MSet} object Main extends App { val in = new java.util.Scanner(System.in) val h, w = in.nextInt println(h * w / 2) }
45
Project_CodeNet
2,019
object Main extends App { val line1 = io.StdIn.readLine.split(' ') val AB = line1(0).toInt val BC = line1(1).toInt val out = (AB * BC) / 2 println(out) }
57
Project_CodeNet
2,019
object Main { def main(args: Array[String]) { val Array(a,b,_) = io.StdIn.readLine().split(" ").map(_.toInt) println((a * b)/2) } }
44
Project_CodeNet
2,019
//import java.util.Scanner import java.io._ import java.nio.file.Files._ import java.nio.file.Path import java.util.StringTokenizer import scala.collection.immutable._ import scala.io.Codec /** * Scala implementation of a faster java.util.Scanner * See: http://codeforces.com/blog/entry/7018 */ class Scanner(r...
1,822
Project_CodeNet
2,019
import scala.io._ object Main { def main(args: Array[String]): Unit = { val Array(ab, bc, ca) = readLine.split(" ").map(_.toInt) println(ab * bc / 2) } }
50
Project_CodeNet
2,019
object Main { def main(args: Array[String]) = { val sc = new java.util.Scanner(System.in) val a,b,c = sc.nextInt println(a*b/2) } }
43
Project_CodeNet
2,019
object Main { def main(args: Array[String]): Unit = { val sc = new java.util.Scanner(System.in) val list = List.fill(3)(sc.nextInt).sorted println(list.head * list.tail.head / 2) } }
54
Project_CodeNet
2,019
object Main extends App { import scala.io.StdIn._ val Array(a, b, c) = readLine.trim.split(' ').map(_.toInt) println(a * b / 2) implicit class Extension[T](val value :T) extends AnyVal { @inline def let[A](@inline func: T ⇒ A): A = func(value) @inline def also(@inline func: T ⇒ Unit): T = {fun...
104
Project_CodeNet
2,019
import java.util.Scanner object Main { def main(args: Array[String]): Unit = { val sc = new Scanner(System.in) val A = Integer.parseInt(sc.next()) val B = Integer.parseInt(sc.next()) val C = Integer.parseInt(sc.next()) println(A * B / 2) } }
67
Project_CodeNet
2,019
object Main extends App { val in = scala.io.Source.stdin.getLines.toSeq val in2 = in.map(_.split(' ').map(_.toLong).toIndexedSeq).head val A = in2(0) val B = in2(1) println(A * B / 2) }
68
Project_CodeNet
2,019
import java.util.Scanner object Main extends App { val sc = new Scanner(System.in) val s = (1 to 3).map(_ => sc.nextInt()) .sorted println(s(0) * s(1) / 2) }
56
Project_CodeNet
2,019
import java.util.Scanner object Main { def main(args: Array[String]): Unit = { val sc: Scanner = new Scanner(System.in) val Array(ab, bc, _) = sc.nextLine.split(" ").map(_.toInt) println(ab * bc / 2) } }
60
Project_CodeNet
2,019
import scala.io.{StdIn => in} object Main extends App { val Array(ab, bc, cd) = in.readLine.split(" ").map(_.toInt) val ans = bc.toDouble * ab / 2 println(ans.toInt) }
51
Project_CodeNet
2,019
object Main extends App { var s = scala.io.StdIn.readLine() val inputArray = s.split(" ") println(inputArray(0).toInt * inputArray(1).toInt / 2) }
45
Project_CodeNet
2,019
object Main extends App { val Array(y1, y2, y3) = scala.io.StdIn.readLine.split(" ").map(_.toInt) println(y1*y2/2) }
38
Project_CodeNet
2,019
object Main { def main(args: Array[String]): Unit = { val sc = new java.util.Scanner(System.in) val AB, BC, _ = sc.nextInt() println(AB * BC / 2) } }
50
Project_CodeNet
2,019
object Main { import java.util.Scanner def readStrings(n: Int)(implicit sc: Scanner): Array[String] = Array.fill(n) { sc.next() } def readInts(n: Int)(implicit sc: Scanner): Array[Int] = Array.fill(n) { sc.nextInt() } def readLongs(n: Int)(implicit sc: Scanner): Array[Long] = Array.fill(n) { sc.nextLong() } ...
217
Project_CodeNet
2,019
import java.util.Scanner object Main { val sc = new Scanner(System.in) def main(args: Array[String]):Unit ={ val ab = sc.nextInt val bc = sc.nextInt val ca = sc.nextInt println(ab * bc / 2) } }
60
Project_CodeNet
2,019
object Main extends App { val sc = new java.util.Scanner(System.in) // val l = List.fill(5)(sc.nextInt) val a, b, c = sc.nextInt val ans = a * b / 2 println(ans) }
56
Project_CodeNet
2,019
import scala.io.StdIn object Main extends App { val Array(ab, bc, _) = StdIn.readLine() .split(" ") .map(_.toInt) println(ab * bc / 2) }
45
Project_CodeNet
2,020
object Main extends App { val sc = new java.util.Scanner(System.in) val A, B, _ = sc.nextInt() println(A * B / 2) }
37
Project_CodeNet
2,019
object Main { def main(args: Array[String]): Unit = { val sc = new java.util.Scanner(System.in) val n = Seq.fill(3)(sc.nextInt()) println(n(0) * n(1) / 2) } }
55
Project_CodeNet
2,020
import scala.io.StdIn._ object Main extends App { val Array(a,b,c) = readLine().split(" ").map(_.toInt) def solve() = { a * b / 2 } println(solve()) }
51
Project_CodeNet
2,019
object Main { def main(args: Array[String]): Unit = { var length = scala.io.StdIn.readLine.split(" ").map{_.toInt} length = length.sorted println(length(0)*length(1)/2) } }
52
Project_CodeNet
2,019
object Main extends App { var s = scala.io.StdIn.readLine() val inputArray = s.split(" ") println(inputArray(0).toInt * inputArray(1).toInt / 2) }
45
Project_CodeNet
2,019
object Main extends App { val sc = new java.util.Scanner(System.in) val a = sc.nextInt val b = sc.nextInt val c = sc.nextInt println(a * b / 2) }
47
Project_CodeNet
2,019
object Main extends App { val arr = io.StdIn.readLine().split(" ").map(_.toInt).sorted println(arr(0) * arr(1) / 2) }
39
Project_CodeNet
2,019
[-]>[-]> >++++++++++> >++++++++++> >++++++++++> >++++++++++> >++++++++++> [-]>[-]>[-]<< < >>>> >>+ [-<,----- -----[---------- ---------- -- [---------- ------<[->>+<<]>>[-<<++++++++++>>]<[-<+>]>+<] +>[-<->]< [- /* */ > ]>+< ]>]< <[-]++< [->->+<[>]>[[-<+>]>>>+<]<<<<] //正味の計算部分 >[-]>[-<+>]>>>[-<<<<<+>>...
260
Project_CodeNet
2,019
++[>>>[>+<-]<<+[->,<++++[>--------<-]>[<++++[>----<-]+>>[<++++++++++>-]<[>+<-]]<]<-]>>>[->[>+>+<<-]>[<+>-]>[->+[>>+<]>[<]>-[+>+<]<<<]<<<]>[-]>>>[<+>--]>>>[>+<-[<<+>]<[>]<-[+<--[<+>--]<+>>>>+>-<<<]>>-]>[<<+>>-]++++++++++[>>+>>>+>>>+<<<<<<<<<+>-]<<<<<<+[>[>>+<]>[<]>-[+>-<]<<-[>>+<]>[<]>-[+>[<<+>]<[>]<-[+<<->>]>]>>-[>>+<]...
278
Project_CodeNet
2,019
>++[>>>,>++++++++[-<---->]<[>++++[-<---->]<<[->++++++++++<]>[-<+>],>++++++++[-<---->]<]+[>++>[-]<[->>>+<<<<<[[->>>>+<<<<]>>>>>-<-<+<<<]>>>>>[-<<[->+<]<[-]<-<<->>>>>>]<[-<<<<+>>>>]<<]<<<+>>]<[->+<]>[-<+<<<+>>>>]+<<<<[[-]>>[->++<]>[-<+>]>-<<<<]>-[->>>>+<<<<]>>>>]<[-]<-<<<<<[->>>>[-<+>]<[->+>>>>+[<[-<+>]<---------[>>-<<++...
220
Project_CodeNet
2,019
,>++++++[<-------->-],>++++[<-------->-]<[>++++[<---->-]<<[>++++++++++<-] >>,>++++[<-------->-]<[,[-]<[>++++++++++<-]>>]] <[>+>++++[>++++[>++++++++<-]<-]<<-] >>>>[[-]<<+>>]<<[>>]<[[->+<-]>>>] ,>++++++[<-------->-],>++++[<-------->-]<[>++++[<---->-]<<[>++++++++++<-] >[<+>-],>++++[<-------->-]<[[-]<[>++++++++++<-]>[<+>-]...
317
Project_CodeNet
2,019
[https://github.com/n4o847/nazuki] ->>>>>>>>>>>>+>>>>>>>+>+>>>>>>>>>+>>>>>>>>+>>>>>>>>>>>>>>>>>+[->>>>>>>>[<[<[<[<[<[<[<[<->-]+<+[->-<]->>-]+<<+[->>-<[<->-]+<+[->-<]]->>>-]+<<<+[->>>-<[<[<->-]+<+[->-<]->>-]+<<+[->>-<[<->-]+<+[->-<]]]->>>>-]+<<<<+[->>>>-<[<[<[<->-]+<+[->-<]->>-]+<<+[->>-<[<->-]+<+[->-<]]->>>-]+<<<+[->>>...
28,355
Project_CodeNet
2,020
>,>++++[-<-------->]<[>++++[-<---->]<<[->++++++++++<]>[-<+>],>++++[-<-------->]<] >,>++++[-<-------->]<[>++++[-<---->]<<[->++++++++++<]>[-<+>],>++++[-<-------->]<] >,----------[>++++++[-<------>]<--<[->++++++++++<]>[-<+>],----------] <<<[->>>+<<<]>>>[-<<<+>>>>+<]<<[->>+<<]>>[-<<+>>>>+<<] >[>[-<-<+>>]>+<<<[->+>+>[-]<<<...
622
Project_CodeNet
2,020
IDENTIFICATION DIVISION. PROGRAM-ID. ATCODER. DATA DIVISION. WORKING-STORAGE SECTION. 01 indata PIC X(100). 01 a1 PIC 9(08). 01 a2 PIC 9(08). 01 a3 PIC 9(08). 01 r pic 9(08). 01 g pic 9(08). 01 r2 pic 9(08). 01 disp pic Z(20)9. ...
187
Project_CodeNet
2,019
let ab, bc, _ = Scanf.scanf " %d %d %d" @@ fun a b c -> a, b, c let _ = ab * bc / 2 |> Printf.printf "%d\n"
47
Project_CodeNet
2,019
Scanf.scanf " %d %d %d" @@ fun u v _ -> print_int @@ u*v/2
25
Project_CodeNet
2,019
let () = Scanf.scanf "%d %d %d" @@ fun ab bc _ -> Printf.printf "%d" (ab * bc / 2)
34
Project_CodeNet
2,019
let cosX a b c = a ** 2. +. b ** 2. -. c ** 2. let sinX c = sqrt (1. -. c ** 2.) let () = Scanf.scanf "%d %d %d\n" (fun a b c -> let af = float_of_int a in let bf = float_of_int b in let cf = float_of_int c in 0.5 *. af *. bf *. sinX (cosX af bf cf)) |> int_of_float |> print_int
120
Project_CodeNet
2,019
let f a b c = a*b/2;; let () = Scanf.scanf "%d %d %d" f |> Printf.printf "%d\n"
35
Project_CodeNet
2,020
let triangle a b c = a * b / 2 let () = Scanf.scanf "%d %d %d" triangle |> Printf.printf "%d\n"
35
Project_CodeNet
2,020
Scanf.scanf "%d %d %d" (fun a b c -> Printf.printf "%d\n" @@ (a * b) / 2)
33
Project_CodeNet
2,020
let () = Scanf.scanf "%d %d %d" @@ fun a b c -> Printf.printf "%d\n" @@ a * b / 2
34
Project_CodeNet
2,019
Printf.printf "%d\n" (Scanf.scanf "%d %d" (fun a b -> a * b / 2))
28
Project_CodeNet
2,019
let _ = let ab, bc, _ = Scanf.scanf "%d %d %d\n" (fun ab bc ca -> ab, bc, ca) in (ab * bc) / 2 |> print_int
51
Project_CodeNet
2,019
let () = Scanf.scanf "%d %d %d" @@ fun a b c -> Printf.printf "%d\n" @@ a * b / 2
35