阿斌想要变强-CSDN博客

原创 hdu 1950 Bridging signals

#include<bits/stdc++.h>using namespace std;#define MAX 79164347int num[50000],dp[50000];int main(){ int t,i,n; scanf("%d",&t); while(t--){ scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&num[i])

2021-05-30 20:34:06 124 1

原创 hdu 1257 最少拦截系统

#include<bits/stdc++.h>using namespace std;int main(){ int n,k,i,j; int f; int h,a[1005]; while(~scanf("%d",&n)){ k=1; scanf("%d",&h); a[0]=h; for(i=1;i<n;i++){ f=0; sc

2021-05-30 20:20:27 63

#include<bits/stdc++.h>using namespace std;#define MAX 100050int dp[MAX][100];int main(){ int n,x,T,t; int i; while(~scanf("%d",&n)&&n!=0){ memset(dp,0,sizeof dp); T=0; for(i=1;i<=n;i++){ scanf("%d%d",&x,&t);

2021-05-24 19:06:59 64

原创 hdu 1421 搬寝室

#include<bits/stdc++.h>using namespace std;int pow1(int a,int b){ return (a-b)*(a-b);}int main(){ int dp[2000][2000]; int n,k,i,j; int a[2100]; while(scanf("%d%d",&n,&k)!=EOF){ for(i=1;i<=n;i++) scanf("%d",&a[i]); sort(

2021-05-23 20:31:42 55

原创 hdu 2084 数塔

#include<bits/stdc++.h>using namespace std;int main(){ int n,m,a,dp[1000][1000]; int i,j; scanf("%d",&m); while(m--){ scanf("%d",&n); for(i=1;i<=n;i++) for(j=1;j<=i;j++) scanf("%d",&dp[i][j]); for(i=n;i>=1;i--)

2021-05-19 19:55:13 55

原创 hdu 4165

#include<bits/stdc++.h>__int64 f[36];using namespace std;int main(){ int i,n,m=0,j; f[0]=1; f[1]=1; for(i=2;i<36;i++){ for(j=0;j<i;j++) f[i]=f[i]+f[j]*f[i-j-1]; } while(scanf("%d",&n)&&n!=0){ printf("%I64d\n",f[n]);

2021-05-17 20:55:05 50

原创 hdu 2067小兔的棋盘卡特兰数

#include<bits/stdc++.h>__int64 f[36];using namespace std;int main(){ int i,n,m=0,j; f[0]=1; f[1]=1; for(i=2;i<36;i++){ for(j=0;j<i;j++) f[i]=f[i]+f[j]*f[i-j-1]; } while(scanf("%d",&n)&&n!=-1){ m++; printf("%d %d %d\

2021-05-11 20:07:33 87

原创 hdu 2067小兔的棋盘dp思想

要到达（n，n）只能从（n，n-1）或者从（n-1，n）到达，所以dp[n][n]=dp[n-1][n]+dp[n][n-1]#include<bits/stdc++.h>__int64 dp[36][36]={};using namespace std;int main(){ int i,n,m=0,j; for(i=0;i<36;i++) dp[i][0]=1; for(i=1;i<36;i++){ for(j=1;j<=i;j++) dp[i]

2021-05-11 19:14:11 108

原创 hdu 2050折现分割平面

#include<bits/stdc++.h>using namespace std;int main(){ long long x=2; int n,m,i; scanf("%d",&n); while(n--){ x=2; scanf("%d",&m); for(i=2;i<=2*m;i++) x=x+i; x=x-2*m; printf("%lld\n",x); } return 0;}

2021-05-09 20:04:04 73

原创 hdu 2046骨牌铺方格

#include<bits/stdc++.h>using namespace std;int main(){ long long a[50]; a[1]=1; a[2]=2; int i,n,c,b; for(i=3;i<=52;i++){ a[i]=a[i-2]+a[i-1]; } scanf("%d",&n); while(n--){ scanf("%d%d",&c,&b); cout<<a[b-c]<<e

2021-05-09 20:01:29 86

原创 hdu 2044一只小蜜蜂

#include<bits/stdc++.h>using namespace std;int main(){ long long a[50]; a[1]=1; a[2]=2; int i,n,c,b; for(i=3;i<=52;i++){ a[i]=a[i-2]+a[i-1]; } scanf("%d",&n); while(n--){ scanf("%d%d",&c,&b); cout<<a[b-c]<<e

