joj

joj 2453 candy 网络流建图的题

ProblemD:CandyAsateacherofakindergarten,youhavemanythingstododuringaday,oneofwhichistoallotcandiestoallchildreninyourclass.TodayyouhaveNcandiesforthecomingMchildren.Eachchildlikesdifferentcandy,andasa
u011401504·2013-08-16 13:00

joj-Before 2012

 joj-Before2012DescriptionAsweknow,in1742,ChristianGoldbach,aGermanamateurmathematician,sentalettertoLeonhardEulerinwhichhemadethefollowingconjecture
yinzm520·2013-07-16 20:00

joj 1113 The Game

                             TheGame这道题是为了让折线数最小，跟先到达没有必然关系。54XXXXXX XXXX XXXX2154000000比如这个就应该是4,而不是最先到达的5。同时不同折线经过相同的点，例如：65XXXXXX XXXXXXXX XXXXXXX2155应该是3#include"iostream" #include"cstring" #inclu
fofu33·2013-06-29 15:00

joj 1270 Triangle Wave 找点自信题

#include usingnamespacestd; intmain() { intA,F; cin>>A>>F; while(F--){ introw=1,i; for(i=1;i=1;i--){ inttemp=row; while(temp--) cout=1) cout<<endl; } return0; }
fofu33·2013-05-19 20:00

joj 2529 Chorus 动态规划 最长上升子序列和最长下降子序列

题目链接：http://acm.jlu.edu.cn/joj/showproblem.php?
fofu33·2013-05-18 14:00

joj 2526 medic 动态规划

题目链接：http://acm.jlu.edu.cn/joj/showproblem.php?
fofu33·2013-05-16 15:00

joj 1008 Go hang a salami 回文判断

题目链接： http://acm.jlu.edu.cn/joj/showproblem.php?
fofu33·2013-05-15 07:00

joj1020 u Calculate e 输出精度设置

题目链接： http://acm.jlu.edu.cn/joj/showproblem.php?
fofu33·2013-05-14 08:00

joj 2512 Groups 并查集

题目链接 http://acm.jlu.edu.cn/joj/showproblem.php?
fofu33·2013-05-11 17:00

joj 2324 Go Dutch

ThereareNpersonandNjobtodo.Thei-thpersondoj-thjobwillcostdifferentcertainmoney.Chooseaschemethateverypersononlydoonedifferentjob,andtotalcostisminimum.InputInputconsistsofseveraltestcases.Thefirstline
WalkingInTheWind·2013-04-11 19:00

信件中常用英文简写

BTW或btwmGX;JOjZ 顺便说一句y}|zH bytheway的首字母缩略词。
zhangpinghao·2013-01-22 22:00

Uva OnlineJudge 网站汇总

浙江大学（ZJU）：http://acm.zju.edu.cn/杭州电子科技大学(HDU)：http://acm.hdu.edu.cn/吉林大学（JLU）：http://acm.jlu.edu.cn/joj
tobacco5648·2012-12-05 18:00

joj 1039 moving tables

joj1039movingtables #include#include#include  using namespace std;  int a[201];  int main()  {  //freopen
I believe·2012-12-05 10:00

JOJ 1007解题

 1007:TrianglesResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K70202611StandardAtrianglecanbemadeupoutofdots,liketheonesshownbelow:Thenumberofdotsineachoneiscalledatriangularnumber.Moreprecisely,
doufei_ccst·2012-07-30 16:00

JOJ 1006解题

 1006:AllyourbaseResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K61952080StandardGivenabase,andtwopositiveintegersindecimal(base10),convertthetwonumberstothenewbase,addthem,anddisplaytheirsuminth
doufei_ccst·2012-07-30 15:00

Android display架构分析

http://note.sdo.com/u/1188299048/n/6R04E~joj94FnM00Q000O8高通7系列硬件架构分析如上图，高通7系列Display的硬件部分主要由下面几个部分组成：
lwpping·2012-07-17 14:00

joj 1928

筛选法求素数~~~~~ #include #include #include #include usingnamespacestd; intprim[50000]; intmain() { memset(prim,0,sizeof(prim)); inti; for(i=2;imax) { max=j-now; b1=now+x1; b2=j+x1; } if(j-
qiankun1993·2012-02-14 17:00

joj 1877

按这题目来就行  #include#include#includeusingnamespacestd;structnode{   charname[35];   inttotal_num;};nodetree[10001];intmain(){   intlen=0,num=0;   charstr[35];   while(gets(str))   {      if(strcmp(str,""
qiankun1993·2012-02-14 15:00

joj 1195

1195:PrimeRingProblemResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE10s8192K1973499StandardAringiscomposedofncirclesasshownindiagram.Putnaturalnumbersintoeachcircleseparately,andthesumofnumbersintwoadj
fangzhiyang·2011-12-13 20:00

joj 2431: Shift and Increment

