fork download 
  1. #pragma GCC optimize("Ofast")
  2. #pragma GCC optimize("unroll-loops")
  3. #pragma GCC optimize("inline")
  4. #include<bits/stdc++.h>
  5. using namespace std;
  6. #define main dummy_main
  7. int main(){
  8.   return 0;
  9. }
  10. #undef main
  11. #define ListNode dummy_ListNode
  12. struct ListNode{
  13. }
  14. ;
  15. #undef ListNode
  16. int ListNode2arr(ListNode *node, int arr[]){
  17.   int n = 0;
  18.   while(node != NULL){
  19.     arr[n++] = node->val;
  20.     node = node->next;
  21.   }
  22.   return n;
  23. }
  24. class Solution{
  25.   public:
  26.   int pairSum(ListNode* head){
  27.     static int sz;
  28.     static int arr[1000000];
  29.     sz = ListNode2arr(head, arr);
  30.     int WKqLrJHZ;
  31.     remove_reference<decltype(arr[WKqLrJHZ] + arr[sz-1-WKqLrJHZ])>::type QAAnbtfa;
  32.     int om7Ebh6q = 0;
  33.     if((0) > ((sz/2)-1)){
  34.       QAAnbtfa = numeric_limits<remove_reference<decltype(arr[WKqLrJHZ] + arr[sz-1-WKqLrJHZ])>::type>::lowest();
  35.     }
  36.     else{
  37.       for(WKqLrJHZ = 0; WKqLrJHZ <= (sz/2)-1; WKqLrJHZ++){
  38.         if(om7Ebh6q == 0){
  39.           QAAnbtfa = arr[WKqLrJHZ] + arr[sz-1-WKqLrJHZ];
  40.           om7Ebh6q = 1;
  41.           continue;
  42.         }
  43.         const auto R5MtCiij = arr[WKqLrJHZ] + arr[sz-1-WKqLrJHZ];
  44.         if(QAAnbtfa < R5MtCiij){
  45.           QAAnbtfa = R5MtCiij;
  46.         }
  47.       }
  48.       if(om7Ebh6q==0){
  49.         QAAnbtfa = numeric_limits<remove_reference<decltype(arr[WKqLrJHZ] + arr[sz-1-WKqLrJHZ])>::type>::lowest();
  50.       }
  51.     }
  52.     return QAAnbtfa;
  53.   }
  54. }
  55. ;
  56. // cLay version 20220312-1
  57.  
  58. // --- original code ---
  59. // #define main dummy_main
  60. // {}
  61. // #undef main
  62. // 
  63. // #define ListNode dummy_ListNode
  64. // struct ListNode {};
  65. // #undef ListNode
  66. // 
  67. // int ListNode2arr(ListNode *node, int arr[]){
  68. //   int n = 0;
  69. //   while(node != NULL){
  70. //     arr[n++] = node->val;
  71. //     node = node->next;
  72. //   }
  73. //   return n;
  74. // }
  75. // 
  76. // class Solution {
  77. // public:
  78. //   int pairSum(ListNode* head) {
  79. //     static int sz, arr[1d6];
  80. //     sz = ListNode2arr(head, arr);
  81. //     return max[i,0,sz/2](arr[i] + arr[sz-1-i]);
  82. //   }
  83. // };
Compilation error #stdin compilation error #stdout 0s 0KB
comments (?)
stdin 
Standard input is empty
compilation info 
prog.cpp:16:18: error: ‘ListNode’ was not declared in this scope
 int ListNode2arr(ListNode *node, int arr[]){
                  ^~~~~~~~
prog.cpp:16:18: note: suggested alternative: ‘ListNode2arr’
 int ListNode2arr(ListNode *node, int arr[]){
                  ^~~~~~~~
                  ListNode2arr
prog.cpp:16:28: error: ‘node’ was not declared in this scope
 int ListNode2arr(ListNode *node, int arr[]){
                            ^~~~
prog.cpp:16:28: note: suggested alternative: ‘modf’
 int ListNode2arr(ListNode *node, int arr[]){
                            ^~~~
                            modf
prog.cpp:16:34: error: expected primary-expression before ‘int’
 int ListNode2arr(ListNode *node, int arr[]){
                                  ^~~
prog.cpp:16:43: error: expression list treated as compound expression in initializer [-fpermissive]
 int ListNode2arr(ListNode *node, int arr[]){
                                           ^
prog.cpp:26:15: error: ‘ListNode’ has not been declared
   int pairSum(ListNode* head){
               ^~~~~~~~
prog.cpp: In member function ‘int Solution::pairSum(int*)’:
prog.cpp:29:32: error: ‘ListNode2arr’ cannot be used as a function
     sz = ListNode2arr(head, arr);
                                ^
stdout 
Standard output is empty
https://ideone.com/WCrd7G
language:
C++ (gcc 8.3)
created:
3 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!