2. 閫夋嫨楂樼駭鐜璁劇疆
3. 鍦ㄧ郴緇熷彉閲忛噷“鏂板緩”
1錛塉AVA_HOME 錛圝DK鐨勫畨瑁呰礬寰? 鍊間負錛欳:\Program Files\Java\jdk1.6.0_10錛?br>
2錛夋柊寤篶lasspath (鍊間負錛?;%JAVA_HOME%\lib\tools.jar) 娉ㄦ剰鍓嶉潰鏄?nbsp; ,; (閫楀彿涓庡垎鍙鳳級
3錛夌紪杈憄ath錛?nbsp; 鍦ㄦ渶鍓嶉潰鍋囧 ;%JAVA_HOME%\bin; %JAVA_HOME%\jre\bin;
涓嬮潰鏉ユ祴璇曚竴涓嬬幆澧冨畨瑁呮槸鍚︽垚鍔燂細
鎴戝湪D鐩樹笅鏂板緩java鏂囦歡澶癸紝鍦ㄦ枃浠跺す涓嬫柊寤鴻浜嬫湰錛岀紪杈戝涓嬶細
public class Hello
{
public static void main(String[] args)
{
System.out.println("鎭枩錛岄厤緗垚鍔?");
}
}
{
public static void main(String[] args)
{
System.out.println("鎭枩錛岄厤緗垚鍔?");
}
}
鍙﹀瓨涓猴細Hello.java
鍦ㄥ紑濮嬭彍鍗曢噷閫夋嫨“榪愯”錛堝鏋滄病鏈夛紝鍙沖嚮浠誨姟鏍忥紝鍦ㄥ睘鎬ч噷鎵懼埌“寮濮嬭彍鍗?#8221;錛?#8220;鑷畾涔?#8221;錛屽嬀閫?#8220;榪愯)
鍦ㄨ繍琛岄噷杈撳叆cmd, 鐒跺悗渚濇杈撳叆
d:
cd java
javac Hello.java
java Hello 濡傛灉鏄劇ず濡備笅錛屽垯閰嶇疆鎴愬姛錛?br>
]]>
鏈鐭礬 http://acm.hdu.edu.cn/showproblem.php?pid=2544
璧よ８瑁哥殑鏈鐭礬
A Walk Through the Forest http://acm.hdu.edu.cn/showproblem.php?pid=1142
"He considers taking a path from A to B to be progress if there exists a route from B to his home that is shorter than any possible route from A." 閲嶅湪鐞嗚В榪欏彞璇濄傚厛姹傚嚭鎵鏈夐《鐐瑰埌欏剁偣2鐨勬渶鐭礬(浠ラ《鐐?涓烘簮鐐瑰仛涓嬈ijkstra)錛岀劧鍚庝粠欏剁偣1寮濮嬭蹇嗗寲鎼滅儲銆?br>If (d[u] > d[v])
Sum += bfs(v);
Minimum Transport Cost http://acm.hdu.edu.cn/showproblem.php?pid=1385
Floyd璺緞杈撳嚭錛岄鐩鎸夎礬寰勭殑瀛楀吀搴忚緭鍑猴紱
if (p[i][k] + p[k][j] == map[i][j] && path[i][k] < path[i][j])
path[i][j] = path[i][k];
鍗沖彲
Arbitrage http://acm.hdu.edu.cn/showproblem.php?pid=1217
闂鏄槸鍚﹀彲浠ョ泩鍒╋紝濡傛灉鎴戜滑鎶婃眹鐜囩湅鎴愯竟錛屽綋涓涓偣閫氳繃鏌愪簺璺緞榪斿洖鍒拌嚜宸卞悗鐨勫煎ぇ浜?錛屽垯鐩堝埄錛?br>
A strange lift http://acm.hdu.edu.cn/showproblem.php?pid=1548
鍥犱負杈圭殑鏉冨奸兘涓?錛孊FS錛孌ijkstra閮藉彲浠?br>
The shortest path http://acm.hdu.edu.cn/showproblem.php?pid=2224
Bitonic path (璇﹁銆婄畻娉曞璁恒?nbsp;P217)
涓涓漢浠巔1涓ユ牸鍦板鐨勮蛋鍒皃n錛岀劧鍚庡啀涓ユ牸閫掑噺鐨勫洖鍒皃1;姹傛昏礬寰勭殑鏈灝忓鹼紱
緗戜笂鐪嬪埌寰堝瑙ｉ鎶ュ憡
鐪嬬殑鎴戠洿鍐掓睏
瀵逛簬1 <= i <= j <= n, 鎴戜滑瀹氫箟P(i, j)鏄竴鏉″寘鍚簡P1, P2, P3 …… Pj鐨勯斿緞; 榪欐潯璺緞鍙互鍒嗘垚2閮ㄥ垎錛氶掑噺搴忓垪涓庨掑搴忓垪錛岃搗鐐規槸Pi(1 <= i <= j)錛屾嫄鐐規槸P1錛岀粓鐐規槸Pj, P[i, j]涓哄叾鏈灝忓鹼紱閭ｄ箞鐘舵佽漿縐繪柟紼嬩負錛?br> b[1,2] = |P1P2|,
i < j-1鏃訛紝 b[i,j] = b[i,j-1] + |Pj-1Pj| 鐐筆j-1鍦ㄩ掑搴忓垪涓紝
i = j-1鏃訛紝 b[i,j] = min{ b[k,j-1] + |PkPj|, 1<= k < j-1 } 鐐筆j-1鍦ㄩ掑噺搴忓垪涓?br> b[n,n] = b[n-1,n] + |Pn-1Pn|
The Shortest Path http://acm.hdu.edu.cn/showproblem.php?pid=2807
Floyd涓庡嬈ijkstra閮藉彲浠ワ紱
A*B=C, A,C榪炲悓錛?br>鎴戜滑涓嶅Θ鍙互瀵逛簬姣忎袱涓煄甯傜浉涔橈紝鎶婂緱鍒扮殑鐭╅樀璺熼潪A錛孊姣旇緝錛岃屼笉瑕佸浜嶢,C鍘誨鎵炬槸鍚﹀瓨鍦ㄨ繖鏍蜂竴涓狟錛岀粨鏋滃緢瀹規槗瓚呮椂
鍙﹀錛岃繖閲屾湁涓紭鍖栨槸鐭╅樀鐨勬瘮杈?nbsp;錛?緇磋漿鍖栨垚1緇達級
璧よ８瑁哥殑鏈鐭礬
A Walk Through the Forest http://acm.hdu.edu.cn/showproblem.php?pid=1142
"He considers taking a path from A to B to be progress if there exists a route from B to his home that is shorter than any possible route from A." 閲嶅湪鐞嗚В榪欏彞璇濄傚厛姹傚嚭鎵鏈夐《鐐瑰埌欏剁偣2鐨勬渶鐭礬(浠ラ《鐐?涓烘簮鐐瑰仛涓嬈ijkstra)錛岀劧鍚庝粠欏剁偣1寮濮嬭蹇嗗寲鎼滅儲銆?br>If (d[u] > d[v])
Sum += bfs(v);
Minimum Transport Cost http://acm.hdu.edu.cn/showproblem.php?pid=1385
Floyd璺緞杈撳嚭錛岄鐩鎸夎礬寰勭殑瀛楀吀搴忚緭鍑猴紱
if (p[i][k] + p[k][j] == map[i][j] && path[i][k] < path[i][j])
path[i][j] = path[i][k];
鍗沖彲
Arbitrage http://acm.hdu.edu.cn/showproblem.php?pid=1217
闂鏄槸鍚﹀彲浠ョ泩鍒╋紝濡傛灉鎴戜滑鎶婃眹鐜囩湅鎴愯竟錛屽綋涓涓偣閫氳繃鏌愪簺璺緞榪斿洖鍒拌嚜宸卞悗鐨勫煎ぇ浜?錛屽垯鐩堝埄錛?br>
A strange lift http://acm.hdu.edu.cn/showproblem.php?pid=1548
鍥犱負杈圭殑鏉冨奸兘涓?錛孊FS錛孌ijkstra閮藉彲浠?br>
涓涓漢鐨勬梾琛?/span>http://acm.hdu.edu.cn/showproblem.php?pid=2066
闇瑕佹瀯鍥撅紝鍙﹀寤虹珛2涓偣錛屽垎鍒悇涔樿濺鍩庡競錛岃崏鍎挎兂鍘葷殑鍦版柟鐩歌繛錛屾潈鍊間負0錛涘垯闂杞寲涓哄崟婧愭渶鐭礬闂錛?/span>
The shortest path http://acm.hdu.edu.cn/showproblem.php?pid=2224
Bitonic path (璇﹁銆婄畻娉曞璁恒?nbsp;P217)
涓涓漢浠巔1涓ユ牸鍦板鐨勮蛋鍒皃n錛岀劧鍚庡啀涓ユ牸閫掑噺鐨勫洖鍒皃1;姹傛昏礬寰勭殑鏈灝忓鹼紱
緗戜笂鐪嬪埌寰堝瑙ｉ鎶ュ憡
鐪嬬殑鎴戠洿鍐掓睏 瀵逛簬1 <= i <= j <= n, 鎴戜滑瀹氫箟P(i, j)鏄竴鏉″寘鍚簡P1, P2, P3 …… Pj鐨勯斿緞; 榪欐潯璺緞鍙互鍒嗘垚2閮ㄥ垎錛氶掑噺搴忓垪涓庨掑搴忓垪錛岃搗鐐規槸Pi(1 <= i <= j)錛屾嫄鐐規槸P1錛岀粓鐐規槸Pj, P[i, j]涓哄叾鏈灝忓鹼紱閭ｄ箞鐘舵佽漿縐繪柟紼嬩負錛?br> b[1,2] = |P1P2|,
i < j-1鏃訛紝 b[i,j] = b[i,j-1] + |Pj-1Pj| 鐐筆j-1鍦ㄩ掑搴忓垪涓紝
i = j-1鏃訛紝 b[i,j] = min{ b[k,j-1] + |PkPj|, 1<= k < j-1 } 鐐筆j-1鍦ㄩ掑噺搴忓垪涓?br> b[n,n] = b[n-1,n] + |Pn-1Pn|
The Shortest Path http://acm.hdu.edu.cn/showproblem.php?pid=2807
Floyd涓庡嬈ijkstra閮藉彲浠ワ紱
A*B=C, A,C榪炲悓錛?br>鎴戜滑涓嶅Θ鍙互瀵逛簬姣忎袱涓煄甯傜浉涔橈紝鎶婂緱鍒扮殑鐭╅樀璺熼潪A錛孊姣旇緝錛岃屼笉瑕佸浜嶢,C鍘誨鎵炬槸鍚﹀瓨鍦ㄨ繖鏍蜂竴涓狟錛岀粨鏋滃緢瀹規槗瓚呮椂
鍙﹀錛岃繖閲屾湁涓紭鍖栨槸鐭╅樀鐨勬瘮杈?nbsp;錛?緇磋漿鍖栨垚1緇達級
]]>
甯歌鐭╅樀姣旇緝澶嶆潅搴︽槸O(n^2), 鎴戜滑鍙妸2緇寸殑鏁扮粍涔樹互涓涓竴緇存暟緇?nbsp; 鏉ユ瘮杈?br>閫氳繃榪欓亾棰樼殑嫻嬭瘯錛屾晥鏋滅伆甯歌浜哄悆鎯娿傘傘?br>
甯歌姣旇緝鐨勪唬鐮佺敤C++鎻愪氦瓚呮椂錛屼絾鏄疓++鍙互榪囨帀錛?484MS
#include <iostream>
using namespace std;
#define N 81
#define INF 99999999
int map[N][N], n, m;
struct node{
int Map[N][N];
} rec[N];
struct nnode{
int Map[N];
}recone[N];
void cmp(int a, int x)
{
int i;
for (i=1; i<=m; i++)
if (recone[x].Map[i] != recone[0].Map[i])
return;
map[a][x] = 1;
}
void creat(int a, int b)
{
int i, j, k, s;
for (i=1; i<=m; i++)
{
recone[0].Map[i] = 0;
for (j=1; j<=m; j++)
{
recone[0].Map[i] += rec[a].Map[i][j] * recone[b].Map[j];
}
}
for (i=1; i<=n; i++)
if (i != a && i != b)
cmp(a, i); //鍒ゆ柇 a 涓?nbsp;i鐨勫叧緋?/span>
}
int main()
{
int i, j, k;
while (scanf("%d %d", &n, &m), n+m)
{
for (i=1; i<=n; i++)
for (map[i][i]=0, j=i+1; j<=n; j++)
map[i][j] = map[j][i] = INF; //鍒濆鍖栫煩闃典箣闂村叧緋?/span>
for (k=1; k<=n; k++)
{
for (i=1; i<=m; i++)
{
recone[k].Map[i] = 0;
for (j=1; j<=m; j++)
{
scanf("%d", &rec[k].Map[i][j]);
recone[k].Map[i] += rec[k].Map[i][j] * j; // 2->1
}
}
} // 鎺ュ彈鐭╅樀淇℃伅
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (i != j)
creat(i, j); // 澶勭悊鐭╅樀 i*j
for (k=1; k<=n; k++)
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (map[i][k] + map[k][j] < map[i][j])
map[i][j] = map[i][k] +map[k][j];
scanf("%d", &m);
while (m--)
{
scanf("%d %d", &i, &j);
if (map[i][j] != INF)
printf("%d\n", map[i][j]);
else
printf("Sorry\n");
}
}
return 0;
}
using namespace std;
#define N 81
#define INF 99999999
int map[N][N], n, m;
struct node{
int Map[N][N];
} rec[N];
struct nnode{
int Map[N];
}recone[N];
void cmp(int a, int x)
{
int i;
for (i=1; i<=m; i++)
if (recone[x].Map[i] != recone[0].Map[i])
return;
map[a][x] = 1;
}
void creat(int a, int b)
{
int i, j, k, s;
for (i=1; i<=m; i++)
{
recone[0].Map[i] = 0;
for (j=1; j<=m; j++)
{
recone[0].Map[i] += rec[a].Map[i][j] * recone[b].Map[j];
}
}
for (i=1; i<=n; i++)
if (i != a && i != b)
cmp(a, i); //鍒ゆ柇 a 涓?nbsp;i鐨勫叧緋?/span>
}
int main()
{
int i, j, k;
while (scanf("%d %d", &n, &m), n+m)
{
for (i=1; i<=n; i++)
for (map[i][i]=0, j=i+1; j<=n; j++)
map[i][j] = map[j][i] = INF; //鍒濆鍖栫煩闃典箣闂村叧緋?/span>
for (k=1; k<=n; k++)
{
for (i=1; i<=m; i++)
{
recone[k].Map[i] = 0;
for (j=1; j<=m; j++)
{
scanf("%d", &rec[k].Map[i][j]);
recone[k].Map[i] += rec[k].Map[i][j] * j; // 2->1
}
}
} // 鎺ュ彈鐭╅樀淇℃伅
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (i != j)
creat(i, j); // 澶勭悊鐭╅樀 i*j
for (k=1; k<=n; k++)
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
if (map[i][k] + map[k][j] < map[i][j])
map[i][j] = map[i][k] +map[k][j];
scanf("%d", &m);
while (m--)
{
scanf("%d %d", &i, &j);
if (map[i][j] != INF)
printf("%d\n", map[i][j]);
else
printf("Sorry\n");
}
}
return 0;
}
]]>
/***
count the number of the integers M (0<M<N) which satisfies gcd(N,M)>1.
鍗籌細N - 1 - phi(N)
鐢變簬1<N<100000000, 涓嶈偗鑳介澶勭悊鎵鏈夌殑嬈ф媺鍑芥暟
閲囩敤嬈ф媺鎬ц川錛?br> 1.鑻鏄川鏁皃鐨刱嬈″箓錛?#966;錛坣錛? 錛坧-1錛塸^(k-1)
2.鑻錛宯浜掕川錛?#966;錛坢n錛? φ(m)φ(n)
鑻?nbsp;n =p1^a1 * p2^a2 ** pn^an
鍒?nbsp; phi(n) = (p1-1)*p1^(a1-1) * (p2-1)*p2^(a2-1) ** (pn-1)*pn^(an-1)
= N * (p1-1)*(p2-2)**(pn-1)/(p1*p2**pn)
**/
#include <stdio.h>
#define N 10001
__int64 p[5000];
int hash[10001];
int main()
{
__int64 i, j, ans, n, m, temp;
p[0] = 1; //璁板綍绱犳暟涓暟
p[1] = 2;
for (i=3; i<N; i+=2)
{
if (hash[i])
continue;
p[++p[0]] = i;
for (j=i*i; j<N; j+=i)
hash[j] = 1;
} //絳涚礌鏁?nbsp;
while (scanf("%I64d", &n), n)
{
ans = 1;
m = n;
for (i=1; p[i]<=m && i<=p[0]; i++)
if (m%p[i]==0)
{
temp = 1;
while (m%p[i] == 0)
{
m /= p[i];
temp *= p[i];
}
temp /= p[i];
ans*=(p[i]-1)*temp;
}
if (m>1)
{
ans *= (m-1);
} //濡傛灉鍓╀笅閭ｄ釜鏁板ぇ浜?,m涓哄ぇ浜?0000鐨勮川鏁?/span>
printf("%I64d\n", n-ans-1);
}
}
count the number of the integers M (0<M<N) which satisfies gcd(N,M)>1.
鍗籌細N - 1 - phi(N)
鐢變簬1<N<100000000, 涓嶈偗鑳介澶勭悊鎵鏈夌殑嬈ф媺鍑芥暟
閲囩敤嬈ф媺鎬ц川錛?br> 1.鑻鏄川鏁皃鐨刱嬈″箓錛?#966;錛坣錛? 錛坧-1錛塸^(k-1)
2.鑻錛宯浜掕川錛?#966;錛坢n錛? φ(m)φ(n)
鑻?nbsp;n =p1^a1 * p2^a2 *
* pn^an鍒?nbsp; phi(n) = (p1-1)*p1^(a1-1) * (p2-1)*p2^(a2-1) *
* (pn-1)*pn^(an-1)= N * (p1-1)*(p2-2)*
*(pn-1)/(p1*p2**pn)**/
#include <stdio.h>
#define N 10001
__int64 p[5000];
int hash[10001];
int main()
{
__int64 i, j, ans, n, m, temp;
p[0] = 1; //璁板綍绱犳暟涓暟
p[1] = 2;
for (i=3; i<N; i+=2)
{
if (hash[i])
continue;
p[++p[0]] = i;
for (j=i*i; j<N; j+=i)
hash[j] = 1;
} //絳涚礌鏁?nbsp;
while (scanf("%I64d", &n), n)
{
ans = 1;
m = n;
for (i=1; p[i]<=m && i<=p[0]; i++)
if (m%p[i]==0)
{
temp = 1;
while (m%p[i] == 0)
{
m /= p[i];
temp *= p[i];
}
temp /= p[i];
ans*=(p[i]-1)*temp;
}
if (m>1)
{
ans *= (m-1);
} //濡傛灉鍓╀笅閭ｄ釜鏁板ぇ浜?,m涓哄ぇ浜?0000鐨勮川鏁?/span>
printf("%I64d\n", n-ans-1);
}
}
]]>
瀹氫箟錛?nbsp; 瀵逛簬姝ｆ暣鏁皀錛?#966;(n)鏄皬浜庢垨絳変簬n鐨勬鏁存暟涓紝涓巒浜掕川鐨勬暟鐨勬暟鐩紱
渚嬪: φ(8) = 4, 鍥犱負1錛?/span>3錛?/span>5錛?鍧囧拰8浜掕川銆?br>鎬ц川錛?nbsp; 1. 鑻鏄川鏁幫紝φ錛坧錛?/span>= p-1.
2. 鑻鏄川鏁皃鐨刱嬈″箓錛?#966;錛坣錛?/span>= 錛坧-1錛塸^(k-1)
鍥犱負闄や簡p鐨勫嶆暟閮戒笌n浜掕川
3. 嬈ф媺鍑芥暟鏄Н鎬у嚱鏁幫紝鑻錛宯浜掕川錛?#966;錛坢n錛?/span>= φ(m)φ(n)
鏍規嵁榪?鏉℃ц川鎴戜滑灝卞彲浠ラ鍑轟竴涓暣鏁扮殑嬈ф媺鍑芥暟鐨勫叕寮忥紝鍥犱負涓涓暟鎬誨彲浠ヤ竴浜涜川鏁扮殑涔樼Н鐨勫艦寮忋?br> E(k) = (p1-1)(p2-1)…(pi-1)*(p1^(a1-1))(p2^(a2-1))…(pi^(ai-1))
= k*(p1-1)(p2-1)…(pi-1)/(p1*p2*…pi)
= k*(1-1/p1)*(1-1/p2)…(1-1/pk)
鍦ㄧ▼搴忎腑鍒╃敤嬈ф媺鍑芥暟濡備笅鎬ц川錛屽彲浠ュ揩閫熸眰鍑烘鎷夊嚱鏁扮殑鍊?a涓篘鐨勮川鍥犵礌)
鑻?N%a==0 && (N/a)%a==0) 鍒欐湁:E(N)=E(N/a)*a;
鑻?N%a==0 && (N/a)%a!=0) 鍒欐湁:E(N)=E(N/a)*(a-1);
渚嬪: φ(8) = 4, 鍥犱負1錛?/span>3錛?/span>5錛?鍧囧拰8浜掕川銆?br>鎬ц川錛?nbsp; 1. 鑻鏄川鏁幫紝φ錛坧錛?/span>= p-1.
2. 鑻鏄川鏁皃鐨刱嬈″箓錛?#966;錛坣錛?/span>= 錛坧-1錛塸^(k-1)
鍥犱負闄や簡p鐨勫嶆暟閮戒笌n浜掕川
3. 嬈ф媺鍑芥暟鏄Н鎬у嚱鏁幫紝鑻錛宯浜掕川錛?#966;錛坢n錛?/span>= φ(m)φ(n)
鏍規嵁榪?鏉℃ц川鎴戜滑灝卞彲浠ラ鍑轟竴涓暣鏁扮殑嬈ф媺鍑芥暟鐨勫叕寮忥紝鍥犱負涓涓暟鎬誨彲浠ヤ竴浜涜川鏁扮殑涔樼Н鐨勫艦寮忋?br> E(k) = (p1-1)(p2-1)…(pi-1)*(p1^(a1-1))(p2^(a2-1))…(pi^(ai-1))
= k*(p1-1)(p2-1)…(pi-1)/(p1*p2*…pi)
= k*(1-1/p1)*(1-1/p2)…(1-1/pk)
鍦ㄧ▼搴忎腑鍒╃敤嬈ф媺鍑芥暟濡備笅鎬ц川錛屽彲浠ュ揩閫熸眰鍑烘鎷夊嚱鏁扮殑鍊?a涓篘鐨勮川鍥犵礌)
鑻?N%a==0 && (N/a)%a==0) 鍒欐湁:E(N)=E(N/a)*a;
鑻?N%a==0 && (N/a)%a!=0) 鍒欐湁:E(N)=E(N/a)*(a-1);
浠ヤ笅鏄?縐嶆眰嬈ф媺鍑芥暟鐨勭畻娉?br>
1 void init()
2 {
3 __int64 i,j;
4 e[1] = 1;
5 for(i=2;i<=N;i++)
6 if(!e[i])
7 {
8 for(j=i; j<=N; j+=i)
9 {
10 if (!e[j])
11 e[j] = j;
12 e[j] = e[j] / i * (i-1);
13 }
14 }
15 }
2 {
3 __int64 i,j;
4 e[1] = 1;
5 for(i=2;i<=N;i++)
6 if(!e[i])
7 {
8 for(j=i; j<=N; j+=i)
9 {
10 if (!e[j])
11 e[j] = j;
12 e[j] = e[j] / i * (i-1);
13 }
14 }
15 }
鍒╃敤绱犳暟絳涢夛細
void init()
{
__int64 i, j;
p[0] = 1; //璁板綍绱犳暟涓暟
p[1] = 2;
for (i=3; i<N; i+=2)
{
if (hash[i])
continue;
p[++p[0]] = i;
for (j=i*i; j<N; j+=i)
hash[j] = true;
} //絳涚礌鏁?/span>
e[1] = 1;
for (i=1; i<=p[0]; i++)
e[p[i]] = p[i] - 1; //鍒濆鍖栫礌鏁扮殑phi
for (i=2; i<N; i++)
{
if(!e[i])
{
for (j=1; j<=p[0]; j++)
if (i % p[j]==0)
{
if (i / p[j] % p[j])
e[i] = e[i / p[j]] * e[p[j]];
else
e[i] = e[i / p[j] ]* p[j];
break;
} // 鍒╃敤涓婅堪鎬ц川姹傝В
}
}
return ;
}
{
__int64 i, j;
p[0] = 1; //璁板綍绱犳暟涓暟
p[1] = 2;
for (i=3; i<N; i+=2)
{
if (hash[i])
continue;
p[++p[0]] = i;
for (j=i*i; j<N; j+=i)
hash[j] = true;
} //絳涚礌鏁?/span>
e[1] = 1;
for (i=1; i<=p[0]; i++)
e[p[i]] = p[i] - 1; //鍒濆鍖栫礌鏁扮殑phi
for (i=2; i<N; i++)
{
if(!e[i])
{
for (j=1; j<=p[0]; j++)
if (i % p[j]==0)
{
if (i / p[j] % p[j])
e[i] = e[i / p[j]] * e[p[j]];
else
e[i] = e[i / p[j] ]* p[j];
break;
} // 鍒╃敤涓婅堪鎬ц川姹傝В
}
}
return ;
}
鏄庢樉絎竴縐嶇殑緙栫▼澶嶆潅搴﹁浣庡緢澶?br>鎵浠ワ紝涓鑸儏鍐典笅錛圢涓嶆槸寰堝ぇ錛夛紝閲囩敤絎竴縐嶅嵆鍙紱
璐村湪榪欓噷渚涗互鍚庡涔?img border=0 src="http://www.shnenglu.com/Emoticons/QQ/13.gif" width=20 height=20>
]]>
0/1杈規潈鏈鐭礬寰?br> BFS
闈炶礋杈規潈鏈鐭礬寰勶紙Dijkstra錛?br> 鍙互鐢―ijkstra瑙ｅ喅闂鐨勭壒寰?br> 璐熻竟鏉冩渶鐭礬寰?br> Bellman-Ford
Bellman-Ford鐨刌en-姘忎紭鍖?br> 宸垎綰︽潫緋葷粺
Floyd
騫夸箟璺緞闂
浼犻掗棴鍖?br> 鏋佸皬鏋佸ぇ璺濈 / 鏋佸ぇ鏋佸皬璺濈
Euler Path / Tour
鍦堝鍦堢畻娉?br> 娣峰悎鍥劇殑 Euler Path / Tour
Hamilton Path / Tour
鐗規畩鍥劇殑Hamilton Path / Tour 鏋勯?br>
鐢熸垚鏍戦棶棰?br> 鏈灝忕敓鎴愭爲
絎琸灝忕敓鎴愭爲
鏈浼樻瘮鐜囩敓鎴愭爲
0/1鍒嗘暟瑙勫垝
搴﹂檺鍒剁敓鎴愭爲
榪為氭ч棶棰?br> 寮哄ぇ鐨凞FS綆楁硶
鏃犲悜鍥捐繛閫氭?br> 鍓茬偣
鍓茶竟
浜岃繛閫氬垎鏀?br> 鏈夊悜鍥捐繛閫氭?br> 寮鴻繛閫氬垎鏀?br> 2-SAT
鏈灝忕偣鍩?br>
鏈夊悜鏃犵幆鍥?br> 鎷撴墤鎺掑簭
鏈夊悜鏃犵幆鍥句笌鍔ㄦ佽鍒掔殑鍏崇郴
浜屽垎鍥懼尮閰嶉棶棰?br> 涓鑸浘闂涓庝簩鍒嗗浘闂鐨勮漿鎹㈡濊礬
鏈澶у尮閰?br> 鏈夊悜鍥劇殑鏈灝忚礬寰勮鐩?br> 0 / 1鐭╅樀鐨勬渶灝忚鐩?br> 瀹屽鍖歸厤
鏈浼樺尮閰?br> 紼沖畾濠氬Щ
緗戠粶嫻侀棶棰?br> 緗戠粶嫻佹ā鍨嬬殑綆鍗曠壒寰佸拰涓庣嚎鎬ц鍒掔殑鍏崇郴
鏈澶ф祦鏈灝忓壊瀹氱悊
鏈澶ф祦闂
鏈変笂涓嬬晫鐨勬渶澶ф祦闂
寰幆嫻?br> 鏈灝忚垂鐢ㄦ渶澶ф祦 / 鏈澶ц垂鐢ㄦ渶澶ф祦
寮﹀浘鐨勬ц川鍜屽垽瀹?br>
]]>
]]>
HH澶х墰鍑虹殑棰樼洰錛屾瘮璧涚殑鏃跺欒鍞綇浜嗘病鏈夊幓鍋氾紝浠婂ぉ鍏磋嚧鏉ヤ簡璁ょ湡鏁蹭簡涓涓嬶紝縐掓潃
榪欓璺?074doing homework涓鏍鳳紝浣嶅帇緙╋紝娌＄殑璇達紝鑷簳鍚戜笂璁＄畻錛岃鍥?br>
#include<iostream>using namespace std;#define N 1100000int m,n,hp,ati,def;
struct node{
int ati; int def; int hp; int lv; int exp;
}q[N],tt;struct man{ int ati; int def; int hp; int exp;}man[21];int max(int a,int b){ return a>b?a:b;}int war(int j,int i){ int time; time=man[i].hp/max(1,q[j].ati-man[i].def); if(man[i].hp%max(1,q[j].ati-man[i].def)==0) time--; if(time>=0) return time; return -1;}void dp(){ int i,j,time,add,temp,next; for(j=0;j<m;j++)
{ if(q[j].hp<=0) continue; for(i=0;i<n;i++) { temp=j>>i; if(temp&1) continue; else next=j+(1<<i); if((time=war(j,i))==-1) continue;//鎴樻枟澶辮觸錛宑ontinue tt=q[j]; tt.hp-=time*max(1,man[i].ati-tt.def); tt.exp+=man[i].exp; if(tt.exp>=100) { add=tt.exp/100; tt.exp%=100; tt.ati+=add*ati; tt.def+=add*def; tt.hp+=add*hp; tt.lv+=add;
} if(q[next].hp==0||tt.hp>q[next].hp||(q[next].hp==tt.hp&&(tt.lv*100+tt.exp)>(q[next].lv*100+q[next].exp))) { q[next]=tt; } } q[j].hp=0; }}int main(){ int i; char name[22]; while(scanf("%d%d%d%d%d%d",&q[0].ati,&q[0].def,&q[0].hp,&ati,&def,&hp)>0) { scanf("%d",&n); for(i=0;i<n;i++) scanf("%s%d%d%d%d",name,&man[i].ati,&man[i].def,&man[i].hp,&man[i].exp); m=(1<<n)-1; q[0].lv=1; q[0].exp=0; for(i=1;i<=m;i++) { q[i].hp=0; } dp(); if(q[m].hp>0) printf("%d\n",q[m].hp); else printf("Poor LvBu,his period was gone.\n"); } return 0;}
]]>
]]>