Skip to content

[H] 소수찾기 문제풀이 제출합니다. #73

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
honux77 merged 3 commits into from
Jun 16, 2019
Merged

[H] 소수찾기 문제풀이 제출합니다. #73

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
eb231e4
H-Index 문제풀이
hsycamp May 24, 2019
78a6ae9
H-Index 문제풀이
hsycamp May 24, 2019
c0cd1e7
소수 찾기 문제풀이
hsycamp Jun 15, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
31 changes: 31 additions & 0 deletions 190611/H/count_prime_number.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
from itertools import permutations


def makeNumbers(numbers):
numbers = list(numbers)
resultA = []
for i in range(1, len(numbers)+1):
resultA.append(permutations(numbers, i))
resultB = [y for x in resultA for y in x]
answer = set([str(int(''.join(j))) for j in resultB])
return answer


def countPrimeNumber(numberlist):
answer = 0
for i in numberlist:
t = int(i)
result = 0
for j in range(2, t):
if t % j == 0:
result += 1
break
if result == 0 and t != 1 and t != 0:
answer += 1
return answer


def solution(numbers):
numberlist = makeNumbers(numbers)
answer = countPrimeNumber(numberlist)
return answer