【入门3】循环结构
题目:P1009 [NOIP1998 普及组] 阶乘之和
总结:高精度 写了壹佰年 属实给我整吐了🤮 这个当以后的模板了
#include<bits/stdc++.h>
using namespace std;
//数字化为字符串
string tostring(int n){
string ans;
if (!n) return "0";
while (n){
ans = (char)(n%10 + '0') + ans;
n = n/10;
}
return ans;
}
//高精度乘
string multiply(string sa, string sb){
int a[1000] = {0}, b[1000] = {0}, c[1000] = {0}, la, lb, lc;
string ans;
la = sa.length();
lb = sb.length();
for (int i = 0; i < la; i++){
a[la-i] = sa[i] - '0';
}
for (int i = 0; i < lb; i++){
b[lb-i] = sb[i] - '0';
}
for (int i = 1; i <= la; i++){
for(int j = 1; j <= lb; j++){
c[i+j-1] = c[i+j-1] + a[i]*b[j];
c[i+j] = c[i+j] + c[i+j-1]/10;
c[i+j-1] = c[i+j-1]%10;
}
}
lc = la + lb;
while (c[lc]==0 && lc>1) {
lc--;
}
for (int i = lc; i >= 1; i--){
ans = ans + tostring(c[i]);
}
return ans;
}
//阶乘
string f(int n){
string result = "1";
for (int i = 1; i <= n; i++){
result = multiply(result, tostring(i));
}
return result;
}
//高精度加
string add(string sa, string sb){
int a[1000] = {0}, b[1000] = {0}, c[1000] = {0}, la, lb, lc;
string ans;
la = sa.length();
lb = sb.length();
for (int i = 0; i < la; i++){
a[la - i] = sa[i] - '0';
}
for (int i = 0; i < lb; i++){
b[lb - i] = sb[i] - '0';
}
lc = max(la, lb);
for (int i = 1; i <= lc; i++){
c[i] = c[i] + a[i] + b[i];
c[i+1] = c[i]/10;
c[i] = c[i] % 10;
}
if (c[lc+1]) lc++;
for(int i = lc; i >= 1; i--){
ans = ans + tostring(c[i]);
}
return ans;
}
int main()
{
string ans;
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
ans = add(ans, f(i));
}
cout << ans;
}
//高精度除法
#include<bits/stdc++.h>
using namespace std;
char s1[5005];
long long b, c[5005], x, a[5005], la, lc;
int main()
{
cin >> s1 >> b; //读入除数和被除数
la = strlen(s1);
for (int i = 1; i <= la; i++){
a[i] = s1[i - 1] - '0';
}
for (int i = 1; i <= la; i++){
c[i] = (x*10 + a[i])/b;
x = (x*10 + a[i])%b;
}
lc = 1;
while (c[lc] == 0 && lc < la) lc++; //删除前导0
for (int i = lc; i <= la; i++) cout << c[i];
}
题目:P1980 [NOIP2013 普及组] 计数问题
总结:今天写这个入门题花了很长时间,因为不想用暴力方法,想用排列组合求解,思路是有了,却推了半天还没推出正确答案,无奈还是用暴力过了。看了题解,最简的和我的思路一致,代码确实不太好写。。感觉自己太菜惹
题目:P1035 [NOIP2002 普及组] 级数求和
总结:
在题解看到一个数论的方法,先存着以后进阶了再看
代码:
#include<cstdio>
#include<cmath>
const double gamma=0.5772156649;
int main() {
int k,n;
scanf("%d",&k);
n=exp(k-gamma)+0.5;
printf("%d",n);
return 0;
}
题目:P2669 [NOIP2015 普及组] 金币
总结:return 0直接结束程序。。
题目:P5722 【深基4.例11】数列求和
总结:too water
题目:P5723 【深基4.例13】质数口袋
总结:
用埃筛筛出100000以内的质数
memset(prime, 1, sizeof(prime));//埃筛一定要初始化数组值
cin >> l;
prime[1] = 0;
prime[0] = 0;
for(int i=2; i<100000; i++) {
if(prime[i]) {
for(int j=i * 2; j<100000; j+=i) {
prime[j] = 0;
}
}
}//筛取质数