2 极光掠夺天边

尚未进行身份认证

侠影之谜

等级
TA的排名 6k+

1100 Mars Numbers (20 分)

#include<bits/stdc++.h>usingnamespacestd;#definerep(x,y,z)for(int(x)=(y);(x)<(z);i++)#definemst(x,y)memset(x,y,sizeof(x))#definelllonglongconstintmaxn=1e4+10;#definepiipa...

2019-09-08 07:24:06

1108 Finding Average

#include<bits/stdc++.h>usingnamespacestd;#definerep(x,y,z)for(int(x)=(y);(x)<(z);i++)#definemst(x,y)memset(x,y,sizeof(x))#definelllonglongconstintmaxn=1e4+10;#definepiipa...

2019-09-07 15:49:07

1112 Stucked Keyboard

#include<bits/stdc++.h>usingnamespacestd;#definerep(x,y,z)for(int(x)=(y);(x)<(z);i++)#definemst(x,y)memset(x,y,sizeof(x))#definelllonglongconstintmaxn=1e4+10;#definepiipa...

2019-09-07 15:25:55

1111 Online Map

#include<bits/stdc++.h>usingnamespacestd;#definerep(x,y,z)for(int(x)=(y);(x)<(z);i++)#definemst(x,y)memset(x,y,sizeof(x))#definelllonglongconstintmaxn=1e4+10;#definepiipa...

2019-09-07 14:14:27

1116 Come on! Let's C

#include<bits/stdc++.h>usingnamespacestd;#definerep(x,y,z)for(int(x)=(y);(x)<(z);i++)#definelllonglongconstintmaxn=1e4+10;intn,x;map<int,int>mp;intvis[maxn];intju...

2019-09-07 11:44:41

1115 Counting Nodes in a BST二叉排序树

#include<bits/stdc++.h>usingnamespacestd;#definerep(x,y,z)for(int(x)=(y);(x)<(z);i++)#definelllonglongconstintmaxn=1e4+10;intn,tot=0,x,dat[maxn],L[maxn],R[maxn];voidInsert(...

2019-09-07 11:16:36

1117 Eddington Number

#include<bits/stdc++.h>usingnamespacestd;#definerep(x,y,z)for(int(x)=(y);(x)<(z);i++)#definelllonglongconstintmaxn=1e5+10;intn,a[maxn],cnt=0;intmain(){cin>>n;...

2019-09-07 10:59:54

1114 Family Property

#include<bits/stdc++.h>usingnamespacestd;#definemst(x,y)memset(x,y,sizeof(x))#definerep(x,y,z)for(intx=(y);(x)<(z);x++)#definefifirst#definesesecond#definemk(x,y)make_pair...

2019-09-06 21:21:04

1113 Integer Set Partition

#include<bits/stdc++.h>usingnamespacestd;#definemst(x,y)memset(x,y,sizeof(x))#definerep(x,y,z)for(intx=(y);(x)<(z);x++)#definefifirst#definesesecond#definemk(x,y)make_pair...

2019-09-06 20:11:43

1110 Complete Binary Tree

#include<bits/stdc++.h>usingnamespacestd;#definemst(x,y)memset(x,y,sizeof(x))#definerep(x,y,z)for(intx=(y);(x)<(z);x++)#definefifirst#definesesecond#definemk(x,y)make_pair...

2019-09-06 19:38:17

1109 Group Photo

#include<bits/stdc++.h>usingnamespacestd;#definemst(x,y)memset(x,y,sizeof(x))#definerep(x,y,z)for(intx=(y);(x)<(z);x++)#definefifirst#definesesecond#definemk(x,y)make_pair...

2019-09-06 18:46:32

1107 Social Clusters

#include<bits/stdc++.h>usingnamespacestd;#definemst(x,y)memset(x,y,sizeof(x))#definerep(x,y,z)for(intx=(y);(x)<(z);x++)constintmaxn=1e3+10;intn,k,x;intfa[maxn],cnt[maxn];ve...

2019-09-06 16:03:33

1106 Lowest Price in Supply Chain

#include<bits/stdc++.h>usingnamespacestd;#definemst(x,y)memset(x,y,sizeof(x))#definerep(x,y,z)for(intx=(y);(x)<(z);x++)constintmaxn=1e5+10;intn,dep[maxn],ub=-1,h=maxn,cnt[maxn...

2019-09-06 15:25:05

1122 Hamiltonian Cycle

#include<bits/stdc++.h>usingnamespacestd;#definemst(x,y)memset(x,y,sizeof(x))#definerep(x,y,z)for(intx=(y);(x)<(z);x++)constintmaxn=500;intn,m,x,y,k,tmp;intvis[maxn],rou[max...

2019-09-05 21:12:02

1121 Damn Single

#include<bits/stdc++.h>usingnamespacestd;#definemst(x,y)memset(x,y,sizeof(x))#definerep(x,y,z)for(intx=(y);(x)<(z);x++)constintmaxn=1e5;inta[maxn];intn,x,y;vector<int&gt...

2019-09-05 20:53:03

1120 Friend Numbers

#include<bits/stdc++.h>usingnamespacestd;#definemst(x,y)memset(x,y,sizeof(x))#definerep(x,y,z)for(intx=(y);(x)<(z);x++)constintmaxn=10000+10;intn,x,a[maxn];set<int>st;...

2019-09-05 20:39:05

1119 Pre- and Post-order Traversals

#include<bits/stdc++.h>usingnamespacestd;#definemst(x,y)memset(x,y,sizeof(x))#definerep(x,y,z)for(intx=(y);(x)<(z);x++)constintmaxn=100+10;intn,a[maxn],b[maxn];intnxt[maxn][...

2019-09-05 20:38:06

1105 Spiral Matrix

#include<bits/stdc++.h>usingnamespacestd;#definerep(x,y,z)for(intx=(y);(x)<(z);x++)constintmaxn=1e6+10;intn,a[maxn],b[maxn];intl,r;voidsolve(intx1,inty1,intx2,inty2){...

2019-09-04 21:17:58

1104 Sum of Number Segments

#include<bits/stdc++.h>usingnamespacestd;#definerep(x,y,z)for(intx=(y);(x)<(z);x++)constintmaxn=1e5+10;intn;doublea[maxn],ans=0;intmain(){scanf("%d",&n);rep(i,0...

2019-09-04 20:21:31

1127 ZigZagging on a Tree

#include<bits/stdc++.h>usingnamespacestd;#definerep(x,y,z)for(intx=(y);(x)<(z);x++)constintmaxn=200;intn;intpost[maxn],ind[maxn];vector<int>g[maxn];vector<int>a...

2019-09-04 20:03:57

查看更多

勋章 我的勋章
  • 持之以恒
    持之以恒
    授予每个自然月内发布4篇或4篇以上原创或翻译IT博文的用户。不积跬步无以至千里,不积小流无以成江海,程序人生的精彩需要坚持不懈地积累!
  • 勤写标兵Lv4
    勤写标兵Lv4
    授予每个自然周发布9篇以上(包括9篇)原创IT博文的用户。本勋章将于次周上午根据用户上周周三的博文发布情况由系统自动颁发。