**For Loops in c**

### Problem Statement :

Objective: In this challenge, you will learn the usage of the for loop, which is a programming language statement which allows code to be executed until a terminal condition is met. They can even repeat forever if the terminal condition is never met. The syntax for the for loop is: for ( <expression_1> ; <expression_2> ; <expression_3> ) <statement> 1. expression_1 is used for intializing variables which are generally used for controlling the terminating flag for the loop. 2. expression_2 is used to check for the terminating condition. If this evaluates to false, then the loop is terminated. 3. expression_3 is generally used to update the flags/variables. The following loop initializes i to 0, tests that i is less than 10, and increments i at every iteration. It will execute 10 times. for(int i = 0; i < 10; i++) { ... } Task: For each integer n in the interval [a,b] (given as input) : 1. If 1<=n<=9, then print the English representation of it in lowercase. That is "one" for 1, "two" for 2, and so on. 2. Else if n>9 and it is an even number, then print "even". 3. Else if n>9 and it is an odd number, then print "odd". Input Format: The first line contains an integer, a. The seond line contains an integer, b. Constraints: 1<=a<=b<=10^6 Output Format: Print the appropriate English representation,even, or odd, based on the conditions described in the 'task' section.

### Solution :

` ````
Solution in C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main()
{
int a, b,t,s;
scanf("%d\n%d", &a, &b);
t=a>b?a:b;
s=a<b?a:b;
for(s;s<=t;s++)
{
if(s<10)
{
if(s==1)
printf("one\n");
if(s==2)
printf("two\n");
if(s==3)
printf("three\n");
if(s==4)
printf("four\n");
if(s==5)
printf("five\n");
if(s==6)
printf("six\n");
if(s==7)
printf("seven\n");
if(s==8)
printf("eight\n");
if(s==9)
printf("nine\n");
}
if(s>=10)
{
if(s%2==0)
printf("even\n");
else
printf("odd\n");
}
}
return 0;
}
```

## View More Similar Problems

## 2D Array-DS

Given a 6*6 2D Array, arr: 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 An hourglass in A is a subset of values with indices falling in this pattern in arr's graphical representation: a b c d e f g There are 16 hourglasses in arr. An hourglass sum is the sum of an hourglass' values. Calculate the hourglass sum for every hourglass in arr, then print t

View Solution →## Dynamic Array

Create a list, seqList, of n empty sequences, where each sequence is indexed from 0 to n-1. The elements within each of the n sequences also use 0-indexing. Create an integer, lastAnswer, and initialize it to 0. There are 2 types of queries that can be performed on the list of sequences: 1. Query: 1 x y a. Find the sequence, seq, at index ((x xor lastAnswer)%n) in seqList.

View Solution →## Left Rotation

A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example: d=2 arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d

View Solution →## Sparse Arrays

There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun

View Solution →## Array Manipulation

Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu

View Solution →## Print the Elements of a Linked List

This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode

View Solution →