版塊導航: 正在加載中...

登錄注冊

應《網(wǎng)絡安全法》要求，自2017年10月1日起，未進行實名認證將不得使用互聯(lián)網(wǎng)跟帖服務。為保障您的帳號能夠正常使用，請盡快對帳號進行手機號驗證，感謝您的理解與支持！

24小時熱門版塊排行榜

北京石油化工學院2026年研究生招生接收調(diào)劑公告

返回列表

liushaojiang

銀蟲 (小有名氣)

應助: 4 (幼兒園)
金幣: 271.7
散金: 10
紅花: 2
帖子: 92
在線: 147.4小時
蟲號: 2064944
注冊: 2012-10-16
專業(yè): 計算機應用技術

[求助] 匈牙利算法的matlab編程求助

一個13*13的矩陣[0 0 0 0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 0 0 0 0 1 0 0
23.5 21.2 28.8 35 36.4 52.5 47.2 55 53.5 60 0 0 0
61 57.5 56.5 56 47 36 27 18 14 20 0 0 0
23.6 24.5 19 6 4 18 21 29 37.5 45 0 0 0
10 29 19 8 21 35.5 37 44.5 55 63 0 0 0
29 25 19.5 20 7 22.5 12 27.5 33.5 40 0 0 0
33 27 25 26 14.5 22 12 17.5 25 35 0 0 0
56 50 48 40 36.5 28 22 15.5 26.5 30 0 0 0
65 62 60 55 50 48.5 35 25 27 20 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0]用匈牙利算法求出求5個不同行，不同列的最小的五個數(shù)，哪位大神能給個程序可以實現(xiàn)的，網(wǎng)上好多匈牙利的matlab程序運行這個矩陣后都死循環(huán)了，感激不盡！

回復此樓

» 猜你喜歡

調(diào)劑已經(jīng)有6人回復
280求調(diào)劑已經(jīng)有6人回復
302求調(diào)劑一志愿華中師范大學已經(jīng)有5人回復
346求調(diào)劑已經(jīng)有4人回復
材料專碩322分已經(jīng)有9人回復
372分材料與化工（085600）一志愿湖南大學求調(diào)劑已經(jīng)有5人回復
318求調(diào)劑，計算材料方向已經(jīng)有10人回復
310求調(diào)劑已經(jīng)有14人回復
315求調(diào)劑已經(jīng)有3人回復
265求調(diào)劑已經(jīng)有13人回復

» 本主題相關價值貼推薦，對您同樣有幫助:

求助matlab編程已經(jīng)有3人回復
求助：遺傳算法的matlab編程求解資源優(yōu)化問題已經(jīng)有7人回復
Matlab編程求助！已經(jīng)有3人回復
matlab編程求助已經(jīng)有3人回復
學習matlab算法編程，推薦一些有用的資料或者書籍吧已經(jīng)有21人回復
求助多輸出支持向量機的matlab程序已經(jīng)有6人回復
matlab畫圖求助已經(jīng)有11人回復
MATLAB經(jīng)典算法程序已經(jīng)有531人回復
求助啊！求一程序，用matlab程序做，用蒙特卡洛方法模擬已經(jīng)有10人回復
求助matlab編程已經(jīng)有13人回復
【求助】求助 matlab編程：可否實現(xiàn)清除文本文檔數(shù)據(jù) 已經(jīng)有5人回復
【求助】多目標pso算法的MATLAB程序已經(jīng)有3人回復
【求助】請教把java程序轉化成matlab程序已經(jīng)有9人回復
【求助】matlab 遺傳算法工具箱繪圖命令是什么？已經(jīng)有6人回復
【求助】求MAtlab求解程序�。�！已經(jīng)有20人回復

1樓 2013-06-22 13:45:39

已閱回復此樓關注TA 給TA發(fā)消息送TA紅花 TA的回帖

ajitai

鐵桿木蟲 (職業(yè)作家)

