4/06/2017

Geeksforgeeks Solution For " Right most non zero digit "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Right most non zero digit

Submit Your Solution :- Click Here 

Solution :- 

#include<iostream>
using namespace std;

int getFiveCount(long long* arr, int n){
    int fiveCount=0;
long long temp;
for(int i=0;i<n;i++){
   temp= arr[i];
   while(temp && !(temp%5)){
       fiveCount++;
       temp/=5;
   }
   arr[i]= temp;
    }
    return fiveCount;
}

long long eliminate2(long long* arr, int n, int fiveCount){
    long long temp;
    for(int i=0;i<n;i++){
  temp=arr[i];
  while(fiveCount && temp && !(temp&1)){
      temp>>=1;
      fiveCount--;
  }
  arr[i]=temp;
  if(!fiveCount)
      break;
    }
    return fiveCount;
}

int main()
 {
//code
int t,n;
long long arr[102];
cin >> t;
while(t--){
   cin >> n;
   for(int i=0;i<n;i++)
       cin >> arr[i];
   long long mod=1;
        int fiveCount= getFiveCount(arr,n);    
        int fiveRemains= eliminate2(arr,n,fiveCount);
        if(fiveRemains)
            mod=5;
        for(int i=0;i<n;i++)
            mod=(mod*(arr[i]%10))%10;
        if(mod==0)
            mod=-1;
        cout << mod <<endl;
}
return 0;
}

Output:-



Geeksforgeeks Solution For " Right most non zero digit "

Ghanendra Yadav

Ghanendra Yadav

Hello, I Am Ghanendra Yadav Owner of This Blog, I am professional Blogger and Programmer. I Love Programming, Logo Making, And Banner Designing. My Highest Qualification is MCA From NIT Warangal. You Can Find Me On Social Media Through Below Link And If You Have Any Query Related To Programming And Other Subject Comment Below or You Can Mail Me I Will Try To Answer Within 24 Hours Email:- yghanendra@student.nitw.ac.in

Find me on Social Media

Facebook | Twitter | Google+ | RSS Feed

No comments:

Post a Comment