1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 | #include <iostream> #include <algorithm> #include <iterator> using namespace std; int f(int &i) { return ++i; } #define e100 r5(m20) #define m20 m5,m5,m5,m5 #define m5 r5(e1) #define e1 f(i) #define r5(e) e,e,e,e,e int main() { int i=0; int a[] = {e100}; int n = sizeof(a)/sizeof(int); cout << "count = " << n << endl; for(int i = 0 ; i < n ; i++ ) cout << a[i] << endl; return 0; } |
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8aXRlcmF0b3I+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IGYoaW50ICZpKSB7IHJldHVybiArK2k7IH0KCiNkZWZpbmUgZTEwMCAgICAgcjUobTIwKQojZGVmaW5lIG0yMCAgICAgIG01LG01LG01LG01CiNkZWZpbmUgbTUgICAgICAgcjUoZTEpCiNkZWZpbmUgZTEgICAgICAgZihpKQojZGVmaW5lIHI1KGUpICAgIGUsZSxlLGUsZQoKaW50IG1haW4oKSB7CiAgICAgICAgaW50IGk9MDsKCWludCBhW10gPSB7ZTEwMH07CiAgICAgICAgaW50IG4gID0gc2l6ZW9mKGEpL3NpemVvZihpbnQpOwogICAgICAgIGNvdXQgPDwgImNvdW50ID0gIiA8PCBuIDw8IGVuZGw7CiAgICAgICAgZm9yKGludCBpID0gMCA7IGkgPCBuIDsgaSsrICkgCiAgICAgICAgICAgIGNvdXQgPDwgYVtpXSA8PCBlbmRsOwoJcmV0dXJuIDA7Cn0=
-
upload with new input
-
result: Success time: 0s memory: 2724 kB returned value: 0
count = 100 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100


