- 博客(14)
- 收藏
- 关注
RSS订阅原创 Mysql 重装问题的解决方法
2014-09-04T16:27:26.694569Z 0 [Note] Plugin 'FEDERATED' is disabled.2014-09-04T16:27:27.938451Z 0 [Note] InnoDB: Using atomics to ref count buffer pool pages2014-09-04T16:27:27.938451Z 0 [Note] In
2014-09-05 00:49:21
672
原创 Zoj1334
#include#include#includeusing namespace std;const int maxn = 50;char s1[maxn], s2[maxn];void convert(char *in, int base1, int base2, char *out){ out[0] = '\0'; int num = 0; for (int i = 0; i
2014-09-02 14:17:45
565
原创 Zoj1292
#include#include#includeusing namespace std;class BigInt{public: string s; friend istream& operator>>(istream& in, BigInt& item); friend ostream& operator<<(ostream& out, BigInt& item); BigI
2014-09-02 12:43:57
460
原创 Zoj1205
#include#include#includeusing namespace std;char my2char(int num){ if(num<10) return num+'0'; else return num-10+'a';}int my2int(char ch){ if(ch>='0' && ch<='9')
2014-09-01 23:08:31
428
原创 Zoj1201
#include#include#includeusing namespace std;const int maxn=50+5;int n;int P[maxn];int I[maxn];void P2I(){ memset(I,0,sizeof(I)); for(int i=0;i<n;i++) for(int j=i+1;j<n;j++)
2014-09-01 22:12:11
501
原创 Zoj1067
水题，就直接上代码了：#includeusing namespace std;struct Color{ int r,g,b;}c[16];int cmp(Color c1,Color c2){ return (c1.r-c2.r)*(c1.r-c2.r)+(c1.g-c2.g)*(c1.g-c2.g)+(c1.b-c2.b)*(c1.b-c2.b);}int ma
2014-09-01 21:39:17
903
原创 Zoj1004
#include#include#includeusing namespace std;string s1;string s2;string s;string action;stack stak;int pos1, cur;void push(){ stak.push(s1[pos1]); pos1++; action += "i";}void pop(){ c
2014-08-30 17:28:13
486
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人