Smart Programmer On

#include<iostream> #include<conio.h> using namespace std; int main() { int number1,number2; int sum=0; cout<<"\t\t\t\tPerfect Number"; again: { cout<<"\n1. Find in giver range.\n2. Check a number.\nChoice: "; cin>>number2; switch (number2) { case 1: { cout<<"\nEnter lower bound : "; cin>>number1; cout<<"Enter upper bound : "; cin>>number2; cout<<"Pefect number is  : "; for(int i=number1;i<=number2;i++) { for(int j=1;j<i;j++) { if(i%j==0) { sum=sum+j; } } if(sum==i) cout<<i<<"\t"; sum=0; } } break; case 2: { cout<<"Enter Number : "; cin>>number1; for(int i=1;i<number1;i++) if(number1%i==0) sum=sum+i; if(sum==number1

#include<iostream> #include<conio.h> using namespace std; int main() { int number1,number2; int sum=0; cout<<"\t\t\t\tPerfect Number"; cout<<"\nEnter lower bound : "; cin>>number1; cout<<"Enter upper bound : "; cin>>number2; cout<<"Pefect number is : "; for(int i=number1;i<=number2;i++) { for(int j=1;j<i;j++) { if(i%j==0) { sum=sum+j; } } if(sum==i) cout<<i<<"\t"; sum=0; } getch(); return 0; } Output:-

#include<stdio.h> #include<conio.h> void main() { int A[10],B[10]; //two array's of 10 same data type elements printf("Enter 10 elements in array A : "); for(int i=0;i<10;i++) { scanf("%d",&A[i]); }                  for(int i=0;i<10;i++) { B[i]=A[i]; } printf("Array A = "); for(int i=0;i<10;i++) { printf("%d   ",A[i]); }                  printf("\nArray B = ");                  for(int i=0;i<10;i++) {   printf("%d   ",B[i]); } getch(); }

#include<iostream> #include<conio.h> using namespace std; int size=10; int main() { int sum=0; int A[size],B[size]; //two array of 10 same data type elements cout<<"Enter 10 elements in array A : "; for(int i=0;i<10;i++) { cin>>A[i]; } for(int i=0;i<10;i++) { B[i]=A[i];              //copying in elements of arrya A in array B } cout<<"Array A = "; for(int i=0;i<10;i++) { cout<<A[i]<<"  "; } cout<<"\nArray B = "; for(int i=0;i<10;i++) { cout<<B[i]<<"  "; } getch(); }

#include<stdio.h> #include<conio.h> void main() {                  int sum=0;                             //initially sum = 0; int array[10]; //an array of 10 same data type elements printf("Enter 10 elements : "); for(int i=0;i<10;i++) { scanf("%d",&array[i]);                                sum=sum+array[i];          // sum is updated every time after entering new value in array } printf("10 elements you enterd are: "); for(int i=0;i<10;i++) { printf("%d   ",array[i]); }                 printf("\nSum  of all elements you entered is :  %d"sum);   // printing sum of all elements getch(); }

#include<iostream> #include<conio.h> using namespace std; int size=10; int main() { int sum=0; int array[size]; //an array of 10 same data type elements cout<<"Enter 10 elements : "; for(int i=0;i<10;i++) { cin>>array[i]; sum=sum+array[i]; } cout<<"10 elements you enterd are: "; for(int i=0;i<10;i++) { cout<<array[i]<<"   "; } cout<<"\nSum of all elements you entered is : "<<sum; getch(); return 0; } output: -

#include<stdio.h> #include<conio.h> void main() { int array[10]; //an array of 10 same data type elements printf("Enter 10 elements : "); for(int i=0;i<10;i++) { scanf("%d",&array[i]); } printf("10 elements you enterd are: "); for(int i=0;i<10;i++) { printf("%d   ",array[i]); } getch(); }

#include<iostream> #include<conio.h> using namespace std; int main() { int array[10]; //an array of 10 same data type elements cout<<"Enter 10 elements : "; for(int i=0;i<10;i++)              // for loop to for getting values for array 10 times { cin>>array[i];            //getting values form user } cout<<"10 elements you enterd are: "; for(int i=0;i<10;i++) { cout<<array[i]<<"   ";       //printing all entered values } getch(); return 0; }

#include<iostream> #include<conio.h> #define max 50 using namespace std; int array[max]; int add(int x[],int size) { for(int i=2;i<=size;i++) { int child=i; int parent=i/2; while(array[child]>array[parent]&&child>1)            //while child node is greater then parent node                                                                                                // and child is not root node. { int temp=array[child]; //Swapping of parent and child if child is greater then its                                 array[child]=array[parent];       //parent node. array[parent]=temp; // cout<<endl<<temp<<" swap with "<<array[child]<<endl; child=parent; // set child:=parnet parent=parent/2; // set parent:=parent/2.. because in heap. parent of any position of                 }                                            //child is equal to floor value of its half.

#include<iostream> #include<conio.h> using namespace std; struct node { int info; node *left,*right; }*root=NULL,*stack[50]; int size=0; int insert() { size++; int x; cout<<"Enter info part: "; cin>>x; node *temp=new node; temp->info=x; int n=2;     if(root==NULL) {    root=temp; temp->left=NULL; temp->right=NULL; return 1; } node *ptr=new node; node *ctr=new node; ctr=NULL; ptr=root; while(ptr!=NULL) { if(ptr->info>x) { ptr=ptr->left; } else if(ptr->info==x) {   cout<<"Item already in list!\n"; int x=0; return x; } else { ptr=ptr->right; } } ptr=root; while(ptr!=NULL) { if(ptr->info>x) { ctr=ptr; ptr=ptr->left; } else { ctr=ptr; ptr=ptr->right; } } if(ctr->info>x) { ctr->left=temp; temp->left=NULL; temp->right=NULL; } else

#include<iostream> #include<conio.h> using namespace std; int main() { int num,n=1,m,cmp; cout<<"Enter a decimal number : "; cin>>num; m=7; while(num<=m||num>m) {   int value=1; if(num<=m) { cmp=m-num; cout<<"Compilment is : "<<cmp; return 0; } n=n+1; for(int i=0;i<n;i++) value=value*2; m=value-1; } getch(); }        Decimal Number = 61 Binary Number of 61 = 111101             Compliment    = 000010   =  2