#include "header.h"
//function value of problem B 
int fB(Vector x,float *f,Vector *df,Matrix *ddf,Int3 spec)
{
	int i,j;
	float sum=0;
	float tmp=0;
	if(spec.f==1)           // spec.f==1 means we want function value
	{
		for(i=1;i<x.n-1;i++)
		{
			sum+=(float)sin(x.fp[i]*x.fp[i+1]+cos(x.fp[i-1]-x.fp[i]));  //inner stuff
		}
		*f=sum;
		printf("function value------------:%f\n",*f);
	}
	if(spec.df==1)           // spec.df==1 means we want derivarive function value which is vector
	{
		for(i=0;i<x.n;i++)
		{
		    tmp=0;	
		    if(i>2) tmp+=(float)cos(x.fp[i-1]*x.fp[i]+cos(x.fp[i-2]-x.fp[i-1]))*x.fp[i-1];
		    if(i>1 & i<x.n-1) tmp+=(float)cos(x.fp[i]*x.fp[i+1]+cos(x.fp[i-1]-x.fp[i]));
		    if (i<x.n-2) tmp+=(float)cos(x.fp[i+1]*x.fp[i+2]+cos(x.fp[i]-x.fp[i+1]))*(-sin(x.fp[i]-x.fp[i+1]));
		    df->fp[i]=tmp;	
		}
	}
	if(spec.ddf==1)           // spec.ddf==1 means we want derivative of derivarive function value which is matrix
	{
		for(i=0;i<x.n;i++)
		{
			for(j=0;j<x.n;j++)
			{		
				tmp=0;
				if(j==i-2)
				{
					if(i>2) tmp=sin(x.fp[i-1]*x.fp[i]+cos(x.fp[i-2]-x.fp[i-1]))*sin(x.fp[i-2]-x.fp[i-1]);
				}
				else if(j==i+2)
				{
					if(i<x.n-2) tmp=sin(x.fp[i+1]*x.fp[i+2]+cos(x.fp[i]-x.fp[i+1]))*x.fp[i+1]*sin(x.fp[i]-x.fp[i+1]);
				}
				else if(j==i-1)
				{
					if(i>2) tmp+=-sin(x.fp[i-1]*x.fp[i]+cos(x.fp[i-2]-x.fp[i-1]))*(x.fp[i-1]+sin(x.fp[i-2]-x.fp[i-1]))*x.fp[i-1]+cos(x.fp[i-1]*x.fp[i]+cos(x.fp[i-2]-x.fp[i-1]));
					if(i>1 & i<x.n-1) tmp+=sin(x.fp[i]*x.fp[i+1]+cos(x.fp[i-1]-x.fp[i]))*sin(x.fp[i-1]-x.fp[i]);
				}
				else if(j==i+1)
				{
					if(i>1 & i<x.n-1) tmp+=-sin(x.fp[i]*x.fp[i+1]+cos(x.fp[i-1]-x.fp[i]))*x.fp[i];
					if(i<x.n-2)	  tmp+=sin(x.fp[i+1]*x.fp[i+2]+cos(x.fp[i]-x.fp[i+1]))*(x.fp[i+2]+sin(x.fp[i]-x.fp[i+1]))*sin(x.fp[i]-x.fp[i+1])+cos(x.fp[i+1]*x.fp[i+2]+cos(x.fp[i]-x.fp[i+1]))*cos(x.fp[i]-x.fp[i+1]);
				}
				else if(j==i)
				{
					if(i>2)	tmp+=-sin(x.fp[i-1]*x.fp[i]+cos(x.fp[i-2]-x.fp[i-1]))*x.fp[i-1];
					if(i>1 & i<x.n-1) tmp+=-sin(x.fp[i]*x.fp[i+1]+cos(x.fp[i-1]-x.fp[i]))*(x.fp[i+1]+sin(x.fp[i-1]-x.fp[i]));
					if(i<x.n-2) tmp+=sin(x.fp[i+1]*x.fp[i+2]+cos(x.fp[i]-x.fp[i+1]))*sin(x.fp[i]-x.fp[i+1])*(-sin(x.fp[i]-x.fp[i+1]))+cos(x.fp[i+1]*x.fp[i+2]+cos(x.fp[i]-x.fp[i+1]))*(-cos(x.fp[i]-x.fp[i+1]));		
				}
				else tmp=0;
				ddf->fp[i*x.n+j]=tmp;	
			}
		}
	}
	return 0;
}