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. class Solution{
  12. public:
  13. int maximumCandies(vector<int>& A, long long K){
  14. int Nzj9Y0kE;
  15. int bkxOPzPX;
  16. int WKqLrJHZ;
  17. Nzj9Y0kE = 0;
  18. bkxOPzPX = 10000000;
  19. while(Nzj9Y0kE < bkxOPzPX){
  20. if((Nzj9Y0kE + bkxOPzPX)%2==0){
  21. WKqLrJHZ = (Nzj9Y0kE + bkxOPzPX) / 2;
  22. }
  23. else{
  24. WKqLrJHZ = (Nzj9Y0kE + bkxOPzPX + 1) / 2;
  25. }
  26. int bs24PFPc;
  27. long long R5MtCiij;
  28. int YGwFZBGH = 0;
  29. if((0) > ((A.size())-1)){
  30. R5MtCiij = 0;
  31. }
  32. else{
  33. for(bs24PFPc = 0; bs24PFPc <= (A.size())-1; bs24PFPc++){
  34. if(YGwFZBGH == 0){
  35. R5MtCiij = A[bs24PFPc]/WKqLrJHZ;
  36. YGwFZBGH = 1;
  37. continue;
  38. }
  39. R5MtCiij += A[bs24PFPc]/WKqLrJHZ;
  40. }
  41. if(YGwFZBGH==0){
  42. R5MtCiij = 0;
  43. }
  44. }
  45. if(R5MtCiij>= K){
  46. Nzj9Y0kE = WKqLrJHZ;
  47. }
  48. else{
  49. bkxOPzPX = WKqLrJHZ - 1;
  50. }
  51. }
  52. return bkxOPzPX;
  53. }
  54. }
  55. ;
  56. // cLay version 20220312-1
  57.  
  58. // --- original code ---
  59. // #define main dummy_main
  60. // {}
  61. // #undef main
  62. //
  63. // class Solution {
  64. // public:
  65. // int maximumCandies(VI& A, ll K) {
  66. // return bsearch_max[int,x,0,1d7](sum[ll][i,0,A.size()](A[i]/x) >= K);
  67. // }
  68. // };
  69.  
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