C ++ Exercises Have Solutions (Sample Code)

Besides the Python, Java exercises, TipsMake.com also summarizes for you some basic C ++ exercises to practice more in the process of learning C ++ programming language.

This C ++ exercise list is divided into 9 sections, each with 3 to 5 items, with increasing difficulty levels. Initially you will "boot" with very basic C ++ exercises, such as simulating the multiplication, printing the amount, checking a set of 3 numbers to see if it is the edge of a triangular triangle, calculating the circumference, area of that triangle.

Gradually, it will be more difficult to create and manage student lists, documents, print or perform other tasks as required by the lesson. Even draw a graph of trigonometric functions.

C + 1 exercise

Question 1: Simulation of manual multiplication

Programming to print the screen simulating manual multiplication 2 positive integers with 3 digits entered from the keyboard. As an example,, with 2 numbers entered 763 and 589, the screen must be printed as follows:

Sample code:

 clrscr();44 
 clrscr();43 
 clrscr();42 
 clrscr();41 
 clrscr();40 
 clrscr();39 
 clrscr();38 
 clrscr();37 
 clrscr();36 
 clrscr();35 
 clrscr();34 
 clrscr();33 
 clrscr();32 
 clrscr();31 
 clrscr();30 
 clrscr();29 
 clrscr();28 
 clrscr();27 
 
 clrscr();26 

Question 2: Enter the amount, print the number of sheets and par values

A person needs to withdraw a T amount from the bank and wants the minimum number of sheets. Indicates that there are denominations of 100, 20, 5 and 1 denominations. Enter from the T-number keyboard and print out the number of sheets for each par value and the total number of sheets received.

Sample code:

 clrscr();25 
 clrscr();24 
 clrscr();23 
 clrscr();22 
 clrscr();21 
 clrscr();20 
 clrscr();19 
 clrscr();18 
 clrscr();17 
 clrscr();16 
 clrscr();15 
 clrscr();14 
 clrscr();13 
 clrscr();12 
 clrscr();11 

Question 3: Change the number of Roman numerals

Programming enter a positive integer less than 1000 and change to the corresponding Roman number, print the result to the screen.

Sample code:

 clrscr();10 
 
 clrscr();09 
 
 clrscr();08 
 
 clrscr();07 
 
 clrscr();06 
 
 clrscr();05 
 
 clrscr();04 
 
 clrscr();03 
 
 clrscr();02 
 
 clrscr();01 
 
 clrscr();00 
 
 f=fopen("HosoSV.DAT","w+b");99 
 
 f=fopen("HosoSV.DAT","w+b");98 
 
 f=fopen("HosoSV.DAT","w+b");97 
 
 f=fopen("HosoSV.DAT","w+b");96 
 
 f=fopen("HosoSV.DAT","w+b");95 
 
 f=fopen("HosoSV.DAT","w+b");94 
 
 f=fopen("HosoSV.DAT","w+b");93 
 
 f=fopen("HosoSV.DAT","w+b");92 
 
 f=fopen("HosoSV.DAT","w+b");91 
 
 f=fopen("HosoSV.DAT","w+b");90 
 
 f=fopen("HosoSV.DAT","w+b");89 
 
 f=fopen("HosoSV.DAT","w+b");88 
 
 f=fopen("HosoSV.DAT","w+b");87 
 
 f=fopen("HosoSV.DAT","w+b");86 
 
 f=fopen("HosoSV.DAT","w+b");85 
 
 f=fopen("HosoSV.DAT","w+b");84 
 
 f=fopen("HosoSV.DAT","w+b");83 
 
 f=fopen("HosoSV.DAT","w+b");82 
 
 f=fopen("HosoSV.DAT","w+b");81 
 
 f=fopen("HosoSV.DAT","w+b");80 
 
 f=fopen("HosoSV.DAT","w+b");79 
 
 f=fopen("HosoSV.DAT","w+b");78 
 
 f=fopen("HosoSV.DAT","w+b");77 
 
 f=fopen("HosoSV.DAT","w+b");76 
 
 f=fopen("HosoSV.DAT","w+b");75 
 
 f=fopen("HosoSV.DAT","w+b");74 
 
 f=fopen("HosoSV.DAT","w+b");73 
 
 f=fopen("HosoSV.DAT","w+b");72 
 
 f=fopen("HosoSV.DAT","w+b");71 
 
 f=fopen("HosoSV.DAT","w+b");70 
 
 f=fopen("HosoSV.DAT","w+b");69 
 
 f=fopen("HosoSV.DAT","w+b");68 

