100 - The 3n + 1 problem

[abhi]

well ok ... i still dont know if u have got AC but anyway this is the problem

Code: Select all

The integers i and j must appear in the output in the same order in which they appeared in the input 

your code doesnt do it because you swap the two integers. it prints i and j in non decreasing order for each case.

[sml]

well ok ... i still dont know if u have got AC but anyway this is the problem

Code: Select all

The integers i and j must appear in the output in the same order in which they appeared in the input 

your code doesnt do it because you swap the two integers. it prints i and j in non decreasing order for each case.

Yeah, this caught me, too. Made me learn to read and reread the problems before submitting, but there are still some evil ones out there that assume you're doing very strict management of the input, which is annoying.

[newton]

Salamo Aleko
One of the ways to get ac is to check on range on fly
make a function that get a cycle of a number

Then in main() procees directly on the range.....Then try to solve 371

i do not understand you. plz make it easier to be understood.

[jtmh]

Instead of computing all the cycle lengths in advance, compute one only when necessary.

[ksjones]

I

[kolpobilashi]

i think you are "xtremely" new!! when there is a sticky about any problem then creating a new thread is a kind of crime..besides you should read all the previous posts before posting a new one.if you want to find previous posts go to the search option.

and for this problem just look at the top of this volume.there's a huge no. of discussions waiting to help you!!!

[jacksh]

why it isWA?
#include<iostream>
using namespace std;
long int fun(long int n,long int i)
{
if(n==1)return i;
if(n%2==0)
return fun(n/2,i+1);
else return fun(3*n+1,i+1);
}
int main()
{
long int a,b;
int max=1;

while(cin>>a>>b)
{
if(a>b){
long int temp;
temp=a;
a=b;
b=temp;

}
for(int i=a;i<=b;++i)
{
long int j;
j=fun(i,1);
if(max<j)max=j;
}
cout<<a<<" "<<b<<" "<<max<<endl;
}
return 0;


}

[mf]

The integers i and j must appear in the output in the same order in which they appeared in the input

[David Buzatto]

Hi!
I already posted my problem, but i did

[Darko]

There can be a case where n1 > n2. Print them before you swap them.

[David Buzatto]

Hi Darko. I tried to do what you said but it didn

[Darko]

Why do you go from n1+1 to n2? why not from n1?

[David Buzatto]

Darko, you were right!
Thanx!

[jacksh]

thank you

[trantri]

Hello everybody,
Do you know what version of Java is supported by the robot? In the problem 100, I use String.split() method and it always complain "Compile error", but when I change to use StringTokenizer class instead, I get "Accepted".

Thank you