hdu
关注
分享
扫一扫
文章平均质量分 65
Flynn_curry
这个作者很懒，什么都没留下…
展开
-
hdu2520 我是菜鸟，我怕谁
#include int main(){ int i,n,v=3,s,T; int a[100005]; a[0]=0; a[1]=1; a[2]=4; for(i=3;i { v+=2; a[i]=a[i-1]+v; a[i]%=10000; }原创 2015-10-16 20:32:22 · 414 阅读 · 0 评论 -
hdu5504 GT and sequence
#include #include #include #include using namespace std;int main(){ int i,T,N,flag,k1,k2; __int64 a[1170],num,ansf,ansz,ans; scanf("%d",&T); while(T--) {原创 2015-10-18 16:09:09 · 599 阅读 · 0 评论 -
hdu2101 A + B Problem Too
#include int main(){ int A,B; while(~scanf("%d%d",&A,&B)) { if((A+B)%86==0) printf("yes\n"); else printf("no\n"); }}原创 2015-10-16 20:42:44 · 354 阅读 · 0 评论 -
hdu1048 The Hardest Problem Ever
#include #include int main(){ int i,j,len; char st1[50],st2[500],st3[50]; while(gets(st1)) { if(strcmp(st1,"ENDOFINPUT")==0) break; gets(st2);原创 2015-10-02 16:40:14 · 459 阅读 · 0 评论 -
hdu1056 HangOver
#include #include int main(){ int i,j; double c,a[5000]; a[1]=(double)1/2; for(i=2;i a[i]=a[i-1]+(double)1/(i+1); while(~scanf("%lf",&c)&&c) {原创 2015-10-02 20:09:59 · 437 阅读 · 0 评论 -
hdu2103 Family planning
#include int main(){ int i,T,M,N; __int64 num,ans,j; int a[50]; scanf("%d",&T); while(T--) { num=ans=0; j=1; scanf("%d%d",&M,&N);原创 2015-10-19 22:15:29 · 438 阅读 · 0 评论 -
hdu1070 Milk
#include #include int main(){ int T,N,i,j,P[105],V[105],p,D; double kase[105]; char st[105][105]; scanf("%d",&T); while(T--) { scanf("%d",&N);原创 2015-10-04 15:43:57 · 420 阅读 · 0 评论 -
hdu1061 Rightmost Digit
#include #include int main(){ int i,j,pir=1,T,N; int a[50]; a[0]=0; for(i=1;i { for(j=0;j { pir=pir*i; pir=pir%10;原创 2015-10-03 10:17:32 · 337 阅读 · 0 评论 -
hdu2547 无剑无我
#include #include int main(){ int t; double a, b, c, d, ans; scanf("%d", &t); while(t--) { scanf("%lf%lf%lf%lf", &a, &b, &c, &d); ans = sqrt(a*a +原创 2015-11-04 22:00:31 · 443 阅读 · 0 评论 -
hdu1846 Brave Game
#include int main(){ int C, n, m; scanf("%d", &C); while(C--) { scanf("%d%d", &n, &m); if(n % (m+1) == 0) printf("second\n"); else printf("first\原创 2015-10-20 19:56:59 · 333 阅读 · 0 评论 -
hdu2188 悼念512汶川大地震遇难同胞——选拔志愿者
#include int main(){ int C, n, m; scanf("%d", &C); while(C--) { scanf("%d%d", &n, &m); if(n % (m+1) == 0) printf("Rabbit\n"); else printf("Grass\原创 2015-10-20 20:12:59 · 372 阅读 · 0 评论 -
hdu1010 Tempter of the Bone
#include #include #include #include using namespace std;int di, dj, N, M, T;char map[9][9];char dir[4][2] = {{0, 1}, {0, -1}, {-1, 0}, {1, 0}};bool escape;void DFS(int si, in原创 2015-11-05 21:22:37 · 396 阅读 · 0 评论 -
hdu2368 Alfredo's Pizza Restaurant
#include int main(){ int kase=0; double r, w, l; while(~scanf("%lf", &r) && r) { scanf("%lf%lf", &w, &l); w /= 2; l /= 2; if(w * w + l *原创 2015-10-21 14:02:01 · 619 阅读 · 0 评论 -
hdu2897 邂逅明下
#include int main(){ int n, p, q; while(~scanf("%d%d%d", &n, &p, &q)) { n = n % (p+q); if(n > 0 && n else printf("WIN\n"); } return 0;}原创 2015-10-21 13:26:11 · 481 阅读 · 0 评论 -
hdu2178 猜数字
#include int main(){ int T, i; __int64 n, ans[100]; scanf("%d", &T); ans[1] = 1; for(i = 2; i { ans[i] = ans[i-1] * 2 + 1; } while(T--) {原创 2015-11-06 22:11:30 · 421 阅读 · 0 评论 -
hdu1847 Good Luck in CET-4 Everybody!
#include int main(){ int n; while(~scanf("%d", &n)) { if(n % 3 == 0) printf("Cici\n"); else printf("Kiki\n"); } return 0;}心得:这题刚开始乍几看都没思路。要点如下:原创 2015-10-21 21:16:24 · 481 阅读 · 0 评论 -
hdu1564 Play a game
#include int main(){ int n; while(~scanf("%d", &n)&&n) { if(n % 2 == 0) printf("8600\n"); else printf("ailyanlu\n"); } return 0;}心得:刚开始看没什么思路，看了k原创 2015-10-21 15:30:14 · 444 阅读 · 0 评论 -
hdu2147 kiki's game
#include int main(){ int n, m; while(~scanf("%d%d", &n, &m) && n && m) { if((n % 2 != 0)&&(m % 2 != 0)) printf("What a pity!\n"); else printf("Wonderful!\n");原创 2015-10-21 16:02:04 · 394 阅读 · 0 评论 -
hdu1517 A Multiplication Game
#include int main(){ double n; while(~scanf("%lf", &n)) { while(n>18) n/=18; if(n >= 0 && n else printf("Ollie wins.\n"); } return 0;}心原创 2015-10-21 14:51:43 · 627 阅读 · 0 评论 -
hdu2149 Public Sale
#include int main(){ int ans, M, N; while(~scanf("%d%d", &M, &N)) { ans = M % (N + 1); if(ans == 0) printf("none\n"); else { if(原创 2015-10-21 16:23:11 · 353 阅读 · 0 评论 -
hdu1076 An Easy Task
#include #include int main(){ int T,N,i,j,Y; scanf("%d",&T); while(T--) { scanf("%d %d",&Y,&N); for(i=0;i { while(((Y%4==0 && Y%10原创 2015-10-07 21:50:06 · 381 阅读 · 0 评论 -
hdu1097 A hard puzzle
#include #include int main(){ int i,a,b,sum,num; int a2[4]={2,4,8,6},a3[4]={3,9,7,1},a4[2]={4,6},a7[4]={7,9,3,1},a8[4]={8,4,2,6},a9[2]={9,1}; while(~scanf("%d %d",&a,&b))原创 2015-10-08 21:36:51 · 332 阅读 · 0 评论 -
hdu1877 又一版 A+B
#include #include #include using namespace std;int main(){ int A, B, m; char s[1005]; while(cin >> m, m) { cin >> A >> B; memset(s, 0, sizeof(s)原创 2015-10-24 09:30:32 · 563 阅读 · 0 评论 -
hdu1219 AC Me
#include #include #include int main(){ int a[30]; char s[100005]; char let[27] = "abcdefghijklmnopqrstuvwxyz"; while(gets(s)) { memset(a, 0, sizeof(a));原创 2015-10-24 21:29:07 · 372 阅读 · 0 评论 -
hdu1407 测试你是否和LTC水平一样高
#include #include int main(){ int x, y, z, num; while(~scanf("%d", &num)) { int flag = 0; for(x = 1; x { for(y = x; y {原创 2015-10-24 22:13:11 · 490 阅读 · 0 评论 -
hdu2143 box
#include #include int main(){ int i; __int64 a,b,c,t; while(~scanf("%I64d %I64d %I64d",&a,&b,&c)) { for(i=0;i { if((a==b+c)||(a==b*c))原创 2015-10-10 09:49:27 · 507 阅读 · 0 评论 -
hdu2568 前进
#include int main(){ int C, n, B; scanf("%d", &C); while(C--) { B = 0; scanf("%d", &n); while(n != 0) { if(n % 2 == 1)原创 2015-10-25 14:46:01 · 432 阅读 · 0 评论 -
hdu5499 SDOI
#include #include int main(){ int i,j,len,T,n,m,p1,p2,k; double P1,P2; int cnt1[105],cnt2[105]; double ans[105]; char st1[105][25],st2[105][15],st3[105]; scanf(原创 2015-10-11 07:17:31 · 695 阅读 · 0 评论 -
hdu2567 寻梦
#include #include int main(){ int n, B; char s1[100], s2[100], s3[200], s4[200]; scanf("%d", &n); while(n--) { memset(s1, 0, sizeof(s1)); memset(s2原创 2015-10-25 16:30:49 · 453 阅读 · 0 评论 -
hdu1181 变形课
#include #include #include using namespace std;bool g[26][26];bool used[26];bool DFS(int i){ used[1] = true; for(int j = 0; j { if(i != j && !used[j]原创 2015-11-10 21:30:26 · 427 阅读 · 0 评论 -
hdu2131 Probability
#include #include int main(){ int i,j,num,len; double ans; char ch,st[300]; while(~scanf("%c %s",&ch,st)) { getchar(); num=0; len=strlen(s原创 2015-10-13 21:53:41 · 585 阅读 · 0 评论 -
hdu2132 An easy problem
#include #include int main(){ int n,i; long long a[100005]; a[0]=0; a[1]=1; for(i=2;i { if(i%3==0) a[i]=a[i-1]+i*i*i; else a[i]=a[i-1]+i;原创 2015-10-13 22:15:15 · 804 阅读 · 1 评论 -
hdu2200 Eddy's AC难题
#include int main(){ int i,j,n,num; __int64 a[100005]; a[1]=0; a[2]=1; num=1; for(i=3;i { num=num*2+1; a[i]=a[i-1]*2+num; } while原创 2015-10-14 21:49:27 · 547 阅读 · 0 评论 -
hdu2317 Nasty Hacks
#include int main(){ int n; __int64 r, e, c; scanf("%d", &n); while(n--) { scanf("%I64d%I64d%I64d", &r, &e, &c); if(e - c > r) printf("advertise\n");原创 2015-10-29 21:15:07 · 393 阅读 · 0 评论 -
hdu2551 竹青遍野
#include #include int main(){ int t, n; __int64 a[1010]; a[0] = 0; for(int i = 1;i a[i] = a[i-1] + i * i * i; scanf("%d", &t); while(t--) {原创 2015-10-28 19:40:55 · 518 阅读 · 0 评论 -
hdu2535 Vote
#include #include #include #include #include using namespace std;int main(){ int n, ans; int a[1000]; while(~scanf("%d", &n) && n) { ans = 0; me原创 2015-10-29 22:00:31 · 441 阅读 · 0 评论 -
hdu1718 Rank
#include #include #include #include using namespace std;int main(){ //freopen("in.txt","r",stdin); int sco[105], ans, pri, a, b, i, j, N; char st[1005][100], st0[100原创 2015-11-15 16:39:40 · 474 阅读 · 0 评论 -
hdu2148 Score
#include int main(){ int i,j,T,N,K,num1,num2; int a[1005],b[1005]; scanf("%d",&T); while(T--) { scanf("%d%d",&N,&K); for(i=0;i scanf("%d原创 2015-10-16 09:47:16 · 580 阅读 · 0 评论 -
hdu1408 盐水的故事
#include int main(){ int ans; double VUL, D; while(~scanf("%lf%lf", &VUL, &D)) { if(VUL int i = 1; int ans = 0; while(VUL > 0)原创 2015-10-30 21:51:36 · 508 阅读 · 0 评论 -
hdu5522 Numbers
#include int main(){ int n, i, j, k, num; int a[1005]; while(~scanf("%d", &n)) { num = 0; for(i = 0; i scanf("%d", &a[i]); for(i =原创 2015-11-01 09:49:41 · 462 阅读 · 0 评论