Code: Select all
10 1Code: Select all
Between 1 and 10, 9 generates the longest sequence of 19 values.
"The largest value in the sequence will not be larger than can be accomodated in a 32-bit Pascal LongInt or C long" - that sounds like an good enough specification of input limits to me.sazzadcsedu wrote:what is the input limit for this problem??
plz someone tell me.
Code: Select all
#include<iostream>
#include<map>
#include<cmath>
using namespace std;
int main()
{
long long m,n;
map<long long,long long> mp;
long long c;
long long max1,max2;
mp[1]=3;
while(1)
{
scanf("%lld %lld",&m,&n);
if(m==0 && n==0)
break;
max1=0;
max2=0;
for(long long i=min(m,n);i<=max(m,n);i++)
{
c=0;
long long tmp=i;
if(mp[i])
c=mp[i];
else
{
while(i!=1)
{
c++;
if(i%2==0)
i/=2;
else
i=3*i+1;
}
mp[tmp]=c;
}
if(c>max2)
{
max2=c;
max1=tmp;
}
}
printf("Between %lld and %lld, %lld generates the longest sequence of %lld values.\n",min(m,n),max(m,n),max1,max2);
}
}
Code: Select all
#include<iostream>
#include<map>
#include<cmath>
using namespace std;
int main()
{
long long m,n;
map<long long,long long> mp;
long long c;
long long max1,max2;
mp[1]=3;
while(1)
{
scanf("%lld %lld",&m,&n);
if(m==0 && n==0)
break;
max1=0;
max2=0;
for(long long i=min(m,n);i<=max(m,n);i++)
{
c=0;
long long tmp=i;
if(mp[i]) // checking if the cycle already calculated
c=mp[i];
else
{
while(i!=1)
{
c++;
if(i%2==0)
i/=2;
else
i=3*i+1;
if(mp[i] && i!=1) // here i am adding the sub-cycle i previously calculated
{
c+=mp[i];
break;
}
}
mp[tmp]=c; // here i m memoizing
}
if(c>max2)
{
max2=c;
max1=tmp;
}
}
printf("Between %lld and %lld, %lld generates the longest sequence of %lld values.\n",min(m,n),max(m,n),max1,max2);
}
}
Code: Select all
# include <stdio.h>
# include <stdlib.h>
int ackerman (long long number)
{
int count = 0;
do
{
if ((number % 2) == 0) number = number/2;
else number = (number*3) + 1;
count++;
}
while (number != 1);
return (count);
}
int main ()
{
long long start, end;
int max;
long long number;
int result;
while (scanf("%I64d %I64d", &start, &end) == 2)
{
if ((start == 0) && (end == 0)) break;
max = 0;
if (start > end) start ^= end ^= start ^= end;
for (long long i = start; i <= end; i++)
{
result = ackerman(i);
if (result > max)
{
number = i;
max = result;
}
}
printf ("Between %I64d and %I64d, %I64d generates the longest sequence of %d values.\n", start, end, number, max);
}
}
Code: Select all
1 2
1 10000
30000 100000
1 1000000
2000000000 2001000000
1234567890 1235678901
0 0
Code: Select all
Between 1 and 2, 1 generates the longest sequence of 3 values.
Between 1 and 10000, 6171 generates the longest sequence of 261 values.
Between 30000 and 100000, 77031 generates the longest sequence of 350 values.
Between 1 and 1000000, 837799 generates the longest sequence of 524 values.
Between 2000000000 and 2001000000, 2000001502 generates the longest sequence of 804 values.
Between 1234567890 and 1235678901, 1234593769 generates the longest sequence of 731 values.
Code: Select all
# include <stdio.h>
# include <stdlib.h>
int ackerman (long long number)
{
int count = 0;
do
{
if ((number % 2) == 0) number = number/2;
else number = (number*3) + 1;
count++;
}
while (number != 1);
return (count);
}
int main ()
{
long long start, end;
int max;
long long number;
int result;
while (scanf("%I64d %I64d", &start, &end) == 2)
{
if ((start == 0) && (end == 0)) break;
max = 0;
if (start > end) start ^= end ^= start ^= end;
for (long long i = start; i <= end; i++)
{
result = ackerman(i);
if (result > max)
{
number = i;
max = result;
}
}
printf ("Between %I64d and %I64d, %I64d generates the longest sequence of %d values.\n", start, end, number, max);
}
}
Code: Select all
1 2
1 10000
30000 100000
1 1000000
2000000000 2001000000
1234567890 1235678901
0 0
Code: Select all
Between 1 and 2, 1 generates the longest sequence of 3 values.
Between 1 and 10000, 6171 generates the longest sequence of 261 values.
Between 30000 and 100000, 77031 generates the longest sequence of 350 values.
Between 1 and 1000000, 837799 generates the longest sequence of 524 values.
Between 2000000000 and 2001000000, 2000001502 generates the longest sequence of 804 values.
Between 1234567890 and 1235678901, 1234593769 generates the longest sequence of 731 values.
p.cc: In function ‘int main()’:
p.cc:26: warning: format ‘%I64d’ expects type ‘int*’, but argument 2 has type ‘long long int*’
p.cc:26: warning: format ‘%I64d’ expects type ‘int*’, but argument 3 has type ‘long long int*’
p.cc:32: warning: operation on ‘start’ may be undefined (there's another predefined symbol 'start', you don't want to mess with it)
p.cc:43: warning: format ‘%I64d’ expects type ‘int’, but argument 2 has type ‘long long int’
p.cc:43: warning: format ‘%I64d’ expects type ‘int’, but argument 3 has type ‘long long int’
p.cc:43: warning: format ‘%I64d’ expects type ‘int’, but argument 4 has type ‘long long int’
p.cc:23: warning: ‘number’ may be used uninitialized in this function
No, it isn't! Your output is screwed up on Linux, because %I64d is not a standard printf specifier for type 'long long'.The output is...
:D Code: Select all
#include <iostream>
using namespace std;
int main()
{
int count=0,max=0,temp;
long int i,j,k,p,gen=0;
while(scanf("%ld %ld",&i,&j)==2)
{
if(i==0&&j==0)
break;
if(i>j)
{temp=i;
i=j;
j=temp;
}
max=0;
gen=0;
for (k=i;k<=j;k++)
{
p=k;
while (p!=1)
{
if (p%2==0)
p=p/2;
else
p=3*p+1;
count=count+1;
}
if (k==1)
{count=1;}
if(max<count)
{max=count;
gen=k;
}
count=0;
}
printf("Between %ld and %ld, %ld generates the longest sequence of %ld values.\n",i,j,gen,max);
}
return 0;
}