應助: 8 (幼兒園)
金幣: 8817.4
散金: 5370
紅花: 11
帖子: 3525
在線: 418.1小時
蟲號: 854389
注冊: 2009-09-22
性別: GG
專業(yè): 金屬材料表面科學與工程

好新鮮的算法，匈牙利算法。

贊一下

回復此樓

2樓2013-06-23 12:59:25

已閱回復此樓關注TA 給TA發(fā)消息送TA紅花 TA的回帖

somomo91

專家顧問 (職業(yè)作家)

專家經(jīng)驗: +3
應助: 144 (高中生)
金幣: 19353
紅花: 115
帖子: 3854
在線: 1053.2小時
蟲號: 2399301
注冊: 2013-04-03
專業(yè): 動力學與控制
管轄: 計算模擬

【答案】應助回帖

這是我用過的匈牙利算法，代入你的13*13，可以得到正確結果，
Perf  = [ 0 0 0 0 0 0 0 0 0 0 0 0 1; ...
      0 0 0 0 0 0 0 0 0 0 0 1 0; ...
      0 0 0 0 0 0 0 0 0 0 1 0 0; ...
      23.5 21.2 28.8 35 36.4 52.5 47.2 55 53.5 60 0 0 0; ...
      61 57.5 56.5 56 47 36 27 18 14 20 0 0 0; ...
      23.6 24.5 19 6 4 18 21 29 37.5 45 0 0 0; ...
      10 29 19 8 21 35.5 37 44.5 55 63 0 0 0; ...
      29 25 19.5 20 7 22.5 12 27.5 33.5 40 0 0 0; ...
      33 27 25 26 14.5 22 12 17.5 25 35 0 0 0; ...
      56 50 48 40 36.5 28 22 15.5 26.5 30 0 0 0; ...
      65 62 60 55 50 48.5 35 25 27 20 0 0 0; ...
      0 0 0 0 0 0 0 0 0 0 0 0 0; ...
      0 0 0 0 0 0 0 0 0 0 0 0 0];
======================================================
function [Matching] = xiongyali(Perf)
Matching = zeros(size(Perf));
num_y = sum(~isinf(Perf),1);
num_x = sum(~isinf(Perf),2);

x_con = find(num_x~=0);
y_con = find(num_y~=0);

P_size = max(length(x_con),length(y_con));
P_cond = zeros(P_size);
P_cond(1:length(x_con),1:length(y_con)) = Perf(x_con,y_con);
if isempty(P_cond)
Cost = 0;
return
end

Edge = P_cond;
Edge(P_cond~=Inf) = 0;
cnum = min_line_cover(Edge);
Pmax = max(max(P_cond(P_cond~=Inf)));
P_size = length(P_cond)+cnum;
P_cond = ones(P_size)*Pmax;
P_cond(1:length(x_con),1:length(y_con)) = Perf(x_con,y_con);

%*************************************************
exit_flag = 1;
stepnum = 1;
while exit_flag
switch stepnum
      case 1
         [P_cond,stepnum] = step1(P_cond);
      case 2
         [r_cov,c_cov,M,stepnum] = step2(P_cond);
      case 3
         [c_cov,stepnum] = step3(M,P_size);
      case 4
         [M,r_cov,c_cov,Z_r,Z_c,stepnum] = step4(P_cond,r_cov,c_cov,M);
      case 5
         [M,r_cov,c_cov,stepnum] = step5(M,Z_r,Z_c,r_cov,c_cov);
      case 6
         [P_cond,stepnum] = step6(P_cond,r_cov,c_cov);
      case 7
         exit_flag = 0;
end
end

Matching(x_con,y_con) = M(1:length(x_con),1:length(y_con));
Cost = sum(sum(Perf(Matching==1)));

function [P_cond,stepnum] = step1(P_cond)

P_size = length(P_cond);

% Loop throught each row
for ii = 1

