https://blog.youkuaiyun.com/Accepteezh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Acceptee/article/details/79611849https://blog.youkuaiyun.com/Acceptee/article/details/79611849AccepteeMon, 19 Mar 2018 15:02:30 +0800https://blog.youkuaiyun.com/Acceptee/article/details/79386659https://blog.youkuaiyun.com/Acceptee/article/details/79386659AccepteeTue, 27 Feb 2018 12:10:33 +0800https://blog.youkuaiyun.com/Acceptee/article/details/79178455https://blog.youkuaiyun.com/Acceptee/article/details/79178455AccepteeSat, 27 Jan 2018 09:43:17 +0800https://blog.youkuaiyun.com/Acceptee/article/details/79095128https://blog.youkuaiyun.com/Acceptee/article/details/79095128AccepteeThu, 18 Jan 2018 13:39:04 +0800https://blog.youkuaiyun.com/Acceptee/article/details/78761252https://blog.youkuaiyun.com/Acceptee/article/details/78761252AccepteeSat, 09 Dec 2017 20:03:47 +0800https://blog.youkuaiyun.com/Acceptee/article/details/78744507https://blog.youkuaiyun.com/Acceptee/article/details/78744507AccepteeThu, 07 Dec 2017 18:33:40 +0800https://blog.youkuaiyun.com/Acceptee/article/details/60755252https://blog.youkuaiyun.com/Acceptee/article/details/60755252AccepteeTue, 07 Mar 2017 10:37:49 +0800 #include #include using namespace std; struct MJ{ int No; double Ac; int Co; }Mj[10010]; bool cmp(MJ x,MJ y){ if(x.Ac>y.Ac) return true]]>https://blog.youkuaiyun.com/Acceptee/article/details/60755182https://blog.youkuaiyun.com/Acceptee/article/details/60755182AccepteeTue, 07 Mar 2017 10:35:10 +0800 #include #define N 2016 using namespace std; struct Mj { int a; int b; }stu[N]; bool cmp(Mj x,Mj y) { if(x.b!=y.b) return x.bhttps://blog.youkuaiyun.com/Acceptee/article/details/60749650https://blog.youkuaiyun.com/Acceptee/article/details/60749650AccepteeTue, 07 Mar 2017 09:47:51 +0800 int num[1000]; int main(){ int]]>https://blog.youkuaiyun.com/Acceptee/article/details/60747790https://blog.youkuaiyun.com/Acceptee/article/details/60747790AccepteeTue, 07 Mar 2017 09:35:56 +0800 #include void f(int k) { int m; double *q]]>https://blog.youkuaiyun.com/Acceptee/article/details/60746172https://blog.youkuaiyun.com/Acceptee/article/details/60746172AccepteeTue, 07 Mar 2017 09:21:07 +0800pBase = (int *)malloc(sizeof(int)*le]]>https://blog.youkuaiyun.com/Acceptee/article/details/60745077https://blog.youkuaiyun.com/Acceptee/article/details/60745077AccepteeTue, 07 Mar 2017 09:10:21 +0800https://blog.youkuaiyun.com/Acceptee/article/details/60743753https://blog.youkuaiyun.com/Acceptee/article/details/60743753AccepteeTue, 07 Mar 2017 08:58:30 +0800pNext = NULL;//一定要把尾节点的指针域]]>https://blog.youkuaiyun.com/Acceptee/article/details/60612977https://blog.youkuaiyun.com/Acceptee/article/details/60612977AccepteeMon, 06 Mar 2017 23:20:52 +0800 int main(void) { int i,n,r,x; char prt[1000],num[16]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'}; while(~scanf("%d%d",&n,&r)) { if(n<0)x=]]>https://blog.youkuaiyun.com/Acceptee/article/details/60610741https://blog.youkuaiyun.com/Acceptee/article/details/60610741AccepteeMon, 06 Mar 2017 23:15:08 +0800 using namespace std; const int maxn=120; char Val[]]>https://blog.youkuaiyun.com/Acceptee/article/details/60607630https://blog.youkuaiyun.com/Acceptee/article/details/60607630AccepteeMon, 06 Mar 2017 22:49:25 +0800https://blog.youkuaiyun.com/Acceptee/article/details/60573954https://blog.youkuaiyun.com/Acceptee/article/details/60573954AccepteeMon, 06 Mar 2017 12:03:32 +0800 int num[1000]; int main(){ int n,x,y; printf("输入排序的总个数:"); scanf("]]>https://blog.youkuaiyun.com/Acceptee/article/details/60468218https://blog.youkuaiyun.com/Acceptee/article/details/60468218AccepteeSun, 05 Mar 2017 16:02:50 +0800 #include int main() { char a[1000],b[1000],c[1001]; int i,j=1,p=0,n,n1,n2; scanf("%d",&n); while(n--) { scanf("%s %s",]]>https://blog.youkuaiyun.com/Acceptee/article/details/60468186https://blog.youkuaiyun.com/Acceptee/article/details/60468186AccepteeSun, 05 Mar 2017 16:00:20 +0800 using namespace std; const int maxn=1010; int Value[maxn]; int Space[maxn]; int Dp[maxn]; int main(){ int T,n,m; cin>>T; while(T--){ cin>]]>https://blog.youkuaiyun.com/Acceptee/article/details/60468157https://blog.youkuaiyun.com/Acceptee/article/details/60468157AccepteeSun, 05 Mar 2017 15:58:35 +0800 int main(){ char s[100]; char a[15];]]>