摘要:
原题链接 https://codeforces.ml/contest/1514/problem/C Now you get Baby Ehab's first words: "Given an integer n, find the longest subsequence of [1,2,…,n−1 阅读全文
摘要:
原题链接 https://codeforces.ml/contest/1514/problem/B Baby Badawy's first words were "AND 0 SUM BIG", so he decided to solve the following problem. Given 阅读全文
摘要:
原题链接 https://codeforces.ml/contest/1514/problem/A Given an array a of length n, tell us whether it has a non-empty subsequence such that the product o 阅读全文