题目链接:uva 474 - Heads / Tails Probability
题目大意:给定n,求12−n的科学计数法。
解题思路:n不大,递推一遍,维护小数和指数部分即可。
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1e6;
int k[maxn+5];
double arr[maxn+5];
void init (int n) {
arr[1] = 5;
k[1] = 1;
for (int i = 2; i <= n; i++) {
arr[i] = 0.5 * arr[i-1];
k[i] = k[i-1];
while (arr[i] < 1.0) {
arr[i] *= 10;
k[i]++;
}
}
}
int main () {
int n;
init(maxn);
while (scanf("%d", &n) == 1) {
printf("2^-%d = %.3lfe-%d\n", n, arr[n], k[n]);
}
return 0;
}
分享到:
相关推荐
https://github.com/void-stack/VMUnprotect/archive/refs/heads/main.zip VMUnprotect是一个致力于寻找虚拟化VMProtect方法的项目。它利用Harmony动态读取VMP行为。目前仅支持方法管理。适用于VMProtect 3.5.1...
android / kernel / goldfish / refs/heads/android-goldfish-3.4
android / kernel / goldfish.git / refs/heads/android-goldfish-2.6.29
FelixAndresen-RSMentalAccounting-archive-refs-heads-master.zip
stephenbeckr-fastRPCA-archive-refs-heads-master.zip
xuzhenqi-cnn-archive-refs-heads-master.zip
wiczerd-HTmeetsMP-archive-refs-heads-master.zip
Suz-OrX-archive-refs-heads-master.zip
murphyk-matlabtools-archive-refs-heads-master.zip
RoboHAZMAT-KinematicsSimulation-archive-refs-heads-master.zip
maitreyim-MATLAB-archive-refs-heads-master.zip
GuipengLi-optLBFGS-archive-refs-heads-master.zip
fedyiv-MathCode-archive-refs-heads-master.zip
DKLab-MPAnalyze-archive-refs-heads-master.zip
charlesfuture-ChnFtrs-archive-refs-heads-master.zip
djrow-SMCode-archive-refs-heads-master.zip
bwinkler-OptimizationMethods-archive-refs-heads-master.zip
TstevetsT-NumericalAnalysis-archive-refs-heads-master.zip
yalechang-nbs-archive-refs-heads-master.zip
spunt-whyhowlocalizer-archive-refs-heads-master.zip