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. class Solution{
  10. public:
  11. bool closeStrings(string word1, string word2){
  12. int i;
  13. int f1[26] = {};
  14. int f2[26] = {};
  15. for(i=(0);i<(word1.size());i++){
  16. f1[word1[i]-'a']++;
  17. }
  18. for(i=(0);i<(word2.size());i++){
  19. f2[word2[i]-'a']++;
  20. }
  21. for(i=(0);i<(26);i++){
  22. if(f1[i] && !f2[i]){
  23. return false;
  24. }
  25. }
  26. for(i=(0);i<(26);i++){
  27. if(!f1[i] && f2[i]){
  28. return false;
  29. }
  30. }
  31. sort(f1,f1+26);
  32. sort(f2,f2+26);
  33. for(i=(0);i<(26);i++){
  34. if(f1[i] != f2[i]){
  35. return false;
  36. }
  37. }
  38. return true;
  39. }
  40. }
  41. ;
  42. // cLay varsion 20201115-2
  43.  
  44. // --- original code ---
  45. // #define main dummy_main
  46. // {}
  47. // #undef main
  48. //
  49. // class Solution {
  50. // public:
  51. // bool closeStrings(string word1, string word2) {
  52. // int f1[26] = {}, f2[26] = {};
  53. // rep(i,word1.size()) f1[word1[i]-'a']++;
  54. // rep(i,word2.size()) f2[word2[i]-'a']++;
  55. // rep(i,26) if(f1[i] && !f2[i]) return false;
  56. // rep(i,26) if(!f1[i] && f2[i]) return false;
  57. // sort(f1,f1+26);
  58. // sort(f2,f2+26);
  59. // rep(i,26) if(f1[i] != f2[i]) return false;
  60. // return true;
  61. // }
  62. // };
  63.  
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