Idk 1017.876? But I’m not entirely sure
Assuming we need to find i such that
1 ≤ i ≤ n and t[i]=i.
If we need to find only the first occurrence, we can do:
for i:1 to n {
if t[i]=i then return(i)
}
If exhaustive search is required, then put the results (values of i) in an array or a linked list, return the number of values found, and the array (or linked list).
Yes, that is true, you have to simplify -42/-45 to be able to see if they are equivalant.
the answer is 30 use the 5 or greater add one more so if the ones spot is a 5+ add one to the tension place
4(3x+4) This should hellp
