Short Problem Definition:
Calculate and print the sum of the elements in an array, keeping in mind that some of those integers may be quite large.
Link
Complexity:
time complexity is O(N)
space complexity is O(1)
Execution:
Just add all of this together. No magic.
Solution:
|
1
2
3
4
5
|
#!/usr/bin/pyif __name__ == '__main__': t = input() n = map(int, raw_input().split()) print sum(n) |
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
# RUSTuse std::io;fn get_number() -> u32 { let mut line = String::new(); io::stdin().read_line(&mut line).ok().expect("Failed to read line"); line.trim().parse::<u32>().unwrap()}fn get_numbers() -> Vec<u32> { let mut line = String::new(); io::stdin().read_line(&mut line).ok().expect("Failed to read line"); line.split_whitespace().map(|s| s.parse::<u32>().unwrap()).collect()}fn main() { get_number(); let sum = get_numbers().iter().fold(0u64, |a, &b| a + b as u64); println!("{}", sum)} |
