fork download
  1. #pragma GCC optimize ("Ofast")
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4. template<class S, class T> inline S divup_L(S a, T b){
  5. return (a+b-1)/b;
  6. }
  7. #define main dummy_main
  8. int main(){
  9. return 0;
  10. }
  11. #undef main
  12. class Solution{
  13. public:
  14. int smallestDivisor(vector<int>& nums, int threshold){
  15. int i;
  16. int j;
  17. int res;
  18. int N = nums.size();
  19. long long s;
  20. int Lj4PdHRW;
  21. int KL2GvlyY;
  22. int Q5VJL1cS;
  23. Lj4PdHRW = 1;
  24. KL2GvlyY = 1000000000;
  25. while(Lj4PdHRW < KL2GvlyY){
  26. if((Lj4PdHRW + KL2GvlyY)%2==0){
  27. Q5VJL1cS = (Lj4PdHRW + KL2GvlyY) / 2;
  28. }
  29. else{
  30. Q5VJL1cS = (Lj4PdHRW + KL2GvlyY - 1) / 2;
  31. }
  32. s = 0;
  33. for(i=(0);i<(N);i++){
  34. s +=divup_L(nums[i],Q5VJL1cS);
  35. }
  36. if(s <= threshold){
  37. KL2GvlyY = Q5VJL1cS;
  38. }
  39. else{
  40. Lj4PdHRW = Q5VJL1cS + 1;
  41. }
  42. }
  43. res =KL2GvlyY;
  44. return res;
  45. }
  46. }
  47. ;
  48. // cLay varsion 20191214-1
  49.  
  50. // --- original code ---
  51. // #define main dummy_main
  52. // {}
  53. // #undef main
  54. //
  55. // class Solution {
  56. // public:
  57. // int smallestDivisor(vector<int>& nums, int threshold) {
  58. // int i, j, res, N = nums.size();
  59. // ll s;
  60. // res = bsearch_min[int,x,1,1d9][
  61. // s = 0;
  62. // rep(i,N) s += nums[i] /+ x;
  63. // ](s <= threshold);
  64. // return res;
  65. // }
  66. // };
  67.  
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