LightOJ
wwt9b15bs
这个作者很懒,什么都没留下…
展开
-
【题解】LIghtOJ1035 约数
题目链接#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;int num[105][105];int ans[10原创 2018-08-11 15:01:46 · 175 阅读 · 0 评论 -
【题解】LightOJ1090 Trailing Zeroes (II) 前缀和+数学知识
题目链接 预处理出阶乘的因子2和5的个数的前缀和#include<cstdio>#include<algorithm>using namespace std;typedef long long ll;const int N=1e6;ll sum2[N+10],sum5[N+10];void Init(){ for(int i=2;i&...原创 2018-09-14 06:39:42 · 182 阅读 · 0 评论 -
【题解】LightOJ1098(同UVA10830)A New Function 数学知识
题目链接 看到这个数据范围就发愁了……O(n)扫都不行。 其实写到根号n就可以了。#include<cstdio>#include<cmath>using namespace std;typedef long long ll;int t,ca;ll ans,n;int main(){ //freopen("in.txt","r原创 2018-09-15 06:34:30 · 226 阅读 · 0 评论 -
【题解】LightOJ1109 打表+数学知识
题目链接DescriptionWe define b is a Divisor of a number a if a is divisible by b . So, the divisors of 12 are 1, 2, 3, 4, 6, 12. So, 12 has 6 divisors.Now you have to order all the integers from 1...原创 2018-09-15 06:34:33 · 162 阅读 · 0 评论 -
【题解】LightOJ1138 Trailing Zeroes (III) 二分+数学知识
题目链接DescriptionYou task is to find minimal natural number N, so that N! contains exactly Q zeroes on the trail in decimal notation. As you know N! = 1*2*…*N. For example, 5! = 120, 120 contains ...原创 2018-09-15 06:34:37 · 169 阅读 · 0 评论 -
【题解】LightOJ1197 Help Hanzo 线性筛+埃氏筛
题目链接DescriptionAmakusa, the evil spiritual leader has captured the beautiful princess Nakururu. The reason behind this is he had a little problem with Hanzo Hattori, the best ninja and the love ...原创 2018-09-15 06:34:41 · 213 阅读 · 0 评论 -
【题解】LightOJ1213 Fantasy of a Summation 快速幂
题目链接 InputInput starts with an integer T (≤ 100), denoting the number of test cases.Each case starts with three integers: n (1 ≤ n ≤ 1000), K (1 ≤ K < 231), MOD (1 ≤ MOD ≤ 35000). The next...原创 2018-09-15 06:34:45 · 157 阅读 · 0 评论 -
【题解】LightOJ1214 Large Division 数学知识
题目链接DescriptionGiven two integers, a and b, you should check whether a is divisible by b or not. We know that an integer a is divisible by an integer b if and only if there exists an integer c s...原创 2018-09-15 06:34:50 · 146 阅读 · 0 评论 -
【题解】LightOJ1215 Finding LCM 最大公约数
题目链接DescriptionLCM is an abbreviation used for Least Common Multiple in Mathematics. We say LCM (a, b, c) = L if and only if L is the least integer which is divisible by a, b and c.You will be...原创 2018-09-15 06:34:54 · 229 阅读 · 0 评论 -
【题解】LightOJ1220 Mysterious Bacteria 线性筛+唯一分解定理+最大公约数
DescriptionDr. Mob has just discovered a Deathly Bacteria. He named it RC-01. RC-01 has a very strange reproduction system. RC-01 lives exactly x days. Now RC-01 produces exactly p new deadly Bacter...原创 2018-09-15 06:35:01 · 168 阅读 · 0 评论 -
【题解】LightOJ1077 How Many Points? 最大公约数
题目链接DescriptionGiven two points A and B on the X-Y plane, output the number of the lattice points on the segment AB. Note that A and B are also lattice point. Those who are confused with the defin...原创 2018-09-14 06:39:38 · 264 阅读 · 0 评论 -
【题解】LightOJ1278 Sum of Consecutive Integers 线性筛
题目链接DescriptionGiven an integer N, you have to find the number of ways you can express N as sum of consecutive integers. You have to use at least two integers.For example, N = 15 has three sol...原创 2018-09-17 09:23:31 · 196 阅读 · 0 评论 -
【题解】LightOJ1259 Goldbach`s Conjecture 线性筛
题目链接DescriptionGoldbach’s conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states:Every even integer, greater than 2, can be expressed as the su...原创 2018-09-17 09:23:25 · 210 阅读 · 0 评论 -
【题解】LightOJ1028 约数个数 线性筛
题目链接#include<cstdio>typedef long long ll;const int N=1e6+1e4;int prime[N],p;bool iscomp[N];void primetable()//线性筛 { for(int i=2;i<=N;i++) { if(iscomp[i]==false)prime[p...原创 2018-08-11 14:14:38 · 183 阅读 · 0 评论 -
【题解】LightOJ1024 最小公倍数
题目链接//求最小公倍数 #include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;const int N=1e5+10;int ans[N],cnt[N],len;//ans记录答案,cnt记录因子原创 2018-08-10 22:57:52 · 228 阅读 · 0 评论 -
【题解】LightOJ1014 求所有约数
题目链接#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>using namespace std;const int N=1e4+10;int res[N];int main(){ //freopen("原创 2018-08-10 22:48:41 · 165 阅读 · 0 评论 -
【题解】LightOJ1007Mathematically Hard 欧拉函数
题目链接//预处理出欧拉函数 #include<cstdio>#include<cstring>typedef unsigned long long ll;const int N=5e6+10;ll phi[N];void init(){ memset(phi,0,sizeof(phi)); phi[1]=1; int i,j;...原创 2018-08-10 22:13:30 · 108 阅读 · 0 评论 -
【题解】LightOJ1045 进制
题目链接 求 n 的阶乘在 base 进制下的位数,这里有一个简单的方法,就是log10(n)+ 1就是 n 的在十进制下的位数,由此可知 log base(n) 就是n在base 进制下的位数,再根据换底公式,log base(n) == log(n)/ log(base),这里让求的是阶乘,根据log的原理呢,就有log base (n!) == ( log(n) + log(n-1) + ...原创 2018-08-18 07:38:58 · 211 阅读 · 0 评论 -
【题解】LightOJ1067 逆元
题目链接 费小马定理求逆元 a/b=1mod( M ); 只要 M 是一个素数,而且 b 不是 M 的倍数,就可以用一个逆元整数 b’,通过 a/b=a*b’*(mod M)来以乘换除 费马小定理说,对于素数 M 任意不是 M 的倍数的 b,都有:b^(M-1)=1 (mod) M; 于是可以拆成:b*b^(M-2)=1(mod)M; 所以:a/b=a/b*(b*b^(M-2))=a*...原创 2018-08-19 09:49:11 · 167 阅读 · 0 评论 -
【题解】LightOJ1163 Bank Robbery 枚举+数学知识
题目链接DescriptionIn one very cold morning, Mark decides to rob a bank. But while trying hacking into the security system, he found that it is locked by some random value. He also found a pattern o...原创 2018-09-16 16:57:27 · 147 阅读 · 0 评论 -
【题解】LightOJ1236 Pairs Forming LCM 唯一分解定理+线性筛
题目链接 InputInput starts with an integer T (≤ 200), denoting the number of test cases.Each case starts with a line containing an integer n (1 ≤ n ≤ 1014).OutputFor each case, print the ca...原创 2018-09-17 09:23:18 · 203 阅读 · 0 评论 -
【题解】LightOJ1245 Harmonic Number (II) 数学知识
题目链接 InputInput starts with an integer T (≤ 1000), denoting the number of test cases.Each case starts with a line containing an integer n (1 ≤ n < 231).OutputFor each case, print the...原创 2018-09-17 09:23:22 · 251 阅读 · 0 评论 -
【题解】LightOJ1234 Harmonic Number 数学知识+打表
题目链接 InputInput starts with an integer T (≤ 10000), denoting the number of test cases.Each case starts with a line containing an integer n (1 ≤ n ≤ 108).OutputFor each case, print the c...原创 2018-09-15 06:34:58 · 190 阅读 · 0 评论