🔒 Closed Guys patulong po

[SeenZone908]

Pa debug na po kasi di na talaga carry dapat example
Mag iinput ako ng 1 dapat gnito po ang output
1 2 3 5 8 13 21

Parang plus sa last digit number ba sana gets niyu po huhu

Ito po code ko

import java.util.*;
public class HelloWorld
{

public static void main(String []args)
{
int num =0;
int nextNum[]= new int[5];
Scanner input = new Scanner(System.in);

System.out.println("Enter 5 number");

for ( int count=0; count <= 4 ; count++)
{
System.out.println("Enter number "+(count+1));
num = input.nextInt();
nextNum[count] = num;
}
for (int list=0; list<=4;list++)
{
System.out.print(nextNum

• +" ");
  }
  
  }
  }

 

[iSinister]

//Input: 1
//Output: 1 2 3 5 8 13 21

import java.util.*;
public class HelloWorld{

public static void main(String []args){

int i,j=0,k=0;
int nextNum[]= new int[7];

Scanner input = new Scanner(System.in);

System.out.print("Enter a number: ");
nextNum[0] = input.nextInt();

for ( i=1 ; i<=6 ; i++){
if( i>=2 && i<7){j+=1;}
if( i>=3 && i<7){k+=1;}
nextNum = nextNum[j] + nextNum[k];
}

for (int x = 0; x<=6 ; x++){
System.out.print(nextNum[x]+" ");
}

}
}

 

[Jmrie_]

--psy bess baka alam mo to

 

[SeenZone908]

//Input: 1
//Output: 1 2 3 5 8 13 21

import java.util.*;
public class HelloWorld{

public static void main(String []args){

int i,j=0,k=0;
int nextNum[]= new int[7];

Scanner input = new Scanner(System.in);

System.out.print("Enter a number: ");
nextNum[0] = input.nextInt();

for ( i=1 ; i<=6 ; i++){
if( i>=2 && i<7){j+=1;}
if( i>=3 && i<7){k+=1;}
nextNum = nextNum[j] + nextNum[k];
}

for (int x = 0; x<=6 ; x++){
System.out.print(nextNum[x]+" ");
}

}
}

Error po ito
nextNum = nextNum[j] + nextNum[k];

 

[Jmrie_]

Error po ito
nextNum = nextNum[j] + nextNum[k];

may susuggest sana ako kaso bawal pala mag advertise dito

 

[SeenZone908]

//Input: 1
//Output: 1 2 3 5 8 13 21

import java.util.*;
public class HelloWorld{

public static void main(String []args){

int i,j=0,k=0;
int nextNum[]= new int[7];

Scanner input = new Scanner(System.in);

System.out.print("Enter a number: ");
nextNum[0] = input.nextInt();

for ( i=1 ; i<=6 ; i++){
if( i>=2 && i<7){j+=1;}
if( i>=3 && i<7){k+=1;}
nextNum = nextNum[j] + nextNum[k];
}

for (int x = 0; x<=6 ; x++){
System.out.print(nextNum[x]+" ");
}

}
}

Error po ito
nextNum = nextNum[j] + nextNum[k];

may susuggest sana ako kaso bawal pala mag advertise dito

Ano po sana yun

 

[Jmrie_]

Bawal boss eh mapapaglitan ako

Error po ito
nextNum = nextNum[j] + nextNum[k];

Ano po sana yun

 

[iSinister]

nextNum = nextNum[j] + nextNum[k];

sorry ewan ko kung bat nawala ung

 

[iSinister]

ayaw talaga e.. hahahaha eto yon check mo nlng

 

[SeenZone908]

ayaw talaga e.. hahahaha eto yon check mo nlng

sige sige bosss

 

[codyscott]

First, recognize the pattern. Meron siyang pattern.

int seed = 1 <----- or any number
int sum = 0;
int addend1 = sum;
in addend2 = seed;
int maximumCap = 100 <----any number para lang hindi siya mag loop ng magloop

FIRST PASS of LOOP:
sum = addend1 + addend2;
print sum
addend1 = addend2
addend2 = sum

SECOND PASS of LOOP:
sum = addend1 + addend2;
print sum
addend1 = addend2
addend2 = sum

THIRD PASS of LOOP:
sum = addend1 + addend2;
print sum
addend1 = addend2
addend2 = sum

...so on and so forth (until it reaches the maximum cap na ilalagay mo).... got it?

About 10 to 15 lines of code.

BTW, sa papel ko lang ito ginawa. Hindi ko pa nasusubukan sa code. Pero sigurado ako ito yung solution mo. (Kayang kaya mo na yan with this clue. Pero kung sirit na ipapakita ko ang actual code)

 

[iSinister]

eto ung logic nung code na ginawa ko.. kinomment ko nlng

 

[--psy]

Baka Fibonacci Series ang tinutukoy mo ts? If that's the case then I have a possible code for it.

 

[--psy]

Familiar kasi ang sequence of numbers eh tulad lang ng output sa Fibonacci Series ts.

 

[codyscott]

heto yung code para sa nakikita kong pattern.
(pls. correct me if I am wrong)...

 

[angelofmercy]

Ito naman yong ginawa ko mam based sa sinimulan mo.

 

[frenchie]

kung ako sa iyo, ang pinaka maganda at simpleng solution ay yung kay codyscott.
scalable siya....

 

[euls020]

heto yung code para sa nakikita kong pattern.
(pls. correct me if I am wrong)...

Ito mas nagets ko. bangis idol talaga. hehehe