- 博客(7)
- 收藏
- 关注
RSS订阅原创 HDU1215(水)
#include<cstdio>#include<iostream>using namespace std;const int maxn=1e5+10;int main(){ int t; int n; scanf("%d",&t); while(t--) { scanf("%d",&n); int ans=0; for(i...
2018-08-30 22:58:25
289
原创 hdu1108(水GCD)
#include<cstdio>#include<iostream>using namespace std;int gcd(int a,int b){ return b==0?a:gcd(b,a%b);}int main(){ int n,m; while(scanf("%d%d",&n,&m)!=EOF) { int g=gcd...
2018-08-28 22:58:47
263
原创 hdu1084(水 结构体排序)
#include<cstdio>#include<iostream>#include<string.h>#include<algorithm> using namespace std;const int maxn=10010;struct node{ int num; int time; int score; int id; ...
2018-08-28 22:41:42
746
原创 HDU1236结构体排序（水）
#include<cstdio>#include<iostream>#include<algorithm>#include<string.h>using namespace std;struct node{ char num[100]; int s;}stu[1010];int score[110];int cnt;bool ...
2018-08-21 22:48:21
313
原创 HDU1597二分查找（水）
#include<cstdio>#include<iostream>#include<string.h>using namespace std;typedef long long ll;int k;ll n;ll s[100000];int result;void search(int l,int r){ int mid=(l+r)/2...
2018-08-18 22:32:27
247
原创 HDU2504(水)GCD
#include<cstdio>#include<iostream>using namespace std;int gcd(int a,int b){ return b==0?a:gcd(b,a%b);}int main(){ int c; int n; int a,b; scanf("%d",&n); while(n--) { s...
2018-08-14 22:31:11
244
原创 kuangbin N - Find a way （水bfs）
Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki. Yifenfei’s home is at the co...
2018-08-02 22:55:37
240
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人