E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
joj
匹配问题汇总
JOJ
2662:采购方案(二分答案+多重匹配)CCST@JLU要举办这次的程序设计大赛。为了节省开支，在各方面都得考虑仔细，比赛场地布置也不例外。
jxy859
·
2011-09-10 20:00
joj
1018
1018:AnagramsbyStackResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE5s8192K1171518StandardHowcananagramsresultfromsequencesofstackoperations?TherearetwosequencesofstackoperatorswhichcanconvertTROTtoTOR
hechenghai
·
2011-09-07 20:00
joj
1693
1693:SimplySyntaxResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K385151StandardInthelandofHedoniatheofficiallanguageisHedonian.AHedonianprofessorhadnoticedthatmanyofherstudentsstilldidnotmastert
hechenghai
·
2011-09-07 07:00
最小点路径覆盖（匈牙利算法）
JOJ
2730题意：http://blog.csdn.net/jxy859/article/details/6747413邻接阵#include #include constintN=105; constin
jxy859
·
2011-09-06 16:00
算法
网络
Graph
Build
qt
IM
joj
2658
2658:歌唱排练ResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE1s65536K468120StandardMr.Sun正在为参加歌咏比赛的JLU_CCST的同学们排练。比赛要求参赛同学站成一排，为了更好的整体效果，Mr.Sun在排布队列方案时不希望出现有女生相邻的情况。你可以告诉Mr.Sun,总共可能出现多少种不同的针对男女学生的排列方案么？比如当
hechenghai
·
2011-09-05 21:00
joj
1035
1035:WebNavigatorResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K1519448StandardStandardwebbrowserscontainfeaturestomovebackwardandforwardamongthepagesrecentlyvisited.Onewaytoimplementthesefeatu
hechenghai
·
2011-09-03 20:00
command
input
each
features
output
whitespace
joj
1474
1474:SoundexIndexingResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K238115StandardTheSoundexIndexSystemwasdevelopedsothatsimilarsoundingnames,ornameswithsimilarspellingcouldbeencodedforeasyretri
hechenghai
·
2011-09-03 20:00
joj
1025
1025:LC-DisplayResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K2238631StandardAfriendofyouhasjustboughtanewcomputer.Untilnow,themostpowerfulcomputerheeverusedhasbeenapocketcalculator.Now,looking
hechenghai
·
2011-09-02 23:00
joj
1170
AuthorsContests Problems Status Links[新版judge已支持specialjudge；增加了提交后的状态页面；增加对提交代码的语言检查][新版judge系统近日试运行，希望可以解决内存越界导致Waiting的问题] [more]Welcome, �γɺ�[JPoints: 977,Sender!: 0/10] 1170:WireIsSoExpensiveResu
hechenghai
·
2011-08-31 23:00
joj
1145
AuthorsContests Problems Status Links[新版judge已支持specialjudge；增加了提交后的状态页面；增加对提交代码的语言检查][新版judge系统近日试运行，希望可以解决内存越界导致Waiting的问题] [more]Welcome, �γɺ�[JPoints: 965,Sender!: 0/10] 1145:AMathematicalCuriosit
hechenghai
·
2011-08-31 22:00
joj
1019
AuthorsContests Problems Status Links[新版judge已支持specialjudge；增加了提交后的状态页面；增加对提交代码的语言检查][新版judge系统近日试运行，希望可以解决内存越界导致Waiting的问题] [more][You'venot loggedin.] 1019:DotheUntwistResultTIMELimitMEMORYLimitRun
hechenghai
·
2011-08-30 21:00
joj
2528
AuthorsContests Problems Status Links[新版judge已支持specialjudge；增加了提交后的状态页面；增加对提交代码的语言检查][新版judge系统近日试运行，希望可以解决内存越界导致Waiting的问题] [more]Welcome, �γɺ�[JPoints: 945,Sender!: 0/2] 2528:SaveResultTIMELimitMEM
hechenghai
·
2011-08-29 22:00
joj
1016
AuthorsContests Problems Status Links[新版judge已支持specialjudge；增加了提交后的状态页面；增加对提交代码的语言检查][新版judge系统近日试运行，希望可以解决内存越界导致Waiting的问题] [more]Welcome, �γɺ�[JPoints: 935,Sender!: 0/1] 1016:DegreesofseparationRes
hechenghai
·
2011-08-29 19:00
joj
1001
1001:TheSumProblemResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K167483298StandardInthisproblem,youaretowriteaprogramtocalculatethesumofinputs.Theinputfileconsistsexactlyonecaseandyoushouldprint
hechenghai
·
2011-08-29 09:00
joj
2485
2485:Welcome,2008ResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s65536K1427665StandardForChinesepeople,2008isaspecialyear.The29thOlympicGameswillbeheldinBeijing.Inordertoexpressourenthusiasm,wedrawabi
hechenghai
·
2011-08-29 09:00
joj
2471
2471:StringtriangleResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s65536K3037604StandardYouareaskedtodrawaright-angletriangle,thegivenmaterialsisaspecialword.Justseethesamplefordetail.InputThefirstlin
hechenghai
·
2011-08-29 09:00
joj
2356
2356:MaximumNumberResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K674362StandardGivenaseriesofinteger,findthemaximumnumber.InputMulti-case.Thefirstlinegivescountn(nintmain(){ intn; intm;//有可能
hechenghai
·
2011-08-29 09:00
joj
2137
2137:Ask&AnswerResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K890466Standard请回答以下问题____年7月，中国共产党第一次全国代表大会在上海召开。____年7月7日，卢沟桥事变爆发，日本侵略军发动了全面侵华战争。____年8月，日本帝国主义宣布无条件投降，中国人民的抗日战争取得了伟大胜利。____年4月23日
hechenghai
·
2011-08-29 09:00
list
System
output
joj
2000
LogoutMyAccountMyGroups 2000:SimpleProblemIVResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE1s10240K1729685StandardGivethreevertexsofatriangle,calculatetheperimeterofthetriangle.InputThereareseveraltes
hechenghai
·
2011-08-29 09:00
joj
1084
1084:FinancialManagementResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K33321125StandardLarrygraduatedthisyearandfinallyhasajob.He’smakingalotofmoney,butsomehowneverseemstohaveenough.Larryhasdeci
hechenghai
·
2011-08-29 09:00
joj
1270
1270:TriangleWaveResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K1323674StandardInthisproblemyouaretogenerateatriangularwaveformaccordingtoaspecifiedpairofAmplitudeandFrequency.InputandOutputThei
hechenghai
·
2011-08-29 09:00
joj
2154
2154:HungryRabbitsResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K1141400StandardAgroupofhungryrabbitshadgotabasketofcarrots,butthesecarrotsisn'tenoughforalltherabbitstostayalive.Sotheyhadameetin
hechenghai
·
2011-08-29 09:00
joj
1002
//这是一个最小路径的一个问题首先用floyed算法将所有点之间的最短路径求出来//然后依次假设某个点为起始点求出花费的时间，选取最小的输出#include#includeusingnamespacestd;intmap[105][105];intmaxll=10000;intn;voidfloyed(){for(intk=1;kmap[i][n]){min=map[i][n];dot=i;}}i
hechenghai
·
2011-08-25 20:00
队列
队列
joj
上的宽度优先搜索的题我已经做完了，我觉得我应该对队列做一些总结了。我觉得宽度优先搜索与队列的结合，无非有三种情况。
hechenghai
·
2011-08-25 09:00
joj
2578
2578:MovingDiceResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE5s65536K23546Standard小明觉得自己的空间想象力不错，但是在玩这个游戏的时候，小明遇到了困难。游戏是这样的，有一个n*m的棋盘和一个骰子（正方体，每个面有一个不同的数字，1～6），骰子一个面的大小恰好能覆盖住棋盘的一个格子。游戏开始的时候骰子放在棋盘的某一个
hechenghai
·
2011-08-25 09:00
JOJ
1984: A Round Peg in a Ground Hole (判断点在凸多边形内)
之前的代码，整理一下，计算几何已经被我忘差不多了 。。。#include #include #include constdoublepi=acos(-1.0); constdoubleeps=1e-8; constintmaxn=1000; structpoint { doublex,y; pointoperator-(pointp) { pointres; res.x=x-p.x; res.y=
jxy859
·
2011-08-24 17:00
c
struct
JOJ
2190: Mondriaan's Dream (状态压缩DP +DFS)
在网上找了很多解题报告，看了很久才理解，不过理解之后代码还是很好实现的> #include typedeflonglongll; constintmaxn=1=m) { if(c==m)dp[0][opt]++; return; } dfs(c+1,opt=m) { if(c==m)dp[r][opt]+=dp[r-1][pre]; return; } DFS(r,c+1,pren)n^=m^=
jxy859
·
2011-08-23 10:00
joj
1113
1113:TheGameResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K38097StandardOnemorning,youwakeupandthink:``Iamsuchagoodprogrammer.Whynotmakesomemoney?''Soyoudecidetowriteacomputergame.Thegametakesp
hechenghai
·
2011-08-22 22:00
properties
input
Path
each
output
pair
joj
2558
ResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE8s65536K39555StandardForaboatonalargebodyofwater,strongcurrentscanbedangerous,butwithcarefulplanning,theycanbeharnessedtohelptheboatreachitsdestination.Yo
hechenghai
·
2011-08-22 19:00
Integer
System
input
character
each
output
JOJ
水DP汇总
花点时间整理下以前A掉的水题，巩固下基础，也希望能再细节处理上有所提高可以用动态规划来解决的问题要满足无后效性（DAG）、最优子结构 【无特殊说明都是
JOJ
的题】/******************
jxy859
·
2011-08-20 16:00
joj
2534
2534:TheHeroRescuedThePrincessResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s65536K27683Standard美丽的公主被关在古老的施了咒语的城堡中，你作为当今世上最勇敢的英雄，决定救出这位美丽的公主。如果你成功了，最后公主就会嫁给你。当然故事有点俗套，至少如果你把她救出了，我会免费送你一个气球。但是有很多的英雄
hechenghai
·
2011-08-19 21:00
c
Class
input
output
joj
1185
1185:KnightMovesResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE1s8192K667315StandardAfriendofyouisdoingresearchontheTravelingKnightProblem(TKP)whereyouaretofindtheshortestclosedtourofknightmovesthatvi
hechenghai
·
2011-08-19 19:00
c
String
Class
input
each
n2
joj
1313
1313:DungeonMasterResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K305120StandardYouaretrappedina3Ddungeonandneedtofindthequickestwayout!Thedungeoniscomposedofunitcubeswhichmayormaynotbefilledwit
hechenghai
·
2011-08-17 22:00
c
Graph
input
UP
character
each
joj
1349
1349:OilDepositsResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K580285StandardTheGeoSurvCompgeologicsurveycompanyisresponsiblefordetectingundergroundoildeposits.GeoSurvCompworkswithonelargerecta
hechenghai
·
2011-08-16 23:00
File
input
character
each
output
plot
joj
2431
2431:ShiftandIncrementResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE5s16384K1304209StandardShiftandincrementisthebasicoperationsoftheALU(ArithmeticLogicalUnit)inCPU.Onenumbercanbetransformtoanyothern
hechenghai
·
2011-08-15 22:00
Integer
basic
input
layer
output
joj
1197
1197:SumItUpResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K694275StandardGivenaspecifiedtotaltandalistofnintegers,findalldistinctsumsusingnumbersfromthelistthatadduptot.Forexample,ift=4,n=6,andt
hechenghai
·
2011-08-14 19:00
list
Integer
input
each
output
Numbers
JOJ
2724 hua rong dao (最小割 拆点)[无代码]
学了拆点之后，发现这题的构图就很简单了，不过昨天因为构图时控制方向的k的范围出了点小问题，本应k #include constintmaxn=1850; constintinf=10&&dis[u]==dis[v]+1) { flag=1; if(edge[j].w0&&dis[v]=r||y>=c)continue; if(!map[x][y])addedge(i*c+j+1+
jxy859
·
2011-08-13 19:00
DAO
c
struct
SAP
Graph
Build
joj
2107
2107:RedandBlackResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K375207StandardThereisarectangularroom,coveredwithsquaretiles.Eachtileiscoloredeitherredorblack.Amanisstandingonablacktile.Fromat
hechenghai
·
2011-08-11 12:00
System
input
character
each
output
Numbers
joj
2346
这是一个数学问题求近似值 #include #include #definePIacos(-1.0) #defineB1e-8 doublecmp,area,a,b; doublegetb(doubleta){ doubleb=sqrt(1.0-ta*ta); doublesja=ta*b; doubletemp=asin(ta)-sja; returntemp/(area-temp);} int
hechenghai
·
2011-08-07 12:00
joj
1595
#include#includeusingnamespacestd;inta[55];intb[55];intoutcome[55];intupper;intdown;intgcd(intn,intm){ intt=n%m; while(t!=0) { n=m; m=t; t=n%m; } returnm;}voidcal(){ for(inti=2;i0) {
hechenghai
·
2011-08-07 12:00
joj
2426
#includechara[10000];intmain(){ intn; while(scanf("%s%d",a,&n)==2) { intu=0; for(inti=u;ia[v]) { a[j]='*'; u=j-1; break; } } } inti=0; w
hechenghai
·
2011-08-07 12:00
joj
2526
2526:medicResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE1s65536K1039237Standard辰辰是个天资聪颖的孩子，他的梦想是成为世界上最伟大的医师。为此，他想拜附近最有威望的医师为师。医师为了判断他的资质，给他出了一个难题。医师把他带到一个到处都是草药的山洞里对他说：“孩子，这个山洞里有一些不同的草药，采每一株都需要一些时间，每
hechenghai
·
2011-08-07 12:00
joj
1509
1509:HamiltonianCycleResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K467113StandardAfewdefinitionsfirst:Definition1AgraphG=(V,E)iscalled``dense''ifforeachpairofnon-adjacentvertices u and v, wher
hechenghai
·
2011-08-07 12:00
joj
1195
1195:PrimeRingProblemResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE10s8192K1939493StandardAringiscomposedofncirclesasshownindiagram.Putnaturalnumbersintoeachcircleseparately,andthesumofnumbersintwoad
hechenghai
·
2011-08-07 12:00
ini
input
each
output
Numbers
joj
1182
1182:LottoResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE1s8192K834389StandardInaLottoIhaveeverplayed,onehastoselect6numbersfromtheset{1,2,...,49}.ApopularstrategytoplayLotto-althoughitdoesn'tincrease
hechenghai
·
2011-08-07 12:00
Integer
System
input
each
output
Numbers
joj
1066
1066:FireNetIIResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K612241Standard1stJOJCupOnlineVContestWarmupProblemSupposethatwehaveasquarecitywithstraightstreets.Amapofacityisasquareboardwithnrows
hechenghai
·
2011-08-07 12:00
image
File
input
each
output
distance
joj
1003
1003:ChannelAllocationResultTIMELimitMEMORYLimitRunTimesACTimesJUDGE3s8192K3470639StandardWhenaradiostationisbroadcastingoveraverylargearea,repeatersareusedtoretransmitthesignalsothateveryreceiverhas
hechenghai
·
2011-08-07 12:00
Graph
input
NetWork
each
Signal
output
joj
2735: picture 求矩形并的周长
Anumber,N(1#include#include#includeusingnamespacestd;#defineABS(x)((x)>=0?(x):-(x))constintMAXN=5500;structTSegNode{ intL,R,Lch,Rch,count,len; TSegNode(intx,inty):L(x),R(y),Lch(-1),Rch(-1),count(0
kongming_acm
·
2011-08-01 21:00
list
struct
Integer
ini
input
each
多校JLU 10题JLUCPC（树形DP）
代码优化后
JOJ
跑了0.57s。
jxy859
·
2011-07-29 19:00
优化
struct
测试
JOJ
2519 Find the longest section（位运算 +（前缀和？））
找一个最长字符串区间，满足里面每个字母出现的次数为偶数巧妙的利用了位运算的性质将所有的状态存在一个整数里，二进制数的每位是01分别表示字母出现的偶奇次，在利用前缀和#include #include #include usingstd::sort; constintmaxn=10005; charstr[105]; intcnt[maxn]; intpin[maxn]; intassist[max
jxy859
·
2011-07-26 18:00
上一页
1
2
3
4
5
6
7
8
下一页
按字母分类：
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他