2431:ShiftandIncrementResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE5s16384K1362215StandardShiftandincrementisthebasicoperationsoftheALU(ArithmeticLogicalUnit)inCPU.Onenumbercanbetransformtoanyothernu
fangzhiyang·2011-12-11 17:00

joj 1313Dungeon Master

DungeonMasterResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K367129StandardYouaretrappedina3Ddungeonandneedtofindthequickestwayout!Thedungeoniscomposedofunitcubeswhichmayormaynotbefilledwithrock.
fangzhiyang·2011-12-07 20:00

joj2573

 2573:ProductoftwoprimesResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s65536K889277Standard输出所有在10000–20000之间，恰好可以分解为两个素数乘积的整数。将这些数从小到大输出。Input无Output每一行输出一个符合要求的数，按照从小到大排列。下面是输出的头和尾，中间部分需自行计算10001 .
hechenghai·2011-12-01 01:00

joj1199

 1199:JusttheFactsResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K1164435StandardTheexpression N!,readas``N factorial,"denotestheproductofthefirst N positiveintegers,where N isnonnegative.So,fore
hechenghai·2011-11-30 23:00

joj2748

 2748:PocketMoneyPlanResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s65536K507249StandardJackisaplainchild.Whenhismothergiveshispocketmoney,healwaysplanshowtospendwithinoneweekandmore.Thistime,hethoug
hechenghai·2011-11-30 23:00

joj2616

 2616:供热管道优化ResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s65536K784150StandardChangchun市的供暖公司总是为供热管道的修建位置感到头疼，一个不好的建设方案会浪费很多的时间和材料，他们总是想找到最优的建设方案。为此，他们来到了JLU,想通过聪明的你帮他们找出最优方案。有n个住宅楼，平面坐标已知，现在要修建一个从南
hechenghai·2011-11-30 23:00

joj2718

 2718:字符串的反码ResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s65536K978257Standard对于一个二进制数，将其每一位取反，称之为这个数的反码。下面我们定义一个字符的反码。如果这是一个小写字符，则它和字符’a’的距离与它的反码和字符’z’的距离相同；如果是一个大写字符，则它和字符’A’的距离与它的反码和字符’Z’的距离相同；如果
hechenghai·2011-11-30 23:00

joj626

 2626:三角形的边ResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s65536K1548410Standard给定三个已知长度的边，确定是否能够构成一个三角形，这是一个简单的几何问题。我们都知道，这要求两边之和大于第三边。实际上，并不需要检验所有三种可能，只需要计算最短的两个边长之和是否大于最大那个就可以了。这次的问题就是：给出三个正整数，计算最小
hechenghai·2011-11-30 23:00

joj1928

 1928:PrimeDistanceResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K9925StandardThebranchofmathematicscallednumbertheoryisaboutpropertiesofnumbers.Oneoftheareasthathascapturedtheinterestofnumberth
hechenghai·2011-11-27 09:00

