- 博客(35)
- 收藏
- 关注
RSS订阅原创 uva 11609 组合数学
#include #include #include const int MOD = 1000000007;typedef long long ll;using namespace std;ll N, T;ll spow(ll x, ll n ){ if ( n == 0LL ) return 1LL; if ( n == 1LL ) return x % MOD;
2016-02-29 21:58:52
391
原创 uva 11076 数论
#include #include #include typedef unsigned long long ull;const int maxn = 15;ull n, t, num[maxn], factorial[maxn];void init(){ factorial[0] = 1; for (int i = 1; i < maxn; i++) factorial[i]
2016-02-29 21:37:28
382
原创 uva 11752 对数
#include #include #include using namespace std;typedef unsigned long long ull;ull maxt = 1 << 16;int index[100] = { 4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 25, 26,
2016-02-28 22:15:47
509
原创 uva 10892 素因子分解
#include #include const int maxn = 1E5 + 10;const int INF = 0x3f3f3f3f;int visit[maxn], prime[maxn], kase, T, m, n;int getprime(){ memset(visit, 0, sizeof(visit)); int cnt = 0; for (long long
2016-02-28 21:28:44
410
原创 uva 10780 素因子分解
#include #include const int maxn = 1E5 + 10;const int INF = 0x3f3f3f3f;int visit[maxn], prime[maxn], kase, T, m, n;int getprime(){ memset(visit, 0, sizeof(visit)); int cnt = 0; for (long long
2016-02-28 20:51:09
345
原创 uva 10943 隔板法
#include #include const int maxn = 210;const int MOD = 1000000;int N, K;long long C[maxn][maxn];void init(){ memset(C, 0, sizeof(C)); for (int i = 0; i <= 200; i ++) C[i][0] = 1;
2016-02-28 18:13:03
521
原创 uva 11889 GCD
#include using namespace std;int gcd(int a, int b){ return b == 0 ? a : gcd(b, a % b);}int main(int argc, char *argv[]){ long long a, L, t, i; cin >> t; while (t--) {
2016-02-28 17:02:15
296
原创 uva 11388 最大公约数与最小公倍数的关系
#include int T, a, b;int main(int argc, char const *argv[]){ scanf("%d", &T); while (T--) { scanf("%d%d", &a, &b); if (b % a != 0) printf("-1\n"); else printf("%d %d\n", a, b); } return
2016-02-28 16:07:48
353
原创 LA 3485 自适应辛普森公式
#include #include double a;double asr(double a, double b, double eps, double A);double asr(double a, double b, double eps);double F(double x){ return sqrt(1 + 4 * a * a * x * x);}double parab
2016-02-28 15:37:00
1120
原创 LA 5009 三分
#include #include using namespace std;const int maxn = 10000 + 10;int n, a[maxn], b[maxn], c[maxn];double F(double x){ double ans = a[0] * x * x + b[0] * x + c[0]; for (int i = 1; i < n; i++)
2016-02-28 14:52:26
352
原创 uva 10341 二分搜索
#include #include #define F(x) (p*exp(-x)+q*sin(x)+r*cos(x)+s*tan(x)+t*(x)*(x)+u)const double eps = 1e-14;int main(int argc, char const *argv[]){ int p, r, q, s, t, u; while (scanf("%d%d%d%d%d%
2016-02-28 14:25:18
288
原创 uva 11542 异或方程组
#include#include#include#include#include#includeusing namespace std;const int maxn = 500 + 10;const int maxp = 100;int vis[maxn];int prime[maxp];int gen_primes(int n) { int m = (int)sq
2016-02-22 19:29:50
513
原创 uva 10828 高斯消元·dp
// UVa10828 Back to Kernighan-Ritchie// Rujia Liu#include#include#include#include#includeusing namespace std;const double eps = 1e-8;const int maxn = 100 + 10;typedef double Matrix[maxn][ma
2016-02-22 19:19:54
400
原创 uva 10870 矩阵
// UVa10870 Recurrences// Rujia Liu#include#include#includeusing namespace std;const int maxn = 20;typedef long long Matrix[maxn][maxn];typedef long long Vector[maxn];int sz, mod;void matr
2016-02-21 21:56:37
390
原创 LA 3510
#include#include#include#includeusing namespace std;string a[14] = {"id", "id-", "rot", "rot-", "sym", "sym-", "bhsym", "bhsym-", "bvsym", "bvsym-", "div", "div-", "mix", "mix-"};int main(){
2016-02-21 15:06:01
409
原创 uva 11077 排列
#include#includeconst int maxn = 30;unsigned long long f[maxn][maxn];int main() { memset(f, 0, sizeof(f)); f[1][0] = 1; for(int i = 2; i <= 21; i++) for(int j = 0; j < i; j++) { f[
2016-02-21 14:59:33
302
原创 LA 3641 置换
#include#includeint main() { char B[30]; int vis[30], cnt[30], T; scanf("%d", &T); while(T--) { scanf("%s", B); memset(vis, 0, sizeof(vis)); memset(cnt, 0, sizeof(cnt)); for(
2016-02-21 14:55:10
350
原创 uva 10294 polya定理
#includetypedef long long LL;const int maxn = 100;int gcd(int a, int b) { return b == 0 ? a : gcd(b, a%b);}int main() { int n, t; while(scanf("%d%d", &n, &t) == 2 && n) { LL pow[maxn];
2016-02-21 14:42:59
293
原创 uva 11762 dp
// UVa11762 Race To 1// Rujia Liu#include#include#includeconst int maxn = 1000000 + 10;double f[maxn];int removed[maxn], primes[maxn], vis[maxn];void gen_primes(int n) { int p = 0; memse
2016-02-21 14:36:33
324
原创 uva 11427
#include#include#includeconst int maxn = 100 + 5;int main() { int T; scanf("%d", &T); for(int kase = 1; kase <= T; kase++) { int n, a, b; double d[maxn][maxn], p; scanf("%d/%d%d"
2016-02-21 14:00:14
427
原创 uva 11722 通过面积比算概率
#include double a, b, c, d, width, height, w;int T, kase;double get_area(double w){ double ly = a + w, ry = b + w; double tx = d - w, bx = c - w; bool on_left = c <= ly && ly <= d; bool on_r
2016-02-21 11:47:29
585
原创 uva 11021 推概率公式
// UVa11021 Tribbles// Rujia Liu#include#includeconst int maxn = 1000 + 10;const int maxm = 1000 + 10;int n, k, m;double P[maxn], f[maxm];int main() { int T; scanf("%d", &T); for(int kas
2016-02-20 17:23:20
329
原创 LA 5059 NIM游戏
// LA5059 Playing With Stones// Rujia Liu#include using namespace std;long long SG(long long x){ return x%2==0 ? x/2 : SG(x/2);}int main() { int T; cin >> T; while (T--){ int n;
2016-02-20 17:14:18
364
原创 uva 11916 大步小步算法
// UVa11916 Emoogle Grid// Rujia Liu#include#include#include#include#includeusing namespace std;const int MOD = 100000007;const int maxb = 500 + 10;int n, m, k, b, r, x[maxb], y[maxb];set
2016-02-20 17:10:08
414
原创 uva 11754 中国剩余定理
// UVa11754 Code Feat// Rujia Liutypedef long long LL;// 即使a, b在int范围内，x和y有可能超出int范围void gcd(LL a, LL b, LL& d, LL& x, LL& y) { if(!b){ d = a; x = 1; y = 0; } else{ gcd(b, a%b, d, y, x); y -=
2016-02-20 17:06:55
465
原创 uva 11426
#include #include #include using namespace std; const long long maxn=4100000; long long phi[maxn*2]; long long s[maxn],f[maxn]; void phi_table(int n) { for(int i=2;i<=n;i++)phi[i
2016-02-20 16:48:31
234
转载 LA 4119
#include #include #include#include#include#include#includeusing namespace std;struct Polynomial{ vectora,p; void parse_polynomial(string str) { int len=str.size(),i=0;
2016-02-20 16:46:04
343
原创 uva 10253
#include#includelong long C(long long n, long long m) { double ans = 1; for(int i = 0; i < m; i++) ans *= n-i; for(int i = 0; i < m; i++) ans /= i+1; return (long long)(ans + 0.5);
2016-02-20 16:39:51
328
原创 LA 4123 dp
// LA4123 Glenbow Museum// Rujia Liu#include#includeconst int maxn = 1000;long long d[maxn+1][5][2], ans[maxn+1];int main() { memset(d, 0, sizeof(d)); for(int k = 0; k < 2; k++) { d[1]
2016-02-20 16:36:45
447
原创 uva 11361 dp
#include #include #include using namespace std;long long f[12][101][101]; long long pow[15],num[15]; long long a,b,p; long long dfs(int l,int k1,int k2,int e) { if(l==-1) return (
2016-02-20 16:32:24
446
原创 LA 3516 区间dp
#include #include using namespace std;const int maxn = 300 + 10;const int MOD = 1E9;typedef long long LL;char S[maxn];int d[maxn][maxn];int dp(int i, int j){ if (i == j) return 1; if (S[i]
2016-02-10 16:42:15
451
原创 uva 11806
#include #include using namespace std;const int MOD = 100007;const int MAXK = 500;int C[MAXK + 10][MAXK + 10];int main(int argc, char const *argv[]){ memset(C, 0, sizeof(C)); C[0][0] = 1; f
2016-02-10 16:21:50
381
原创 uva 11401 荣斥
#include using namespace std;long long f[1000010];int main(int argc, char const *argv[]){ f[3] = 0; for (long long x = 4; x <= 1000000; x++) f[x] = f[x - 1] + ((x - 1) * (x - 2) / 2 - (x - 1)
2016-02-09 10:51:52
341
原创 uva 11538 组合
#include #include using namespace std;int main(int argc, char const *argv[]){ unsigned long long n, m; while (cin >> n >> m) { if (!n && !m) break; if (n > m) swap(n, m); cout << n*m*(n +
2016-02-09 10:40:15
385
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人