Войти
или
Зарегистрироваться
Курсы
Учебник
Учебник 2.0
ОГЭ/ЕГЭ
Олимпиады
Рубрикатор
Компилятор
Статья Автор:
Шаранов Платон
Обработка файла. Критерий С. Отчет.
A=[] B=[] C=[] D=[] E=[] F=[] M=[] N=[] L=[] H=[] J=[] Y=[] I=[] O=[] P=[] R=[] T=[] with open("Career") as f: _, _, a, _, b, _, _, c, d, e, f, m, n, l, _, h, j, y, i, o, p, r, t =s.readline().split(",") a,b,c,d,e,f,m,n,l,h,j,y,i,o,p,r,t = int() for line in f: A.append(a) print("Age:") print(min(A)) print(max(A)) print(sum(A)/len(A)) if len(A) % 2 > 0: print(A[len(A)//2]) if len(A) % 2 == 0: print((A[len(A)//2] + A[len(A)//2 -1]) / 2) itog=[] for i in A: vichet=(i - (sum(A) / len(A)))^2 itog.append(vichet) print(sum(itog)) for i in A: summa=(i-(sum(A) / len(A)))^2 promeczut=summa / (len(A)-1) print(promeczut^ B.append(b) print("Years of Experience:") print( for c in f: C.append(c) for d in f: D.append(d) for e in f: E.append(e) for f in f: F.append(f) for m in f: M.append(m) for n in f: N.append(n) for l in f: L.append(l) for h in f: H.append(h) for j in f: J.append(j) for y in f: Y.append(y) for i in f: I.append(i) for o in f: O.append(o) for p in f: P.append(p) for r in f: R.append(r) for t in f: T.append(t)
×
A=[] B=[] C=[] D=[] E=[] F=[] M=[] N=[] L=[] H=[] J=[] Y=[] I=[] O=[] P=[] R=[] T=[] with open("Career") as f: _, _, a, _, b, _, _, c, d, e, f, m, n, l, _, h, j, y, i, o, p, r, t =f.readline().split(",") a,b,c,d,e,f,m,n,l,h,j,y,i,o,p,r,t = int() for line in f: A.append(a) print("Age:") print(min(A)) print(max(A)) print(sum(A)/len(A)) A=sorted(A) if len(A) % 2 > 0: print(A[len(A)//2]) if len(A) % 2 == 0: print((A[len(A)//2] + A[len(A)//2 -1]) / 2) most_common={} for element in A: if element in most_common: most_common[element] += 1 else: most_common[element] = 1 max_count = 0 most_common_element = None for num, count in frequency.items(): if count > max_count: max_count = count most_common_element = num print(most_common_element) end=[] for i in A: subtraction_1=(i - (sum(A) / len(A)))^2 end.append(subtraction_1) print(sum(end)) for i in A: subtraction_2=(i-(sum(A) / len(A)))^2 end_2=subtraction_2 / (len(A)-1) print(end_2^0.5) B.append(b) print("Years of Experience:") print(min(B)) print(max(B)) print(sum(B)/len(B)) B=sorted(B) if len(B) % 2 > 0: print(B[len(B)//2]) if len(B) % 2 == 0: print((B[len(B)//2] + B[len(B)//2 -1]) / 2) most_common={} for element in B: if element in most_common: most_common[element] += 1 else: most_common[element] = 1 max_count = 0 most_common_element = None for num, count in frequency.items(): if count > max_count: max_count = count most_common_element = num print(most_common_element) end=[] for i in B: subtraction_1=(i - (sum(B) / len(B)))^2 end.append(subtraction_1) print(sum(end)) for i in B: subtraction_2=(i-(sum(B) / len(B)))^2 end_2=subtraction_2 / (len(B)-1) print(end_2^0.5) C.append(c) print("Job Satisfaction:") print(min(C)) print(max(C)) print(sum(C)/len(C)) C=sorted(C) if len(C) % 2 > 0: print(C[len(C)//2]) if len(C) % 2 == 0: print((C[len(C)//2] + C[len(C)//2 -1]) / 2) most_common={} for element in C: if element in most_common: most_common[element] += 1 else: most_common[element] = 1 max_count = 0 most_common_element = None for num, count in frequency.items(): if count > max_count: max_count = count most_common_element = num print(most_common_element) end=[] for i in C: subtraction_1=(i - (sum(C) / len(C)))^2 end.append(subtraction_1) print(sum(end)) for i in C: subtraction_2=(i-(sum(C) / len(C)))^2 end_2=subtraction_2 / (len(C)-1) print(end_2^0.5) D.append(d) print("Work-Life Balance:") print(min(D)) print(max(D)) print(sum(D)/len(D)) D=sorted(D) if len(D) % 2 > 0: print(D[len(D)//2]) if len(D) % 2 == 0: print((D[len(D)//2] + D[len(D)//2 -1]) / 2) most_common={} for element in D: if element in most_common: most_common[element] += 1 else: most_common[element] = 1 max_count = 0 most_common_element = None for num, count in frequency.items(): if count > max_count: max_count = count most_common_element = num print(most_common_element) end=[] for i in D: subtraction_1=(i - (sum(D) / len(D)))^2 end.append(subtraction_1) print(sum(end)) for i in D: subtraction_2=(i-(sum(D) / len(D)))^2 end_2=subtraction_2 / (len(D)-1) print(end_2^0.5) E.append(e) print("Job Opportunities:") print(min(E)) print(max(E)) print(sum(E)/len(E)) E=sorted(E) if len(E) % 2 > 0: print(E[len(E)//2]) if len(E) % 2 == 0: print((E[len(E)//2] + E[len(E)//2 -1]) / 2) most_common={} for element in E: if element in most_common: most_common[element] += 1 else: most_common[element] = 1 max_count = 0 most_common_element = None for num, count in frequency.items(): if count > max_count: max_count = count most_common_element = num print(most_common_element) end=[] for i in E: subtraction_1=(i - (sum(E) / len(E)))^2 end.append(subtraction_1) print(sum(end)) for i in E: subtraction_2=(i-(sum(E) / len(E)))^2 end_2=subtraction_2 / (len(E)-1) print(end_2^0.5) F.append(f) print("Salary:") print(min(F)) print(max(F)) print(sum(F)/len(F)) F=sorted(F) if len(F) % 2 > 0: print(F[len(F)//2]) if len(F) % 2 == 0: print((F[len(F)//2] + F[len(F)//2 -1]) / 2) most_common={} for element in F: if element in most_common: most_common[element] += 1 else: most_common[element] = 1 max_count = 0 most_common_element = None for num, count in frequency.items(): if count > max_count: max_count = count most_common_element = num print(most_common_element) end=[] for i in F: subtraction_1=(i - (sum(F) / len(F)))^2 end.append(subtraction_1) print(sum(end)) for i in F: subtraction_2=(i-(sum(F) / len(F)))^2 end_2=subtraction_2 / (len(F)-1) print(end_2^0.5) M.append(m) print("Job Security:") print(min(M)) print(max(M)) print(sum(M)/len(M)) M=sorted(M) if len(M) % 2 > 0: print(M[len(M)//2]) if len(M) % 2 == 0: print((M[len(M)//2] + M[len(M)//2 -1]) / 2) most_common={} for element in M: if element in most_common: most_common[element] += 1 else: most_common[element] = 1 max_count = 0 most_common_element = None for num, count in frequency.items(): if count > max_count: max_count = count most_common_element = num print(most_common_element) end=[] for i in M: subtraction_1=(i - (sum(M) / len(M)))^2 end.append(subtraction_1) print(sum(end)) for i in M: subtraction_2=(i-(sum(M) / len(M)))^2 end_2=subtraction_2 / (len(M)-1) print(end_2^0.5) N.append(n) print("Career Change Interest:") print(min(N)) print(max(N)) print(sum(N)/len(N)) N=sorted(N) if len(N) % 2 > 0: print(N[len(N)//2]) if len(N) % 2 == 0: print((N[len(N)//2] + N[len(N)//2 -1]) / 2) most_common={} for element in N: if element in most_common: most_common[element] += 1 else: most_common[element] = 1 max_count = 0 most_common_element = None for num, count in frequency.items(): if count > max_count: max_count = count most_common_element = num print(most_common_element) end=[] for i in N: subtraction_1=(i - (sum(N) / len(N)))^2 end.append(subtraction_1) print(sum(end)) for i in N: subtraction_2=(i-(sum(N) / len(N)))^2 end_2=subtraction_2 / (len(N)-1) print(end_2^0.5) L.append(l) print("Skills Gap:") print(min(L)) print(max(L)) print(sum(L)/len(L)) L=sorted(L) if len(L) % 2 > 0: print(L[len(L)//2]) if len(L) % 2 == 0: print((L[len(L)//2] + L[len(L)//2 -1]) / 2) most_common={} for element in L: if element in most_common: most_common[element] += 1 else: most_common[element] = 1 max_count = 0 most_common_element = None for num, count in frequency.items(): if count > max_count: max_count = count most_common_element = num print(most_common_element) end=[] for i in L: subtraction_1=(i - (sum(L) / len(L)))^2 end.append(subtraction_1) print(sum(end)) for i in L: subtraction_2=(i-(sum(L) / len(L)))^2 end_2=subtraction_2 / (len(L)-1) print(end_2^0.5) H.append(h) print("Mentorship Available:") print(min(H)) print(max(H)) print(sum(H)/len(H)) H=sorted(H) if len(H) % 2 > 0: print(H[len(H)//2]) if len(H) % 2 == 0: print((H[len(H)//2] + H[len(H)//2 -1]) / 2) most_common={} for element in H: if element in most_common: most_common[element] += 1 else: most_common[element] = 1 max_count = 0 most_common_element = None for num, count in frequency.items(): if count > max_count: max_count = count most_common_element = num print(most_common_element) end=[] for i in H: subtraction_1=(i - (sum(H) / len(H)))^2 end.append(subtraction_1) print(sum(end)) for i in H: subtraction_2=(i-(sum(H) / len(H)))^2 end_2=subtraction_2 / (len(H)-1) print(end_2^0.5) J.append(j) print("Certifications:") print(min(J)) print(max(J)) print(sum(J)/len(J)) J=sorted(J) if len(J) % 2 > 0: print(J[len(J)//2]) if len(J) % 2 == 0: print((J[len(J)//2] + J[len(J)//2 -1]) / 2) most_common={} for element in J: if element in most_common: most_common[element] += 1 else: most_common[element] = 1 max_count = 0 most_common_element = None for num, count in frequency.items(): if count > max_count: max_count = count most_common_element = num print(most_common_element) end=[] for i in J: subtraction_1=(i - (sum(J) / len(J)))^2 end.append(subtraction_1) print(sum(end)) for i in J: subtraction_2=(i-(sum(J) / len(J)))^2 end_2=subtraction_2 / (len(J)-1) print(end_2^0.5) Y.append(y) print("Freelancing Experience:") print(min(Y)) print(max(Y)) print(sum(Y)/len(Y)) Y=sorted(Y) if len(Y) % 2 > 0: print(Y[len(Y)//2]) if len(Y) % 2 == 0: print((Y[len(Y)//2] + Y[len(Y)//2 -1]) / 2) most_common={} for element in Y: if element in most_common: most_common[element] += 1 else: most_common[element] = 1 max_count = 0 most_common_element = None for num, count in frequency.items(): if count > max_count: max_count = count most_common_element = num print(most_common_element) end=[] for i in Y: subtraction_1=(i - (sum(Y) / len(Y)))^2 end.append(subtraction_1) print(sum(end)) for i in Y: subtraction_2=(i-(sum(Y) / len(Y)))^2 end_2=subtraction_2 / (len(Y)-1) print(end_2^0.5) I.append(i) print("Geographic Mobility:") print(min(I)) print(max(I)) print(sum(I)/len(I)) I=sorted(I) if len(I) % 2 > 0: print(I[len(I)//2]) if len(I) % 2 == 0: print((I[len(I)//2] + I[len(I)//2 -1]) / 2) most_common={} for element in I: if element in most_common: most_common[element] += 1 else: most_common[element] = 1 max_count = 0 most_common_element = None for num, count in frequency.items(): if count > max_count: max_count = count most_common_element = num print(most_common_element) end=[] for i in I: subtraction_1=(i - (sum(I) / len(I)))^2 end.append(subtraction_1) print(sum(end)) for i in I: subtraction_2=(i-(sum(I) / len(I)))^2 end_2=subtraction_2 / (len(I)-1) print(end_2^0.5) O.append(o) print("Professional Networks:") print(min(O)) print(max(O)) print(sum(O)/len(O)) O=sorted(O) if len(O) % 2 > 0: print(O[len(O)//2]) if len(O) % 2 == 0: print((O[len(O)//2] + O[len(O)//2 -1]) / 2) most_common={} for element in O: if element in most_common: most_common[element] += 1 else: most_common[element] = 1 max_count = 0 most_common_element = None for num, count in frequency.items(): if count > max_count: max_count = count most_common_element = num print(most_common_element) end=[] for i in O: subtraction_1=(i - (sum(O) / len(O)))^2 end.append(subtraction_1) print(sum(end)) for i in O: subtraction_2=(i-(sum(O) / len(O)))^2 end_2=subtraction_2 / (len(O)-1) print(end_2^0.5) P.append(p) print("Career Change Events") print(min(P)) print(max(P)) print(sum(P)/len(P)) P=sorted(P) if len(P) % 2 > 0: print(P[len(P)//2]) if len(P) % 2 == 0: print((P[len(P)//2] + P[len(P)//2 -1]) / 2) most_common={} for element in P: if element in most_common: most_common[element] += 1 else: most_common[element] = 1 max_count = 0 most_common_element = None for num, count in frequency.items(): if count > max_count: max_count = count most_common_element = num print(most_common_element) end=[] for i in P: subtraction_1=(i - (sum(P) / len(P)))^2 end.append(subtraction_1) print(sum(end)) for i in P: subtraction_2=(i-(sum(P) / len(P)))^2 end_2=subtraction_2 / (len(P)-1) print(end_2^0.5) R.append(r) print("Technology Adoption:") print(min(R)) print(max(R)) print(sum(R)/len(R)) R=sorted(R) if len(R) % 2 > 0: print(R[len(R)//2]) if len(R) % 2 == 0: print((R[len(R)//2] + R[len(R)//2 -1]) / 2) most_common={} for element in R: if element in most_common: most_common[element] += 1 else: most_common[element] = 1 max_count = 0 most_common_element = None for num, count in frequency.items(): if count > max_count: max_count = count most_common_element = num print(most_common_element) end=[] for i in R: subtraction_1=(i - (sum(R) / len(R)))^2 end.append(subtraction_1) print(sum(end)) for i in R: subtraction_2=(i-(sum(R) / len(R)))^2 end_2=subtraction_2 / (len(R)-1) print(end_2^0.5) T.append(t) print("Likely to Change Occupation:") print(min(T)) print(max(T)) print(sum(T)/len(T)) T=sorted(T) if len(T) % 2 > 0: print(T[len(T)//2]) if len(T) % 2 == 0: print((T[len(T)//2] + T[len(T)//2 -1]) / 2) most_common={} for element in T: if element in most_common: most_common[element] += 1 else: most_common[element] = 1 max_count = 0 most_common_element = None for num, count in frequency.items(): if count > max_count: max_count = count most_common_element = num print(most_common_element) end=[] for i in T: subtraction_1=(i - (sum(T) / len(T)))^2 end.append(subtraction_1) print(sum(end)) for i in T: subtraction_2=(i-(sum(T) / len(T)))^2 end_2=subtraction_2 / (len(T)-1) print(end_2^0.5)
×
Чтобы оставить комментарий нужна авторизация
Печать