Very Big Fibonacci Number!

#1

This problem has constrain as 0 < n < 100, and we have to compute n*(n+1)/2 Fibonacci number which is very large.
so the answer for even n = 15 comes out wrong, I have used long long int also but still its capacity is not enough.

What should I do?

here is the code -

#include

using namespace std;

int main()
{

int n;

cin>>n;

long long int curr;
long long int p1=0;
long long int p2=1;

for(int i=1;i<=n;i++)
{
	for(int j=1;j<=i;j++)
	{
		if(i==1 && j==1)
			cout<<"0";
		else if(i==2 && j==1)
			cout<<"1\t";
		else
		{
			curr = p1 + p2;
			cout<<curr<<"\t";
			p2 = p1;
			p1 = curr;
			
		}
	}
	cout<<endl;
}


return 0;

}

#2

@Abhishek_17_03,
Please share a Coding Blocks IDE link of your code.

#3

Hey,
There is some issue with the link generation.
So I am pasting the code here.

#include
#include
using namespace std;
int main() {
int n;
cin>>n;

long long int curr;
long long int p1=0;
long long int p2=1;

for(int i=1;i<=n;i++)
{
	for(int j=1;j<=i;j++)
	{
		if(i==1 && j==1)
			cout<<"0";
		else if(i==2 && j==1)
			cout<<"1\t";
		else
		{
			curr = p1 + p2;
			cout<<curr<<"\t";
			p2 = p1;
			p1 = curr;
			
		}
	}
	cout<<endl;
}


return 0;

}

#4

@Abhishek_17_03,
I said Coding Blocks IDE link. Don’t just paste your code here.
Goto Coding Blocks IDE(<–click here!!!), Paste your code, Hit Save, share the link here.

#5

Here is the link -
Sorry it was not working earlier.

#6

Dude your code is not even working correctly for n=3, leave n->100.

#7

Try this

#8

@Abhishek_17_03,
Try submitting it.

#9

Yeah it works, such a silly mistake.
Thanks