Question 4: Print how to read numbers

Print the screen how to read a positive integer smaller than 1000000. Example 726503 read: seventy-twenty-six thousand five hundred and three.

Sample code:

 f=fopen("HosoSV.DAT","w+b");67 
 
 f=fopen("HosoSV.DAT","w+b");66 
 
 f=fopen("HosoSV.DAT","w+b");65 
 
 f=fopen("HosoSV.DAT","w+b");64 
 
 f=fopen("HosoSV.DAT","w+b");63 
 
 f=fopen("HosoSV.DAT","w+b");62 
 
 f=fopen("HosoSV.DAT","w+b");61 
 
 f=fopen("HosoSV.DAT","w+b");60 
 
 f=fopen("HosoSV.DAT","w+b");59 
 
 f=fopen("HosoSV.DAT","w+b");58 
 
 f=fopen("HosoSV.DAT","w+b");57 
 
 f=fopen("HosoSV.DAT","w+b");56 
 
 f=fopen("HosoSV.DAT","w+b");55 
 
 f=fopen("HosoSV.DAT","w+b");54 
 
 f=fopen("HosoSV.DAT","w+b");53 
 
 f=fopen("HosoSV.DAT","w+b");52 
 
 f=fopen("HosoSV.DAT","w+b");51 
 
 f=fopen("HosoSV.DAT","w+b");50 
 
 f=fopen("HosoSV.DAT","w+b");49 
 
 f=fopen("HosoSV.DAT","w+b");48 
 
 f=fopen("HosoSV.DAT","w+b");47 
 
 f=fopen("HosoSV.DAT","w+b");46 
 
 f=fopen("HosoSV.DAT","w+b");45 
 
 f=fopen("HosoSV.DAT","w+b");44 
 
 f=fopen("HosoSV.DAT","w+b");43 
 
 f=fopen("HosoSV.DAT","w+b");42 
 
 f=fopen("HosoSV.DAT","w+b");41 

Question 5: Solving quadratic equations

Programming to solve the equation ax ² + bx + c = 0, the real coefficients a, b, and c enter from the keyboard.

Sample code:

 f=fopen("HosoSV.DAT","w+b");40 
 
 f=fopen("HosoSV.DAT","w+b");39 
 
 f=fopen("HosoSV.DAT","w+b");38 
 
 f=fopen("HosoSV.DAT","w+b");37 
 
 f=fopen("HosoSV.DAT","w+b");36 
 
 f=fopen("HosoSV.DAT","w+b");35 
 
 f=fopen("HosoSV.DAT","w+b");34 
 
 f=fopen("HosoSV.DAT","w+b");33 
 
 f=fopen("HosoSV.DAT","w+b");32 
 
 f=fopen("HosoSV.DAT","w+b");31 
 
 f=fopen("HosoSV.DAT","w+b");30 
 
 f=fopen("HosoSV.DAT","w+b");29 
 
 f=fopen("HosoSV.DAT","w+b");28 
 
 f=fopen("HosoSV.DAT","w+b");27 
 
 f=fopen("HosoSV.DAT","w+b");26 
 
 f=fopen("HosoSV.DAT","w+b");25 
 
 f=fopen("HosoSV.DAT","w+b");24 
 
 f=fopen("HosoSV.DAT","w+b");23 
 
 f=fopen("HosoSV.DAT","w+b");22 
 
 f=fopen("HosoSV.DAT","w+b");21 
 
 f=fopen("HosoSV.DAT","w+b");20 

C ++ exercise # 2

Question 1: Check if 3 numbers are right next to the triangle, if there are any kind of triangle, calculate perimeter, area

Enter 3 real numbers a, b, c and check that these 3 numbers are 3 sides of a triangle? If there are three triangular edges, it is said which triangle is in the following triangle types: regular, square, square, weight, normal and circumference, area of that triangle. Print results to the screen.

