[cernRoot]how to deal with TPavetext->SetTextAngle()?

TPaveText *l1 = new TPaveText(0.9,0,1.1,.5);
l1->AddText("text");
l1->SetTextAngle(90.);
l1->Draw();

does not produce rotated text.

TPaveText::AddText returns a pointer to the TText object. Do:

TText *text = l1->AddText("text");
 text->SetTextAngle(90);
 text->SetTextAlign(22);
 l1->Draw();


博主设置当前文章不允许评论。

how to deal with this progrom!!!

07-15

org.apache.jasper.JasperExceptionrn org.apache.jasper.servlet.JspServletWrapper.service(JspServletWrapper.java:358)rn org.apache.jasper.servlet.JspServlet.serviceJspFile(JspServlet.java:301)rn org.apache.jasper.servlet.JspServlet.service(JspServlet.java:248)rn javax.servlet.http.HttpServlet.service(HttpServlet.java:856)rn org.apache.struts.action.RequestProcessor.doForward(RequestProcessor.java:1069)rn org.apache.struts.action.RequestProcessor.internalModuleRelativeForward(RequestProcessor.java:1012)rn org.apache.struts.action.RequestProcessor.processValidate(RequestProcessor.java:980)rn org.apache.struts.action.RequestProcessor.process(RequestProcessor.java:255)rn org.apache.struts.action.ActionServlet.process(ActionServlet.java:1482)rn org.apache.struts.action.ActionServlet.doPost(ActionServlet.java:525)rn javax.servlet.http.HttpServlet.service(HttpServlet.java:763)rn javax.servlet.http.HttpServlet.service(HttpServlet.java:856)rnrnrnroot cause rnrnjava.lang.ClassCastExceptionrn org.apache.struts.taglib.html.ErrorsTag.doStartTag(ErrorsTag.java:215)rn org.apache.jsp.hello_jsp._jspx_meth_html_errors_0(hello_jsp.java:208)rn org.apache.jsp.hello_jsp._jspx_meth_html_html_0(hello_jsp.java:133)rn org.apache.jsp.hello_jsp._jspService(hello_jsp.java:90)rn org.apache.jasper.runtime.HttpJspBase.service(HttpJspBase.java:133)rn javax.servlet.http.HttpServlet.service(HttpServlet.java:856)rn org.apache.jasper.servlet.JspServletWrapper.service(JspServletWrapper.java:311)rn org.apache.jasper.servlet.JspServlet.serviceJspFile(JspServlet.java:301)rn org.apache.jasper.servlet.JspServlet.service(JspServlet.java:248)rn javax.servlet.http.HttpServlet.service(HttpServlet.java:856)rn org.apache.struts.action.RequestProcessor.doForward(RequestProcessor.java:1069)rn org.apache.struts.action.RequestProcessor.internalModuleRelativeForward(RequestProcessor.java:1012)rn org.apache.struts.action.RequestProcessor.processValidate(RequestProcessor.java:980)rn org.apache.struts.action.RequestProcessor.process(RequestProcessor.java:255)rn org.apache.struts.action.ActionServlet.process(ActionServlet.java:1482)rn org.apache.struts.action.ActionServlet.doPost(ActionServlet.java:525)rn javax.servlet.http.HttpServlet.service(HttpServlet.java:763)rn javax.servlet.http.HttpServlet.service(HttpServlet.java:856)rnrn

Deal of Fortune

01-22

