IN C DEVELOPMENT 1.Write a for cycle that images the strange integers

11 through 121 comprehensive, divided by rooms. strange 2.Write a for cycle that images in ascending purchase all of the

good multiples of 5 which can be under 175, divided by

rooms. 3.Write a concerning cycle that images all of the also

integers from 80 through 20 comprehensive, divided by rooms. also 4.Write a for cycle that images in ascending purchase all of the

good integers under 200 which can be divisible by both 2 and 3,

divided by rooms 5.Given int variables k and total having been

declared, make use of a concerning cycle to calculate the sum the

squares of this very first 50 good integers and

shop this price altogether. Therefore your signal should place 1*1 + 2*2 +

3*3 +… + 49*49 + 50*50 into total. Utilize no factors besides k

and total. squares 6.Given an int adjustable letter that is initialized to a

good price and, additionally, int factors k and total that

have now been announced, make use of a concerning cycle to calculate the sum

the cubes of this very first letter entire figures, and shop

this price altogether. Therefore if letter equals 4, your signal should place 1*1*1

+ 2*2*2 + 3*3*3 + 4*4*4 into total. Utilize no factors besides letter,

k, and total. cubes 7.Write a concerning cycle that images the integers 1

through 40, divided by rooms or brand-new outlines. You might use just one

adjustable, matter with been announced as

an integer. for matter 8.Write a concerning cycle that computes listed here

amount: 5+10+15+20+…+485+490+495+500. The amount is put in a

adjustable amount which have been announced and

initialized to 0. furthermore, there’s another adjustable,

num which have already been announced. You must certainly not make use of

some other factors. for amount num 9. believe the int factors i, lo, hi, and outcome have now been

declared which lo and hi have now been initialized. Write a for cycle that adds the integers between lo and hello

(comprehensive), and shops the effect in outcome. Your signal shouldn’t replace the values of lo and hi. In addition, do

perhaps not declare any extra factors — only use i, lo, hi, and

outcome.

signal screenshot

#include

#include

void print_odd_integers_11_through_121()

{

int i;

// initialize i you start with 11 as much as 121 and printing

// all integers perhaps not complete divisible by 2

for(i=11; i<=121; i++)
{
if(we%2 != 0)
{
printf("%d ", i);
}
}
}
void print_positive_multiples_of_5()
{
unsigned int i, multiples;
// initialize 1 to i and i*5 to multiples, initially several
// of 5. Increment i by one and assign multiples a
// item of 5 and I also. At each version i increases by
// one and several is assigned item of i and 5
for(i=1, multiples=i*5; multiples<175; i++, multiples=5*i)
{
printf("%u ", multiples);
}
}
void print_even_integers_from_80_to_20()
{
unsigned int i;
for(i=80; i>=20; i–)

{

if(i%2 == 0)

{

printf(“%u “, i);

}

}

}

void print_integers_divisible_by_2_and_3()

