随笔分类 - ybt
摘要:#include <iostream> #include <algorithm> #include<cstdio> using namespace std; int a[1005][1005],b[1005][1005]; int main() { int n; scanf("%d",&n); fo
阅读全文
摘要:#include <iostream> #include <algorithm> #include<queue> using namespace std; int main() { int n,i,j; int t1,t2,w,temp; int sum; priority_queue<int,ve
阅读全文
摘要:#include <iostream> #include<queue> #include<cstdio> #include<cstring> using namespace std; struct node { char s[20]; int x; friend bool operator < (n
阅读全文
摘要:#include<iostream> #include<cstdio> #include<stack> #include<string> using namespace std; stack<int>p1; stack<char>p2; int n; string s; int main() { i
阅读全文
摘要:#include<cstdio> #include<map> using namespace std; map<int,int>mymap; map<int,int>::iterator it; int main(){ int n,i,k,x; scanf("%d",&n); for(i=1;i<=
阅读全文
摘要:#include<iostream> #include<cstdio> #include<set> using namespace std; int main() { multiset<int> s; multiset<int>::iterator it; int n,t,o; s.clear();
阅读全文
摘要:#include<cstdio> #include<algorithm> #include<cstring> #include<iostream> using namespace std; struct number{ int x,y; }stu[10010]; int cmp(number x1,
阅读全文
摘要:#include<cstdio> #include<algorithm> #include<cstring> #include<iostream> using namespace std; struct number{ int x,y; }stu[50020]; int cmp(number x1,
阅读全文
摘要:#include<cstdio> #include<algorithm> #include<cstring> #include<iostream> using namespace std; int main() { int i,x,a[1010]={0},b[1010]={0}; i=0; whil
阅读全文
摘要:#include<cstdio> #include<algorithm> using namespace std; struct time{ //下面要用到结构体,所以定义结构体要在最上面 int x,y; }stu[1010]; int cmp(time x1,time x2){//排序以结尾时间
阅读全文
浙公网安备 33010602011771号