- 博客(29)
- 收藏
- 关注
RSS订阅原创 2021-06-06
Bone Collector/*一维坐标*/ #include<bits/stdc++.h>using namespace std;#define MAX 1001int main(){ int s[MAX]; int a[MAX],v[MAX]; int T,n,V; cin>>T; while(T--){ cin>>n>>V; for(int i=0; i<n; i++){ cin>>a[i]; }
2021-06-06 20:08:47
56
原创 hdu 4165
Pills#include<bits/stdc++.h> using namespace std;#define ll long longll fa[36] = {1,1};int main(){ for(int i=2; i<35; i++){ for(int j=0; j<i; j++){ fa[i] += fa[j]*fa[i-j-1]; } } int n; while(scanf("%d",&n)!=EOF){ if(n==0)
2021-05-20 19:41:18
60
原创 hdu 2045
不容易系列之(3)—— LELE的RPG难题//#include<bits/stdc++.h>//using namespace std;//#define ll long long//int main()//{// ll fa[55];// fa[1] = 3;// fa[2] = 6;// fa[3] = 6;// for(int i=4; i<=52; ++i){// fa[i] = 3*pow(2,i-1) - fa[i-1];//所有情况次数减去n与1颜色
2021-05-18 20:11:47
58
原创 hdu 2047
阿牛的EOF牛肉串.n-2 n-1 n ————X表示 EF/OX EF O ————fn1 = 2f(n-2)*1 种X X EF ————fn2 = 2f(n-2)*1 种#include<bits/stdc++.h>using namespace std;#define ll long longint main(){ ll fa[55]; int n; fa[1] = 3; fa[2] = 8; for(int i=3; i&
2021-05-17 20:55:50
48
原创 hdu 2190
悼念512汶川大地震遇难同胞——重建希望小学#include<iostream>using namespace std;#define ll long longint main(){ int n,t; ll fa[33]; fa[1] = 1;; fa[2] = 3; for(int i=3; i<=31; i++){ fa[i] = fa[i-1] + 2*fa[i-2]; } cin >> n ; while(n--){ cin >&
2021-05-17 20:04:45
46
原创 hdu 2050
折线分割平面数学推倒：#include<iostream>using namespace std; #define ll long longint main(){ int c; int n; ll fn; cin >>c; while(c--){ cin >> n; if(n==1) cout<< 2 <<endl; else if(n==2) cout << 7 <<endl; els
2021-05-17 19:53:29
44
原创 hdu 1879
继续畅通工程#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int pri[10101];struct s{ int b; int e; int num; int v; }a[10101];bool cmp(s a,s d){ if(a.v==d.v) return a.num<d.n
2021-05-13 19:21:47
44
原创 hdu 1233
还是畅通工程#include<iostream>#include<algorithm>#include<cstring>using namespace std;struct cum{ int a; int b; int w;}s[10000];int fa[10000];bool cmp(cum x,cum y){ return x.w<y.w;} int find(int x){ if(x!=fa[x]) fa[x] = find(
2021-05-11 20:27:07
44
原创 hdu 1232
畅通工程//#include<bits/stdc++.h>//using namespace std;#include<stdio.h>int n,m;int fa[1010];int find(int x){ if(fa[x]!=x) fa[x] = find(fa[x]); return fa[x];}void bing(int a,int b){ int fx=find(a); int fy=find(b); if(fx!=fy) fa[fx]=f
2021-05-10 20:04:27
36
原创 hdu 3183
A Magic Lamp#include<stdio.h>#include<string.h>char s[1001];int x[1001];int a[1001];int main(){ int i,j; int l,k,n,m; while(scanf("%s",s)!=EOF) { n=0; scanf("%d",&m); l = strlen(s); for(i=0; i<l; i++) { a[i]=s[i]-
2021-05-09 11:06:32
39
原创 hdu 1236
排名#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>using namespace std;struct stu{ char id[25]; int cnt; int sum;}s[1010];bool cmp(stu a,stu b){ if(a.sum!=b
2021-05-07 22:34:11
54
原创 hdu 2037
今年暑假不AC#include<stdio.h>int main(){ int n,t; int i,j; int start[100],end[100]; int count; while(scanf("%d",&n)!=EOF&&n!=0){ for(i=0;i<n;i++) scanf("%d %d",&start[i],&end[i]); for(i = 0;i<n-1;i++) for(j=i+1;j
2021-04-14 19:57:21
56
原创 hdu 1009
FatMouse’ Trade #include <cstdio>#include <iostream>#include <algorithm>#include <cstring>using namespace std;struct room{ int beans; int foods; double ave;}ro[100000];bool compare(room a,room b){ return a.ave>b.ave;
2021-04-13 20:27:20
48
原创 hdu 1098
Ignatius’s puzzle#include<stdio.h>int main(){ //f(x) = 5*x^13 + 13*x^5 + k*a*x; int n,i,k; //x==1时f(x) = 18+ka 能被65整除 while(scanf("%d",&k) != EOF){ //求a的值使（18+k*a）%65 == 0 for(i=1; i<=65; i++){ if((18+i*k)%65==0){ p
2021-04-07 20:24:14
37
原创 hdu1060
Leftmost Digit#include<stdio.h>#include<math.h>int xxx(double x){ double a = x*log10(x); //n^n = k <----> log10(n^n) = log10^k; return pow(10, a-floor(a));//log10(k) = A.B = log10(10^A.B);} //k = 10^A.B = 10^A * 10^0.B = N^
2021-04-07 20:04:43
40
原创 hdu 2035
奇异功能#include<stdio.h>#include<math.h>double y;double ff(double x){ return 6*pow(x,7) + 8*pow(x,6) + 7*pow(x,3) + 5*pow(x,2) - y*x;}int main(){ int t; scanf("%d",&t); while(t--){ scanf("%lf",&y); double l=0,r=100; double
2021-03-30 19:25:43
46
原创 hdu 2035
人见人爱A^B#include<stdio.h>int main(){ int a,b; while(scanf("%d %d",&a ,&b) != EOF){ if(a==0 && b==0){ break; } int i,temp=1; if(b==0){ printf("1"); }else{ for(i=1; i<=b; i++){ temp = temp * a; temp =
2021-03-29 20:21:43
42
原创 hdu 1097
A hard puzzle#include<stdio.h>int f(int a,int b){ int c=1; a=a%10; while(b!=0){ //a^33==(a^32)*a if(b%2==1){ c=c*a%10; } b=b/2; a=a*a%10; } return c;}int main(){ int a,b
2021-03-29 20:06:51
69
原创 hdu1021
斐波纳契#include<stdio.h>int f[15] = {1, 2, 0, 2, 2, 1, 0, 1};int main(){ int n; while(scanf("%d", &n) == 1 ){ if(f[n%8]==0){ printf("yes\n"); }else{ printf("no\n"); } } return 0;}
2021-03-29 19:00:44
37
原创 hdu 1108
最小公倍数#include<stdio.h>int main(){ int a,b; int t,c; int m,n; while(scanf("%d %d",&a,&b)!=EOF){ m=a; n=b; if(a<b){ t=b; b=a; a=t; } c=a%b;
2021-03-28 16:27:05
52
1
原创 hdu 1096
A+B用于投入产出做法(Viii)#include<stdio.h>int main(){ int sum; int m,n; int a,x; scanf("%d",&n); for(int i=1; i<=n; i++){ scanf("%d",&a); while (a--){ scanf("%d",&x); sum= sum + x; } if(i==n){ printf("%d\n",sum);
2021-03-28 16:08:59
35
原创 hdu 1095
A+B用于投入产出做法(Vii)#include<stdio.h>int main(){ int a,b; int sum=0; while (scanf("%d %d",&a ,&b) != EOF){ sum= a+b; printf("%d\n\n",sum); } return 0;}
2021-03-27 09:38:15
64
原创 hdu 1094
A+B用于投入产出做法(VI)#include<stdio.h>int main(){ int n,i; int a,sum=0; while(scanf("%d",&n) != EOF){ for(i=1; i<=n; i++){ scanf("%d",&a); sum = sum + a; } printf("%d\n",sum); sum=0; } return 0;}
2021-03-24 21:32:50
71
原创 2021-03-24
A+B用于投入产出做法(V)#include<stdio.h>int main(){ int a; int x; int n,i; int sum=0; scanf("%d",&n); for(i=1; i<=n; i++){ scanf("%d",&x); while(x){ scanf("%d",&a); sum = sum + a; x--; } printf("%d\n",sum); sum=0;
2021-03-24 21:06:19
26
原创 hdu 1092
A+B用于投入产出做法(IV)#include<stdio.h>int main(){ int n,x; int sum=0; while(scanf("%d",&n) != EOF && n != 0){ while( n ){ scanf("%d",&x); sum=sum+x; n--; } printf("%d\n",sum); sum=0; } return 0;}
2021-03-24 20:33:48
77
原创 hdu 1091
A+B投入产出做法(三)#include<stdio.h>int main(){ int a,b; while(scanf("%d %d",&a, &b)!=EOF){ if(a==0&&b==0){ break; } printf("%d\n",a+b); } return 0;}
2021-03-24 19:59:19
32
原创 hdu 1090
A+B投入产出做法(二)#include<stdio.h>int main(){ int a,b,n; int i=1; scanf("%d",&n); while(i<n){ for(i=1; i<=n; i++){ scanf("%d %d",&a,&b); printf("%d\n",a+b); } } return 0;}
2021-03-22 20:51:17
83
1
原创 hdu 1089
A+B投入产出做法(一)#include<stdio.h>int main(){ int a,b; while(scanf("%d %d",&a, &b)!=EOF) printf("%d\n",a+b); return 0;}
2021-03-22 20:46:34
37
原创 hdu 1001
View Code#include<stdio.h>int main(){ int n,i,sum; while(scanf("%d", &n) != EOF) { sum=0; for(i=1;i<=n;i++){ sum += i; } printf("%d\n\n", sum); } return 0;}
2021-03-22 20:40:09
33
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人