![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
九度OJ
文章平均质量分 61
ErrorZero
I dont want to survive. I want to live .
展开
-
九度OJ 题目1192:回文字符串
题目链接:http://ac.jobdu.com/problem.php?pid=1192解题时间:2013/4/13程序源码:#include #include #include int main(){ char str[1001]; int len; int mid; int flag;//1表示是回文序列 int i; wh原创 2013-04-13 10:58:06 · 718 阅读 · 0 评论 -
九度OJ 题目1010:A + B
题目链接:http://ac.jobdu.com/problem.php?pid=1010解题时间:2013/4/13程序源码:#include #include #include int main(){ char str[6]; char number[10][6]={"zero","one","two","three","four","five","six"原创 2013-04-13 11:28:59 · 790 阅读 · 0 评论 -
九度OJ 题目1079:手机键盘
题目链接:http://ac.jobdu.com/problem.php?pid=1079解题时间:2013/4/13程序源码:#include #include #include int main(){ char str[101]; int len; int time; int i; int place;//位于第几个按键 wh原创 2013-04-13 16:31:54 · 719 阅读 · 0 评论 -
九度OJ 题目1179:阶乘
题目链接:http://ac.jobdu.com/problem.php?pid=1179解题时间:2013/4/13程序源码:#include #include int main(){ int n; long long y1,y2; long long temp; int i; while(scanf("%d",&n)!=EOF)原创 2013-04-13 10:54:18 · 617 阅读 · 0 评论 -
九度OJ 题目1020:最小长方形
题目链接:http://ac.jobdu.com/problem.php?pid=1020解题时间:2013/4/13程序源码:#include #include int main(){ int ax,ay,bx,by; int x,y; while(1) { ax=ay=bx=by=0; scanf("%d %d原创 2013-04-13 12:28:37 · 901 阅读 · 0 评论 -
九度OJ 题目1029:魔咒词典
题目链接:http://ac.jobdu.com/problem.php?pid=1029解题时间:2013/4/13程序源码:#include #include #include int main(){ int num=0;//魔咒条数 char magicWords[10000][21]; char magicWorks[10000][81];原创 2013-04-13 14:03:37 · 744 阅读 · 0 评论 -
九度OJ 题目1016:火星A+B
题目链接:http://ac.jobdu.com/problem.php?pid=1016解题时间:2013/4/14程序源码:#include #include #include /*int primes[] ={ 2,3,5,7,11, 13,17,19,23,29, 31,37,41,43,47, 53,59,61,67,71,原创 2013-04-14 13:32:37 · 728 阅读 · 0 评论 -
九度OJ 题目1483:求最大最小数
题目链接:http://ac.jobdu.com/problem.php?pid=1483解题时间:2013/4/14程序源码:#include #include int main(){ int n; int max,min,temp; while(scanf("%d",&n)!=EOF) { scanf("%d",&temp);原创 2013-04-14 10:31:07 · 858 阅读 · 1 评论