DHOJ

Common Subsequence

#define_CODE_DHOJ_A1159_ #ifdef_CODE_DHOJ_A1159_ #include #include constintM=1001; charX[M]; charY[M]
shiquxinkong·2014-01-14 17:00

DHOJ 2021 发工资咯：）

#include usingnamespacestd; intmain(){ inta[10000]; intt; while(cin>>t&&t){ intsum=0; intb[2][6]={ {100,50,10,5,2,1}, {0,0,0,0,0,0} }; for(inti=0;i>a[i]; for(inti=0;i
電泡泡·2012-10-14 13:00

DHOJ 1896 Brave Game 巴什博弈

#include intmain(){ intnum,n,m; scanf("%d",&num); while(num--){ scanf("%d%d",&n,&m); if(n%(m+1)!=0) printf("first\n"); else printf("second\n"); } return0; }
電泡泡·2012-08-29 14:00

HDU 1195 Open the Lock 暴力过法 DHOJ 1195

题目链接如下 http://acm.hdu.edu.cn/showproblem.php?pid=1195 Problem Description Now an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbe
mmdev·2010-07-21 00:00

HDU 1195 Open the Lock 暴力过法 DHOJ 1195

题目链接如下 http://acm.hdu.edu.cn/showproblem.php?pid=1195 ProblemDescriptionNowanemergenttaskforyouistoopenapasswordlock.Thepasswordisconsistedoffourdigits.Eachdigitisnumberedfrom1to9.Eachtime,youcanaddor
huaxiangsl·2010-07-21 00:00

DHOJ1005 HDU1005 Number Sequence

 ProblemDescriptionAnumbersequenceisdefinedasfollows:f(1)=1,f(2)=1,f(n)=(A*f(n-1)+B*f(n-2))mod7.GivenA,B,andn,youaretocalculatethevalueoff(n).  InputTheinputconsistsofmultipletestcases.Eachtestcasecon
huaxiangsl·2010-06-25 23:00

DHOJ1005 HDU1005 Number Sequence

Problem Description A number sequence is defined as follows: f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7. Given A, B, and n, you are to calculate the value of f(n).
mmdev·2010-06-25 23:00
上一页 1 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他