2021-05-09 20:00:45 67

原创 hdu 2041超级楼梯

#include<bits/stdc++.h>using namespace std;int main(){ int f[43]; int n,m,i; scanf("%d",&n); f[1]=0;f[2]=1;f[3]=2; for(i=4;i<=40;i++) f[i]=f[i-1]+f[i-2]; while(n--){ scanf("%d",&m); printf("%d\n",f[m]); } return 0;}

2021-05-09 20:00:03 82

原创 hdu 1879继续畅通工程

#include<bits/stdc++.h>struct shu{ int a,b,v,t;}c[10000];bool cmp(shu x,shu y){ if(x.t!=y.t) return x.t>y.t; else return x.v<y.v;}int pre[10000];int find(int x){ if(x!=pre[x]) return find(pre[x]); else return x;}join(int x,int y

2021-05-09 16:26:26 75

原创 hdu 1863畅通工程

#include<bits/stdc++.h>struct shu{ int a,b,v;}c[10000];bool cmp(shu x,shu y){ return x.v<y.v;}int pre[10000];int find(int x){ if(x!=pre[x]) return find(pre[x]); else return x;}join(int x,int y){ int fx,fy; fx=find(x);fy=find(y); i

2021-05-09 16:10:59 57

原创 hdu 1233 还是畅通工程

#include<bits/stdc++.h>struct shu{ int a,b,v;}c[10000];bool cmp(shu x,shu y){ return x.v<y.v;}int pre[10000];int find(int x){ if(x!=pre[x]) return find(pre[x]); else return x;}join(int x,int y){ int fx,fy; fx=find(x);fy=find(y); i

2021-05-09 15:42:37 54

原创 hdu 1232畅通工程

#include<bits/stdc++.h>using namespace std;int pre[1005];int find(int x) { while(pre[x] != x) x = pre[x]; return x;}void join(int x,int y){ int fx=find(x),fy=find(y); if(fx!=fy) pre[fx]=fy;}int main(){ int m,n,x,y; int i,j; whil

2021-05-05 19:29:36 45

原创 hdu 1872

#include<bits/stdc++.h>using namespace std;struct abc { char name[51]; int s;}a[400],b[400];int cmp (abc x,abc y) { return x.s>y.s;}int main() { int n,i,k1,k2; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) scanf("%s %d",a[i]

2021-04-15 20:20:03 73

原创 hdu 3183

#include<bits/stdc++.h>using namespace std;int main() { char a[1100]; int n,l,i,j,flag,sum,min,k,flag1; while(scanf("%s%d",a,&n)!=EOF) { l=strlen(a); flag=0; k=0; for(i=l-n; i>0; i--){ mi

2021-04-15 19:18:31 91

原创 hdu 2454 Degree Sequence of Graph G

#include<bits/stdc++.h>using namespace std;int compare (int a,int b) { return a>b;}int main () { int t,n,m,sum,i,j,f; int a[11000]; scanf("%d",&t); while(t--) { scanf("%d",&n); sum=0; for(i=1;i<=n;i++){ scanf("%d",&amp

2021-04-13 20:12:27 78

原创 hdu 1236排名

#include<bits/stdc++.h>using namespace std;struct shuju { char name[100]; int sum,num; int a;}s[2000];bool cmp(shuju x,shuju y) { if(x.a==y.a) return strcmp(x.name,y.name) < 0 ? 1 : 0; else return x.a>y.a;}int main () { int m,b,c

2021-04-12 20:57:47 74

原创 hdu 2037 今年暑假不AC

#include<bits/stdc++.h>using namespace std;struct shijian { int b,e;}s[1000];int compare (shijian b,shijian a) { return b.e<a.e;}int main() { int n,i,t; int sum; while(scanf("%d",&n)!=EOF&&n!=0) { for(i=0;i<n;i++) sc

2021-04-12 19:43:26 53

原创 hdu 1050 Moving Tables

#include<bits/stdc++.h>using namespace std;int main() { int b[400]; int i,j,n,m; int x,y,max; scanf("%d",&m); while(m--) { scanf("%d",&n); for(i=1;i<=400;i++) b[i]=0; while(n--) { scanf("%d %d",&x,&y); if(x&gt

2021-04-12 19:13:44 41

原创 hdu1052 Tian Ji -- The Horse Racing

