ZJU-PAT

ZJU-PAT 1065. A+B and C (64bit) (20)

Given three integers A, B and C in [-263, 263], you are supposed to tell whether A+B > C. Input Specification: The first line of the input gives the positive number of test cases, T (<=10).
·2015-11-13 17:43

ZJU-PAT 1081. Rational Sum (20)

GivenNrationalnumbersintheform"numerator/denominator",youaresupposedtocalculatetheirsum.InputSpecification:Eachinputfilecontainsonetestcase.EachcasestartswithapositiveintegerN( #include #include #incl
Matrix_Reloaded·2014-07-08 23:00

ZJU-PAT 1010. Radix (25)

Givenapairofpositiveintegers,forexample,6and110,canthisequation6=110betrue?Theansweris"yes",if6isadecimalnumberand110isabinarynumber.NowforanypairofpositiveintegersN1andN2,yourtaskistofindtheradixofon
Matrix_Reloaded·2014-06-30 00:22

ZJU-PAT 1010. Radix (25)

Givenapairofpositiveintegers,forexample,6and110,canthisequation6=110betrue?Theansweris"yes",if6isadecimalnumberand110isabinarynumber.NowforanypairofpositiveintegersN1andN2,yourtaskistofindtheradixofon
Matrix_Reloaded·2014-06-30 00:00

ZJU-PAT 1065. A+B and C (64bit) (20)

GiventhreeintegersA,BandCin[-263,263],youaresupposedtotellwhetherA+B>C.InputSpecification:Thefirstlineoftheinputgivesthepositivenumberoftestcases,T(C,or"Case#X:false"otherwise,whereXisthecasenumber(st
Matrix_Reloaded·2014-06-23 00:00

ZJU-PAT 1078. Hashing (25) 浙大2014年上机复试第二题

#include #include #include #include #include usingnamespacestd; constintMaxN=20001; intn,m; boolPosition[MaxN]; voidspecial_process(intcur) { for(inti=1;i0)printf(""); scanf("%d",&tmp); intcur=tmp
Matrix_Reloaded·2014-04-04 11:00

ZJU-PAT 1080. Graduate Admission (30) 浙大2014年上机复试第四题

#include #include #include #include usingnamespacestd; constintmaxn=40005; constintmaxm=101; intn,m,k; intnum[maxm]; intlastRank[maxm]; vectormm[maxm]; structstu { intid; intGE,GI,fin; intpre[6];
Matrix_Reloaded·2014-04-04 09:00

ZJU-PAT 1079. Total Sales of Supply Chain (25) 浙大2014年上机复试第三题

#include #include usingnamespacestd; structNode { intparent;//父节点 boolflag;//是否是retailers intlevel;//第几层 intnum;//销售多少个 }; Nodett[100005]; intn; doublep,r,sum; intJisuan(intnum) { if(tt[num].level!
Matrix_Reloaded·2014-04-03 16:00

ZJU-PAT 1056. Mice and Rice (25) 浙大2013年上机复试第四题

#pragmawarning(disable:4786) #include #include #include #include #include #include usingnamespacestd; intn,m; intB[100005]; intflag; intcnt;//第几轮次被淘汰 intgroup[1005],num_in_group;
Matrix_Reloaded·2013-04-18 16:00

ZJU-PAT 1057. Stack (30) 浙大2013年上机复试第三题

#pragmawarning(disable:4786) #include #include #include #include #include usingnamespacestd; intn,d;; intA[10005],B[10005]; intselect(intnum) { for(inti=1;i #include #include #include #include using
Matrix_Reloaded·2013-04-18 15:00

ZJU-PAT 1055. The World's Richest (25) 浙大2013年上机复试第二题

对每个年龄人数进行控制减少遍历的范围极大降低时间复杂度#pragmawarning(disable:4786) #include #include #include #include #include usingnamespacestd; constintMAXN=100005; intm,n; intnum,Min,Max; structpeople { stringname; intage
Matrix_Reloaded·2013-04-18 14:00

ZJU-PAT 1054. The Dominant Color (20) 浙大2013年上机复试第一题

#pragmawarning(disable:4786) #include #include #include #include usingnamespacestd; intmain() { intm,n; while(scanf("%d%d",&m,&n)!=EOF) { inti,j; strings; mapans; map::iteratorp;
Matrix_Reloaded·2013-04-18 13:00

zju-pat 1008.Elevator

#include #include usingnamespacestd; intn; inta[105]; voidrun() { inti; for(i=0;icur) { ans=ans+(a[i]-cur)*6; ans+=5; cur=a[i]; } elseif(a[i]
Matrix_Reloaded·2013-03-27 22:00

ZJU-PAT 1050

#include #include usingnamespacestd; /* SampleInput: Theyarestudents. aeiou SampleOutput: Thyrstdnts. */ boolmyhash[150]; strings1,s2; voidrun() { getline(cin,s2); inti; strings=""; intlen=s1.siz
Matrix_Reloaded·2013-03-24 22:00

ZJU-PAT 1051 Pop Sequence

#include #include #include usingnamespacestd; intm,n,cases; stackf; inta[1005]; boolJudge() { while(f.empty()==false)f.pop(); inti,j; for(i=0;im)returnfalse; for(i=1;icur) { for(j=cur+1;jm) retur
Matrix_Reloaded·2013-03-24 22:00
上一页 1 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他