緇欏畾N鍜屼竴涓暣鏁伴泦鍚坅錛岀敤涓嶅睘浜巃鐨?涓暣鏁扮浉涔樺緱鍑虹N鏈榪戠殑鏁存暟
N鐨勮寖鍥?锝?000
浠庡皬鍒板ぇ3閲嶅驚鐜氨鍙互瑙?br /> 鐞嗚涓婄殑澶嶆潅搴﹂珮杈?000^3
濡傛灉紜疄綆椾竴嬈℃垜鐨勭數鑴戣璺戝埌6縐?br /> 涓嶈繃鍏跺疄褰撲箻縐噺鍘籒宸茬粡瓚呰繃涔嬪墠鐨勫樊棰濇椂灝卞彲浠reak浜?br /> 鎵浠ヨ綆楅噺鍏跺疄寰堝皬
鍔犱笂break綆椾竴嬈″彧瑕侀浂鐐歸浂鍑犵
鍙﹀鐨勯櫡闃辨槸寰幆濡傛灉鍙槸1锝?000鏄笉琛岀殑
鏈夊彲鑳戒細鐢ㄥ埌姣?000榪樺ぇ鐨勫洜瀛?br />
1
import java.util.*;
2import java.util.regex.*;
3import java.text.*;
4import java.math.*;
5import java.awt.geom.*;
6
7public class AvoidingProduct
8
{
9
int SIZE = 1101;
10
11 public int[] getTriple(int[] a, int n)
12
{
13 boolean[] table = new boolean[SIZE];
14 Arrays.fill(table, true);
15 for(int i = 0 ; i < a.length ; ++ i)
16 table[a[i]] = false;
17 int x,y,z;
18 int[] ans = new int[3];
19 Arrays.fill(ans, Integer.MAX_VALUE);
20 int gap = Integer.MAX_VALUE;
21 Outer:
22 for(x = 1 ; x < SIZE; ++ x){
23 if(table[x] == false) continue;
24 for(y = 1; y < SIZE; ++ y){
25 if(table[y] == false) continue;
26 for(z = 1 ; z < SIZE; ++ z){
27 if(table[z] == false) continue;
28 int total = x * y * z;
29 int sub = n - total;
30 if(Math.abs(sub) < gap){
31 ans[0] = x; ans[1] = y; ans[2] = z;
32 gap = Math.abs(sub);
33
}
34 if(sub < 0 && Math.abs(sub) >= gap)
35 break ;
36 }
37 }
38 }
39 return ans;
40 }
41
42
}
import java.util.*;2
import java.util.regex.*;3
import java.text.*;4
import java.math.*;5
import java.awt.geom.*;6
7
public class AvoidingProduct8
{
9
int SIZE = 1101;10
11
public int[] getTriple(int[] a, int n)12
{
13
boolean[] table = new boolean[SIZE];14
Arrays.fill(table, true);15
for(int i = 0 ; i < a.length ; ++ i)16
table[a[i]] = false;17
int x,y,z;18
int[] ans = new int[3];19
Arrays.fill(ans, Integer.MAX_VALUE);20
int gap = Integer.MAX_VALUE;21
Outer:22
for(x = 1 ; x < SIZE; ++ x){23
if(table[x] == false) continue;24
for(y = 1; y < SIZE; ++ y){25
if(table[y] == false) continue;26
for(z = 1 ; z < SIZE; ++ z){27
if(table[z] == false) continue;28
int total = x * y * z;29
int sub = n - total;30
if(Math.abs(sub) < gap){31
ans[0] = x; ans[1] = y; ans[2] = z;32
gap = Math.abs(sub);33
}34
if(sub < 0 && Math.abs(sub) >= gap)35
break ;36
}37
}38
}39
return ans;40
}41
42
}]]>
http://www.topcoder.com/stat?c=problem_statement&pm=8547&rd=11128
姹俛鍒癮+b鎵鏈夌殑鏁扮殑cool divider鏁伴噺涔嬪拰錛屽嵆鏈韓鑳借鏁撮櫎浣嗘槸鍏秐嬈℃柟涓嶈兘琚暣闄?br />
鐢變簬鏁版嵁楂樿揪10^7錛屾毚鍔涙病鏈夊彲鑳斤紝灝嗕箻娉曡漿鍖栦負鍔犳硶涔熶粛鐒惰綆楅噺澶ぇ
絳旀緇欏嚭浜嗗緢濂界殑瑙ｅ喅鏂規硶
瀵逛簬a鍒癮+b涓棿鐨勬暟錛屽彲浠ユ暣闄鐨勪釜鏁頒負(a+b)/i - (a-1)/i錛屼互涓婂潎涓篿nt鐨勯櫎娉曟搷浣?br /> 榪欐牱澶уぇ鑺傜渷浜嗚綆楅噺
鍞竴瑕佹敞鎰忕殑鏄鏋渂澶т簬a錛屼細灝嗕竴閮ㄥ垎鍊兼湰韜璁＄畻涓嬈?br /> 鍥犳鏈鍚庤鍋氫竴鐐逛慨鏁?/p>
1import java.util.*;
2import java.util.regex.*;
3import java.text.*;
4import java.math.*;
5import java.awt.geom.*;
6
7public class ProperDivisors
8{
9 public int analyzeInterval(int a, int b, int n)
10 {
11 int i,sum = 0;
12 for(i = 2 ; i <= (a+b)/2; ++ i)
13 sum += (a+b)/i - (a-1)/i;
14 for(i = 2 ; i <= (a+b)/2; ++ i){
15 int k = pow(i,n);
16 sum -= (a+b)/k - (a-1)/k;
17 }
18 if(b >= a){
19 sum -= (a+b)/2 - a + 1;
20 if(a == 1) sum++;
21 }
22
23 return sum;
24 }
25
26 public int pow(int k, int n){
27 int i;
28 long result = k;
29 for( i = 1 ; i < n; ++ i){
30 result *= k;
31 if(result > Integer.MAX_VALUE)
32 return Integer.MAX_VALUE;
33 }
34 int res = (int)result;
35 return res;
36 }
37}
import java.util.*;2
import java.util.regex.*;3
import java.text.*;4
import java.math.*;5
import java.awt.geom.*;6
7
public class ProperDivisors8
{9
public int analyzeInterval(int a, int b, int n)10
{11
int i,sum = 0;12
for(i = 2 ; i <= (a+b)/2; ++ i)13
sum += (a+b)/i - (a-1)/i;14
for(i = 2 ; i <= (a+b)/2; ++ i){15
int k = pow(i,n);16
sum -= (a+b)/k - (a-1)/k;17
}18
if(b >= a){19
sum -= (a+b)/2 - a + 1;20
if(a == 1) sum++;21
}22
23
return sum;24
}25
26
public int pow(int k, int n){27
int i;28
long result = k;29
for( i = 1 ; i < n; ++ i){30
result *= k;31
if(result > Integer.MAX_VALUE)32
return Integer.MAX_VALUE;33
}34
int res = (int)result;35
return res;36
}37
}]]>