自己挂了场比赛here 密码123456
例题10-1 巨大的斐波那契数! UVA11582
注意:1、找循环节;2、64位要开unsigned long long
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
#define ull unsigned long long
using namespace std;
ull f[1010][100010], MOD[1010];
ull quickpoww(ull base, ull n, int Mod){
ull ans = 1;
while(n){
if(n & 1) ans = (ans * base) % Mod;
base = (base * base) % Mod;
n >>= 1;
}
return ans;
}
void Init(){
for(int n = 2; n <= 1000; n++){
int x = 2;
f[n][0] = 0, f[n][1] = 1;
while(1){
f[n][x] = (f[n][x - 1] + f[n][x - 2]) % n;
if(f[n][x] == 1 && f[n][x - 1] == 0){
MOD[n] = x - 1;// 循环节为 x-1 !!
break;
}
x++;
}
}
}
int main(){
Init();
int T;
scanf("%d", &T);
while(T--){
ull a, b, n;
scanf("%llu%llu%llu", &a, &b, &n);
if(n == 1) printf("0\n");
else printf("%llu\n", f[n][quickpoww(a % MOD[n], b, MOD[n])]);
}
return 0;
}
例题10-2 不爽的裁判 UVA12169
拓展欧几里德算法:
设a,b,c为任意整数,g = gcd(a,b),方程ax+by=g的一组解是(x0,y0),则当c是g的倍数时,ax+by=c的一组解是(x0*c/g,y0*c/g);当c不是g的倍数时无整数解。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<iostream>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
static const int Mod = 10001;
ll x[110];
vector<ll> ans;
void exgcd(ll a, ll b, ll& d, ll& x, ll& y){
if(!b){ d = a; x = 1; y = 0;}
else { exgcd(b, a % b, d, y, x); y -= x * (a / b);}
}
int main(){
int T;
scanf("%d", &T);
for (int i = 1; i <= T; i++) scanf("%lld", &x[i]);
for (ll a = 0; a <= 10000; a++){
bool flag = true;
ans.clear();
ll t = x[2] - a * a * x[1], b, d, k;
exgcd(a + 1, Mod, d, b, k);
if(t % d) continue;
b = b * t / d;
b = (b % Mod + Mod) % Mod;
for (int i = 1; i <= T; i++){
ll h = (a * x[i] + b) % Mod;
ans.push_back(h);
if(i < T && (a * h + b) % Mod != x[i + 1]){
flag = false; break;
}
}
if(flag){
for (int i = 0; i < T; i++) printf("%lld\n", ans[i]);
break;
}
}
return 0;
}
例题10-3 选择与除法 UVA10375
唯一分解定理:将X写成若干素数相乘的形式,通过指数的加减来避免高精度乘除。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<iostream>
#define ll long long
#define INF 0x3f3f3f3f
#define MAXN 10000
using namespace std;
bool is_prime[MAXN + 5];
vector <int> prime;
int e[MAXN + 5];
void Init(){
memset(is_prime, true, sizeof(is_prime));
for(int i = 2; i <= MAXN; i++){
if(is_prime[i]) prime.push_back(i);
for(int j = 0; j < prime.size() && i * prime[j] <= MAXN; j++){
is_prime[i * prime[j]] = false;
if(i % prime[j] == 0) break;
}
}
}
void add_factorial(int n, int a){
for(int k = 1; k <= n; k++){
int p = k;
for(int i = 0; i < prime.size() && p > 1; i++){
while(p % prime[i] == 0){
p /= prime[i];
e[i] += a;
}
}
}
}
int main(){
int p, q, r, s;
Init();
while(cin >> p >> q >> r >> s){
memset(e, 0, sizeof(e));
add_factorial(p, 1);
add_factorial((p - q), -1);
add_factorial(q, -1);
add_factorial(r, -1);
add_factorial((r - s), 1);
add_factorial(s, 1);
double ans = 1;
for(int i = 0; i < prime.size(); i++) ans *= pow(prime[i], e[i]);
printf("%.5lf\n", ans);
}
return 0;
}
例题10-4 最小公倍数的最小和 UVA10791
唯一分解定理。由于题目要求至少两个正整数,则需要仔细考虑特殊情况。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<queue>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
int main(){
ll n, kase = 0;
while(scanf("%lld", &n) && n != 0){
ll sum = 0, q = sqrt(n + 1), cnt = 0;//cnt用来确认至少有两个正整数
for(int i = 2; i <= q && n > 1; i++){
ll t = 1; bool flag = false;
while(n % i == 0){
n /= i;
t *= i;
if(!flag) cnt++; flag = true;
}
if(t > 1) sum += t;
}
if(n != 1 || cnt == 0) {
cnt ++;
sum += n;
}
if(cnt == 1) sum ++;
printf("Case %lld: %lld\n", ++kase, sum);
}
}
例题10-5 GCD等于XOR UVA12716
观察可得c=a-b。再筛一筛就ojbk。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<queue>
#define ll long long
#define INF 0x3f3f3f3f
#define MAXN 30000000
using namespace std;
ll ans[MAXN];
void Init(){
int a, b, c;
for(c = 1; c <= MAXN / 2; c++){
for(int k = 2; k * c <= MAXN; k++){
a = k * c, b = a - c;
if((a ^ b) == c) ans[a]++;
}
}
for(int i = 2; i <= MAXN; i++) ans[i] += ans[i - 1];
}
int main(){
Init();
int T, n, Case = 0;
scanf("%d", &T);
while(T--){
scanf("%d", &n);
printf("Case %d: %lld\n", ++Case, ans[n]);
}
return 0;
}
例题10-6 无关的元素 UVA1635
唯一分解定理
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<queue>
#define ll long long
#define INF 0x3f3f3f3f
#define MAXM 32000
using namespace std;
bool is_prime[100000];
int n, m;
vector <int > prime, ans, factor, e;
void Init(){
memset(is_prime, true, sizeof(is_prime));
for(int i = 2; i <= MAXM; i++){
if(is_prime[i]) prime.push_back(i);
for(int j = 0; j < prime.size() && i * prime[j] <= MAXM; j++){
is_prime[i * prime[j]] = false;
if(i % prime[j] == 0) break;
}
}
}
void Init2(){
ans.clear();
factor.clear();
e.clear();
for(int i = 0; i < prime.size() && m > 1; i++){
if(m % prime[i] == 0){
factor.push_back(prime[i]);
int cnt = 0;
while(m % prime[i] == 0){m /= prime[i]; cnt--;}
e.push_back(cnt);
}
}
if(m != 1){factor.push_back(m), e.push_back(-1);}
}
bool add_factor(int x, int y){
bool flag = true;
for(int i = 0; i < factor.size(); i++){
while(x % factor[i] == 0){ x /= factor[i]; e[i]++;}
while(y % factor[i] == 0){ y /= factor[i]; e[i]--;}
if(e[i] < 0) flag = false;
}
return flag;
}
int main(){
Init();
while(scanf("%d%d", &n, &m) != EOF){
Init2();
for(int i = 1; i < n; i++)
if(add_factor(n - i, i)) ans.push_back(i + 1);
printf("%d\n", ans.size());
for(int i = 0; i < ans.size(); i++){
if(i) printf(" ");
printf("%d", ans[i]);
}
printf("\n");
}
return 0;
}
例题10-7 交表 UVA10820
欧拉函数(根据容斥定理推导)
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<queue>
#define ll long long
#define INF 0x3f3f3f3f
#define MAXN 50000
using namespace std;
int phi[MAXN + 5], sum[MAXN + 5], ans[MAXN + 5];
void phi_table(){
for(int i = 2; i <= MAXN; i++) phi[i] = 0;
phi[1] = 1;
for(int i = 2; i <= MAXN; i++)
if(!phi[i]){
for(int j = i; j <= MAXN; j += i){
if(!phi[j]) phi[j] = j;
phi[j] = phi[j] / i * (i-1);
}
}
}
void Init(){
phi_table();
for(int i = 1; i <= MAXN; i++){
sum[i] = sum[i-1] + phi[i];
ans[i] = 2 * sum[i] - 1;
}
}
int main(){
Init();
int n;
while(scanf("%d", &n) && n != 0) printf("%d\n", ans[n]);
return 0;
}
例题10-8 密码 UVA1262
解码问题
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<queue>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
char s1[10][10], s2[10][10];
int vis[30];
vector<int> code[10];
int ans[10];
int main(){
int T, n;
scanf("%d", &T);
while(T--){
bool flag = true;
scanf("%d", &n); n--;
for(int i = 0; i < 6; i++)scanf("%s", s1[i]);
for(int i = 0; i < 6; i++) scanf("%s", s2[i]);
for(int i = 0; i < 5; i++){
code[i].clear();
for(int j = 0; j < 26; j++) vis[j] = 0;
for(int j = 0; j < 6; j++){
vis[s1[j][i] - 'A'] = 1;
}
for(int j = 0; j < 6; j++){
if(vis[s2[j][i] - 'A']){
code[i].push_back(s2[j][i] - 'A');
vis[s2[j][i] - 'A'] = 0;
}
}
if(code[i].empty()){
printf("NO\n");
flag = false;
}
if(!flag) break;
sort(code[i].begin(), code[i].end());
}
if(!flag) continue;
for(int i = 4; i >= 0; i--){
ans[i] = n % code[i].size();
n /= code[i].size();
}
if(n) printf("NO");
else for(int i = 0; i < 5; i++) printf("%c", code[i][ans[i]] + 'A');
printf("\n");
}
return 0;
}
例题10-9 决斗 UVA1636
简单概率问题
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<queue>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
char s[110];
int main(){
double sho, rot;
while(scanf("%s", s) != EOF){
int len = strlen(s), cnt0 = 0, cnt_live = 0;
for(int i = 0; i < len; i++){
cnt0 += (s[i] == '0');
cnt_live += (s[i] == '0' && s[(i + 1) % len] == '0');
}
rot = 1.0 * cnt0 / len;
sho = 1.0 * cnt_live / cnt0;
if(rot > sho) printf("ROTATE\n");
else if(rot == sho) printf("EQUAL\n");
else printf("SHOOT\n");
}
return 0;
}
例题10-10 奶牛和轿车 UVA10491
稍难一点的概率问题
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<queue>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
int main(){
int a, b, c;
while(cin >> a >> b >> c) printf("%.5lf\n", 1.0 * b * (a + b - 1) / (a + b) / (a + b - c - 1));
return 0;
}
例题10-11 条件概率 UVA11181
再难一点点的概率问题
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<queue>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
int vis[30], n;
double p[30], sum[30];
double dfs(int s, int r){
if(r == 0){
double t = 1.0;
for(int i = 1; i <= n; i++) t = (vis[i]) ? t * p[i] : t * (1 - p[i]);
for(int i = 1; i <= n; i++) if(vis[i] == 1) sum[i] += t;
return t;
}
double ans = 0;
for(int i = s; i <= n - r + 1; i++){
if(!vis[i]){
vis[i] = 1;
ans += dfs(i + 1, r - 1);
vis[i] = 0;
}
}
return ans;
}
int main(){
int r, Case = 0;
while(scanf("%d%d", &n, &r) && n != 0){
memset(vis, 0, sizeof(vis));
memset(sum, 0, sizeof(sum));
for(int i = 1; i <= n; i++) scanf("%lf", &p[i]);
double Sum = dfs(1, r);
printf("Case %d:\n", ++Case);
for(int i = 1; i <= n; i++){
printf("%.6lf\n", sum[i] / Sum);
}
}
return 0;
}
例题10-12 纸牌游戏 UVA1637
概率dp
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<queue>
#include<map>
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;
int p[15][10], top[15], vis[2000000];
double dp[2000000];
map <char, int> Map;
char s[10];
void Init(){
Map['6'] = 1;
Map['7'] = 2;
Map['8'] = 3;
Map['9'] = 4;
Map['T'] = 5;
Map['J'] = 6;
Map['Q'] = 7;
Map['K'] = 8;
Map['A'] = 9;
}
double dfs(int id, int card){
if(!card) return 1;
if(vis[id]) return dp[id];
int res = 0; double t = 0;
for(int i = 0; i < 8; i++){ if(top[i] >= 0)
for(int j = i + 1; j < 9; j++){
if(top[j] >= 0 && p[i][top[i]] == p[j][top[j]]){
res++;
top[i]--; top[j]--;
t = t + dfs(id - pow(5, i) - pow(5, j), card - 2);
top[i]++; top[j]++;
}
}
}
vis[id] = 1;
if(!res) return dp[id] = 0;
else return dp[id] = t / res;
}
bool read(){
memset(vis, 0, sizeof(vis));
for(int i = 0; i < 9; i++){
top[i] = 3;
for(int j = 0; j < 4; j++){
if(scanf("%s", s) == EOF) return false;
p[i][j] = Map[s[0]];
}
}
return true;
}
int main(){
Init();
while(read()) printf("%.6lf\n", dfs(pow(5, 9), 36));
return 0;
}