————算法题————
算法题
由原
见贤思齐
展开
-
HDU-1431-素数回文(暴力打表)
素数回文 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 23082 Accepted Submission(s): 5399 Problem Description xiaoou33对既是素数又是回文的数特别感兴趣。比如说1...原创 2018-08-04 10:56:05 · 226 阅读 · 0 评论 -
CodeForces - 233A Perfect Permutation
A. Perfect Permutation time limit per test: 2 seconds ...原创 2018-08-01 20:13:14 · 189 阅读 · 0 评论 -
POJ-2251-Dungeon Master(3D迷宫,BFS)
Dungeon Master Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 48111 Accepted: 18149 Description You are trapped in a 3D dungeon and need to find the quickest way out!...原创 2018-08-11 08:16:23 · 174 阅读 · 0 评论 -
POJ-2387-Til the Cows Come Home(最短路)
Til the Cows Come Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 72844 Accepted: 24344 Description Bessie is out in the field and wants to get back to the barn t...原创 2018-08-14 20:48:36 · 159 阅读 · 0 评论 -
Aizu-1378- ICPC Asia 2017-Secret of Chocolate Poles
Secret of Chocolate Poles Time Limit : 1 sec, Memory Limit : 262144 KB Problem A Secret of Chocolate Poles Wendy, the master of a chocolate shop, is thinking of displaying poles of chocolate disks ...原创 2018-08-14 21:12:48 · 508 阅读 · 0 评论 -
UVA-10929-You can say 11(秦九昭算法+同余与模算术)
原题链接 1000位大数取余; 秦九昭算法+同余与模算术; 1314 = (((1)*10+3)*10+1)*10+4 ( a + b ) % n = ( ( a % n ) + ( b % n ) ) % n ( a - b ) % n = ( ( a % n ) - ( b % n ) + n ) % n ( ( a % n ) - ( b % n ) 可能小于 n...原创 2018-08-17 20:59:33 · 293 阅读 · 0 评论 -
UVALive-7457-Discrete Logarithm Problem(取模运算)
原题链接 额,一直在理解题意在纠结看不懂,后来才恍然大悟 题意:定义一种新运算 a × b = a * b mod p ; 已知条件给定一个p 求 x 这里用到同余与模运算乘法公式:a * b % n = ( a % n ) * ( b % n ) % n ; ...原创 2018-08-18 19:19:11 · 631 阅读 · 0 评论 -
UVALive-3399-Sum of Consecutive Prime Numbers(素数筛,暴力)
原题链接 写个素数筛暴力打表一波就AC了; #include <iostream> using namespace std; const int N = 10001; int i, j, NotPrime[N]; long long sum[N]; void GetNotPrime() { for( i=2; i<=N; i++ ) if...原创 2018-08-17 20:39:48 · 218 阅读 · 0 评论