..

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162number=366 #1901년 1월 1일count=0JANUARY=31FEBURARY=28MARCH=31APIRL=30MAY=31JUNE=30JULY=31AUGUST=31SEPTEMBER=30OCTOBER=31NOVEMBER=30DECEMBER=31def isLeapYear(a): if(a%7==0): return Trueif(isLeapYear(number)): count=count+1for year in range(1901,2001): #윤년 판정 if(year%4==0): FEBURARY=29 ..

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889sum_result=0HUNDRED_AND=10for number in range(1,1001): sum=0 number_str=str(number) number_length=(len(number_str)) if(number_length==1): #한 자리 수 if(number==1 or number==2 or number==6): sum=sum+3 elif(number==3 or number==7 or n..

123456789sum=0number=0for i in range(1,1001): number=i for j in range(1,i): number=number*i sum=sum+numbersum_str=str(sum)print(sum_str[-10:])cs 거듭제곱을 구하기 위해 math.pow()를 사용하면 수의 범위를 넘어가게 되므로 거듭제곱을 구할 수 있는 코드를 작성해주어야 한다. 최종 결과를 문자열로 바꾼 후 끝에서 10번째부터 문자열 끝까지 출력하게 만들어 주었다. [-10:-1]이라고 쓰면 -1번째 문자는 포함하지 않는 것이므로 옳은 방법이 아니다.

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465arr=#words.txtarr_length=len(arr)count=0for a in range(0,arr_length): sum=0 for str_length in range(0,len(arr[a])): if(arr[a][str_length].find('A')!=-1): sum=sum+1 elif(arr[a][str_length].find('B')!=-1): sum=sum+2 elif(arr[a][str_length].find('C')!=-1): sum=sum+3 elif(arr[a][s..

123456string=''i=0while(len(string)

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061arr=#name.txtlist.sort(arr)arr_length=len(arr)sum_result=0for number in range(0,arr_length): sum=0 for str_length in range(0,len(arr[number])): if(arr[number][str_length].find('A')!=-1): sum=sum+1 elif(arr[number][str_length].find('B')!=-1): sum=sum+2 elif(arr[number][str_length].find..

12345678910111213141516import mathcountResult=0result=0for circumference in range(1,1001): count=0 for a in range(1,circumference): for b in range(1,a): c=circumference-a-b if((int)(math.pow(c,2)!=(int)(math.pow(a,2)+math.pow(b,2)))): continue else: count=count+1 if(countResult

12345678910111213141516171819202122232425262728import mathsum=0for a in range(0,1000001): numberDecimal=str(a) numberBinary=str(bin(a))[2:len(str(bin(a)))] decimal_length=len(numberDecimal) binary_length=len(numberBinary) decimal_count=math.ceil(decimal_length/2) binary_count=math.ceil(binary_length/2) index_decimal_a=0 index_decimal_b=decimal_length-1 index_binary_a=0 index_binary_b=binary_leng..

1234567891011121314151617181920212223242526import math#a,b,c는 자리수를 나타냄first=0second=0third=0sumResult=0arr=[]for a in range(1,8): for b in range(1,8): for c in range(1,8): if(a+b+c!=9): continue for i in range(int(math.pow(10,a-1)),int(math.pow(10,a))): for j in range(int(math.pow(10,b-1)),int(math.pow(10,b))): result=i*j result_length=len(str(i*j)) if(a+b+result_length!=9): break string=str(i)+..

1234567import matharr=[]for a in range(2,101): for b in range(2,101): arr.append(math.pow(a,b))arr=list(set(arr))print(len(arr))cs 파이썬은 정말 강력하다.