Пікірлер

• 
  

  0

  

  dmitriy  commented 10 days ago

  def is_prime(n): if n < 2: return False

  Көшіру

  for i in range(2, int(n ** 0.5)+1):
      if n % i == 0:
          return False
  return True

  def prime_numbers(): num1, num2 = map(int, input().split())

  Көшіру

  primes = [n for n in range(num1, num2 + 1) if is_prime(n)]
  
  if primes:
      print(*primes)
  else:
      print("No prime!")

  prime_numbers()

• 
  

  0

  

  joe_pididon  commented 43 days ago

  include <iostream>

  using namespace std;

  int main() { int n = 1001; int num[n]; int A, B, found = 0;

  Көшіру

  cin >> A >> B;
  
  for (int i = A; i <= B; i++) {
      int prime = 1;
      if (i < 2) prime = 0;
      for (int j = 2; j * j <= i; j++) {
          if (i % j == 0) {
              prime = 0;
              break;
          }
      }
      if (prime) {
          cout << i << " ";
          found = 1;
      }
  }
  
  if (!found) cout << "No prime!";
  
  return 0;

  }