uva
@阿奇@
做一个勤勉、有趣、善良的人
展开
-
uva10142
#include <iostream>#include <stdio.h>#include <queue>#include <cstring>#include <algorithm>using namespace std;queue<int> q[1010];struct candidate{ char name[90]; int num; int cnt;原创 2017-12-17 19:38:33 · 204 阅读 · 0 评论 -
uva10034
#include <iostream>#include <math.h>#include <algorithm>#include <stdio.h>#include <string.h>using namespace std;struct Node{ double x,y;};Node node[110];int u[110*110];int v[110*110];d原创 2017-11-13 20:49:21 · 176 阅读 · 0 评论 -
uva115
题目翻译#include <iostream>#include <string.h>#include <map>#include <stdio.h>using namespace std;int parent[350];//记录每个名号的父亲名号map<string,int> nametonum;//为每个名字编号int num;//名号string namelist[350];//把原创 2017-11-03 22:12:51 · 199 阅读 · 0 评论 -
uva122
#include <iostream>#include <stdio.h>#include <vector>#include <queue>#include <string.h>using namespace std;struct Node{ int data; bool vis; Node* ls; Node* rs; Node() {原创 2017-11-03 16:28:32 · 209 阅读 · 0 评论 -
uva544
#include <iostream>#include <stdio.h>#include <string.h>#include <string>#include <map>#include <algorithm>using namespace std;int m,n,t;int e,b;int map_ [210][210];bool vis[210];int dis[210原创 2017-11-13 15:13:26 · 171 阅读 · 0 评论 -
uva11045
#include<stdio.h>#include<cstring>#include<iostream>using namespace std;const int N=505;int line[N][N];int girl[N],used[N],nx[N];int k,m,n;bool found(int x){ for(int i=1; i<=n; i++) {原创 2017-11-17 14:15:21 · 198 阅读 · 0 评论 -
uva 536
#include <iostream>#include <string>#include <string.h>using namespace std;void solve(char *pr,char *in,int length){ if(length==0) return ; char a=*pr; int index=0; for(;index<leng原创 2017-10-13 11:32:33 · 237 阅读 · 0 评论 -
uva196
#include <iostream>#include <stdio.h>#include <string.h>#include <stdlib.h>using namespace std;int m,n;string s[1000][20000];char c[1000*1000];//c是全局变量,在内层的dfs中c已经被修改了!int map_[1000][20000];bo原创 2017-11-12 21:58:24 · 171 阅读 · 0 评论 -
uva170
#include <iostream>#include <queue>using namespace std;class card{public: char value; char color; bool face_down; int intvalue() { switch (value) { case '原创 2017-10-25 15:02:11 · 183 阅读 · 0 评论 -
uva469
#include <iostream>#include <cstdio>#include <string.h>using namespace std;int t;char map[110][110];bool vis[110][110];char tmp[110];int dir[8][2]= {1,0,0,1,0,-1,-1,0,1,1,-1,1,-1,-1,1,-1};int m原创 2017-10-24 23:41:33 · 187 阅读 · 0 评论 -
uva11988
#include <iostream>#include <list>#include <stdio.h>#include <string.h>using namespace std;char c[100010];list<char> s;int main(){ while(~scanf("%s",c)) { s.clear(); lis原创 2017-11-04 12:13:31 · 236 阅读 · 0 评论 -
uva141
#include <iostream>#include <stdio.h>#include <string.h>#include <map>using namespace std;string s,s1,s2,s3;int move_;map<string,int> m;int n;void equal_string(int t){ m[s]++; if(m[s]原创 2017-11-04 15:56:53 · 204 阅读 · 0 评论 -
uva11512
#include <iostream>#include <vector>#include <set>#include <cstdlib>#include <algorithm>#include <map>#include <string.h>#include <stdio.h>//把字符串变成4进制;二分法找到最长的长度,再在重复2次及以上的子基因中遍历找最短的,并在此过程中累加最短原创 2017-11-24 17:25:58 · 400 阅读 · 0 评论 -
uva10422
#include <iostream>#include <set>#include <stdio.h>#include <stdlib.h>#include <queue>#include <string.h>#include <string>#include <cstdio>#include <cstring>using namespace std;set<int> map_h原创 2017-12-02 14:00:27 · 191 阅读 · 0 评论 -
uva670
#include<cstdio>#include<cstring>#include<iostream>#include <math.h>using namespace std;const int N=110;int line[N][N];int rount[200][2];//数组开小了,rount[110][2]会越界,但不会停止运行,直接跑出for循环了,笑哭,找了好久int g原创 2017-11-17 09:40:52 · 195 阅读 · 0 评论 -
uva10080
#include<cstdio>#include<cstring>#include<iostream>#include<queue>#include<vector>#include<cmath>#include<algorithm>using namespace std;const int N=110;int line[N][N];int girl[N],used[N];int原创 2017-11-15 13:48:05 · 260 阅读 · 0 评论 -
uva10092
这题有多个解……#include<cstdio>#include<cstring>#include<iostream>#include<queue>#include<vector>#include<cmath>#include<algorithm>using namespace std;const int N=1100;int line[N][N];int nx[N];int原创 2017-11-15 13:47:11 · 373 阅读 · 0 评论 -
uva10048
#include <iostream>#include <math.h>#include <algorithm>#include <stdio.h>#include <string.h>using namespace std;int u[1100];int v[1100];int w[1100];int p[110];int r[1100];int n,m,q,b,end_;原创 2017-11-14 16:32:23 · 119 阅读 · 0 评论 -
uva10397
#include <iostream>#include <math.h>#include <algorithm>#include <stdio.h>#include <string.h>using namespace std;struct Node{ double x,y;};Node node[800];int u[800*800];int v[800*800];d原创 2017-11-14 16:28:54 · 176 阅读 · 0 评论 -
uva127
#include <iostream>#include <stack>#include <list>#include <vector>using namespace std;string s;struct card{ char color; char rank_;};struct pile{ stack<card> s;};list<pile> pil原创 2017-11-04 23:52:35 · 224 阅读 · 0 评论 -
uva124
#include <iostream>#include <stdio.h>#include <algorithm>#include <string.h>using namespace std;char v[21];char c[500];bool map_[26][26];int main(){ //freopen("debug\\in.txt","r",stdin);原创 2017-11-10 10:05:23 · 205 阅读 · 0 评论 -
uva439 暂时未AC代码
#include <iostream>#include <cstdio>#include <queue>#include <string.h>using namespace std;struct Node{ int x; int y; int step;};Node vs;Node vd;char ch;int m;char ch1;int m1;in原创 2017-10-10 22:50:21 · 153 阅读 · 0 评论 -
uva10608
#include <iostream>#include <stdio.h>#include <algorithm>#include <string.h>using namespace std;int par[500005];int g[500005];int cases;int n,m;int find_par(int x){ return x==par[x]?x:fin原创 2017-11-07 10:07:07 · 192 阅读 · 0 评论 -
uva117
#include <iostream>#include <string.h>using namespace std;int dis[30];int vis[30];int par[30][30];int deg[30];int ans;int start,e;void dj(){ memset(dis,0,sizeof(dis)); memset(vis,0,si原创 2017-10-28 23:49:11 · 247 阅读 · 0 评论 -
uva534
#include <iostream>#include <string.h>#include <algorithm>#include <math.h>#include <iomanip>using namespace std;double par[220][220];double dis[220];int vis[220];int n;double ans;class node原创 2017-10-28 22:33:43 · 197 阅读 · 0 评论 -
uva10099
#include <iostream>#include <string.h>#include <algorithm>using namespace std;int par[110][110];int trip_num[110];int vis[110];int n,r;int s,e,num;int x,y;int ans;void init(){ memset(pa原创 2017-10-28 17:16:47 · 199 阅读 · 0 评论 -
uva 107
#include <cstdio>//RE 错误可能是0这一特殊情况,+0.5精度调整也要注意#include <iostream>#include <math.h>using namespace std;int main(){ int h,m; while(scanf("%d%d",&h,&m) && h && m) { int n=1;原创 2017-10-11 19:05:16 · 156 阅读 · 0 评论 -
uva10000
#include<iostream>#include <string.h>using namespace std;//弗洛伊德算法可以算最大路径,dj算法就不行……BFS好像也不行?int dis[105][105];int main(){ int n; int t =0; while(cin>>n,n) { int s; in原创 2017-10-28 15:33:07 · 233 阅读 · 0 评论 -
uva10336
#include <iostream>#include <stdio.h>#include <string.h>using namespace std;int T;int t;char map[100][100];//遍历过赋值为0int ch_num[128];//因为题目要求结果从大到小输出,所以这个数组记录每个字符块的数目,同时我们还需要记录最大值,看代码就轻易理解算法过程了i原创 2017-10-20 12:14:00 · 206 阅读 · 0 评论 -
UVA144
#include <iostream>#include <cstdio>#include <queue>using namespace std;struct student{ int num; int payment;};queue <student> q;int k,n;struct Machine{ int front_money; int b原创 2017-10-10 13:15:37 · 184 阅读 · 0 评论 -
uva 11516
#include <cstdio>#include <algorithm>using namespace std;int loc[100005];int main(){ int tc; scanf("%d",&tc); while(tc--) { int s,h,i,lo,hi,mid; scanf("%d %d",&s,&h);原创 2017-10-07 12:15:27 · 436 阅读 · 0 评论 -
uva315
#include <iostream>#include <vector>#include <stdio.h>#include <string.h>using namespace std;//放在vector之前int n;//节点数int count;//dfs为dfn编号的计数器int ans;int dfn[110];//遍历的顺序,也就是遍历的编号int low[110];/原创 2017-10-21 19:48:50 · 246 阅读 · 0 评论 -
uva459
#include <iostream>#include <stdio.h>#include <algorithm>#include <string.h>using namespace std;int par[500005];int g[500005];int cases;int find_par(int x){ return x==par[x]?x:find_par(par原创 2017-11-07 11:35:37 · 213 阅读 · 0 评论 -
uva104
#include <iostream>#include <stdio.h>#include <string.h>using namespace std;int n;double dp[25][25][25];//dp[i][j][p]记录i到j且遍历的国家数为p的乘积int path[25][25][25];//path[i][j][p]记录i到j的第p个遍历的国家void print原创 2017-11-01 14:20:00 · 226 阅读 · 0 评论 -
uva10305
#include <iostream>#include <list>#include <stack>#include <string.h>#include <stdio.h>using namespace std;class G{ int v; list<int> *adj; void topological_Sort_Util(int v,bool visit原创 2017-11-08 20:28:36 · 232 阅读 · 0 评论 -
uva10926
#include <iostream>#include <string.h>#include <stdio.h>#include <algorithm>using namespace std;int n;bool map[110][110];//记录j是否是i的依赖点int ans[110];//每个点的依赖点数目,一旦赋值就不会变,因为我们是倒着求ans值的,也就是从最少的点开始……原创 2017-10-23 13:18:36 · 182 阅读 · 0 评论 -
uva10596
#include <iostream>#include <stdio.h>#include <string.h>using namespace std;int deg[230];//每个点的度,根据欧拉定理连通图的每个点度都为偶数时,可以遍历每个桥一次int n,m;int a,b;//连接的两个点bool d;bool un_link;//d代表是否有度为奇数的点,un_link代表原创 2017-10-22 19:19:57 · 282 阅读 · 0 评论 -
uva260
#include <iostream>#include <stdio.h>using namespace std;int n;int b_win_flag;int count=1;char map[230][230];int dir[6][2]= {-1,-1,-1,0,0,1,1,1,1,0,0,-1};void dfs(int x,int y){ map[x][y]=0;原创 2017-10-22 15:22:10 · 169 阅读 · 0 评论 -
uva10452
水题#include <iostream>#include <stdio.h>using namespace std;char map[10][10];int m,n,count;int p[3][2]= {0,-1,0,1,-1,0};string s="IEHOVA#";bool dfs(int x,int y){ if(map[x][y-1]==s[count])原创 2017-10-21 21:33:29 · 172 阅读 · 0 评论 -
uva793
#include <iostream>#include <stdio.h>#include <algorithm>#include <string.h>using namespace std;int par[500005];int g[500005];int find_par(int x){ return x==par[x]?x:find_par(par[x]);}voi原创 2017-11-07 13:26:46 · 242 阅读 · 0 评论