[BOJ] 1929 : 소수 구하기 [정수론](Python)(feat. 에라토스테네스의 체)

[BOJ] 1929 : 소수 구하기 [정수론](Python)(feat. 에라토스테네스의 체)

문제 링크 https://www.acmicpc.net/problem/1929 1929번: 소수 구하기 첫째 줄에 자연수 M과 N이 빈 칸을 사이에 두고 주어진다. (1 ≤ M ≤ N ≤ 1,000,000) M이상 N이하의 소수가 하나 이상 있는 입력만 주어진다. www.acmicpc.net 소스 코드 m,n = map(int,input().split()) sosu = [1 for _ in range(n+1)] sosu[1] = 0 for num in range(2,int(n**0.5)+1): if sosu[num]: # 배수로 제거되지 않은 숫자인 경우 # 이 숫자의 배수는 전부 0으로 바꿔준다 for multiple in range(num+num,n+1,num): sosu[multiple] = 0 # ..

원문링크 : [BOJ] 1929 : 소수 구하기 [정수론](Python)(feat. 에라토스테네스의 체)

 등록된 다른 글

<Prompt, Agent> [SPP] Unleashing Cognitive Synergy in Large Language Models: A Task-Solving Agent through Multi-Persona Self-Collaboration (2023.07)

<Prompt, Agent> [SPP] Unleashing Cognitive Synergy in Large Language Models: A Task-Solving Agent through Multi-Persona Self-Collaboration (2023.07)

<Image> [ViT] An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale

<Image> [ViT] An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale

Taylor series for approximations(1)

Taylor series for approximations(1)

<Data Type> [BitNet b1.58] The Era of 1-bit LLMs: All Large Language Models are in 1.58 Bits (2024.02)

<Data Type> [BitNet b1.58] The Era of 1-bit LLMs: All Large Language Models are in 1.58 Bits (2024.02)

3.1. 서론 3.2. 준비 운동: 덧셈, 뺄셈, 곱셈, 나눗셈

3.1. 서론 3.2. 준비 운동: 덧셈, 뺄셈, 곱셈, 나눗셈

Building AI in Your Company(3)

Building AI in Your Company(3)

<Benchmark> Struc-Bench: Are Large Language Models Really Good at Generating Complex Structured Data?

<Benchmark> Struc-Bench: Are Large Language Models Really Good at Generating Complex Structured Data?

<Reward> Beyond Sparse Rewards: Enhancing Reinforcement Learning with Language Model Critique in Text Generation (2024.01)

<Reward> Beyond Sparse Rewards: Enhancing Reinforcement Learning with Language Model Critique in Text Generation (2024.01)