![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法_joj
文章平均质量分 87
NJUTONY
吉林大学09级软件学院南京大学计算机研究生在读
展开
-
joj1007
#includeint main(){ void draw(int n); int i,k,m,n; while(scanf("%d",&n),n) { k=0; for(i=1;i if((i+1)*i/2==n) {k=1;m=i;break;} if(k) {printf("%d is a triangular number./n",n); draw(m); } else原创 2010-07-13 21:03:00 · 423 阅读 · 0 评论 -
joj1008(注意库函数的应用)
1008: Go hang a salami, IResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K75551380Standard<br />Given a character string, determine if it is a palindrome. A palindrome is a word or phrase that reads the same forwards and backwards, like mom or noon原创 2010-07-13 21:18:00 · 563 阅读 · 0 评论 -
joj1009(简单的格式控制)
1009: ZorroResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K96051955Standard<br />Zorro is ready to modernize -- he is tired of hand drawing his giant "Z", and would like to add an educational element. So he wants you to write a program to draw a Z原创 2010-07-13 21:23:00 · 724 阅读 · 0 评论 -
joj1006(进制转换)
#includeint main(){ void change(int ,int); int a,b,n,sum; int a1[50],b1[50],c1[50]; scanf("%d %d %d",&n,&a,&b); while(a||b||n) { sum=a+b; change(a,n); printf(" + "); change(b,n); printf(" = ");原创 2010-07-13 20:53:00 · 541 阅读 · 0 评论 -
hdu2544最短路 Floyd求最短路
最短路<br />Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 5440 Accepted Submission(s): 2349<br /><br />Problem Description在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候,却是非常累原创 2011-03-06 14:44:00 · 955 阅读 · 0 评论