fork download
  1. from collections import Counter
  2.  
  3. def solve(s,t):
  4. s_count = Counter(s)
  5. t_count = Counter(t)
  6.  
  7. ans = float('inf')
  8.  
  9. for ch in t_count:
  10. if ch not in s_count:
  11. return 0
  12. ans = min(ans, s_count[ch]//t_count[ch])
  13. return ans
  14.  
  15. def main():
  16. s = input().strip()
  17. t = input().strip()
  18.  
  19. print(solve(s,t))
  20.  
  21. if __name__=="__main__":
  22. main()
Success #stdin #stdout 0.1s 14144KB
stdin
abacbc
bca
stdout
2