数论
ACM__dongsheng
在校大学生
展开
-
light oj february 29
DescriptionGiven two dates, please calculate the number of February 29 between the two dates inclusively.Only a leap year contains February 29. The year satisfying one of the following conditions is a原创 2016-11-19 18:26:57 · 508 阅读 · 0 评论 -
1035 最长的循环节
整数k的倒数1/k,写为10进制的小数如果为无限循环小数,则存在一个循环节,求<=n的数中,倒数循环节长度最长的那个数,假如存在多个最优的答案,输出所有答案中最大的那个数。1/6= 0.1(6) 循环节长度为1 1/7= 0.(142857) 循环节长度为6 1/9= 0.(1) 循环节长度为1 Input输入n(10 <= n <= 1000)Output输出<=n的数中倒数循环节长度最长原创 2016-11-02 19:31:22 · 996 阅读 · 0 评论 -
1434 区间LCM
一个整数序列S的LCM(最小公倍数)是指最小的正整数X使得它是序列S中所有元素的倍数,那么LCM(S)=X。 例如,LCM(2)=2,LCM(4,6)=12,LCM(1,2,3,4,5)=60。 现在给定一个整数N(1<=N<=1000000),需要找到一个整数M,满足M>N,同时LCM(1,2,3,4,…,N-1,N) 整除 LCM(N+1,N+2,….,M-1,M),即LCM(N+1,N+2原创 2016-10-28 18:58:04 · 1127 阅读 · 0 评论 -
lonlife oj 1029 - Bob and Alice are playing factors
DESCRIPTION Bob and his girl friend Alice like factors very much.One day, Bob find a beautiful path: 4, 2, 1, Becauese 2 is the factor of 4 and 1 is the factor of 2.Alice is excited, says “why can’t w原创 2016-09-04 10:04:47 · 425 阅读 · 0 评论 -
hdu 1129 Diophantus of Alexandria
Problem Description Diophantus of Alexandria was an egypt mathematician living in Alexandria. He was one of the first mathematicians to study equations where variables were restricted to integral valu原创 2016-04-17 15:05:14 · 392 阅读 · 0 评论 -
Positive Con Sequences
题意就是:4个等比或等差的数,缺了一个,你要求出那个数。 思路:对每个位置考虑下#include"iostream" #include"cstdlib" #include"cmath" using namespace std; int main() { long long a,b,c,d,t,x; while(cin>>a>>b>>c>>d,a!=-1||b!=-1||c!=-1||d!=-原创 2016-04-10 19:31:39 · 579 阅读 · 0 评论 -
hdu 2588 GCD
Problem DescriptionThe greatest common divisor GCD(a,b) of two positive integers a and b,sometimes written (a,b),is the largest divisor common to a and b,For example,(1,2)=1,(12,18)=6. (a,b) can be e原创 2016-03-29 12:41:22 · 117 阅读 · 0 评论 -
fzu 养鸡场
Problem DescriptionJason买来了n米长的竹篱笆,打算将n米长的竹篱笆全部用来围成一个三角形的养鸡场。为方便起见,养鸡场三条边的长度都为正整数。同时,他想让自己的养鸡场看起来更美观一些,要求三条边的长度分别在一个区间范围内。现在,他想知道有多少种不同的方案使得围成的养鸡场满足要求? Input输入包含多组数据。输入数据第一行是一个正整数n,表示竹篱笆的长度。在接下来三行中,第i原创 2016-04-09 23:40:10 · 521 阅读 · 0 评论 -
hdu 2136 Largest prime factor
verybody knows any number can be combined by the prime number. Now, your task is telling me what position of the largest prime factor. The position of prime 2 is 1, prime 3 is 2, and prime 5 is 3, et原创 2016-03-14 18:53:29 · 437 阅读 · 0 评论 -
hdu 4497
GCD and LCM Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 1941 Accepted Submission(s): 860Problem DescriptionGiven two positive integers原创 2016-03-23 19:58:03 · 867 阅读 · 1 评论 -
lightoj 1236 - Pairs Forming LCM
Find the result of the following code:long long pairsFormLCM( int n ) { long long res = 0; for( int i = 1; i <= n; i++ ) for( int j = i; j <= n; j++ ) if( lcm(i, j) == n原创 2016-03-21 08:59:58 · 452 阅读 · 0 评论 -
hdu 1576 A/B
Problem Description 要求(A/B)%9973,但由于A很大,我们只给出n(n=A%9973)(我们给定的A必能被B整除,且gcd(B,9973) = 1)。Input 数据的第一行是一个T,表示有T组数据。 每组数据有两个数n(0 <= n < 9973)和B(1 <= B <= 10^9)。Output 对应每组数据输出(A/B)%9973。Sample Input原创 2016-03-30 11:14:01 · 2593 阅读 · 0 评论 -
hdu 1286 找新朋友
Problem Description 新年快到了,“猪头帮协会”准备搞一个聚会,已经知道现有会员N人,把会员从1到N编号,其中会长的号码是N号,凡是和会长是老朋友的,那么该会员的号码肯定和N有大于1的公约数,否则都是新朋友,现在会长想知道究竟有几个新朋友?请你编程序帮会长计算出来。Input 第一行是测试数据的组数CN(Case number,1#include<stdio.h> #inclu原创 2016-03-29 13:01:03 · 648 阅读 · 0 评论 -
Maximum GCD
Given the Nintegers, you have to nd the maximum GCD (greatest common divisor) of every possiblepair of these integers. Input The rst line of input is an integerN(1这里写代码片 #include<iostream> #includ原创 2016-03-17 19:38:39 · 934 阅读 · 0 评论 -
codeforce 787A The Monster 两种解法
题意 : 问b+na = d+kc,有无解; b-d = kc - na; #include <bits\stdc++.h> using namespace std; int gcd(int a,int b){ return b == 0? a:gcd(b,a%b); }int main(){ int a,b,c,d; scanf("%d%d%d%d",&a,&b,&c原创 2017-03-24 02:04:27 · 562 阅读 · 0 评论