======【初☆步】======
豫帝哥哥
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
展开
-
HDOJ Guess the number 3337【神题-抓取杭电后台输出数据】
Guess the numberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7077 Accepted Submission(s): 1626Problem DescriptionAekdyCoin原创 2015-08-08 13:57:40 · 1263 阅读 · 0 评论 -
蓝桥杯试题 入门训练 Fibonacci数列
入门训练 Fibonacci数列 时间限制:1.0s 内存限制:256.0MB 问题描述Fibonacci数列的递推公式为:Fn=Fn-1+Fn-2,其中F1=F2=1。当n比较大时,Fn也非常大,现在我们想知道,Fn除以10007的余数是多少。输入格式输入包含一个整数n。输出格式输出一行,包含原创 2014-12-22 17:53:13 · 1646 阅读 · 0 评论 -
NYOJ 喷水装置(一) 6
喷水装置(一)时间限制:3000 ms | 内存限制:65535 KB难度:3描述现有一块草坪,长为20米,宽为2米,要在横中心线上放置半径为Ri的喷水装置,每个喷水装置的效果都会让以它为中心的半径为实数Ri(0<Ri<15)的圆被湿润,这有充足的喷水装置i(1<i<600)个,并且一定能把草坪全部湿润,你要做的是:选择尽量少的喷水装置,把整个草坪的全部湿润。原创 2015-01-30 23:32:00 · 737 阅读 · 0 评论 -
2015百度之星资格赛 列变位法解密 1002
列变位法解密Accepts: 1644Submissions: 6646Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem Description列变位法是古典密码算法中变位加密的一种方法,具体过程如下将明文字符分割成原创 2015-05-26 10:29:09 · 816 阅读 · 0 评论 -
HDOJ 士兵队列训练问题 1276【vector】
士兵队列训练问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4608 Accepted Submission(s): 2149Problem Description某部队进行新兵队列训练,将新兵从一原创 2015-08-03 10:05:55 · 805 阅读 · 0 评论 -
【简单题】CCPC Huatuo's Medicine L
Huatuo's MedicineTime Limit:1000MS Memory Limit:65535KB 64bit IO Format:%lld & %lluSubmit Status Practice UESTC 1226DescriptionHuatuo was a famous doctor. He原创 2015-11-01 12:28:07 · 856 阅读 · 0 评论 -
【博弈-找规律】HDOJ 取石子游戏 2516
取石子游戏Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3601 Accepted Submission(s): 2125Problem Description1堆石子有n个,两人轮流取.先取者第1次原创 2015-11-28 18:03:39 · 556 阅读 · 0 评论 -
【技巧】HDOJ N!Again 2674
N!AgainTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4194 Accepted Submission(s): 2251Problem DescriptionWhereIsHeroFrom:原创 2015-11-28 18:23:09 · 614 阅读 · 0 评论 -
HDU校赛
The Country ListTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2516 Accepted Submission(s): 592Problem DescriptionAs the原创 2016-01-03 17:25:07 · 822 阅读 · 0 评论 -
【水】LightOJ Positive Negative Sign 1294
1294 - Positive Negative SignPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBGiven two integers: n and m and n is divisible by 2m,原创 2015-12-02 23:23:34 · 631 阅读 · 0 评论 -
【简单】LigthOJ Ekka Dokka 1116
1116 - Ekka DokkaPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBEkka and his friend Dokka decided to buy a cake. They both love c原创 2015-12-02 23:06:35 · 517 阅读 · 0 评论 -
【博弈】HDOJ ZYB's Game 5591
ZYB's GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 285 Accepted Submission(s): 238Problem DescriptionZYB played a ga原创 2015-12-07 19:21:00 · 741 阅读 · 0 评论 -
【水】HDOJ ZYB's Biology 5590
ZYB's BiologyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 323 Accepted Submission(s): 269Problem DescriptionAfter gettin原创 2015-12-07 19:19:00 · 715 阅读 · 0 评论 -
【找规律】HDOJ Rikka with Chess 5630
Rikka with ChessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 351 Accepted Submission(s): 299Problem DescriptionYuta gives原创 2016-03-01 16:48:20 · 814 阅读 · 0 评论 -
HDOJ 回文数猜想 1282(讨论区代码,strrev,itoa,atoi函数使用)
#include#include#includeint main(){ char a[100],b[100]; int h,c[100],d[100]; int f,k,i; while(scanf("%s",a)!=EOF) { h=0,k=0; memset(c,0,sizeof(c)); memset(b,0,sizeof(b));原创 2014-12-07 22:33:23 · 870 阅读 · 0 评论 -
NYOJ 字母小游戏 273(gets与scanf区别)
#include#include#include int main(){ int t; scanf("%d",&t); //getchar(); while(t--) { int i,l,k=0; char a[210],b; //gets(a); scanf("%s",a); l=strlen(a); for(i=0;i<l;i++) { i原创 2014-11-28 20:26:11 · 951 阅读 · 0 评论 -
最近素数
#include#include#includeint main (){ int t; scanf("%d",&t); while(t--) { int x,i,q,h; scanf("%d",&x); q=x; h=x; if(x==1)//1不是素数! { printf("2\n"); continue;//不可忘了continue,否则原创 2014-11-21 23:21:11 · 916 阅读 · 0 评论 -
HDOJ Hard Code 4813【2013长春区域赛A题-水】
Hard CodeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 959 Accepted Submission(s): 676Problem DescriptionSome strange code原创 2015-08-08 09:06:15 · 626 阅读 · 0 评论 -
HDOJ Osu! 5078【2014鞍山区域赛I题-水】
Osu!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1263 Accepted Submission(s): 660Special JudgeProblem DescriptionOsu! is原创 2015-08-04 14:24:42 · 1192 阅读 · 0 评论 -
将最小值放到数列最前边
#include#includeint main (){ int min(int a,int b); int n; int a[100],i,m,t,s; while(scanf("%d",&t)&&t!=0) //scanf("%d",&t); //while(t--) { //int a[100]原创 2014-11-07 20:37:14 · 1167 阅读 · 0 评论 -
利用函数求阶乘
#include#includeint main (){ int min(int a,int b); int n; int a[100],i,m,t,s; while(scanf("%d",&t)&&t!=0) //scanf("%d",&t); //while(t--) { //int a[100]原创 2014-11-07 20:40:00 · 1563 阅读 · 0 评论 -
交换输出
#include#includeint main(){ int min(int a,int b); int n; while(scanf("%d",&n),n) { int a[110],s,i,m; for(int i=0;i<n;i++) scanf("%d",&a[i]); m=a[0]; for(i=0,s=0;i<n;i++) { //m=a[0];//原创 2014-11-16 21:29:48 · 1043 阅读 · 0 评论 -
多少单词
#include #include #includechar ch[1000000];int main (){ int word=0,m=0,i; char c; gets(ch); //scanf输入字符串当字符串中含有空格的时候,空格后面的部分将不会被读入;而用gets则可以 //scanf("%s",ch);原创 2014-11-12 17:13:57 · 884 阅读 · 0 评论 -
杨辉三角
#include#includeint main (){ int n,i,j,a[30][30]; while(scanf("%d",&n)==1) { a[0][0]=1;a[1][0]=1;a[1][1]=1; if(n==1) printf("1\n"); if(n==2)原创 2014-11-07 20:43:21 · 864 阅读 · 0 评论 -
HDOJ EXCEL排序 1862(sort排结构体)
EXCEL排序Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13593 Accepted Submission(s): 5331Problem DescriptionExcel可以对一组纪录按任意指定列排序原创 2014-12-20 01:24:30 · 638 阅读 · 0 评论 -
HDOJ ASCII码排序 2000
#include#includeint main(){ char a,b,c,x,y,z; while(scanf("%c%c%c",&a,&b,&c)!=EOF) { getchar(); //不能忘了此处要吸收换行符。 //char x;// x=a+b+c;// a=a<b?a:b;// a=a<c?a:c;//原创 2014-11-27 10:55:44 · 838 阅读 · 0 评论 -
HDOJ City hall 1453(模拟)
City hallTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 256 Accepted Submission(s): 160Problem DescriptionBecause of its age原创 2015-05-05 22:58:46 · 573 阅读 · 0 评论 -
素数求和
#include #include #includeint main (){ int n,m; scanf("%d",&n); while(n--) { int i,k,a[1000],z=0; scanf("%d",&m); for(i=0;i scanf("%d",&a[i]);原创 2014-11-07 20:24:09 · 920 阅读 · 0 评论 -
pow函数使用
/*#include #include #include int main (){ float p,r,n; r=0.1;n=10; p=pow(1+r,n);//pow函数用来求y^x的值,调用pow函数形式为pow(y,x) printf("%f\n",p); system ("pause"); return 0;原创 2014-11-07 20:27:22 · 6181 阅读 · 0 评论 -
18岁生日
#include#includeint main (){ int t; scanf("%d",&t); while(t--) { int a,b,c,t=0,t1,i; scanf("%d-%d-%d",&a,&b,&c); //if((a%4==0&&a%100!=0||a%400==0)&&((a+18)%4==原创 2014-11-11 12:09:15 · 846 阅读 · 0 评论 -
【模拟】HDOJ Clarke and chemistry 5625
Clarke and chemistryTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 442 Accepted Submission(s): 243Problem DescriptionClarke原创 2016-02-29 19:38:31 · 844 阅读 · 0 评论