Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.ArrayList;
- import java.util.List;
- import java.util.Scanner;
- /**
- *
- * @author PC-28
- */
- public class Solution {
- static List<Long> primos = new ArrayList<>();
- static List<Long> primosN = new ArrayList<>();
- public static void main(String[] args) {
- primos();
- String[] abn;
- int a, b, n;
- Scanner s = new Scanner(System.in);
- s.nextLine();
- while (s.hasNext()) {
- abn = s.nextLine().split(" ");
- n = Integer.parseInt(abn[0]);
- a = Integer.parseInt(abn[1]);
- b = Integer.parseInt(abn[2]);
- int i = 0;
- //obtener divisores
- primosN.clear();
- while ((n % primos.get(i) == 0) && primos.get(i) < n) {
- primosN.add(primos.get(i));
- i++;
- }
- int inti = 0;
- for (i = a; i <= b; i++) {
- if (test(i)) {
- inti += i;
- }
- }
- System.out.println(inti % 1000000007);
- }
- }
- static boolean test(int n) {
- for (long i : primosN) {
- if (n % i == 0) {
- return false;
- }
- }
- return true;
- }
- static void primos() {
- boolean primo;
- primos.add(2L);
- long i = 3;
- while (i <= 10000) {
- primo = true;
- for (long l : primos) {
- if (i % l == 0) {
- primo = false;
- break;
- }
- }
- if (primo) {
- primos.add(i);
- }
- i++;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement