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++) {
...
}

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;
}```
```

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

Costly Intervals

Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the

The Strange Function

One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting

Self-Driving Bus

Treeland is a country with n cities and n - 1 roads. There is exactly one path between any two cities. The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true: There is a path between ever

Unique Colors

You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti

Fibonacci Numbers Tree

Shashank loves trees and math. He has a rooted tree, T , consisting of N nodes uniquely labeled with integers in the inclusive range [1 , N ]. The node labeled as 1 is the root node of tree , and each node in is associated with some positive integer value (all values are initially ). Let's define Fk as the Kth Fibonacci number. Shashank wants to perform 22 types of operations over his tree, T