guojiaqi007的专栏

http://ac.jobdu.com/problem.php?pid=1103#include #include #include static int a,b,c,symbol,left;void read_equalor(char line[]){ int len = (int) strlen(line); int i = 0,temp=0;

1042. Shuffling Machine (20)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueShuffling is a procedure used to randomi

https://www.patest.cn/contests/pat-a-practise/1023#include #include #define rep(i,j,k) for(int i=j;i<=k;i++)const int maxn = 100;char s[maxn];int b[maxn], c[maxn], len, x;bool flag;int main(

http://ac.jobdu.com/problem.php?pid=1550默认给最少“1”， 如果a[i] > a[i-1], 比前面多给一个。如果 a[i] 参考了http://blog.youkuaiyun.com/xiexingshishu/article/details/20319825#include #include using namespace std;#def

http://ac.jobdu.com/problem.php?pid=1006#include #include #include using namespace std;#define rep(i,j,k) for(int i=j;i<=k;i++)bool ac(string s){ //cout << s << endl; int len = s.size()

http://ac.jobdu.com/problem.php?pid=1130参考了 http://www.cnblogs.com/jasonJie/p/5740646.html#include #include #include typedef struct date{ int year,month,day; friend bool oper

https://www.patest.cn/contests/pat-a-practise/1016#include #include #include #include #include #include #define _CRT_SECURE_NO_WARNINGSusing namespace std;typedef struct item { int typ

http://ac.jobdu.com/problem.php?pid=1159#include #include typedef struct ant{ int pos,dir; bool friend operator < (struct ant a, struct ant b){ return a.pos < b.pos; }

http://ac.jobdu.com/problem.php?pid=1486参考了 1. http://blog.youkuaiyun.com/huahua520amy/article/details/98225612.http://blog.youkuaiyun.com/u011255131/article/details/53580630code 简化于 参考2#include

https://www.patest.cn/contests/pat-a-practise/1112#include #include #include #include #include using namespace std;bool map[256];int main(){ vector stuckKeysPre; set stuckKey; int k, reps

https://www.patest.cn/contests/pat-a-practise/1109#include #include#include #include #include using namespace std;typedef struct peo { string name; int height; friend bool operator < (s

https://www.patest.cn/contests/pat-a-practise/1108笨方法：#include #include #include using namespace std;bool to2Doboule(string s, double &f) { double res = 0.0; int i = 0; if (s[i] == '-') i+

https://www.patest.cn/contests/pat-a-practise/1105#include #include #include #include int dir[4][2] = { {0,1},{1,0},{0,-1},{-1,0} };int N,m, n,map[1001][1001],a[1000001];bool myGreater(i

http://ac.jobdu.com/problem.php?pid=1005参考了 http://blog.youkuaiyun.com/abcjennifer/article/details/7292011#include #include #include #include typedef struct applicant{ int ge,gi,choice

https://www.patest.cn/contests/pat-a-practise/1026根据http://blog.youkuaiyun.com/jtjy568805874/article/details/50809719 修改#include #include using namespace std;#define inthree(i,j,k) scanf("%d%d%d"