Find abc which is a2+b2+c2=a+b+c

Question

1.00/5 (1 vote)

See more:

Hello,

So i have to make a program which finds abc, three digit number which is true to a2+b2+c2=a+b+c.(Dont know what was unclear on this in my first post...)I made a code for this but i dont know if its good because it gives me only 4 numbers in range of 100-1000.Can any1 check it pls if its correct.There is only 4 answers??Or i made smtg wrong and thats why i gives me only 4.Thx in advance

C#

static int a;
static int b;
static int c;
static int abc;
static int sum;
static int sum2;




public static void main(String [] args){

    for(abc=100;abc&lt;1000;abc++){

        a=abc/100;
        b=abc%100/10;
        c=abc%10;
        sum=a+b+c;

        sum2 = (int) (Math.pow(a, 2)+ Math.pow(b, 2)+Math.pow(c, 2));
    if(sum==sum2){
        System.out.println(" "+abc);

    }



    }

Posted 14-Mar-15 10:00am

Member 11524654

Updated 14-Mar-15 10:01am

v2

Add a Solution

Comments

Maciej Los 14-Mar-15 17:03pm

Are you sure your code is correct? It looks like you missed one bracket: }

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

BacchusBeale · Accepted Answer · 2015-03-14T10:53:00

Your answer is correct, this makes sense since if any digit was greater than 1 the condition must be false:

C#

public static void ABC()
    {
        int abc=0,a2b2c2=0,num=0;
        for(int a=0; a<10; a++)
        {
            for(int b=0; b<10; b++)
            {
                for(int c=0; c<10; c++)
                {
                    abc=a+b+c;
                    a2b2c2=a*a+b*b+c*c;
                    num=100*a+10*b+c;
                    if(abc == a2b2c2 && num>=100)
                        System.out.println(num);
                }
            }
        }
    }

Maciej Los · Accepted Answer · 2015-03-14T11:25:00

I do not have a lot experience with Java, so i tested your code (with small changes) in C#:

C#

for(int abc=100;abc<1000;abc++)
{
    int a=abc/100;
    int b=abc%100/10;
    int c=abc%10;
    int sum=a+b+c;
    int sum2 = (int)(System.Math.Pow(a,2) + System.Math.Pow(b,2) + System.Math.Pow(c,2));
    if(sum==sum2)
    {
        Console.WriteLine("abc={0} a={1} b={2} c={3} sum={4} sum2={5}", abc, a, b, c, sum, sum2);
    }
}

and using Linq query too:

C#

var qry = Enumerable.Range(100, 900).
            Select(z=> new{a = (int)z/100, b = (int)z%100/10, c = (int)z%10}).
            Select(n=> new{a = n.a, b = n.b, c = n.c, sum = n.a+n.b+n.c, sum2 = (int)(Math.Pow(n.a,2) + Math.Pow(n.b,2) + Math.Pow(n.c,2))}).
            Where(x=>x.sum==x.sum2).
            Select(f=>f);

Result is the same:

a b c sum sum2
1 0 0 1 1
1 0 1 2 2
1 1 0 2 2
1 1 1 3 3

Find abc which is a2+b2+c2=a+b+c

2 solutions

Solution 1

Solution 3

Add your solution here

Preview 0