Challenge: Filtering Numbers in a Loop
Tarea
Swipe to start coding
Find the sum of all numbers from 1 to n, excluding those that are divisible by 3 or 5.
- Create a method called
sumNotDivisibleBy3Or5(int n)that returns anint. - Inside this method, create a
forloop that iterates from 1 ton(inclusive). - In each iteration, check if the number is not divisible by 3 and not divisible by 5.
- If the number passes the condition, add it to a running total
sum. - Return the total
sumafter the loop ends.
Solución
¿Todo estuvo claro?
¡Gracias por tus comentarios!
Sección 1. Capítulo 22
single
Pregunte a AI
Pregunte a AI
Pregunte lo que quiera o pruebe una de las preguntas sugeridas para comenzar nuestra charla
Genial!
Completion tasa mejorada a 2.86
Challenge: Filtering Numbers in a Loop
Desliza para mostrar el menú
Tarea
Swipe to start coding
Find the sum of all numbers from 1 to n, excluding those that are divisible by 3 or 5.
- Create a method called
sumNotDivisibleBy3Or5(int n)that returns anint. - Inside this method, create a
forloop that iterates from 1 ton(inclusive). - In each iteration, check if the number is not divisible by 3 and not divisible by 5.
- If the number passes the condition, add it to a running total
sum. - Return the total
sumafter the loop ends.
Solución
¿Todo estuvo claro?
¡Gracias por tus comentarios!
Sección 1. Capítulo 22
single