摘要： 1. #include<bits/stdc++.h>using namespace std;bool book[10000001];int prime[100001];int t=1;void Prime(int x){ memset(book,0,sizeof(book)); for(int i= 阅读全文

摘要： #include<iostream>#include<vector>using namespace std; bool cmp(vector<int> &A,vector<int> &B){ if(A.size()!=B.size()) return A.size()>B.size(); for(i 阅读全文

摘要： 1. #include<bits/stdc++.h>using namespace std;int n,x,ans=0,sum=0,a[1001],b[1001];int main(){ memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); n=10; for( 阅读全文

摘要： #include <iostream>#include <cstring>#include <algorithm>#include <vector>#include <unordered_set>#pragma GCC optimize(2)#pragma GCC optimize(3)#defin 阅读全文

摘要： 1. #include <iostream>#include <cstring>#include <algorithm>#include <set> using namespace std; const int N = 1010; int t, n;int a[N], b[N];set<int> s 阅读全文

摘要： 1. #include <iostream>#include <vector> using namespace std; int n; void solve(){ cin >> n; vector<string> vec; for (int i = 0; i < n; i ++) { string 阅读全文

摘要： 1. #include <iostream>using namespace std; template <class T>class MyArray{public: bool check(); ~MyArray(); MyArray(int); void sort(); void display() 阅读全文

摘要： 1. #include <iostream> using namespace std; int a[501][501]; int main(){ int n, sum = 0; cin >> n; for (int i = 1; i <= n; i++) for (int j = 1; j <= n 阅读全文

摘要： 1. # include <iostream>using namespace std;int main(){ int n,a; cin >> n; for (int i = 1;i <= n;i ++){ cin >> a; if(a % 4 == 0) printf("%d %d\n",a / 4 阅读全文

摘要： 1. #include <bits/stdc++.h>using namespace std;class number{ int fz,fm; friend number operator+(number &n1,number &n2);public: number(int a=0,int b=1) 阅读全文