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 :



title-img 


                            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

Kindergarten Adventures

Meera teaches a class of n students, and every day in her classroom is an adventure. Today is drawing day! The students are sitting around a round table, and they are numbered from 1 to n in the clockwise direction. This means that the students are numbered 1, 2, 3, . . . , n-1, n, and students 1 and n are sitting next to each other. After letting the students draw for a certain period of ti

View Solution →

Mr. X and His Shots

A cricket match is going to be held. The field is represented by a 1D plane. A cricketer, Mr. X has N favorite shots. Each shot has a particular range. The range of the ith shot is from Ai to Bi. That means his favorite shot can be anywhere in this range. Each player on the opposite team can field only in a particular range. Player i can field from Ci to Di. You are given the N favorite shots of M

View Solution →

Jim and the Skyscrapers

Jim has invented a new flying object called HZ42. HZ42 is like a broom and can only fly horizontally, independent of the environment. One day, Jim started his flight from Dubai's highest skyscraper, traveled some distance and landed on another skyscraper of same height! So much fun! But unfortunately, new skyscrapers have been built recently. Let us describe the problem in one dimensional space

View Solution →

Palindromic Subsets

Consider a lowercase English alphabetic letter character denoted by c. A shift operation on some c turns it into the next letter in the alphabet. For example, and ,shift(a) = b , shift(e) = f, shift(z) = a . Given a zero-indexed string, s, of n lowercase letters, perform q queries on s where each query takes one of the following two forms: 1 i j t: All letters in the inclusive range from i t

View Solution →

Counting On a Tree

Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n

View Solution →

Polynomial Division

Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie

View Solution →