#include <iostream> #include <algorithm> #include <vector> using namespace std; int main() { int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; ++i) cin >> v[i]; ranges::sort(v); for (int i = 0; i < n; ++i) cout << v[i] << " \n"[i == n - 1]; return 0; }
#[allow(unused_must_use)] fn main() { loop { let mut s = String::new(); std::io::stdin().read_line(&mut s); let mut two = s.split_whitespace().map(|s| s.parse::<i64>()); match (two.next(), two.next()) { (Some(Ok(a)), Some(Ok(b))) => println!("{}", a + b), _ => { break; } } } }Haskell:
import System.IO (isEOF) main :: IO() main = do done <- isEOF if not done then do line <- getLine let a = (read (takeWhile (/= ' ') line) :: Int) let b = (read (drop 1 (dropWhile (/= ' ') line)) :: Int) putStrLn (show (a+b)) main else return ()
sudo pkill -9 judged sudo judgedHaskell: https://github.com/lab530/AHUCM_OJ_ref/commit/dc3402c29