Answer:
lst = []
n = int(input("Input an array size for you words array: "))
print("Now please enter " + str(n) + " words")
max = 0
min = 1000
index_min = 0
index_max = 0
for i in range(n):
s = input("Input a word: ")
lst.append(s)
if len(s) >= max:
max = len(s)
index_max = i
if len(s) <= min:
min = len(s)
index_min = i
print("The longest word is :" + lst[index_max])
print("The shortest word is :" + lst[index_min])
Explanation:
Create an empty list, lst
Get the size from the user
Create a for loop that iterates "size" times
Inside the loop, get the strings from the user and put them in the lst. Find the longest and shortest strings and their indices using if structure.
When the loop is done, print the longest and shortest
<span>Black sockets should be used, but the color is not the reason why. Chrome sockets will cause splits to form in the socket walls pretty quickly, after only a few uses. But the black sockets are that color because they have gone through a process called Parkerizing that coats the surface of the socket in order to provide more resistance when being used and protect the socket against corrosion.</span>
Answer:
Explanation:
#include <stdio.h>
#include <string.h>
typedef struct ProductInfo_struct {
char itemName[30];
int itemQty;
} ProductInfo;
ProductInfo IncreaseItemQty (ProductInfo productToStock, int increaseValue) {
productToStock.itemQty = productToStock.itemQty + increaseValue;
return productToStock;
}
int main(void) {
ProductInfo mugInfo;
int addStock;
addStock = 10;
scanf("%s", mugInfo.itemName);
scanf("%d", &mugInfo.itemQty);
**** /* Your solution goes here */ ****
printf("Name: %s, stock: %d\n", mugInfo.itemName, mugInfo.itemQty);
return 0;
}
Assuming decoders with enabler.
input with rectangle is the ENABLE input.
wire with "/" on it is a bundled wire with multiple values to save drawing space.
In1 is MSB, In5 is LSB.
messy drawing as I'm in vehicle.
I think it’s 1, 2 and if im wrong im sorry
