fork download
  1. #pragma GCC optimize ("Ofast")
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4. template<class S, class T> inline S max_L(S a,T b){
  5. return a>=b?a:b;
  6. }
  7. template<class T> inline int sod_L(T n){
  8. int res = 0;
  9. while(n){
  10. res += n%10;
  11. n /= 10;
  12. }
  13. return res;
  14. }
  15. #define main dummy_main
  16. int main(){
  17. return 0;
  18. }
  19. #undef main
  20. class Solution{
  21. public:
  22. int countLargestGroup(int n){
  23. int i;
  24. int mx;
  25. int res = 0;
  26. int cnt[100] = {};
  27. for(i=(0);i<(100);i++){
  28. cnt[i] = 0;
  29. }
  30. for(i=(1);i<(n+1);i++){
  31. cnt[sod_L(i)]++;
  32. }
  33. {
  34. int cTE1_r3A;
  35. int RZTsC2BF;
  36. if(100==0){
  37. RZTsC2BF = 0;
  38. }
  39. else{
  40. RZTsC2BF = cnt[0];
  41. for(cTE1_r3A=(1);cTE1_r3A<(100);cTE1_r3A++){
  42. RZTsC2BF = max_L(RZTsC2BF, cnt[cTE1_r3A]);
  43. }
  44. }
  45. mx =RZTsC2BF;
  46. }
  47. for(i=(0);i<(100);i++){
  48. if(mx==cnt[i]){
  49. res++;
  50. }
  51. }
  52. return res;
  53. }
  54. }
  55. ;
  56. // cLay varsion 20200408-1
  57.  
  58. // --- original code ---
  59. // #define main dummy_main
  60. // {}
  61. // #undef main
  62. //
  63. // class Solution {
  64. // public:
  65. // int countLargestGroup(int n) {
  66. // int mx, res = 0, cnt[100] = {};
  67. // rep(i,100) cnt[i] = 0;
  68. // rep(i,1,n+1) cnt[sod(i)]++;
  69. // mx = max(cnt(100));
  70. // rep(i,100) if(mx==cnt[i]) res++;
  71. // return res;
  72. // }
  73. // };
  74.  
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