- 博客(19)
- 收藏
- 关注
RSS订阅原创 hdu2093
hdu2093#include<bits/stdc++.h>using namespace std;struct student{ char c[12]; int a,b;}s[10005];bool cmp(student x,student y){ if(x.a==y.a) { if(x.b==y.b) return strcmp(x.c,y.c)<0; return x.b<y.b;
2021-05-05 18:57:04
92
原创 hdu1872
hdu1872#include<bits/stdc++.h>int main(){ int s[310],t[310],i,j,k,n; char a[310][110],b[310][110],c[110]; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) scanf("%s%d",a[i],&s[i]); for(i=0;i<n;i++
2021-05-05 18:55:20
72
原创 hdu2454
hdu2454#include<bits/stdc++.h>using namespace std;bool cmp(int a,int b){ return a>b;}int main(){ int t,i,m,n,a[1005]; scanf("%d",&t); while(t--) { scanf("%d",&n); for(i=0;i<n;i++) scanf
2021-05-05 18:54:14
213
原创 hdu3183
hdu3183#include<bits/stdc++.h>using namespace std;int main(){ int x,y,m,n,i,j,k; char a[1005],b[1005]; while(scanf("%s%d",a,&x)!=EOF) { m=k=0; y=strlen(a)-x; while(y--) { for(i=m;i&l
2021-05-05 18:52:48
53
原创 hdu1236
hdu1236#include<bits/stdc++.h>using namespace std;struct ti{ char c[25]; int b;}s[1005];bool cmp(ti x,ti y){ if(x.b!=y.b) return x.b>y.b; else return strcmp(x.c,y.c)<0;}int main(){ int x,y,z,i,j,k,l,a[12];
2021-05-05 18:51:46
47
原创 hdu2037
hdu2037#include<bits/stdc++.h>using namespace std;struct ti{ int a,b;}s[105];bool cmp(ti x,ti y){ return x.b<y.b;}int main(){ int t,i,k,j; while(scanf("%d",&t),t) { for(i=0;i<t;i++) scanf("%d%d"
2021-05-05 18:47:03
55
原创 hdu1050
hdu1050#include<bits/stdc++.h>int main(){ int t,i,k,a[205],m,n,l; scanf("%d",&t); while(t--) { for(i=0;i<=200;i++) a[i]=0; scanf("%d",&k); while(k--) { scanf("%d%d",&am
2021-05-05 18:45:35
65
原创 hdu1052
hdu1052#include<bits/stdc++.h>using namespace std;bool cmp(int a,int b){ return a>b;}int main(){ int x,y,i,a[1005],b[1005],j,l,m,n; long long k; while(scanf("%d",&x),x) { for(i=0;i<x;i++) scanf("%d
2021-05-05 18:44:00
63
原创 hdu1009
hdu1009#include<bits/stdc++.h>using namespace std;struct food{ double a,b,c;}w[1005];bool cmp(food x,food y){ if(x.c>y.c) return true; return false;}int main(){ int x,i; double y,t; while(scanf("%lf%d",&y,&
2021-05-05 18:42:29
47
原创 hdu1098
Realtime Status``#include<bits/stdc++.h>using namespace std;int main(){ int x,y,z,i,j,k; while(scanf("%d",&x)!=EOF) { x%=65; for(i=0;i<65;i++) { for(j=1;j<65;j++) { z=j*j*j%65; y=z*j*j%65;
2021-05-05 18:39:29
40
原创 hdu1060
Leftmost Digit#include<bits/stdc++.h>using namespace std;int main(){ int i,l; long long j,k; double t; scanf("%d",&i); while(i--) { scanf("%lld",&j); t=j*log10(j); k=t; l=pow(10,t-k)
2021-03-28 10:00:46
55
1
原创 hdu2199
Can you solve this equation?#include<bits/stdc++.h>int main(){ int x; double m,n,i,j,k,y,z; scanf("%d",&x); while(x--) { m=0; n=100; j=50; scanf("%lf",&y); if(y>=6&&y&l
2021-03-28 09:59:14
147
4
原创 hdu2899
Strange fuctioninclude<bits/stdc++.h>int main(){ int x; double m,n,i,j,k,y,z; scanf("%d",&x); while(x--) { m=0; n=100; j=50; scanf("%lf",&y); while(n-m>0.000001) {
2021-03-28 09:57:44
63
1
原创 hdu2035
人见人爱A^B#include<bits/stdc++.h>int main(){ long long n,m,k,i,j,t; while(scanf("%lld%lld",&m,&n),m,n) { t=1; while(n--) t=t*m%1000; printf("%lld\n",t); } return 0;}
2021-03-28 09:56:10
104
2
原创 hud1097
A hard puzzle#include<bits/stdc++.h>int main(){ int n,m,k; while(scanf("%d%d",&m,&n)!=EOF) { m%=10; n--; if(m==1||m==5||m==6) n=1; else if(m==4||m==9) n%=2; else n
2021-03-28 09:54:26
80
1
原创 hdu1021
Fibonacci Again`#include<bits/stdc++.h>int main(){ int n; while(scanf("%d",&n)!=EOF) { n%=8; if(n==2||n==6) printf("yes\n"); else printf("no\n"); } return 0;}
2021-03-28 09:52:59
42
原创 hdu1019
Least Common Multiple`#include<bits/stdc++.h>int main(){ long long m,n,t,i,j,k; scanf("%lld",&i); while(i--) { scanf("%lld%lld",&j,&m); j--; while(j--) { scanf("%lld",&n);
2021-03-28 09:50:30
51
原创 2021-03-26
hdu1108最小公倍数添加链接描述#include<bits/stdc++.h>int main(){ int m,n,t,i; while(scanf("%d%d",&m,&n)!=EOF) { i=m*n; while(n>0) { t=m%n; m=n; n=t; } printf("%
2021-03-26 20:16:17
85
原创 hdu 1001
View Code#include<stdio.h>int main(){ long long n,m; while(scanf("%lld",&n)!=EOF) printf("%lld\n\n",n*(n+1)/2); return 0;}
2021-03-26 18:34:29
58
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人