{

unsigned int i;

for(i=1; i<=200; i++)
{
if((ipercent2==0) && (ipercent3==0))
{
printf("%u ", i);
}
}
}
void print_squares_of_first_50_integers()
{
unsigned lengthy int total;
int k;
for(k=1; k<=50; k++)
{
complete = k*k;
printf("%lu ", complete);
}
}
// We deliver worth of letter as feedback to operate
// and computer system cubes of very first letter integers
void print_cubes_of_first_n_integers(int letter)
{
unsigned int total, k;
for(k=1; k<=n; k++)
{
complete = k*k*k;
printf("%u ", complete);
}
}
// printing 1 to 40 integers only using matter adjustable
// as well as cycle
void print_integers_1_to_40()
{
int matter;
for(count=1; count<=40; count++)
{
printf("%d ", matter);
}
}
// printing amount of 5+10+15+20...500
void compute_sum_of_500_integers()
{
int sum=0, num;
// we increment num by 5 and hold processing complete into amount
// we in addition print 5 + 10 + 15 upto 500
for(num=5; num<=500; num+=5)
{
amount += num;
printf("%d + ", num);
}
printf(" = %d", amount);
}
// printing amount of integers between lo and hello
void print_sum_of_integers_between_lo_and_hi()
{
int lo=1, high=100, i, outcome;
for(i=lo; i<=high; i++)
{
outcome += i;
}
printf("nresult = %d", outcome);
}
int main()
{
printf("nOdd integers between 11 to 121 inclusiven");
print_odd_integers_11_through_121();
printf("nn");
printf("nPrint good multiples of 5 under 175n");
print_positive_multiples_of_5();
printf("nn");
printf("nPrint also integers from 80 through 20
inclusiven");
print_even_integers_from_80_to_20();
printf("nn");
printf("nPrint good integers under 200 divisible by 2
and 3n");
print_integers_divisible_by_2_and_3();
printf("nn");
printf("nPrint squares of very first 50 integersn");
print_squares_of_first_50_integers();
printf("nn");
printf("nPrint cubes of very first letter integersn");
print_cubes_of_first_n_integers(50);
printf("nn");
printf("nPrint good integers 1 to 40n");
print_integers_1_to_40();
printf("nn");
printf("nPrint amount of 5+10+15+...500n");
compute_sum_of_500_integers();
printf("nn");
printf("nPrint amount of integers between lo and hello
factorsn");
print_sum_of_integers_between_lo_and_hi();
}
We had been incapable of transcribe this picture
dd integers between 11 to 121 inclusive 1 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 51 53 55 57 59 61 63 65 67 69 71 73 75 77 79 81 83 85 87 89 91 93 95 97 99 101 103 105 107 109 111 1 3 115 117 119 121 rint good multiples of 5 under 175 10 15 20 25 30 35 40 45 50 55 60 65 70 75 80 85 90 95 100 105 110 115 120 125 30 135 140 145 150 155 160 165 170 rint also integers from 80 through 20 comprehensive 0 78 7674 72 70 68 66 64 62 60 58 56 54 52 50 48 46 44 42 40 38 36 34 32 30 28 26 24 22 20 rint good integers under 200 divisible by 2 and 3 12 18 24 30 36 42 48 54 60 66 72 78 84 90 96 102 108 114 120 126 132 138 144 1 0 156 162 168 174 180 186 192 198 rint squares of very first 50 integers 4 9 16 25 36 49 64 81 100 121 144 169 196 225 256 289 324 361 400 441 484 529 76 625 676 729 784 841 900 961 1024 1089 1156 1225 1296 1369 1444 1521 1600 168 1764 1849 1936 2025 2116 2209 2304 2401 2500 rint cubes of very first letter integers 8 27 64 125 216 343 512 729 1000 1331 1728 2197 2744 3375 4096 4913 5832 6859 000 9261 10648 12167 13824 15625 17576 19683 21952 24389 27000 29791 32768 3593 39304 42875 46656 50653 54872 59319 64000 68921 74088 79507 85184 91125 97336 03823 110592 117649 125000 rint good integers 1 to 40 2 3 4 5 678 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 rint amount of 5+10+15+...500 + 10 +15 + 20 25 30 + 35 4045 50 +556065 775808 + 90 95 + 100 105110 115120125 +130 135140 145 150+ 55 + 160+165 +170 175 180 185+190+195 + 200 2052121522 + 22523235 240245+250 255 26265 +270275+ 280 + 285 + 290295300305310315320 325 330335 340345 +350+ 55 + 360+365 +370 375 380385 +390+395 +400 405 410415 42 + 42543435 440 445+450 455 46465+470475+ 480 485 + 490 + 495 + 500 + 25250 rint amount of integers between lo and hi variables esult2691974 rocess came back 17 〈0x11〉 exe c ution time : 0.082 s ress any secret to carry on