@Arpit: Is there any requirement to do it other than by brute force?
Besides, I think it is rather clever brute force.
Dave
On Feb 25, 5:13 am, Arpit Sood <soodfi...@gmail.com> wrote:
> dave how is this different from brute force ?
>
>
>
>
>
> On Thu, Feb 24, 2011 at 8:56 PM, Dave <dave_and_da...@juno.com> wrote:
> > @Ashish: The code seems pretty straightforward, but okay. The outer
> > for-loop runs through the numbers that have 10-digit squares. The
> > squares are represented as 64 bit integers (type long long) because
> > some of them are larger than the maximum representable 32-bit
> > integers. For each number, the inner for-loop makes a tally of which
> > digits appear in the square of the number. The if-statement determines
> > whether the tally indicates that the square of the number has all ten
> > digits, in which case the digits are non-repeated as prescribed in the
> > problem statement.
>
> > Dave
>
> > On Feb 24, 5:25 am, ashish agarwal <ashish.cooldude...@gmail.com>
> > wrote:
> > > @dave..Can you please explain your logic ..
> > > Regards,
> > > Ashish
>
> > > On Thu, Feb 24, 2011 at 6:32 AM, Dave <dave_and_da...@juno.com> wrote:
> > > > Try this:
>
> > > > int i,k,n;
> > > > long long j,nsq;
> > > > for( n = 31623 ; n < 100000 ; ++n )
> > > > {
> > > > nsq = (long long)n * (long long)n;
> > > > j = nsq;
> > > > k = 0;
> > > > for( i = 0 ; i < 10; ++i )
> > > > {
> > > > k |= (1 << (j % 10));
> > > > j /= 10;
> > > > }
> > > > if( k == 01777 )
> > > > printf("%i %lli\n",n,nsq);
> > > > }
>
> > > > It finds 76 answers in the blink of an eye, the first being 32043^2
> > > > and the last being 99066^2.
>
> > > > Dave
>
> > > > On Feb 22, 3:17 pm, bittu <shashank7andr...@gmail.com> wrote:
> > > > > How to find a number of 10 digits (non repeated digits) which is a
> > > > > perfect square? perfect square examples: 9 (3x3) 16 (4x4) 25(5x) etc.
> > > > > Ten digit number example 1,234,567,890
>
> > > > > Thanks & Regards
> > > > > Shashank
>
> > > > --
> > > > You received this message because you are subscribed to the Google
> > Groups
> > > > "Algorithm Geeks" group.
> > > > To post to this group, send email to algogeeks@googlegroups.com.
> > > > To unsubscribe from this group, send email to
> > > > algogeeks+unsubscr...@googlegroups.com.
> > > > For more options, visit this group at
> > > >http://groups.google.com/group/algogeeks?hl=en.-Hide quoted text -
>
> > > - Show quoted text -
>
> > --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to algogeeks@googlegroups.com.
> > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
>
> --
> Regards,
> Arpit Sood- Hide quoted text -
>
> - Show quoted text -
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
