题目链接:http://poj.org/problem?id=2635
题目:如果数K能被L以内的素数不包括L整除,输出 BAD 和这个素数,否则 GOOD;
思路:
高精度取模能够处理大数的取模,最基本的是十进制的取模,要想不超时,可以3位为一个单位取模;如果这个大数有100位,那么3位为一个单位取模只需要 100/3次,时间上有很大优化;
这里素数要用素数筛法预先打表
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
using namespace std;
typedef long long ll;
const int Maxn = 1e6+10;
int prime[Maxn], p[Maxn], num[50], cnt;
void init () {
cnt = 0;
for (int i = 2; i < Maxn; ++i) {
if (!prime[i]) {
p[cnt++] = i;
for (int j = i+i; j < Maxn; j+=i) prime[j] = 1;
}
}
}
int main (void)
{
init ();
char s[105]; int k;
while (scanf ("%s%d", s, &k)) {
if(!strcmp (s, "0") && !k) break;
int len = strlen (s)-1,index, n = 0; bool falg = false;
while (len-2 >= 0) { // 用数组把s大数拆分成3位数为一个单位
index = s[len]-'0';
index += (s[len-1]-'0')*10;
index += (s[len-2]-'0')*100;
num[n++] = index;
len-=3;
}
if(len > -1) { // 处理剩余的部分
index = 0;
for (int i = 0; i <= len; ++i) index = (index*10+(s[i]-'0'));
num[n++] = index;
}
for (int i = 0; i < cnt; ++i) {
if (p[i] >= k) break;
int tmp = 0, mod = p[i];
for (int j = n-1; j >= 0; --j) { // 高精度取模,3位数为一个单位
tmp = (tmp*1000+num[j])%mod;
}
if (!tmp) {
printf ("BAD %d\n", mod); falg = true;
break;
}
}
if (!falg) printf ("GOOD\n");
}
return 0;
}
Java就不用多解释了,直接算就行了;
import java.io.*;
import java.util.*;
import java.math.*;
import java.text.*;
public class Main {
public static void main (String[] args) {
Scanner cin = new Scanner (new BufferedInputStream (System.in));
int prime[] = new int[1000010];
for (int i = 2; i <= 1000000; ++i) {
if(prime[i] == 0) {
for (int j = i+i; j <= 1000000; j+=i) prime[j] = 1;
}
}
while (cin.hasNext()) {
BigInteger N; int K, ans = 0;
N = cin.nextBigInteger ();
K = cin.nextInt();
if (N.equals(BigInteger.ZERO) && K == 0) break;
for (int i = 2; i < K; ++i) {
if(prime[i] == 0 && N.remainder(BigInteger.valueOf(i)).equals(BigInteger.ZERO)) {
ans = i; break;
}
}
if (ans != 0) {
System.out.println("BAD " + ans);
} else System.out.println("GOOD");
}
}
}