?suborn

suborn發(fā)音

英：[s?'b?:n]　　美：[s??b?rn]

英：　　美：

suborn中文意思翻譯

vt. 教唆, 收買(mǎi), 賄賂, 教唆某人作偽證

suborn詞形變化

動(dòng)詞過(guò)去式: suborned | 動(dòng)詞現在分詞: suborning | 名詞: subornation | 動(dòng)詞第三人稱(chēng)單數: suborns | 動(dòng)詞過(guò)去分詞: suborned |

suborn同義詞

subservience | dependence | bondage | hyponymy | mastery | relegation | dependency | reduction | demotion

suborn反義詞

insubordination | co-ordination

suborn常見(jiàn)例句

1 、He makes glaring errors if he thinks he may suborn me.───如果他認為他可以收買(mǎi)我，那他就大錯特錯了。

2 、And you suborned perjury defending a corrupt cop.─── 而你為了一個(gè)*的警察作偽證

3 、1.He was charged with conspiracy to suborn witnesses.───他被指控陰謀收買(mǎi)證人作偽證。

4 、They're getting you di*arred for suborning perjury.─── 他們要搞得你被吊銷(xiāo)律師執照 因為你唆使他人做假證

5 、Get someone else to do your dirty work, because I'm not suborning perjury.─── 找其他人替你做這些卑鄙勾當 我是不會(huì )替你做偽證的

6 、When I think something is right, I will stick to that. Sometimes that sounds a little suborn but I am now trying to find a balance between insistence and compromise.───一旦我認為是對的,我就會(huì )堅持.有時(shí)這聽(tīng)上去有點(diǎn)固執,我現在正試圖在執著(zhù)和妥協(xié)中尋找平衡.

7 、3.The siloviki have shown they can squash opposition, suborn the courts and stay in charge.───“西羅維基”集團表明了他們能夠壓制反對意見(jiàn)，收買(mǎi)法庭和掌控一切。

8 、But now I find I had suborn'd the witness， And he's indicted falsely.───現在我才覺(jué)悟我是收買(mǎi)了假見(jiàn)證，讓他受了冤枉。

9 、I am protecting you from a feeble attempt to suborn perjury.─── 我是在保護你不去 唆使他人做偽證

10 、i afraid you are wrong if you want to suborn me .───如果你想收買(mǎi)我，恐怕你找錯了人。

11 、He tried to suborn the police.───他企圖賄賂警方。

12 、to bribe; to suborn; to buy over; to buy off───買(mǎi)通

13 、suborn a witness───收買(mǎi)證人

14 、I care about what you're making me do, because I am not suborning perjury.─── 我只關(guān)心你讓我做了什么 我是不會(huì )去做偽證的

15 、4.If he thinks that he can suborn me, he is grievously in error.───如果他認為可以收買(mǎi)我，那他就大錯特錯了。

16 、to buy over; to suborn───賄買(mǎi)

17 、Either way, he was gonna let me suborn perjury.─── 無(wú)論如何他都要我替他做偽證

海盜分金幣用C/C++語(yǔ)言程序表示

http://acm.hit.edu.cn/index.php?option=com_wrapper&Itemid=39

有道ACM的題和你的題一樣.我把這ACM的題的答案給你!

#include

int main()

{

int n,m,answer;

while(scanf("%d %d",&n,&m)==2)

{

answer=m-(n-1)/2;

if(answer>0)

printf("%d\n",answer);

else

printf("0\n");

}

return 0;

}

海盜分金幣用C/C++語(yǔ)言程序表示

1,0,1,0,98

----------------------------------------

///////////////////////////////////////

//

// 主要功能代碼是CCalcutor::CarryScheme 中的循環(huán)

// 因為同樣人數可有多個(gè)方案

// 所以我用CStringArray 來(lái)保存所有方案

// 在循環(huán)中我處理每個(gè)“前一次的方案”

//

///////////////////////////////////////

class CCalcutor : public CPermutationAndCombination

{

public:

static bool CarryScheme (CStringArray &saSchemeJust, ULONG nCountJust, CStringArray &saSchemeDraft, bool bEquityAsPredominance)

{

ULONG *pnsSubornSpare = new ULONG[nCountJust];

ULONG *pnsSchemeJust = new ULONG[nCountJust];

ULONG *pnsSchemeDraft = new ULONG[nCountJust];

ULONG nCountTryFor;

CString strSchemeJustHot;

saSchemeDraft.RemoveAll ();

for (int nIndexMainJust=0; nIndexMainJust

{

strSchemeJustHot = saSchemeJust.GetAt(nIndexMainJust);

CSchemeCodeHelper::ParseSchemeCode (pnsSchemeJust, nCountJust, strSchemeJustHot);

// 我對每個(gè)方案調用Suborn 和BuildAllSchemeCode_AddTail

GetSubornSpare (pnsSchemeJust, nCountJust, pnsSubornSpare, nCountTryFor, bEquityAsPredominance);

BuildAllSchemeCode_AddTail (pnsSchemeJust, nCountJust, pnsSubornSpare, nCountTryFor, saSchemeDraft);

}

delete[] pnsSubornSpare;

delete[] pnsSchemeJust;

delete[] pnsSchemeDraft;

return true;

}

static CString CallCalcutor (ULONG nMan, bool bEquityAsPredominance = false)

{

if (0 == nMan)

return _T("nobody!");

else if (1 == nMan)

return _T("need NOT to distribute for first man\r\n");

else if (2 == nMan)

{

if (bEquityAsPredominance)

return _T("second man overture [0, 100] (>=50%)\r\n");

else

return _T("MUST death for second man(> 50%)\r\n");

}

CStringArray saJust;

CStringArray saNow;

ULONG nNow;

nNow = 3;

saNow.Add (bEquityAsPredominance ? _T("1,0,99") : _T("0,0,100"));

for (; nNow

{

saJust.Copy (saNow);

if (!CCalcutor::CarryScheme (saJust, nNow, saNow, bEquityAsPredominance))

{

return _T("BAD CALL");

}

}

CString strScheme;strScheme.Format (_T("%2d(>%s50%%)=>"),nMan,bEquityAsPredominance ? _T("="): (" "));

for (int nIndex=0; nIndex

{

CString str;

str.Format (_T("[%s]"), saNow.GetAt(nIndex));

strScheme += str;

}

strScheme += _T("\r\n");

return strScheme;

}

};

///////////////////////////////////////

//

// 調試入口

//

///////////////////////////////////////

#define GetIt(n,b) CCalcutor::CallCalcutor(n,b)

CGgggggApp theApp;

BOOL CGgggggApp::InitInstance()

{

CString strPrompt;

strPrompt.Format

(

_T("%s%s%s %s%s%s\r\n\r\n%s%s%s %s%s%s")

, GetIt(3,1), GetIt(4,1), GetIt(5,1), GetIt(6,1), GetIt(7,1), GetIt(8,1)

, GetIt(3,0), GetIt(4,0), GetIt(5,0), GetIt(6,0), GetIt(7,0), GetIt(8,0)

);

TRACE1 (_T("%s"), strPrompt);

::AfxMessageBox (strPrompt);

return false;

}

運算結果如下：

3(>=50%)=>[1,0,99]

4(>=50%)=>[0,1,0,99]

5(>=50%)=>[1,0,1,0,98]

6(>=50%)=>[0,1,0,1,0,98]

7(>=50%)=>[1,0,1,0,1,0,97]

8(>=50%)=>[0,1,0,1,0,1,0,97]

3(> 50%)=>[0,0,100]

4(> 50%)=>[1,1,0,98]

5(> 50%)=>[2,0,1,0,97][0,2,1,0,97]

6(> 50%)=>[0,1,2,1,0,96][1,0,2,1,0,96]

7(> 50%)=>[1,2,0,0,1,0,96][1,0,0,2,1,0,96][2,1,0,0,1,0,96][0,1,0,2,1,0,96]

8(> 50%)=>[2,0,1,1,0,1,0,95][0,0,1,1,2,1,0,95][2,1,1,0,0,1,0,95][0,1,1,0,2,1,0,95][0,2,1,1,0,1,0,95][1,2,1,0,0,1,0,95][1,0,1,0,2,1,0,95]

-------------------------------------------

下面的網(wǎng)頁(yè)回答了幾百條,自己可以研究一下

-------------------------------------------