Skip to main content

A Very Big Sum C and Java Solution

Problem:
You are given an array of integers of size . You need to print the sum of the elements in the array, keeping in mind that some of those integers may be quite large.
Input Format
The first line of the input consists of an integer . The next line contains  space-separated integers contained in the array.
Output Format
Print a single value equal to the sum of the elements in the array.
Constraints

Sample Input
5
1000000001 1000000002 1000000003 1000000004 1000000005
Output
5000000015
Note:
The range of the 32-bit integer is .
When we add several integer values, the resulting sum might exceed the above range. You might need to use long long int in C/C++ or long data type in Java to store such sums.
Solution:

// C Solution

#include 
#include 
#include 
#include 

int main()
{
    long long int a[10],n,i,sum=0;
    scanf("%lld",&n);
    for(i=0;i
// Java Solution

import java.io.*;
import java.util.*;

public class VeryBigSum {

    public static void main(String[] args) {
       
        Scanner sc = new Scanner(System.in);
        sc.nextLine();
        String[]numArray = sc.nextLine().split(" ");
        
        long sum = 0;
        for(String num:numArray){
            if(!num.equals("")){
                sum+=Long.parseLong(num);
            }
        }
        System.out.println(sum);
    }
}

Comments

Popular posts from this blog

Killjee and easy problem

Killjee is solving an easy problem. Given an array  a a  containing  N N  positive integers. You need to find the magic value of the array. Magic value of an array is  ∑ N i = 1 ( b i i ) ∑ i = 1 N ( b i i ) . where,  b i b i  is number of set bits of  a i a i . Find and print the answer  Modulo   ( 10 10 + 11 ) ( 10 10 + 11 ) INPUT CONSTRAINTS 1 ≤ N ≤ 10 5 1 ≤ N ≤ 10 5 1 ≤ a i ≤ 10 9 1 ≤ a i ≤ 10 9 INPUT FORMAT First line of input contains a single integer  N N . Next line contains  N N  space separated integers, elements of array  a a . OUTPUT FORMAT Output a single integer, magic value of the array. Sample Input 3 1 2 4 Sample Output 3 Explanation b [ 1 ] = 1 , b [ 2 ] = 1 b [ 1 ] = 1 , b [ 2 ] = 1  and  b [ 3 ] = 1 b [ 3 ] = 1  so, summation of  b [ i ] i b [ i ] i  =  1 + 1 + 1 = 3 1 + 1 + 1 = 3 . Note:  Your code should be able to c...

Write a program to insert an element in the particular position in a given Linkedlist TCS Question

Input In the first line, there are two integer numbers (X and P) will be given. First number(X) is the element to be inserted into the linked list, Second number(P) is the position where the element X to be inserted in the linkedlist. In second line, You are provided with a set of integer elements as a linkedlist (Ni, i is 0,1,…n) followed by white spaces and ends with NULL indicates end of linkedlist. Output You have to print the new linkedlist elements after the insertion Examples: Input : 3 0 1 2 NULL Output : 3 1 2 NULL // Java program to insert an element in the particular position in a given Linkedlist import java.util.Scanner; class LinkedList { Node head; // head of list /* Linked list Node*/ class Node { int data; Node next; Node(int d) { data = d; next = null; } } /* Inserts a new Node at front of the list. */ public void push(int new_data) { /* 1 ...

Comparing large numbers Write a program to check whether a given relation is true for a given pair of numbers.

Input You are provided with an unknown number of test cases. Each test case consists of a natural number, which is followed by a white space, relational operator (==, !=, >= or <=), white space, and another natural number. All test cases are separated by a new line character. You can assume that no number has more than 1000 digits. Output A binary sequence should appear as the output. ith element of the sequence should be equal to 1 or 0, depending on whether the corresponding relation is true or false. All elements of the sequence should be separated with a new line character. Examples: Input : 100 == 200 200 <= 100 200 != 100 Output : 0 0 1 contents = [] variable = [] i=0 while True: try: line = raw_input("") except EOFError: break contents.append(line) for val in contents: variable = contents[i].split(" ") if variable[1]== '==': if int(variable[0]) == int(variable[2]): print 2-1 ...