Count the numbers that are not divisible by 3,5 beetwen 1 to N – Programming, Pseudocode Example, C# Programming Example
Basic C# Console For Loop If Else Statement

Count the numbers that are not divisible by 3,5 beetwen 1 to N

In this article, we will find the  Count of the numbers that are not divisible by 3,5 between 1 and N.

Variables are defined in the first row. In the next lines, values are assigned to these variables. In the loop “if statement” checks the number is divisible by 3, 5 whether is number or not.

In the last line we print the result of processing on the screen.

 

 

Output:

You can find more similar examples of programming for this programming language in the site.

 

Leave a Comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.