Flashhusky-优快云博客

原创 HDU-2037 今年暑假不AC

添加链接描述 #include<stdio.h> int main (void) { int m,n,i,h,count,j; int a[200], b[200]; while(scanf("%d",&m)&&m){ count=1; for(i=0;i<m;i++){ scanf("%d%d", &a[i], &b[i]); } for

2021-04-17 12:35:58 83

添加链接描述 #include <algorithm> #include <stdio.h> #include <string.h> using namespace std; struct pla{ char number[22]; int sum; }people[1010]; bool cmp(pla a,pla b) { if(a.sum!=b.sum) return a.sum>b.sum; else return

2021-04-15 20:44:00 97

原创 HDU-1050 Moving Tables

添加链接描述 #include <bits/stdc++.h> using namespace std; #define MAX 210 int a[MAX]; int main() { int b; scanf("%d",&b); while(b--){ int c; int f,e,max,temp; max=0; memset(a, 0, sizeof a); scanf("%d",&c); while (c--){ scanf("%

2021-04-14 19:41:42 97

原创 HDU-1009 FatMouse‘ Trade

添加链接描述 #include <stdio.h> #include <iostream> #include <string.h> #include <algorithm> const int maxn=1005; using namespace std; struct sj{ double a,b,c; }; bool cmp(sj y,sj z) { if(y.c>z.c) return 1; else return 0;

2021-04-14 18:52:35 98

原创 HDU-2035 人见人爱A^B

#include<stdio.h> int power(int a,int b,int mod) { int ans=1;while(b) { if(b%2==1) ans=ans*a%mod; a=a*a%mod; b=b/2; } return ans; } int main() { int a,b,mod=1000; while(scanf("%d %d",&a,&b)!=EOF) { if(a==0&&b==0) .

2021-04-12 19:29:52 92

原创 HDU-1098 Ignatius‘s puzzle

添加链接描述 #include <stdio.h> int main() { int a,b,c; while (scanf("%d",&a)==1){ for (c=0;c<=64;c++){ if((18+a*c)%65==0){ printf("%d\n",c); break; } } if(c==6

2021-04-12 18:41:28 83

原创 HUD-1108 最小公倍数

添加链接描述 #include <stdio.h> int main() { int a,b,c; while (scanf("%d",&a)==1){ scanf("%d",&b); c=a; while (a%b!=0){ a=a+c; } printf("%d\n",a); } return 0; }

2021-04-08 19:44:45 83

原创 HDU-1097 A hard puzzle

添加链接描述 #include <stdio.h> int main() { int a, b, d, i; while (scanf("%d%d", &a, &b)==2) { a %= 10000; b %= 10000; d = 1; for (i = 1; i <= b; i++) { d *= a; d %= 10000;

2021-04-06 18:55:08 119

原创 HDU-1021Fibonacci Again

Fibonacci Again #include <bits/stdc++.h> using namespace std; int f[15] = {1, 2, 0, 2, 2, 1, 0, 1, 1, 2}; int main(){ int n; while(scanf("%d", &n) == 1){ printf("%s\n", n%4==2?"yes":"no"); } return 0; }

2021-03-30 19:04:13 102

原创 HDU- 1001 Sum Problem

Sum Problem #include <stdio.h> int main() { int n; while (scanf("%d",&n)!=EOF) { int sum=0; for(int i=0;i<=n;i++) { sum+=i; } printf("%d\n\n",sum); } return 0; }

2021-03-30 18:48:18 115

Flashhusky的博客