唉，无语了，就这样就WA了
原题链接：1.A+B problem
2025-04-20 22:09:02
发布于：江苏
28阅读
0回复
0点赞
这题好难！！！
#pragma G++ optimize(-01)
#pragma G++ optimize(-02)
#pragma G++ optimize(-03)
#pragma G++ optimize("Ofast")
#pragma G++ optimize("inline")
#pragma G++ optimize("-fgcse")
#pragma G++ optimize("-fgcse-lm")
#pragma G++ optimize("-fipa-sra")
#pragma G++ optimize("-ftree-pre")
#pragma G++ optimize("-ftree-vrp")
#pragma G++ optimize("-fpeephole2")
#pragma G++ optimize("-ffast-math")
#pragma G++ optimize("-fsched-spec")
#pragma G++ optimize("unroll-loops")
#pragma G++ optimize("-falign-jumps")
#pragma G++ optimize("-falign-loops")
#pragma G++ optimize("-falign-labels")
#pragma G++ optimize("-fdevirtualize")
#pragma G++ optimize("-fcaller-saves")
#pragma G++ optimize("-fcrossjumping")
#pragma G++ optimize("-fthread-jumps")
#pragma G++ optimize("-funroll-loops")
#pragma G++ optimize("-fwhole-program")
#pragma G++ optimize("-freorder-blocks")
#pragma G++ optimize("-fschedule-insns")
#pragma G++ optimize("inline-functions")
#pragma G++ optimize("-ftree-tail-merge")
#pragma G++ optimize("-fschedule-insns2")
#pragma G++ optimize("-fstrict-aliasing")
#pragma G++ optimize("-fstrict-overflow")
#pragma G++ optimize("-falign-functions")
#pragma G++ optimize("-fcse-skip-blocks")
#pragma G++ optimize("-fcse-follow-jumps")
#pragma G++ optimize("-fsched-interblock")
#pragma G++ optimize("-fpartial-inlining")
#pragma G++ optimize("no-stack-protector")
#pragma G++ optimize("-freorder-functions")
#pragma G++ optimize("-findirect-inlining")
#pragma G++ optimize("-frerun-cse-after-loop")
#pragma G++ optimize("inline-small-functions")
#pragma G++ optimize("-finline-small-functions")
#pragma G++ optimize("-ftree-switch-conversion")
#pragma G++ optimize("-foptimize-sibling-calls")
#pragma G++ optimize("-fexpensive-optimizations")
#pragma G++ optimize("-funsafe-loop-optimizations")
#pragma G++ optimize("inline-functions-called-once")
#pragma G++ optimize("-fdelete-null-pointer-checks")
#include <bits/stdc++.h>
using namespace std;
int n, x;
struct node {
int data;
node * next;
};
int main() {
const int MAX = 2;
n = MAX;
node * head, * r, * p, * q;
head = new node;
head -> next = NULL;
r = head;
for(int i = 1; i <= n; i++) {
cin >> x;
p = new node;
p -> data = x;
p -> next = NULL;
r -> next = p;
r = p;
}
p = head;
while(p -> next != NULL) {
printf("%d", p -> next -> data + p -> next -> next -> data);
p = p -> next;
}
return 0;
}
全部评论 1
我突然发现，这样就可以了
//火车头不打了，会超2000字，需要的到上面去复制 #include <bits/stdc++.h> using namespace std; int n, x; struct node { int data; node * next; }; int main() { const int MAX = 2; n = MAX; node * head, * r, * p, * q; head = new node; head -> next = NULL; r = head; for(int i = 1; i <= n; i++) { cin >> x; p = new node; p -> data = x; p -> next = NULL; r -> next = p; r = p; } p = head; while(p -> next != NULL) { printf("%d", p -> next -> data + p -> next -> next -> data); return 0; p = p -> next; } return 0; }昨天 来自 江苏
0
有帮助，赞一个