ACM
Luckeerr
这个作者很懒,什么都没留下…
展开
-
ACM (2) 括号配对
//http://acm.nyist.net/JudgeOnline/problem.php?pid=2#include#include#includeint main() { freopen("input.txt", "r", stdin); int N; scanf("%d", &N); for (int i = 0; i char s[10原创 2017-07-03 14:44:51 · 300 阅读 · 0 评论 -
ACM (4) ASCII码排序
//http://acm.nyist.net/JudgeOnline/problem.php?pid=4#include#include//bubble sortint main(){ freopen("input.txt", "r", stdin); int N; scanf("%d", &N); for (int t = 0; t < N; t++){ char s[原创 2017-07-03 15:12:54 · 495 阅读 · 0 评论 -
ACM (5) Binary String Matching
#include#include#includeint main(){ freopen("input.txt", "r", stdin); int N; scanf("%d", &N); while (N--){ char a[11]; char b[1001]; int count = 0; scanf("%s", a); scanf("%s", b);原创 2017-07-03 15:04:44 · 259 阅读 · 0 评论 -
ACM (6) 喷水装置(一)
//http://acm.nyist.net/JudgeOnline/problem.php?pid=6#include#includeint main(){ freopen("input.txt", "r", stdin); int m; scanf("%d", &m); while (m--){ int N; double r[601]; double temp;原创 2017-07-04 16:23:06 · 427 阅读 · 0 评论 -
ACM (7) 街区最短路径问题
#includetypedef struct{ int x, y;}Point;int main(){ freopen("input.txt", "r", stdin); int n; scanf("%d", &n); while (n--){ int m; int x, y; int maxx=0, maxy=0,minx=101,miny=101; int原创 2017-07-04 19:23:38 · 510 阅读 · 0 评论 -
ACM (8) 一种排序
#includetypedef struct{ int n, l, w;}D;int compare(D d1, D d2){ if (d1.n > d2.n){ return 1; } else if (d1.n == d2.n){ if (d1.l > d2.l){ return 1; } else if (d1.l == d2.l){ if (d原创 2017-07-05 14:08:47 · 400 阅读 · 0 评论