Project Euler #13: Large sum | Hackerrank | Project Euler

  Large sum

Work out the first ten digits of the sum of N 50 - digit numbers.

Input Format

First line contains N, next N lines contain a 50 digit number each.

Constraints

1<=N<=10^3

Output Format

Print only first 10 digit of the final sum

Sample Input

5

37107287533902102798797998220837590246510135740250

46376937677490009712648124896970078050417018260538

74324986199524741059474233309513058123726617309629

91942213363574161572522430563301811072406154908250

23067588207539346171171980310421047513778063246676

Sample Output

2728190129

Explanation

Summing the numbers we get 2728190129820036131461476701043585006837989465343, first 10 digits are 2728190129.

Solution in python:

n = int(input())

tot=0

for i in range(n):

    a=int(input())

    tot=int(tot)+a;

while (tot >= 10000000000):

    tot = tot // 10

print(tot)

You can also run it on an online IDE :

https://ide.geeksforgeeks.org/40288644-2c69-4867-89bc-2432afbb48a5

Your feedback are always welcome! If you have any doubt you 

can contact me or leave a comment!  

Happy Coding!! Cheers!!!

Project Euler #34: Digit factorials | Hackerrank | Project Euler

 Digit factorials 

19 is a curious number, as 1!+9!=1+362880=362881 which is divisible by 19.

Find the sum of all numbers below N which divide the sum of the factorial of their digits.

Note: as 1!,2!,...,9! are not sums they are not included.

Input Format

Input contains an integer N

Constraints

10<=N<=10^5

Output Format

Print the answer corresponding to the test case.

Sample Input

20

Sample Output

19

Solution:

#include <cmath>

#include <cstdio>

#include <vector>

#include <iostream>

#include <algorithm>

using namespace std;

int main() {

    long long n;

    scanf("%lld",&n);

    long long total=0;

    for(long long i=10;i<=n;i++)

    {

        long long m,k,sum=0;

        k=i;

        while(k>0)    

         {   

         long long fact=1;

         m=k%10; 

         if(m==0)

         fact=1;

         else{

         for(long long j=1;j<=m;j++)  

         fact*=j;

         }

         sum+=fact;

         k=k/10;

         }

         //cout<<sum<<endl;

         if(sum%i==0)

          total+=i;

    }

     cout<<total;

    return 0;

}

You can also run it on an online IDE :

https://ide.geeksforgeeks.org/d823a9e4-936e-4127-b9e9-21a8aef2a7f0

Your feedback are always welcome! If you have any doubt you 

can contact me or leave a comment!  

Happy Coding!! Cheers!!!

Project Euler #22: Names scores | Hackerrank | Project Euler

 Names scores

You are given around five-thousand first names, begin by sorting it into alphabetical order. Then working out the alphabetical value for each name, multiply this value by its alphabetical position in the list to obtain a name score.

For example, when the list in sample is sorted into alphabetical order, PAMELA, which is worth 16 + 1 + 13 + 5 + 12 +1 = 48, is the 5th name in the list. So, PAMELA would obtain a score of 5*48=240.

You are given Q queries, each query is a name, you have to print the score.

Input Format

The first line contains an integer N, i.e., number of names.

Next N lines will contain a Name.

Followed by integer Q followed by Q lines each having a word.

Constraints

1<=N<=5200

length of each word will be less than 

1<=Q<=100

Output Format

Print the values corresponding to each test case.

Sample Input

5

ALEX

LUIS

JAMES

BRIAN

PAMELA

1

PAMELA

Sample Output

240

Solution:

#include <cmath>

#include <cstdio>

#include <vector>

#include <iostream>

#include <algorithm>

using namespace std;

int getIndex(vector<string> names, string K)

{

    auto it = find(names.begin(), names.end(), K);

    if (it != names.end()) 

    {

        int index = it - names.begin();

        return index ;

    }

    else {

        return -1 ;

    }

}

bool mycomp(string a, string b){

    return a<b;

}

vector<string> alphabaticallySort(vector<string> a){

    int n=a.size();

    sort(a.begin(),a.end(),mycomp);

    return a;

}

int main()

{   

    int n,q;

    scanf("%d",&n);

    vector<string> names;

    string name;

    for(int i=0;i<n;i++){

        cin>>name;

        names.push_back(name); 

    }

    names=alphabaticallySort(names);

    scanf("%d",&q);

    for(int q1=0;q1<q;q1++)

    {

      string query;

      int ind,sum=0;

      cin>>query;

      ind=getIndex(names, query);

      for(int j=0;j<query.length();j++)

            sum+=(int)(query[j])-64;

      cout<<sum*(ind+1)<<endl;   

    }

    return 0;

}

You can also run it on an online IDE :

https://ide.geeksforgeeks.org/1b73b19d-d1a5-4442-8cff-0886dc90c492

Your feedback are always welcome! If you have any doubt you 

can contact me or leave a comment!  

Happy Coding!! Cheers!!!

Project Euler #8: Largest product in a series | Hackerrank | Project Euler

 Largest product in a series

Find the greatest product of K consecutive digits in the N digit number.

Input Format

First line contains T that denotes the number of test cases.

First line of each test case will contain two integers N & K.

Second line of each test case will contain a N digit integer.

Constraints

1<=T<=100

1<=K<=7

K<=N<=1000

Output Format

Print the required answer for each test case.

Sample Input 0

2

10 5

3675356291

10 5

2709360626

Sample Output 0

3150

0

Explanation 0

For 3675356291 and selecting K=5 consecutive digits, we have 36753, 67535, 75356, 53562, 35629 and 56291. Where 6*7*5*3*5 gives  maximum product as 3150

For 2709360626, 0 lies in all selection of 5 consecutive digits hence maximum product remains 0

Solution:

#include <map>

#include <set>

#include <list>

#include <cmath>

#include <ctime>

#include <deque>

#include <queue>

#include <stack>

#include <string>

#include <bitset>

#include <cstdio>

#include <limits>

#include <vector>

#include <climits>

#include <cstring>

#include <cstdlib>

#include <fstream>

#include <numeric>

#include <sstream>

#include <iostream>

#include <algorithm>

#include <unordered_map>

using namespace std;

int main(){

    int t;

    cin >> t;

    for(int a0 = 0; a0 < t; a0++){

        int n;

        int k;

        cin >> n >> k;

        string num;

        cin >> num;

    int j=k;

    int l=0;

    int max=0;

    while(j<=n)

    {

        int mul=1;

        for(int i=l;i<j;i++)

        {

            mul=(int)(num[i]-48)*mul;

        }

    

        j++;

        l++;

        

        if(mul>max)

        max=mul;

    }

     cout<<max<<endl;

    }

    return 0;

}

You can also run it on an online IDE :

https://ide.geeksforgeeks.org/1a3d68dc-6e98-408d-9c36-f0dd139e8f4d

Your feedback are always welcome! If you have any doubt you 

can contact me or leave a comment!  

Happy Coding!! Cheers!!!