丧心病狂工科女

摘要： A. Middle of the Contest 代码： #include <bits/stdc++.h> using namespace std; int h1, m1, h2, m2; int tim1 = 0, tim2 = 0; int main() { scanf("%d:%d", &h1 阅读全文

摘要： A. Sushi for Two 代码： #include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int N, cnt = 0; int a[maxn], vis[maxn]; int main() { sca 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=2222 Problem Description In the modern time, Search engine came into the life of everybody like Google, Baid 阅读全文

摘要： see u again 阅读全文

摘要： A. Maxim and Biology 代码： #include <bits/stdc++.h> using namespace std; int N; string s; int minn = 0x3f3f3f3f; int main() { scanf("%d", &N); cin >> s; 阅读全文

摘要： A. Restoring Three Numbers 代码： #include <bits/stdc++.h> using namespace std; int n[5]; int a, b, c; int main() { for(int i = 0; i < 4; i ++) scanf("%d 阅读全文

摘要： A. The Doors 代码： #include <bits/stdc++.h> using namespace std; const int maxn = 2e5 + 10; int N; int Zero = 0, One = 0; int a[maxn], b[maxn], suma[max 阅读全文

摘要： https://leetcode.com/problems/find-the-town-judge/ In a town, there are N people labelled from 1 to N. There is a rumor that one of these people is se 阅读全文

摘要： A. Detective Book 代码： #include <bits/stdc++.h> using namespace std; const int maxn = 1e4 + 10; int N; int a[maxn]; int maxx = 0; int main() { scanf("% 阅读全文

摘要： https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/ Given a string and a string dictionary, find the longest string in the dict 阅读全文