fork download
  1. #pragma GCC optimize ("Ofast")
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4. #define main dummy_main
  5. int main(){
  6. return 0;
  7. }
  8. #undef main
  9. int sm[100000];
  10. class Solution{
  11. public:
  12. int waysToMakeFair(vector<int>& A){
  13. int i;
  14. int N = A.size();
  15. int res = 0;
  16. int tmp;
  17. int Lj4PdHRW;
  18. int KL2GvlyY;
  19. if(N==0){
  20. KL2GvlyY = 0;
  21. }
  22. else{
  23. KL2GvlyY = A[0];
  24. for(Lj4PdHRW=(1);Lj4PdHRW<(N);Lj4PdHRW++){
  25. KL2GvlyY += A[Lj4PdHRW];
  26. }
  27. }
  28. int tot = KL2GvlyY;
  29. for(i=(0);i<(N);i++){
  30. if(i>=2){
  31. sm[i] = A[i] +sm[i-2];
  32. }
  33. else{
  34. sm[i] = A[i] +0;
  35. }
  36. }
  37. for(i=(0);i<(N);i++){
  38. tmp = -sm[i];
  39. if(i){
  40. tmp += sm[i-1];
  41. }
  42. if((N-1)%2==i%2){
  43. tmp +=sm[N-1];
  44. }
  45. else{
  46. tmp +=sm[N-2];
  47. }
  48. if(2*tmp == tot-A[i]){
  49. res++;
  50. }
  51. }
  52. return res;
  53. }
  54. }
  55. ;
  56. // cLay version 20201121-1
  57.  
  58. // --- original code ---
  59. // #define main dummy_main
  60. // {}
  61. // #undef main
  62. //
  63. // int sm[1d5];
  64. // class Solution {
  65. // public:
  66. // int waysToMakeFair(vector<int>& A) {
  67. // int N = A.size(), res = 0, tmp, tot = sum(A(N));
  68. // rep(i,N) sm[i] = A[i] + if[i>=2, sm[i-2], 0];
  69. // rep(i,N){
  70. // tmp = -sm[i];
  71. // if(i) tmp += sm[i-1];
  72. // tmp += if[(N-1)%2==i%2, sm[N-1], sm[N-2]];
  73. // if(2*tmp == tot-A[i]) res++;
  74. // }
  75. // return res;
  76. // }
  77. // };
  78.  
Compilation error #stdin compilation error #stdout 0s 0KB
stdin
Standard input is empty
compilation info
/usr/bin/ld: /usr/lib/gcc/x86_64-linux-gnu/8/../../../x86_64-linux-gnu/Scrt1.o: in function `_start':
(.text+0x20): undefined reference to `main'
collect2: error: ld returned 1 exit status
stdout
Standard output is empty