251 questions
name = [Gayeon, Nayeon, Dayeon, ...., Hayeon]test1 = [20, 98, ..., 86]test2 = [50, 39, ...,39]and How do I set the name to key and test1, test2 to value in the function info??I want to bundle the valu...
import collectionsimport operatorStudent = collections.namedtuple(Student, name stdid grade )e=int(input(Input loop count: ))list=[]for list in range (e): name1=input(Input name: ) stdid1 =int(input(I...
num=[1,2,2,3,3,4,4,4,4,4]How can I count the number of duplicate entries in this list?The count function should not be used and should be counted using a for repetitive statement.
Hello, I am an undergraduate studying coding.In the management class, ArrayList<Member> members = newArrayList<Member>();members.add (new member 1 (Hong Gil-dong, string, string, int);memb...
To solve this problem #4 for i in range(len(table[0])) : print(table[0][i]) sum=0 for j in range(1,len(table)) : for k in range(1,len(table[j])) : sum=sum+table[j][k] print(total score,sum,means,sum/(...
Hello, There is data as below. data = [{ 'a' : '1', 'b' : '2' , 'c' : '3' } , { 'd' : '4', 'e' : '5', 'f' : '6' }, { 'g' : '7', 'h' : '8', 'i' : '9' }]This 'a' : '1', 'b' : '2' , 'c' : '3''d' : '4', '...
def list_L(A,B): d=[] for i in range(A): C=B.count(A[i]) d.append(C) k=d.count(0) return True else: return FalseA=[int(x) for x in input(enter list1 elements:).split()]B=[int(x) for x in input(en...
Hello, everyoneI want to put the lists in one of the lists ([a], [b], [c], ... []) or [a,b,c,d,e,...]). What should I do?Most of the time I looked it up, A = [a], B = [b] were made and put together li...
[{'name': 'name', 'age': 1, 'kind': 'n'}, {'name': 'value', 'age': value, 'kind': 'value'}, {'name': 'value', 'age': value, 'kind': 'value'}]The list is stored in this way, but I don't know how to set...
// Use three dictionaries.Output A > {'ACG': [0], 'CGT': [1], 'GTT': [2], 'TTC': [3], 'TCC': [4], 'CCG': [5], 'CGG': [6, 10, 15]}Output B > {'AAT': [0], 'ATA': [1], 'TAT': [2], 'ATC': [3], 'TCC'...
| « | - 18 - | » |
© 2024 OneMinuteCode. All rights reserved.