Write a program to find all triad numbers below 1000 where the second number is twice the first and the third is three times the first number?

Answer 1

#include

#include

int main()

{

int i,j,k,l,m,n,p,q,temp,fno,secno,thirdno;

int arr[1][9];

cout<<"---------------------------------------ABRAR TARIQ-------------------------------"<

cout<<"Here are the all possible combinations of the triad numbers between 1 to 1000 ! cheers !"<

int a=0;

for(i=100;i<=1000;i++)

{

for(j=i+1;j<=1000;j++)

{

if(j==2*i)

{

fno=i;

secno=j;

}

if(j==3*i)

{

thirdno=3*i;

}

}

k=fno/100;

temp=fno%100;

l=temp/10;

m=temp%10;

arr[0][0]=k;

arr[0][1]=l;

arr[0][2]=m;

k=secno/100;

temp=secno%100;

l=temp/10;

m=temp%10;

arr[0][3]=k;

arr[0][4]=l;

arr[0][5]=m;

k=thirdno/100;

temp=thirdno%100;

l=temp/10;

m=temp%10;

arr[0][6]=k;

arr[0][7]=l;

arr[0][8]=m;

for(n=0;n<1;n++)

{

for(p=0;p<9;p++)

{

for(q=p+1;q<9;q++)

{

if(arr[n][p]==arr[n][q]arr[n][p]==0arr[n][q]==0)

{

a=1;

}

if(a==1)

break;

}

if(a==1)

{

a=0;

break;

}

}

if(p==9&&q==9&&a==0)

{

cout<<<","<<<","<<<

cout<<"---And---"<

}

}

return 0;

}