Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8522657
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 11, 20262026-06-11T07:11:11+00:00 2026-06-11T07:11:11+00:00

I am solving SPOJ problem FLIB and I have tried implementing this using Maps

  • 0

I am solving SPOJ problem FLIB and I have tried implementing this using Maps like this –

long long FiboSum(long long n) {
    if(n==1||n==0) return n;
    if(fiboDict.count(n)) return (long long) fiboDict.at(n);
    if(n%2==0) { 
        //calculate term -- value to that key
        fiboDict.insert(pair<long,long>(n,term));
    }
    else { 
        //calculate term
        fiboDict.insert(pair<long,long>(n,term));
    }
    return (long long) fiboDict.at(n);
}

fiboDict is the map, but the problem needs me to calculate for ( 0 <= n < 2^51) but KEY value can’t hold such high values, and I am getting Error

terminate called after throwing an instance of 'std::out_of_range' what():  
map::at

How could I make it hold large values? or If there is alternative then please suggest.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-11T07:11:12+00:00Added an answer on June 11, 2026 at 7:11 am

    Why dont you make map of :

    pair<long long,long long>
    

    then?

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I tried solving this problem in SPOJ using Booth Algorithm in O(n) time, but
I am solving this problem. I am implementing cycling mapping, I have 4 processors,
I'm having trouble solving this problem. I have to find all simple paths starting
Continue solving this problem , i've found couple of 'org.hibernate.impl.SessionFactoryImpl' memory leaks using MAT
I am have difficulties solving this problem: For a positive number n, define C(n)
I tried solving the following problem using the SuanShu optimization library, with no success.
I was solving this problem on SPOJ We are to calculate ( (P^N) +
I have a trouble solving out this fiddle. When i put limits i am
I was practicing the dynamic programming problem on SPOJ. But I have no idea
I am solving the following problem: Suppose I have a list of software packages

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.