- 博客(6)
- 收藏
- 关注
RSS订阅原创 hdu 1019 Least Common Multiple
hdu 1019 Least Common Multiple添加链接描述#include <bits/stdc++.h>using namespace std;int gcd(int x, int y){ return y ? gcd(y, x % y) : x;}int lcm(int x, int y){ return x/gcd(x,y)*y;}int main(){ int T, m, x, ans; scanf("%d", &T);
2021-05-09 20:12:17
47
原创 hdu 1050 Moving Tables（贪心）
hdu 1050 Moving Tables（贪心）添加链接描述#include <bits/stdc++.h>using namespace std;#define MXN 210int n, r[MXN<<1], c[MXN]; int main(){ int T, n, s, t; scanf("%d", &T); for(int i = 1; i <= 200; i++) r[i<<1] = i,
2021-05-09 20:02:24
58
原创 hdu 1001 Sum Problem
hdu 1001 Sum Problem添加链接描述#include <bits/stdc++.h>using namespace std;int n;int main(){ int ans; while(scanf("%d", &n) == 1){ ans = 0; for(int i = 1; i <= n; i++){ ans += i; } printf("%d\
2021-05-09 19:34:44
48
原创 hdu 1052 Tian Ji -- The Horse Racing
hdu 1052 Tian Ji – The Horse Racing添加链接描述#include <bits/stdc++.h>using namespace std;#define MXN 1010int n, t[MXN], k[MXN];int main(){ while(scanf("%d", &n)){ if(n == 0) break; for(int i = 1; i <= n; i++) scanf("%d",
2021-05-09 19:28:05
53
原创 hdu 1009 FatMouse‘ Trade（贪心)
hdu 1009 FatMouse‘ Trade（贪心)添加链接描述#include <bits/stdc++.h>using namespace std;#define MXN 1010int m, n;double ans, m2;struct sRoom{ int f, j; double jf;} r[MXN];int main(){ while(scanf("%d %d", &m, &n)){ if(m == -
2021-05-09 19:20:06
48
原创 1108 最小公倍数
hdu 1108 最小公倍数添加链接描述#include <bits/stdc++.h>using namespace std;int gcd(int x, int y){ return y ? gcd(y, x % y) : x;}int lcm(int x, int y){ return x/gcd(x,y)*y;}int main(){ int x, y; while(scanf("%d %d", &x, &y) == 2){
2021-04-11 15:24:09
56
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人