Sample code:

 f=fopen("HosoSV.DAT","w+b");19 
 
 f=fopen("HosoSV.DAT","w+b");18 
 
 f=fopen("HosoSV.DAT","w+b");17 
 
 f=fopen("HosoSV.DAT","w+b");16 
 
 f=fopen("HosoSV.DAT","w+b");15 
 
 f=fopen("HosoSV.DAT","w+b");14 
 
 f=fopen("HosoSV.DAT","w+b");13 
 
 f=fopen("HosoSV.DAT","w+b");12 
 
 f=fopen("HosoSV.DAT","w+b");11 
 
 f=fopen("HosoSV.DAT","w+b");10 
 
 f=fopen("HosoSV.DAT","w+b");09 
 
 f=fopen("HosoSV.DAT","w+b");08 
 
 f=fopen("HosoSV.DAT","w+b");07 
 
 f=fopen("HosoSV.DAT","w+b");06 
 
 f=fopen("HosoSV.DAT","w+b");05 
 
 f=fopen("HosoSV.DAT","w+b");04 
 
 f=fopen("HosoSV.DAT","w+b");03 
 
 f=fopen("HosoSV.DAT","w+b");02 
 
 f=fopen("HosoSV.DAT","w+b");01 
 
 f=fopen("HosoSV.DAT","w+b");00 
 
 printf("Nhap so sv n=");99 
 
 printf("Nhap so sv n=");98 
 
 printf("Nhap so sv n=");97 

Question 2: Calculate the number of years to save

A person needs to have a T amount, accumulate by depositing an initial deposit of S with an annual interest rate of P% by progressive method (the interest of each year is added to the principal). Enter real numbers T, S, P and determine the number of years to save.

Sample code:

 printf("Nhap so sv n=");96 
 
 printf("Nhap so sv n=");95 
 
 printf("Nhap so sv n=");94 printf("Nhap so sv n=");93 
 
 printf("Nhap so sv n=");92 
 
 printf("Nhap so sv n=");91 
 
 printf("Nhap so sv n=");90 
 
 printf("Nhap so sv n=");89 
 
 printf("Nhap so sv n=");88 
 
 printf("Nhap so sv n=");87 
 
 printf("Nhap so sv n=");86 
 
 printf("Nhap so sv n=");85 
 
 printf("Nhap so sv n=");84 
 
 printf("Nhap so sv n=");83 
 
 printf("Nhap so sv n=");82 
 
 printf("Nhap so sv n=");81 
 
 printf("Nhap so sv n=");80 
 
 printf("Nhap so sv n=");79 
 
 printf("Nhap so sv n=");78 

Question 4: Find and print perfect numbers

Find and print the screen all perfect numbers do not exceed the number of given n input from the keyboard. The perfect number is the number equal to the sum of its divisors excluding the divisor that is the number itself. Example 6 is a perfect number because 6 = 1 + 2 + 3.

Sample code:

 printf("Nhap so sv n=");77 
 
 printf("Nhap so sv n=");76 
 
 printf("Nhap so sv n=");75 
 
 printf("Nhap so sv n=");74 
 
 printf("Nhap so sv n=");73 
 
 printf("Nhap so sv n=");72 
 
 printf("Nhap so sv n=");71 
 
 printf("Nhap so sv n=");70 
 
 printf("Nhap so sv n=");69 
 
 printf("Nhap so sv n=");68 
 
 printf("Nhap so sv n=");67 
 
 printf("Nhap so sv n=");66 
 
 printf("Nhap so sv n=");65 
 
 printf("Nhap so sv n=");64 
 
 printf("Nhap so sv n=");63 
 
 printf("Nhap so sv n=");62 
 
 printf("Nhap so sv n=");61 
 
 printf("Nhap so sv n=");60 
 
 printf("Nhap so sv n=");59 
 
 printf("Nhap so sv n=");58 
 
 printf("Nhap so sv n=");57 

Question 5: Find and print smaller prime numbers n

Find and print the screen all primes do not exceed the given number n entered from the keyboard. A prime number is a number that only has a divisor of 1 and that number itself.