DescriptionnnBig deals only go with smart brains. Now Sempr has a chance to prove that he deserves one.nnSempr is the head of a decoration team. The billionaire flymouse has offered him an opportunity to decorate all his houses and rooms. If the deal goes through, Sempr could spend rest of his life counting notes in his bed. However, large fortune never comes in ease. It turns out that Sempr is doing business with a man who is among the pickiest people in the world. Before his team starts working, flymouse has given him a long list of clauses, violation of any of which will mean “deal’s off”.nnIn general, each clause in the list is about characteristics of several houses and/or rooms. Here’s a possible clause among others:nnThe roof of the villa in the mountain is not painted green,nor chandeliers are installed in the downtown office,nor the sea view apartment has a big window.nA clause is always composed of one or more subclauses, connected by the conjunction or if necessary. It is satisfied as long as any of its subclauses is satisfied, whether the rest is satisfied or not. The same subclause can be found in more than one clauses and appear in both positive and negative forms.nnPicky as he is, flymouse never creates the nonsense of “mission impossible”. List in hand, how will Sempr fulfil the deal before he can retire for life?nnInputnnThe list of clauses is presented in multiple lines. The clauses are listed one after another, separated by lines containing a single word and if necessary. The subclauses of a clause each occupy a separate line. If a subclause is not the first subclause of a clause, it will be preceded by the word or, which is not part of it. A subclause consists of a sequence of words formed by lowercase letters in the English alphabet. A subclause is considered to be in positive form if it does not contain the word not and in negative form if the word not appears exactly one in it. The word not never appears more than once in a single subclause. If the word not is removed, the negative form of a subclause is exactly the same as its positive form. A clause has only one positive form but can have several negative forms, which are considered equivalent.nnThe list is non-empty and contains at most 1000 clauses, each consist of at least one and at most six subclauses. No subclauses are repeated in any forms in a single clause. There are at most 120 different subclauses if forms are neglected.nnWords on the same line are separated by exactly one space. No lines contain any leading or trailing spaces and there are no blank lines.nnOutputnnShow how Sempr meets flymouse’s demands by telling which subclauses are satisfied and which are not. If there are multiple possibilities, pick one of them. For each subclause (forms neglected) that appears in the input, print its positive form if it is satisfied or otherwise one of its negative forms formed by inserting the word not into the beginning, the end or between any two successive words of its positive form. Subclauses can appear in arbitrary order. Each subclause occupies a separate line. Words on the same line must be separated by exactly one space. The line must not contain any leading or trailing spaces. There must not be any blank lines.nnSample Inputnnroof of the villa in the mountain is not painted greennor chandeliers are installed in the downtown officenor the sea view apartment has a big windownandnroof of the villa in the mountain is painted greennor chandeliers are not installed in the downtown officenandnthe sea view apartment has a big windownSample Outputnnroof of the villa in the mountain is not painted greennchandeliers are not installed in the downtown officenthe sea view apartment has a big window

Best Deal

05-07

Tom, a young explorer, visited an Indian tribe and fell in love with the Chief's daughter. Tom asked the Chief to marry his daughter to him. But the Chief would accept his proposal only if he could provide 10000 golden coins as the engagement gift. Tom couldn't make it, so he pled for a reduction. The Chief said:" OK, I would then request 8000 golden coins if you could get me the fur coat of the Pontiff. Or, if you could get me his crystal, I could drop to 5000 golden coins."nnTom then went to the Pontiff for his fur coat or crystal. The Pontiff too requested some amount of golden coins as the exchange, or a possible reduction of price if Tom could get him some other things. Tom continued to visit other people and found that all of them would either request some golden coins for exchange, or drop the price down for something else.nnNow Tom needs your help on trading to marry the girl he loves.nnAn important rule Tom has to tell you is: the hierachical system is so strict in this tribe that two people will never contact each other in any way if the difference of the two levels they belong to is larger than a certain threshold. Tom is an outsider so he is beyond this restriction. However, if he trades with someone in a lower level, then others in a higher level will not trade with him anymore since otherwise they would be indirectly contacting the lower levels, and vice versa. Therefore your best suggestion to him must have all the situations considered.nnFor the sake of convenience, let us mark all the trading objects by numbers starting from 1. The Chief's approval is as well considered an object and is always marked 1. Each object has a price P, the owner's level L, and a sequence of substitutions Ti and the corresponding "voucher" price Vi. There must be no "indirect trading" if the difference between two levels is greater than M. You must calculate the least number of golden coins Tom needs to marry the daughter of the Chief.nnInputnnThe input consists of several test cases. For each test case: nnThe 1st line contains two integers M and N (1<=N<=100) which represent the threshold of level difference and the total number of trading objects respectively.nThen the descriptions of N objects follow, in the increasing order with respect to their marks. Each description begins with three nonnegative integers P, L, and X (

没有更多推荐了,返回首页

私密
私密原因:
请选择设置私密原因
  • 广告
  • 抄袭
  • 版权
  • 政治
  • 色情
  • 无意义
  • 其他
其他原因:
120
出错啦
系统繁忙,请稍后再试

关闭