Luckeerr的博客

//http://acm.nyist.net/JudgeOnline/problem.php?pid=2 #include #include #include int main() {  freopen("input.txt", "r", stdin);  int N;  scanf("%d", &N);  for (int i = 0; i   char s[10

//http://acm.nyist.net/JudgeOnline/problem.php?pid=4 #include #include //bubble sort int main(){ freopen("input.txt", "r", stdin); int N; scanf("%d", &N); for (int t = 0; t < N; t++){ char s[

#include #include #include int 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);

//http://acm.nyist.net/JudgeOnline/problem.php?pid=6 #include #include int main(){ freopen("input.txt", "r", stdin); int m; scanf("%d", &m); while (m--){ int N; double r[601]; double temp;

#include typedef 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

#include typedef 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