Sample code:

 printf("Nhap so sv n=");56 
 
 printf("Nhap so sv n=");55 
 
 printf("Nhap so sv n=");54 
 
 printf("Nhap so sv n=");53 
 
 printf("Nhap so sv n=");52 
 
 printf("Nhap so sv n=");51 
 
 printf("Nhap so sv n=");50 
 
 printf("Nhap so sv n=");49 
 
 printf("Nhap so sv n=");48 
 
 printf("Nhap so sv n=");47 
 
 printf("Nhap so sv n=");46 
 
 printf("Nhap so sv n=");45 
 
 printf("Nhap so sv n=");44 
 
 printf("Nhap so sv n=");43 
 
 printf("Nhap so sv n=");42 
 
 printf("Nhap so sv n=");41 
 
 printf("Nhap so sv n=");40 
 
 printf("Nhap so sv n=");39 

Exercise C ++ No. 3

Question 1: Check the main number

Write a function that checks whether a number is righteous (the prime number is equal to the square of an integer); Whether a number test function is a Pythagorean number (the number of Pythons is the main number and is equal to the other 2 main numbers). In the main function enter a positive integer and use the function on the test is the main number? Pitago number?

Sample code:

 printf("Nhap so sv n=");38 
 
 printf("Nhap so sv n=");37 
 
 printf("Nhap so sv n=");36 
 
 printf("Nhap so sv n=");35 
 
 printf("Nhap so sv n=");34 
 
 printf("Nhap so sv n=");33 
 
 printf("Nhap so sv n=");32 
 
 printf("Nhap so sv n=");31 
 
 printf("Nhap so sv n=");30 
 
 printf("Nhap so sv n=");29 
 
 printf("Nhap so sv n=");28 
 
 printf("Nhap so sv n=");27 
 
 printf("Nhap so sv n=");26 
 
 printf("Nhap so sv n=");25 
 
 printf("Nhap so sv n=");24 
 
 printf("Nhap so sv n=");23 
 
 printf("Nhap so sv n=");22 
 
 printf("Nhap so sv n=");21 
 
 printf("Nhap so sv n=");20 
 
 printf("Nhap so sv n=");19 
 
 printf("Nhap so sv n=");18 
 
 printf("Nhap so sv n=");17 
 
 printf("Nhap so sv n=");16 
 
 printf("Nhap so sv n=");15 
 
 printf("Nhap so sv n=");14 printf("Nhap so sv n=");13 
 
 printf("Nhap so sv n=");12 
 
 printf("Nhap so sv n=");11 
 
 printf("Nhap so sv n=");10 
 
 fwrite(&n,sizeof(int),1,f);56 
 
 fwrite(&n,sizeof(int),1,f);55 
 
 fwrite(&n,sizeof(int),1,f);54 
 
 fwrite(&n,sizeof(int),1,f);53 
 
 fwrite(&n,sizeof(int),1,f);52 
 
 fwrite(&n,sizeof(int),1,f);51 fwrite(&n,sizeof(int),1,f);50 
 
 fwrite(&n,sizeof(int),1,f);49 
 
 fwrite(&n,sizeof(int),1,f);48 
 
 fwrite(&n,sizeof(int),1,f);47 
 
 fwrite(&n,sizeof(int),1,f);46 
 
 fwrite(&n,sizeof(int),1,f);45 
 
 fwrite(&n,sizeof(int),1,f);44 
 
 fwrite(&n,sizeof(int),1,f);43 
 
 fwrite(&n,sizeof(int),1,f);42 
 
 fwrite(&n,sizeof(int),1,f);41 fwrite(&n,sizeof(int),1,f);40 
 
 i=1;3 
 
 i=1;2 
 
 i=1;1 
 
 i=1;0 
 
 do9 
 
 do8 
 
 do7 
 
 do6 
 
 do5 do4 
 
 do3 
 
 do2 
 
 do1 
 
 do0 
 
 {printf("So thu %d : ",i++); scanf("%d",&x);9 
 
 {printf("So thu %d : ",i++); scanf("%d",&x);8 
 
 {printf("So thu %d : ",i++); scanf("%d",&x);7 
 
 {printf("So thu %d : ",i++); scanf("%d",&x);6 
 
 {printf("So thu %d : ",i++); scanf("%d",&x);5 {printf("So thu %d: ",i++); scanf("%d",&x);4 
 
 {printf("So thu %d : ",i++); scanf("%d",&x);3 
 
 {printf("So thu %d : ",i++); scanf("%d",&x);2 
 
 {printf("So thu %d : ",i++); scanf("%d",&x);1 
 
 {printf("So thu %d : ",i++); scanf("%d",&x);0 
 
 fprintf(fp,"%d ",x);9 
 
 fprintf(fp,"%d ",x);8 
 
 fprintf(fp,"%d ",x);7 
 
 fprintf(fp,"%d ",x);6 
 
 fprintf(fp,"%d ",x);5 fprintf(fp,"%d ",x);4 
 
 fprintf(fp,"%d ",x);3 
 
 fprintf(fp,"%d ",x);2 
 
 fprintf(fp,"%d ",x);1 
 
 fprintf(fp,"%d ",x);0 
 
 printf("Tiep tuc nhap ? (c/k) : ");9 
 
 printf("Tiep tuc nhap ? (c/k) : ");8 
 
 printf("Tiep tuc nhap ? (c/k) : ");7 
 
 printf("Tiep tuc nhap ? (c/k) : ");6 
 
 printf("Tiep tuc nhap ? (c/k) : ");5 printf("Tiep tuc nhap? (c/k): ");4 
 
 printf("Tiep tuc nhap ? (c/k) : ");3 
 
 printf("Tiep tuc nhap ? (c/k) : ");2 
 
 printf("Tiep tuc nhap ? (c/k) : ");1 
 
 printf("Tiep tuc nhap ? (c/k) : ");0 
 
 fflush(stdin);9 
 
 fflush(stdin);8 
 
 fflush(stdin);7 
 
 fflush(stdin);6 
 
 fflush(stdin);5 fflush(stdin);4 
 
 fflush(stdin);3 
 
 fflush(stdin);2 
 
 fflush(stdin);1 
 
 fflush(stdin);0 
 
 t=getchar();9 
 
 t=getchar();8 
 
 t=getchar();7 
 
 t=getchar();6 
 
 t=getchar();5 t=getchar();4 
 
 t=getchar();3 
 
 t=getchar();2 
 
 t=getchar();1 
 
 t=getchar();0 
 
 }while ((t=='c')||(t=='C'));9 
 
 }while ((t=='c')||(t=='C'));8 
 
 }while ((t=='c')||(t=='C'));7 
 
 }while ((t=='c')||(t=='C'));6 
 
 }while ((t=='c')||(t=='C'));5 }while ((t=='c')||(t=='C'));4 
 
 }while ((t=='c')||(t=='C'));3 
 
 }while ((t=='c')||(t=='C'));2 
 
 }while ((t=='c')||(t=='C'));1 
 
 }while ((t=='c')||(t=='C'));0 
 
 fclose(fp);9 
 
 fclose(fp);8 
 
 fclose(fp);7 
 
 fclose(fp);6 
 
 fclose(fp);5 fclose(fp);4 
 
 fclose(fp);3 
 
 fclose(fp);2 
 
 fclose(fp);1 
 
 fclose(fp);0 
 
 fp=fopen("tepsn.dat","r");9 
 
 fp=fopen("tepsn.dat","r");8 
 
 fp=fopen("tepsn.dat","r");7 
 
 fp=fopen("tepsn.dat","r");6 
 
 fp=fopen("tepsn.dat","r");5 fp=fopen("tepsn.dat","r");4 
 
 fp=fopen("tepsn.dat","r");3 
 
 fp=fopen("tepsn.dat","r");2 
 
 fp=fopen("tepsn.dat","r");1 
 
 fp=fopen("tepsn.dat","r");0 
 
 ts=sd=0;9 
 
 ts=sd=0;8 
 
 ts=sd=0;7 
 
 ts=sd=0;6 
 
 ts=sd=0;5 ts=sd=0;4 
 
 ts=sd=0;3 
 
 ts=sd=0;2 
 
 ts=sd=0;1 
 
 ts=sd=0;0 
 
 if (!feof(fp))9 
 
 if (!feof(fp))8 
 
 if (!feof(fp))7 
 
 if (!feof(fp))6 
 
 if (!feof(fp))5 if (!feof(fp))4 
 
 if (!feof(fp))3 
 
 if (!feof(fp))2 
 
 if (!feof(fp))1 
 
 if (!feof(fp))0 
 
 {fscanf(fp,"%d",&x);9 
 
 {fscanf(fp,"%d",&x);8 
 
 {fscanf(fp,"%d",&x);7 
 
 {fscanf(fp,"%d",&x);6 
 
 {fscanf(fp,"%d",&x);5 {fscanf(fp,"%d",&x);4 
 
 {fscanf(fp,"%d",&x);3 
 
 {fscanf(fp,"%d",&x);2 
 
 {fscanf(fp,"%d",&x);1 
 
 {fscanf(fp,"%d",&x);0 
 
 max=min=x;9 
 
 max=min=x;8 
 
 max=min=x;7 
 
 max=min=x;6 
 
 max=min=x;5 

Question 3: Write recursive function to find the greatest common convention

Write recursive function to find the greatest common divisor of 2 natural numbers; a function that finds the smallest common multiple of two natural numbers. The main function uses the written functions and can run multiple times to find the greatest common divisor and the smallest common multiple of different positive integer pairs. The request to check the input must be positive integers.

Sample code:

 max=min=x;4 
 
 max=min=x;3 
 
 max=min=x;2 
 
 max=min=x;1 
 
 max=min=x;0 
 
 ts++;9 
 
 ts++;8 
 
 ts++;7 
 
 ts++;6 
 
 ts++;5 
 
 ts++;4 
 
 ts++;3 
 
 ts++;2 
 
 ts++;1 
 
 ts++;0 
 
 if (x>0) sd++;9 
 
 if (x>0) sd++;8 
 
 if (x>0) sd++;7 
 
 if (x>0) sd++;6 
 
 if (x>0) sd++;5 
 
 if (x>0) sd++;4 
 
 if (x>0) sd++;3 
 
 if (x>0) sd++;2 
 
 if (x>0) sd++;1 
 
 if (x>0) sd++;0 
 
 while (!feof(fp))9 
 
 while (!feof(fp))8 
 
 while (!feof(fp))7 
 
 while (!feof(fp))6 

Question 4: Calculate the distance of the positive integer n

Write recursive function to calculate the factorial of the positive integer n. The main function uses this function and can run several times to calculate for many different numbers entered from the keyboard. The request to check the input data must be a positive integer. The formula calculates the factorial of n: n! = 1.3. n if n is odd and n! = 2.4. n if n is even.

Sample code:

 while (!feof(fp))5 
 
 while (!feof(fp))4 
 
 while (!feof(fp))3 
 
 while (!feof(fp))2 
 
 while (!feof(fp))1 
 
 while (!feof(fp))0 
 
 {fscanf(fp,"%d",&x);9 
 
 {fscanf(fp,"%d",&x);8 
 
 {fscanf(fp,"%d",&x);7 
 
 {fscanf(fp,"%d",&x);6 
 
 {fscanf(fp,"%d",&x);5 
 
 {fscanf(fp,"%d",&x);4 
 
 {fscanf(fp,"%d",&x);3 
 
 {fscanf(fp,"%d",&x);2 
 
 {fscanf(fp,"%d",&x);1 
 
 {fscanf(fp,"%d",&x);0 
 
 if (max 
 
 if (min>x) min=x;9 
 
 if (max 
 
 if (min>x) min=x;8 
 
 if (max 
 
 if (min>x) min=x;7 
 
 if (max 
 
 if (min>x) min=x;6 
 
 if (max 
 
 if (min>x) min=x;5  

Question 5: Write recursive function to solve the problem of Hanoi tower

Write recursive function to solve the problem of Hanoi tower: It is necessary to transfer n towers from position A to position B using position C as an intermediary. Requirements: Only one floor can be transferred at a time, only the A, B, C positions can be used to place the tower floors, not the raised floor on the small floor. The main function uses this function and can run several times to calculate for many different numbers entered from the keyboard.

Sample code:

FAQ

What should readers know about C ++ Exercises Have Solutions (Sample Code)?

Start with the core concepts and examples in this guide. They provide the context needed to understand the topic accurately and apply the information with fewer mistakes.

Why is C ++ Exercises Have Solutions (Sample Code) important?

Understanding this topic helps readers make better technical decisions, recognize common problems, and choose safer or more efficient solutions.

How should beginners use this guide?

Work through each section in order, test unfamiliar steps in a safe environment, and keep a backup of important files or settings before making significant changes.