![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
uva
erge1998
华南师范大学计算机学院2016届学生
展开
-
UVA 11971 Polygon
#include<bits/stdc++.h>#include<stdio.h>#include<iostream>#include<cmath>#include<math.h>#include<queue>#include<set>#include<map>#in原创 2018-08-24 14:54:11 · 103 阅读 · 0 评论 -
UVA 10375 choose and divide (唯一分解定理)
#include<bits/stdc++.h>#include<iostream>#include<stdio.h>using namespace std;const int MAX_N=100000000;int prime[MAX_N];//素数表bool is_prime[MAX_N+1];int n;//返回n以内的素数的个数in...原创 2018-08-23 13:07:14 · 112 阅读 · 0 评论 -
UVA 10791
#include<bits/stdc++.h>#include<iostream>#include<stdio.h>#include<cmath>#define maxn 10000000using namespace std;int a[maxn];int b[maxn];int n;long long pow(int a,...原创 2018-08-23 13:08:41 · 167 阅读 · 0 评论 -
UVA 12716 GCD XOR
#include<bits/stdc++.h>#include<iostream>#include<stdio.h>#include<cmath>using namespace std; const int ma =30000005;int ans[30000005];void solve(){ int top=ma ...原创 2018-08-23 13:11:37 · 112 阅读 · 0 评论 -
UVA 10820 Send a Table
#include<bits/stdc++.h>#define MAX_N 50005using namespace std;//求欧拉函数值 O(n^0.5)int euler[MAX_N];int sum[MAX_N];//o(MAX_N)时间筛出欧拉函数值的表void euler_phi2(){ for(int i=0;i<MAX_N;i++)e...原创 2018-08-23 13:12:43 · 168 阅读 · 0 评论 -
UVA 1262 Password
https://vjudge.net/problem/24768/origin#include<bits/stdc++.h>#include<stdio.h>#include<iostream>#include<cmath>#include<math.h>#include<queue>#include<...原创 2018-08-23 13:15:14 · 82 阅读 · 0 评论 -
UVA 1636 Headshot
https://vjudge.net/problem/51197/origin#include<bits/stdc++.h>#include<stdio.h>#include<iostream>#include<cmath>#include<math.h>#include<queue>#include<...原创 2018-08-23 13:16:14 · 134 阅读 · 0 评论 -
UVA 10491 Cows and Cars (全概率公式)
#include<bits/stdc++.h>#include<stdio.h>#include<iostream>#include<cmath>#include<math.h>#include<queue>#include<set>#include<map>#原创 2018-08-23 13:19:01 · 130 阅读 · 0 评论 -
UVA 11181 Possibility Given
#include<bits/stdc++.h>#include<stdio.h>#include<iostream>#include<cmath>#include<math.h>#include<queue>#include<set>#include<map>#原创 2018-08-23 13:20:57 · 107 阅读 · 0 评论 -
UVA 1637 Double Patience
参考刘汝佳的代码如下:#include<bits/stdc++.h>using namespace std;map<vector<int>,double>d;char card[9][4][3];double dp(vector<int>&cnt,int c){ if(c==0)return 1; if(d....转载 2018-08-24 14:37:31 · 155 阅读 · 0 评论 -
UVA 580 Critical Mass
#include<bits/stdc++.h>#include<stdio.h>#include<iostream>#include<cmath>#include<math.h>#include<queue>#include<set>#include<map>原创 2018-08-24 14:40:49 · 155 阅读 · 0 评论 -
UVA 12034 Race
#include<bits/stdc++.h>#include<stdio.h>#include<iostream>#include<cmath>#include<math.h>#include<queue>#include<set>#include<map>#in原创 2018-08-24 14:43:35 · 82 阅读 · 0 评论 -
UVA 1638 Pole Arrangement
#include<bits/stdc++.h>#include<stdio.h>#include<iostream>#include<cmath>#include<math.h>#include<queue>#include<set>#include<map>#in原创 2018-08-24 14:45:22 · 118 阅读 · 0 评论 -
UVA 1639 Candy
#include<bits/stdc++.h>#include<stdio.h>#include<iostream>#include<cmath>#include<math.h>#include<queue>#include<set>#include<map>#in原创 2018-08-24 14:48:42 · 161 阅读 · 0 评论 -
UVA 10288 Coupons
#include<bits/stdc++.h>#include<stdio.h>#include<iostream>#include<cmath>#include<math.h>#include<queue>#include<set>#include<map>#in原创 2018-08-24 14:49:57 · 129 阅读 · 0 评论 -
UVA 10900 So do you want to be a 2^n-aire?
#include<bits/stdc++.h>#include<stdio.h>#include<iostream>#include<cmath>#include<math.h>#include<queue>#include<set>#include<map>#原创 2018-08-24 14:53:00 · 150 阅读 · 0 评论 -
UVA 11346 Possibility
#include<bits/stdc++.h>#include<stdio.h>#include<iostream>#include<cmath>#include<math.h>#include<queue>#include<set>#include<map>#in原创 2018-08-24 14:51:01 · 152 阅读 · 0 评论 -
UVA 12063 Zeros and ones 一道需要好好体会的好题
#include<bits/stdc++.h>#include<stdio.h>#include<iostream>#include<cmath>#include<math.h>#include<queue>#include<set>#include<map>原创 2018-08-28 09:41:06 · 297 阅读 · 0 评论