_size
rmin = min(P_cond(ii,

);
P_cond(ii,

= P_cond(ii,

-rmin;
end

stepnum = 2;

function [r_cov,c_cov,M,stepnum] = step2(P_cond)

P_size = length(P_cond);
r_cov = zeros(P_size,1);
c_cov = zeros(P_size,1);
M = zeros(P_size);

for ii = 1

_size
for jj = 1

==1)) ~= 0
r_cov(row) = 1;
zcol = find(M(row,

==1);
         c_cov(zcol) = 0;
      else
         stepnum = 5;
         zflag = 0;
         Z_r = row;
         Z_c = col;
      end
end
end

function [M,r_cov,c_cov,stepnum] = step5(M,Z_r,Z_c,r_cov,c_cov)

zflag = 1;
ii = 1;
while zflag
rindex = find(M(:,Z_c(ii))==1);
if rindex > 0
      ii = ii+1;
      Z_r(ii,1) = rindex;
      Z_c(ii,1) = Z_c(ii-1);
else
      zflag = 0;
end

if zflag == 1;
      cindex = find(M(Z_r(ii),

==2);
      ii = ii+1;
      Z_r(ii,1) = Z_r(ii-1);
      Z_c(ii,1) = cindex;
end
end

for ii = 1:length(Z_r)
if M(Z_r(ii),Z_c(ii)) == 1
      M(Z_r(ii),Z_c(ii)) = 0;
else
      M(Z_r(ii),Z_c(ii)) = 1;
end
end

r_cov = r_cov.*0;
c_cov = c_cov.*0;

M(M==2) = 0;

stepnum = 3;

function [P_cond,stepnum] = step6(P_cond,r_cov,c_cov)
a = find(r_cov == 0);
b = find(c_cov == 0);
minval = min(min(P_cond(a,b)));

P_cond(find(r_cov == 1),

= P_cond(find(r_cov == 1),

+ minval;
P_cond(:,find(c_cov == 0)) = P_cond(:,find(c_cov == 0)) - minval;

stepnum = 4;

function cnum = min_line_cover(Edge)

[r_cov,c_cov,M,stepnum] = step2(Edge);
[c_cov,stepnum] = step3(M,length(Edge));
[M,r_cov,c_cov,Z_r,Z_c,stepnum] = step4(Edge,r_cov,c_cov,M);
cnum = length(Edge)-sum(r_cov)-sum(c_cov);

贊一下

回復此樓

3樓2013-06-25 20:22:21

已閱回復此樓關注TA 給TA發(fā)消息送TA紅花 TA的回帖

somomo91

專家顧問 (職業(yè)作家)

專家經(jīng)驗: +3
應助: 144 (高中生)
金幣: 19353
紅花: 115
帖子: 3854
在線: 1053.2小時
蟲號: 2399301
注冊: 2013-04-03
專業(yè): 動力學與控制
管轄: 計算模擬

【答案】應助回帖

小蟲的自動真惡心表情

=========================================
function [Matching] = xiongyali(Perf)
Matching = zeros(size(Perf));
num_y = sum(~isinf(Perf),1);
num_x = sum(~isinf(Perf),2);

x_con = find(num_x~=0);
y_con = find(num_y~=0);

P_size = max(length(x_con),length(y_con));
P_cond = zeros(P_size);
P_cond(1:length(x_con),1:length(y_con)) = Perf(x_con,y_con);
if isempty(P_cond)
Cost = 0;
return
end

Edge = P_cond;
Edge(P_cond~=Inf) = 0;
cnum = min_line_cover(Edge);
Pmax = max(max(P_cond(P_cond~=Inf)));
P_size = length(P_cond)+cnum;
P_cond = ones(P_size)*Pmax;
P_cond(1:length(x_con),1:length(y_con)) = Perf(x_con,y_con);

%*************************************************
exit_flag = 1;
stepnum = 1;
while exit_flag
switch stepnum
      case 1
         [P_cond,stepnum] = step1(P_cond);
      case 2
         [r_cov,c_cov,M,stepnum] = step2(P_cond);
      case 3
         [c_cov,stepnum] = step3(M,P_size);
      case 4
         [M,r_cov,c_cov,Z_r,Z_c,stepnum] = step4(P_cond,r_cov,c_cov,M);
      case 5
         [M,r_cov,c_cov,stepnum] = step5(M,Z_r,Z_c,r_cov,c_cov);
      case 6
         [P_cond,stepnum] = step6(P_cond,r_cov,c_cov);
      case 7
         exit_flag = 0;
end
end

Matching(x_con,y_con) = M(1:length(x_con),1:length(y_con));
Cost = sum(sum(Perf(Matching==1)));

function [P_cond,stepnum] = step1(P_cond)

P_size = length(P_cond);

% Loop throught each row
for ii = 1

_size
rmin = min(P_cond(ii,: ));
P_cond(ii,: ) = P_cond(ii,: )-rmin;
end

stepnum = 2;

function [r_cov,c_cov,M,stepnum] = step2(P_cond)

P_size = length(P_cond);
r_cov = zeros(P_size,1);
c_cov = zeros(P_size,1);
M = zeros(P_size);

for ii = 1

_size
for jj = 1

_size
      if P_cond(ii,jj) == 0 && r_cov(ii) == 0 && c_cov(jj) == 0
         M(ii,jj) = 1;
         r_cov(ii) = 1;
         c_cov(jj) = 1;
      end
end
end

r_cov = zeros(P_size,1);
c_cov = zeros(P_size,1);
stepnum = 3;

function [c_cov,stepnum] = step3(M,P_size)

c_cov = sum(M,1);
if sum(c_cov) == P_size
stepnum = 7;
else
stepnum = 4;
end

function [M,r_cov,c_cov,Z_r,Z_c,stepnum] = step4(P_cond,r_cov,c_cov,M)

P_size = length(P_cond);

zflag = 1;
while zflag
row = 0; col = 0; exit_flag = 1;
ii = 1; jj = 1;
while exit_flag
      if P_cond(ii,jj) == 0 && r_cov(ii) == 0 && c_cov(jj) == 0
         row = ii;
         col = jj;
         exit_flag = 0;
      end
      jj = jj + 1;
      if jj > P_size; jj = 1; ii = ii+1; end
      if ii > P_size; exit_flag = 0; end
end

if row == 0
      stepnum = 6;
      zflag = 0;
      Z_r = 0;
      Z_c = 0;
else
      M(row,col) = 2;
      if sum(find(M(row,:  )==1)) ~= 0
         r_cov(row) = 1;
         zcol = find(M(row,:  )==1);
         c_cov(zcol) = 0;
      else
         stepnum = 5;
         zflag = 0;
         Z_r = row;
         Z_c = col;
      end
end
end

function [M,r_cov,c_cov,stepnum] = step5(M,Z_r,Z_c,r_cov,c_cov)

zflag = 1;
ii = 1;
while zflag
rindex = find(M(:,Z_c(ii))==1);
if rindex > 0
      ii = ii+1;
      Z_r(ii,1) = rindex;
      Z_c(ii,1) = Z_c(ii-1);
else
      zflag = 0;
end

if zflag == 1;
      cindex = find(M(Z_r(ii),:  )==2);
      ii = ii+1;
      Z_r(ii,1) = Z_r(ii-1);
      Z_c(ii,1) = cindex;
end
end

for ii = 1:length(Z_r)
if M(Z_r(ii),Z_c(ii)) == 1
      M(Z_r(ii),Z_c(ii)) = 0;
else
      M(Z_r(ii),Z_c(ii)) = 1;
end
end

r_cov = r_cov.*0;
c_cov = c_cov.*0;

M(M==2) = 0;

stepnum = 3;

function [P_cond,stepnum] = step6(P_cond,r_cov,c_cov)
a = find(r_cov == 0);
b = find(c_cov == 0);
minval = min(min(P_cond(a,b)));

P_cond(find(r_cov == 1),:  ) = P_cond(find(r_cov == 1),:  ) + minval;
P_cond(:,find(c_cov == 0)) = P_cond(:,find(c_cov == 0)) - minval;

stepnum = 4;

function cnum = min_line_cover(Edge)

[r_cov,c_cov,M,stepnum] = step2(Edge);
[c_cov,stepnum] = step3(M,length(Edge));
[M,r_cov,c_cov,Z_r,Z_c,stepnum] = step4(Edge,r_cov,c_cov,M);
cnum = length(Edge)-sum(r_cov)-sum(c_cov);

贊一下

回復此樓

4樓2013-06-25 20:23:59

已閱回復此樓關注TA 給TA發(fā)消息送TA紅花 TA的回帖

somomo91

專家顧問 (職業(yè)作家)

專家經(jīng)驗: +3
應助: 144 (高中生)
金幣: 19353
紅花: 115
帖子: 3854
在線: 1053.2小時
蟲號: 2399301
注冊: 2013-04-03
專業(yè): 動力學與控制
管轄: 計算模擬

【答案】應助回帖

瘋了！
===================================
function [Matching] = xiongyali(Perf)
Matching = zeros(size(Perf));
num_y = sum(~isinf(Perf),1);
num_x = sum(~isinf(Perf),2);

x_con = find(num_x~=0);
y_con = find(num_y~=0);

P_size = max(length(x_con),length(y_con));
P_cond = zeros(P_size);
P_cond(1:length(x_con),1:length(y_con)) = Perf(x_con,y_con);
if isempty(P_cond)
Cost = 0;
return
end

Edge = P_cond;
Edge(P_cond~=Inf) = 0;
cnum = min_line_cover(Edge);
Pmax = max(max(P_cond(P_cond~=Inf)));
P_size = length(P_cond)+cnum;
P_cond = ones(P_size)*Pmax;
P_cond(1:length(x_con),1:length(y_con)) = Perf(x_con,y_con);

%*************************************************
exit_flag = 1;
stepnum = 1;
while exit_flag
switch stepnum
      case 1
         [P_cond,stepnum] = step1(P_cond);
      case 2
         [r_cov,c_cov,M,stepnum] = step2(P_cond);
      case 3
         [c_cov,stepnum] = step3(M,P_size);
      case 4
         [M,r_cov,c_cov,Z_r,Z_c,stepnum] = step4(P_cond,r_cov,c_cov,M);
      case 5
         [M,r_cov,c_cov,stepnum] = step5(M,Z_r,Z_c,r_cov,c_cov);
      case 6
         [P_cond,stepnum] = step6(P_cond,r_cov,c_cov);
      case 7
         exit_flag = 0;
end
end

Matching(x_con,y_con) = M(1:length(x_con),1:length(y_con));
Cost = sum(sum(Perf(Matching==1)));

function [P_cond,stepnum] = step1(P_cond)

P_size = length(P_cond);

% Loop throught each row
for ii = 1 : P_size
rmin = min(P_cond(ii,:  ));
P_cond(ii,:  ) = P_cond(ii,:  )-rmin;
end

stepnum = 2;

function [r_cov,c_cov,M,stepnum] = step2(P_cond)

P_size = length(P_cond);
r_cov = zeros(P_size,1);
c_cov = zeros(P_size,1);
M = zeros(P_size);

for ii = 1 : P_size
for jj = 1 : P_size
      if P_cond(ii,jj) == 0 && r_cov(ii) == 0 && c_cov(jj) == 0
         M(ii,jj) = 1;
         r_cov(ii) = 1;
         c_cov(jj) = 1;
      end
end
end

r_cov = zeros(P_size,1);
c_cov = zeros(P_size,1);
stepnum = 3;

function [c_cov,stepnum] = step3(M,P_size)

c_cov = sum(M,1);
if sum(c_cov) == P_size
stepnum = 7;
else
stepnum = 4;
end

function [M,r_cov,c_cov,Z_r,Z_c,stepnum] = step4(P_cond,r_cov,c_cov,M)

P_size = length(P_cond);

zflag = 1;
while zflag
row = 0; col = 0; exit_flag = 1;
ii = 1; jj = 1;
while exit_flag
      if P_cond(ii,jj) == 0 && r_cov(ii) == 0 && c_cov(jj) == 0
         row = ii;
         col = jj;
         exit_flag = 0;
      end
      jj = jj + 1;
      if jj > P_size; jj = 1; ii = ii+1; end
      if ii > P_size; exit_flag = 0; end
end

if row == 0
      stepnum = 6;
      zflag = 0;
      Z_r = 0;
      Z_c = 0;
else
      M(row,col) = 2;
      if sum(find(M(row,:  )==1)) ~= 0
         r_cov(row) = 1;
         zcol = find(M(row,:  )==1);
         c_cov(zcol) = 0;
      else
         stepnum = 5;
         zflag = 0;
         Z_r = row;
         Z_c = col;
      end
end
end

function [M,r_cov,c_cov,stepnum] = step5(M,Z_r,Z_c,r_cov,c_cov)

zflag = 1;
ii = 1;
while zflag
rindex = find(M(:,Z_c(ii))==1);
if rindex > 0
      ii = ii+1;
      Z_r(ii,1) = rindex;
      Z_c(ii,1) = Z_c(ii-1);
else
      zflag = 0;
end

if zflag == 1;
      cindex = find(M(Z_r(ii),:  )==2);
      ii = ii+1;
      Z_r(ii,1) = Z_r(ii-1);
      Z_c(ii,1) = cindex;
end
end

for ii = 1:length(Z_r)
if M(Z_r(ii),Z_c(ii)) == 1
      M(Z_r(ii),Z_c(ii)) = 0;
else
      M(Z_r(ii),Z_c(ii)) = 1;
end
end

r_cov = r_cov.*0;
c_cov = c_cov.*0;

M(M==2) = 0;

stepnum = 3;

function [P_cond,stepnum] = step6(P_cond,r_cov,c_cov)
a = find(r_cov == 0);
b = find(c_cov == 0);
minval = min(min(P_cond(a,b)));

P_cond(find(r_cov == 1),:  ) = P_cond(find(r_cov == 1),:  ) + minval;
P_cond(:,find(c_cov == 0)) = P_cond(:,find(c_cov == 0)) - minval;

stepnum = 4;

function cnum = min_line_cover(Edge)

[r_cov,c_cov,M,stepnum] = step2(Edge);
[c_cov,stepnum] = step3(M,length(Edge));
[M,r_cov,c_cov,Z_r,Z_c,stepnum] = step4(Edge,r_cov,c_cov,M);
cnum = length(Edge)-sum(r_cov)-sum(c_cov);

贊一下

回復此樓

5樓2013-06-25 20:25:42

已閱回復此樓關注TA 給TA發(fā)消息送TA紅花 TA的回帖

somomo91

專家顧問 (職業(yè)作家)

專家經(jīng)驗: +3
應助: 144 (高中生)
金幣: 19353
紅花: 115
帖子: 3854
在線: 1053.2小時
蟲號: 2399301
注冊: 2013-04-03
專業(yè): 動力學與控制
管轄: 計算模擬

【答案】應助回帖

看那個沒有表情的回復吧，

贊一下

回復此樓

6樓2013-06-25 20:26:17

已閱回復此樓關注TA 給TA發(fā)消息送TA紅花 TA的回帖

somomo91

專家顧問 (職業(yè)作家)

專家經(jīng)驗: +3
應助: 144 (高中生)
金幣: 19353
紅花: 115
帖子: 3854
在線: 1053.2小時
蟲號: 2399301
注冊: 2013-04-03
專業(yè): 動力學與控制
管轄: 計算模擬

【答案】應助回帖

還是在這里下載吧
http://kuai.xunlei.com/d/uqQpENouxozJUQQAcad

贊一下

回復此樓

7樓2013-06-25 20:28:24

已閱回復此樓關注TA 給TA發(fā)消息送TA紅花 TA的回帖

相關版塊跳轉我要訂閱樓主 liushaojiang 的主題更新

返回列表

最具人氣熱帖推薦 [查看全部]		作者	回/看	最后發(fā)表

[考研] 一志愿華中農(nóng)業(yè)071010，總分320求調(diào)劑 +4	困困困困坤坤 2026-04-02	4/200	2026-04-02 15:30 by zzchen2000
[考研] 366求調(diào)劑一志愿東北大學 +7	運氣來得若有似?/a> 2026-04-02	7/350	2026-04-02 14:47 by 岸上的一條魚
[考研] 能源動力調(diào)劑 +3	不破不立0 2026-04-02	3/150	2026-04-02 12:46 by ffffjjjj
[考研] 085600，材料與化工321分調(diào)劑 +8	大饞小子 2026-03-27	10/500	2026-04-02 10:15 by kaiyanjie
[考研] 279求調(diào)劑 +7	莫xiao 2026-04-01	7/350	2026-04-01 22:05 by 客爾美德
[考研] 一志愿西安交大材料學碩（英一數(shù)二）347，求調(diào)劑到高分子/材料相關專業(yè) +7	zju51 2026-03-31	9/450	2026-04-01 19:35 by CFQZAFU
[考研] 353求調(diào)劑 +4	拉鉤不許變 2026-04-01	4/200	2026-04-01 18:10 by 記事本2026
[碩博家園] 博一被送出聯(lián)培感覺不適應怎么辦 +3	全村的狗 2026-03-31	3/150	2026-04-01 10:44 by 328838485
[考研] 一志愿北京科技大學085601材料工程英一數(shù)二初試總分335求調(diào)劑 +5	雙馬尾痞老板2 2026-03-31	5/250	2026-04-01 09:04 by oooqiao
[考研] 一志愿華東師范大學有機化學專業(yè)，初試351分，復試被刷求調(diào)劑! +9	真名有冰 2026-03-29	10/500	2026-03-31 18:01 by xhai2011
[考研] 086000調(diào)劑 +5	7901117076 2026-03-26	5/250	2026-03-31 17:45 by 544594351
[考研] 085601英二數(shù)二求調(diào)劑總分325 +4	余航航 2026-03-31	4/200	2026-03-31 17:38 by 唐沐兒
[考研] 求調(diào)劑生物學 377分 +6	zzll03 2026-03-31	6/300	2026-03-31 17:33 by 唐沐兒
[考研] 343求調(diào)劑 +8	愛羈絆 2026-03-28	8/400	2026-03-31 16:12 by 不吃魚的貓
[考研] 085600材料與化工調(diào)劑 +16	kikiki7 2026-03-30	16/800	2026-03-31 10:03 by 氯化亞硝酰
[考研] 327求調(diào)劑 +5	小卡不卡. 2026-03-29	5/250	2026-03-30 19:30 by Wang200018
[考研] 356求調(diào)劑 +3	gysy?s?a 2026-03-28	3/150	2026-03-29 00:33 by 544594351
[考研] 308求調(diào)劑 +7	墨墨漠 2026-03-27	7/350	2026-03-28 07:43 by 熱情沙漠
[考研] 352分化工與材料 +5	海納百川Ly 2026-03-27	5/250	2026-03-28 03:39 by fmesaito
[考研] 一志愿上海理工能源動力（085800）310分求調(diào)劑 +3	zhangmingc 2026-03-27	4/200	2026-03-27 19:01 by 給你你注意休息

24小時熱門版塊排行榜

[求助] 匈牙利算法的matlab編程求助

» 猜你喜歡

» 本主題相關價值貼推薦，對您同樣有幫助:

【答案】應助回帖

【答案】應助回帖

【答案】應助回帖

【答案】應助回帖

【答案】應助回帖

» 本主題相關價值貼推薦，對您同樣有幫助: