corrupted、suborn是什么意思、subn中文翻译发音、用法及例句

日期: 栏目:知识类 浏览:

  •

  suborn

  英:【səbɔ:n】美:【səˈbɔrn】

  英:

  美:

  vt.

  教唆, 收买, 贿赂, 教唆某人作伪证

  动词过去式:

  suborned 

  动词现在分词:

  suborning 

  名词:

  subornation 

  动词第三人称单数:

  suborns 

  动词过去分词:

  suborned 

  subservience dependence bondage hyponymy mastery relegation dependency reduction demotion

  insubordination co-ordination

  1 、He makes glaring errors if he thinks he may

  suborn

  me.───如果他认为他可以收买我,那他就大错特错了。

  2 、And you

  suborn

  ed perjury defending a corrupt cop.─── 而你为了一个*的警察作伪证

  3 、1.He was charged with conspiracy to

  suborn

  witnesses.───他被指控阴谋收买证人作伪证。

  4 、Theyre getting you di*arred for

  suborn

  ing perjury.─── 他们要搞得你被吊销律师执照 因为你唆使他人做假证

  5 、Get someone else to do your dirty work, because Im not

  suborn

  ing perjury.─── 找其他人替你做这些卑鄙勾当 我是不会替你做伪证的

  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.───一旦我认为是对的,我就会坚持.有时这听上去有点固执,我现在正试图在执着和妥协中寻找平衡.

  7 、3.The siloviki have shown they can squash opposition,

  suborn

  the courts and stay in charge.───“西罗维基”集团表明了他们能够压制反对意见,收买法庭和掌控一切。

  8 、But now I find I had

  suborn

  d the witness, And hes indicted falsely.───现在我才觉悟我是收买了假见证,让他受了冤枉。

  9 、I am protecting you from a feeble attempt to

  suborn

  perjury.─── 我是在保护你不去 唆使他人做伪证

  10 、i afraid you are wrong if you want to

  suborn

  me .───如果你想收买我,恐怕你找错了人。

  11 、He tried to

  suborn

  the police.───他企图贿赂警方。

  12 、to bribe; to

  suborn

  ; to buy over; to buy off───买通

  13 、

  suborn

  a witness───收买证人

  14 、I care about what youre making me do, because I am not

  suborn

  ing perjury.─── 我只关心你让我做了什么 我是不会去做伪证的

  15 、4.If he thinks that he can

  suborn

  me, he is grievously in error.───如果他认为可以收买我,那他就大错特错了。

  16 、to buy over; to

  suborn

  ───贿买

  17 、Either way, he was gonna let me

  suborn

  perjury.─── 无论如何他都要我替他做伪证

  海盗分金币用C/C++语言程序表示

  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++语言程序表示

  1,0,1,0,98

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

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

  //

  // 主要功能代码是CCalcutor::CarryScheme 中的循环

  // 因为同样人数可有多个方案

  // 所以我用CStringArray 来保存所有方案

  // 在循环中我处理每个“前一次的方案”

  //

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

  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);

  // 我对每个方案调用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】

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

  下面的网页回答了几百条,自己可以研究一下

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

标签: