Find integers divisible by 7 with a remainder of 2 or 3
Find integers divisible by 7 with a remainder of 2 or 3
Write a C program that finds all integer numbers that divide by 7 and have a remainder of 2 or 3 between two given integers.
Sample Solution:
C Code:
#include <stdio.h>
int main() {
int x, y, temp, i, sum=0;
// Prompt for user input
printf("\nInput the first integer: ");
scanf("%d", &x);
printf("\nInput the second integer: ");
scanf("%d", &y);
// Swap values if x is greater than y
if(x > y) {
temp = y;
y = x;
x = temp;
}
// Iterate through numbers between x and y (exclusive)
for(i = x+1; i < y; i++) {
// Check if the number modulo 7 is 2 or 3
if((i%7) == 2 || (i%7) == 3) {
printf("%d\n", i);
}
}
return 0;
}
Sample Output:
Input the first integer: 25 Input the second integer: 45 30 31 37 38 44
Flowchart:
For more Practice: Solve these Related Problems:
- Write a C program to find all integers within a range that are divisible by 5 and leave a remainder of 2.
- Write a C program to list integers between two numbers that satisfy multiple modulo conditions for a given divisor.
- Write a C program to find numbers in a specified range that leave a remainder of 2 or 3 when divided by 7.
- Write a C program to print integers that are divisible by 7 and have a remainder of either 1 or 4.
Go to:
PREV : Sum all numbers between two integers, excluding multiples of 17.
NEXT : Print n lines of 3 consecutive numbers starting from 1.
C programming Code Editor:
Have another way to solve this solution? Contribute your code (and comments) through Disqus.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.