#include<bits/stdc++.h>using namespace std;bool compare(int a,int b) { return a>b;}int main(){ int a[1000],b[1000]; int n,i,j,sum; while(scanf("%d",&n)!=EOF&&n!=0) { sum=0; for(i=0;i<n;i++) scanf("%d ",&a[i]);

2021-04-11 19:32:42 80

原创 hdu 1009 FatMouse‘ Trade

#include<bits/stdc++.h>using namespace std;struct mao { double a,b,c;}s[1000];int compare(mao a,mao b) { return a.c>b.c;} int main() { int m,n,i; double x,y,sum; while(scanf("%d %d",&m,&n)!=EOF) { sum=0; if(m==-1&&n=

2021-04-09 19:16:27 58

原创 hdu 1098

#include <bits/stdc++.h>using namespace std;int main (){ int k,a; while(scanf("%d",&k)!=EOF) { k=k%65; for(a=0;a<=64;a++) { if((18+a*k)%65==0){ printf("%d\n",a); break; } if(a==64) printf("no\n"); } } retur

2021-03-31 19:30:59 38

原创 hdu 1060 Leftmost Digit

#include<stdio.h>#include<math.h> int main(){ int n,T; scanf("%d",&T); double sum1,sum2; while(T--) { sum1=0;sum2=0; scanf("%d",&n); sum1=n*log10(double(n)); sum2=sum1-floor(sum1); printf("%d\n",int

2021-03-31 18:53:20 48

原创杭电oj数学基础2199

#include<stdio.h>#include<math.h>double f(double x){ return 8*pow(x,4)+7*pow(x,3)+2*x*x+3*x+6;}int main(){ double y,l,r,mid; int n; scanf("%d",&n); while(n--) { scanf("%lf",&y); r=100;l=0; mid=(r+l)/2; if(y<f(0)||

2021-03-30 20:25:07 97

原创杭电oj数学基础2899

#include<stdio.h>#include<math.h>double f(double x,double y){ return 6*pow(x,7)+8*pow(x,6)+7*pow(x,3)+5*x*x-y*x;}double ff(double x,double y){ return 42*pow(x,6)+48*pow(x,5)+21*pow(x,2)+10*x-y;}int main(){ double x,y,l,r,mid; int n

2021-03-30 19:33:58 156

原创杭电oj数学基础2035

#include<stdio.h>int main(){ int a,b,s,i; while(scanf("%d %d",&a,&b)==2) { if(a==0&&b==0) return 0; s=a; for(i=1;i<b;i++) s=(s*a)%1000; printf("%d\n",s); }

2021-03-30 18:58:53 65

原创杭电oj数学基础1021

int main(){ int a[8]={1,2,0,2,2,1,0,1}; int n; while(scanf("%d",&n)!=EOF){ n=a[n%8]; if(n==0) printf("yes\n"); else printf("no\n"); } return 0;}在这里插入代码片

2021-03-28 16:24:14 134 1

原创杭电oj数学基础1019

int gcd(int a,int b){ int t; while(a!=0){ t=b%a; b=a; a=t; } return b;}int main(){ int n,s,m,i,a; scanf("%d",&n); while(n!=0){ scanf("%d",&m); s=1; for(i=1;i<=m;i++){ scanf("%d",&a); s=s/gcd(s,a)*a; } printf("%

2021-03-28 16:03:36 92

原创杭电oj数学基础1108

int gct(int a,int b){ int t; while(a!=0){ t=b%a; b=a; a=t; } return b;}int main(){ int a,b,s; while(scanf("%d %d",&a,&b)!=-1){ printf("%d\n",a*b/gct(a,b)); } return 0;}在这里插入代码片

2021-03-28 14:14:25 122 1

原创杭电oj数学基础1001

int main(){ int x,n,s,i; while(scanf("%d",&n)!=EOF){ s=0; for(i=1;i<=n;i++) s=s+i; printf("%d\n",s); printf("\n"); } return 0;}在这里插入代码片

2021-03-28 13:52:06 69

原创杭电oj1096

#include<stdio.h>int main(){int x,n,i,s,a;scanf("%d",&n);while(n–){s=0;scanf("%d",&x);for(i=1;i<=x;i++){scanf("%d",&a);s=s+a;}if(n!=0)printf("%d\n\n",s);elseprintf("%d\n",s);}return 0;}

2021-03-22 20:49:02 211 2

qq_52877128的博客