2017年03月_老虞面馆

原创 1128. N Queens Puzzle (20) PAT 甲级

传送门#include<stdio.h>#include<vector>#include<math.h>#include<stdlib.h>using namespace std;int main(){ int k; vector<int> v; scanf("%d",&k); int n; while(k--){ scanf("%d

2017-03-30 16:51:48 356

原创 1068. 万绿丛中一点红(20) PAT 乙级

传送门#include<stdio.h>#include<math.h>#include<map> using namespace std;#define MAX_N 1100//typedef long long ll;int img[MAX_N][MAX_N];int m,n;int tol;map<int,int> v; bool judge(int i,int j){ if

2017-03-28 10:00:05 1848

原创 1067. 试密码(20) PAT 乙级

传送门#include<iostream>using namespace std;int main(){ string passwd,input; int n; cin>>passwd>>n; getchar(); int count=0; while(true){ getline(cin,input); if(in

2017-03-26 14:51:50 807

原创 1066. 图像过滤(15) PAT乙级

传送门#include<stdio.h>#define MAX_N 520int n,m;int a,b;int p;int num[MAX_N][MAX_N];void print(){ for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ if(num[i][j]<=b&&num[i][j]>=a){

2017-03-26 12:48:05 1070

原创 1127. ZigZagging on a Tree (30) PAT 甲级

传送门#include<stdio.h>#include<queue>#include<algorithm> #define MAX_N 32using namespace std;typedef struct Node { Node *lchild; Node *rchild; int data; int level;}node,*BTtree;int i

2017-03-15 21:04:41 996

原创玩转linux主机--node.js、npm

1.安装文件下载官网下载node.js的tar.gz包2解压tar zxvf node-v6.9.5.tar.gz3.编译安装cd node-v6.9.5 ./configure –prefix=/usr/local/node make make install4.配置环境变量vim /etc/profile#set for nodejsexport NODE_HOME=/usr/local

2017-03-14 11:16:56 1054

原创玩转linux主机--redis

redis是一款高效的key/value存储系统1.下载wget http://download.redis.io/releases/redis-3.2.8.tar.gz2.解压tar xzf redis-2.8.17.tar.gzcd redis-2.8.173.安装make进入redis4.启动 ./redis-server5.客户端测试 ./redis-cli

2017-03-11 11:43:04 494

原创 1126. Eulerian Path (25) PAT 甲级

传送门#include<stdio.h>#include<vector>#include<algorithm>using namespace std;#define MAX_V 520#define INF 1000000000int G[MAX_V][MAX_V];int set[MAX_V];int n,m;int d[MAX_V];int find(int r){ whi

2017-03-06 09:50:05 473

原创 1125. Chain the Ropes (25) PAT 甲级&&1070. 结绳(25) PAT 乙级

传送门#include<stdio.h>#include<algorithm>using namespace std;#define MAX_N 10100int main(){ int n; double a[MAX_N]; scanf("%d",&n); for(int i=0;i<n;i++){ scanf("%lf",&a[i]);

2017-03-06 09:32:33 583

原创 1124. Raffle for Weibo Followers (20) PAT 甲级&&1069. 微博转发抽奖(20) PAT乙级

传送门#include<iostream>#include<map>#include<string>#include<vector>using namespace std;map<string,int> count;vector<string> v;int m,n,s;int main(){ string name; cin>>m>>n>>s; v.push_ba

2017-03-06 09:31:19 579

原创 1014. Waiting in Line (30) PAT 甲级

传送门#include<stdio.h>#include<algorithm>#include<vector>using namespace std;#define MAX_N 110#define INF 1000000000struct Customer{ int arriveTime; int processingTime;}customer;int endTime[

2017-03-02 15:50:21 305

原创 1122. Hamiltonian Cycle (25) PAT 甲级

传送门#include<stdio.h>#include<vector>#define MAX_V 210#define INF 100000000#include<algorithm>using namespace std;int G[MAX_V][MAX_V];int n,m;int k;int len;vector<int> h;bool judge(){ if(h.s

2017-03-01 17:08:02 565 2

原创 1118. Birds in Forest (25) PAT 甲级

传送门#include<stdio.h>#include<vector>#define MAX_N 10100int set[MAX_N];//vector<int> v;int find(int r){ int x=r; while(set[r]!=r){ r=set[r]; } while(x!=set[x]){ int z=x

2017-03-01 16:04:36 358

原创 1072. Gas Station (30) PAT 甲级

传送门#include<stdio.h>#include<string.h>#include<vector>#include<algorithm>using namespace std;#define MAX_V 1100#define INF 1000000000int G[MAX_V][MAX_V];int n,m,k,ds;int d[MAX_V];bool visited[M

2017-03-01 15:17:24 569

原创 1087. All Roads Lead to Rome (30) PAT 甲级

传送门#include<stdio.h>#include<iostream>#include<vector>#include<queue>#include<string.h>#include<algorithm>#include<map>#include<string>using namespace std;#define MAX_V 220#define INF 10000000

2017-03-01 13:32:17 774

原创 1018. Public Bike Management (30) PAT 甲级

传送门#include<stdio.h>#include<algorithm>#include<string.h>#include<vector>#include<math.h>using namespace std;#define MAX_V 510#define INF 1000000000int G[MAX_V][MAX_V];int n,m,Cmax,Sp;bool visi

2017-03-01 10:42:07 622

SY_Yu的博客