joj1806

 1806:IntersectionResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K318108StandardYouaretowriteaprogramthathastodecidewhetheragivenlinesegmentintersectsagivenrectangle.Anexample: line:startpoint:(4
hechenghai·2011-11-24 00:00

joj1131

 1131:IntersectionResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K712174StandardYouaretowriteaprogramthathastodecidewhetheragivenlinesegmentintersectsagivenrectangle.Anexample:line:startpoint:(4,
hechenghai·2011-11-23 11:00

joj2256

 2256:Frog&BridgeResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE10s32768K1070170StandardAfrogisgoingtojumpacrossabridge,wheretherearestones.Thefrogisconsideringhowhecansteponthestonesasfewtimesaspossib
hechenghai·2011-11-20 10:00

joj 2660 河床

rmq的st算法，还有就是从头遍历的小技巧，不然仍然会超时。。。。#include#include#includeusingnamespacestd;#definemax(a,b)(a>b?a:b)  #definemin(a,b)(a=1;j--)        {           mx[j][i]=mx[j][i-1];            if(j+(1maxx)           
qiankun1993·2011-11-19 15:00

joj2412

 2412:DividethefingerResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE1s8192K444140StandardWecandivideonefigureintosomesmallerones.Forexample,123456789canbedividedinto123,456,789,or1,234567,89,whichissim
hechenghai·2011-11-19 00:00

joj 2651

水题，我竟然把Yes和No写成了YES和NO。。。。。 #include#includeusingnamespacestd;intfrid[105][105];intcloth[105];intn;intr_right;voiddfs(intm,intc){    //cout<
qiankun1993·2011-11-18 20:00

joj1889

 1889:AmultiplicationgameResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K362139StandardStanandOllieplaythegameofmultiplicationbymultiplyinganinteger p byoneofthenumbers2to9.Stanalwaysstartswith p
hechenghai·2011-11-18 00:00

joj1063

 1063:AFunnyGameResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K696260Standard1stJOJCupOnlineVContestWarmupProblemTomandJackareonthetrain.Thejourneyistoodullsomuchsothatbothofthemareeagertofindaw
hechenghai·2011-11-16 00:00

joj 1089 &&zoj 1060&&poj 1094 以及wa的分析和数据

这道题着实让无数人纠结，wa了n次n天，poj的discuss有大量的数据，wa的同学可以试一试。结果我把数据都过了还是wa，后来在discuss的帮助下终于ac了，判断是否有环要最先判断，例如如下的数据：44A#include#includeusingnamespacestd;intmap[27][27];intrudu[27];intr_mark[27];intfff; //一个分量中如度为0
qiankun1993·2011-11-11 20:00

joj2211

 2211:FirstofAllResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE8s8192K889188StandardAreyouatwitteraboutthisspecialprogrammingcontest?Don'tworry-let'sfirstofalltalksomethingaboutarathersimpleproblemrega
hechenghai·2011-11-11 00:00

joj 1189

 大数，题目有点误解人。。。明明说VeryLongInteger但运算的却不是数字而是文本行#include#includeusingnamespacestd;charstr1[1000005],str2[105];intmain(){   scanf("%s",str1);   while(scanf("%s",str2),strcmp(str2,"0")!=0)   {        intl
qiankun1993·2011-11-10 21:00

joj 2699

水题简单的博弈思想#include#includeusingnamespacestd;intmain(){   intn,k;   while(scanf("%d%d",&n,&k),n||k)   {       inti=n%(k+1);       if(i!=1)           printf("16\n");       else           printf("18\n"); 
qiankun1993·2011-11-10 20:00

joj 2717

水题，应用简单dp，含i个字符的串的个数等于i-1个字符的串的个数*2（包扩加上0和加上1），再减去最后3个字符是011的情况。 #include#includeusingnamespacestd;doubledp[41];intmain(){   memset(dp,0,sizeof(dp));   dp[0]=1;   dp[1]=2;   dp[2]=4;   dp[3]=7;   inti
qiankun1993·2011-11-10 19:00

joj1189

 1189:IntegerInquiryResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE1s8192K1044363StandardOneofthefirstusersofBIT'snewsupercomputerwasChipDiller.Heextendedhisexplorationofpowersof3togofrom0to333andheexp
hechenghai·2011-11-08 20:00

joj2343

 2343:SingaSongResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s16384K1186215StandardNstudentsareplayingagame,theysitinacircleandnumberthemselveswith1toNclockwise.First,theteacherletthestudentwhosenumb
hechenghai·2011-11-08 20:00

joj2171

 2171:AnEasyProblem!ResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K952230StandardIt'saneasyproblem!N-bitsequencesisastringofdigitalswhichcontainsonly'0'and'1'.Youshoulddeterminethenumberofn-bits
hechenghai·2011-11-08 20:00

joj2699

 2699:16and18ResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE1s65536K28565Standard16and18aregoodfriends.Theyareplayingagame.Therulesareasfollowing:(1)16and18willgivenumbersinturn.Atfirst16,then18,andthe
hechenghai·2011-11-08 20:00

joj2659

 2659:宝石游戏ResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE1s65536K457183Standard初始时有n个标号为1~n(n#includeusingnamespacestd;longlong a[55];intn;intmain(){  while(scanf("%d",&n),n)  {    longlongsum=0;    fo
hechenghai·2011-11-08 20:00

joj2761

 2761:首战告捷ResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE1s6144K103156Standard又是新的一年ACM院赛，估计大家都磨拳擦掌，蓄势待发了。作为一个ACMer，不仅需要很强的Code能力，还需要一定的IQ,EQ。首先来点轻松的智力题目。1.最近，kk编写的程序截获了外星人Mars的一份报文，从报文上得知Mars人将派遣“AWQQ
hechenghai·2011-11-08 20:00

joj2058

 2058:FindtheSectionResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K713153StandardInthistaskyouareaskedtodealwithalotoffloatingpointnumbers.Findthesectioninanumbertablethatthesumofthenumbersiniti
hechenghai·2011-11-07 00:00

joj 2526

ResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE1s65536K1066244Standard辰辰是个天资聪颖的孩子，他的梦想是成为世界上最伟大的医师。为此，他想拜附近最有威望的医师为师。医师为了判断他的资质，给他出了一个难题。医师把他带到一个到处都是草药的山洞里对他说：“孩子，这个山洞里有一些不同的草药，采每一株都需要一些时间，每一株也有它自身的价值。
fangzhiyang·2011-11-06 20:00

joj1026

copy来的思想，果然自己还很菜啊递归方程式如下（f（i，j）为i个砖头，第一排为j个的摆发）：f(i,j)=f(i-j,j+1)+f(i-j,j+2)+...+f(i-j,floor((i-j-1)/2)#include#includeusingnamespacestd;doublep[501][501];intmain(){   inti,j,k;   for(i=0;i<501;i++)  
qiankun1993·2011-11-06 20:00
上一页 1 2 3 4 5 6 7 8 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他