摘要：Now you get Baby Ehab's first words: "Given an integer nn, find the longest subsequence of [1,2,…,n−1][1,2,…,n−1] whose product is 11 modulo nn." Plea 阅读全文

摘要：Educational Codeforces Round 104 (Rated for Div. 2) A. Arena 签到题，直接看看多少个数比最小的数大就好了。 #include<bits/stdc++.h> #define ll long long int #define mem(a,b) 阅读全文

摘要：A. Yet Another String Game #include<bits/stdc++.h> #define mem(a,b) memset(a,b,sizeof a) #define ll long long int using namespace std; string s; int m 阅读全文

摘要：A. Space Navigation 签到题 #include<bits/stdc++.h> #include<iostream> #include<map> #include<cstdio> #include<cmath> #define mem(a,b) memset(a,b,sizeof a 阅读全文

摘要：A. Nezzar and Colorful Balls 签到题： #include<bits/stdc++.h> #define ll long long using namespace std; int a[110]; int main() { int t; cin>>t; while(t--) 阅读全文