数学
jiangjiashi
这个作者很懒,什么都没留下…
展开
-
Just the Facts(P1604)
#include#include#include#include#includeusing namespace std;int main(){ freopen("fuck.txt","r",stdin); int i,j,k; int n; while (cin>>n) { printf("%5d -> ",n); long long ans=1; f原创 2012-05-15 13:53:32 · 328 阅读 · 0 评论 -
Crossing River (P1700)
注意其问题的最小化。先排序。把前两个做为特殊情况 ,其情况看代码您就知道。#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int n;int go[1111];int hi[原创 2012-07-24 21:34:23 · 357 阅读 · 0 评论 -
Area (P1654)
这个题就是求一个封闭区间内的面积。要先知道的:两个相邻向量(x1,y1)和(x2,y2)之间的平行四边形的面积为: abs(x1*y2-x2*y1)把所有两邻边的总面积算出来相加就行。#include#include#include#include#include#include#include#include#include#include原创 2012-07-24 17:31:03 · 415 阅读 · 0 评论 -
(经典) 放苹果 (P 1664 )
这个题,看似简单,却不好下手。得清楚地知道状态转移的情况 #include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int apple(int n,int m){ if (n==0) re原创 2012-07-24 14:50:00 · 1227 阅读 · 0 评论 -
欢乐端午节(CD1732)
是一个概率的递推:go[j][i]=(go[j][i-1]+go[j-i][i])%N;#include#include#include #include#include#include#include#include#include#include#includeusing namespace std; #define N 1000007int go[1原创 2012-06-24 19:51:37 · 847 阅读 · 0 评论 -
Linerarity(P2780)
这个可以先排好序,然后计算出的后面的点的关系与前面的点的已经没有关系,既然有关系前面的点已经计算过。然后排好序(这里不会费多少时间的)找出有多少共线即可。#include#include#include#include#include#include#include#includeusing namespace std;#define N 1001struct原创 2012-07-04 14:34:38 · 380 阅读 · 0 评论 -
Ratio(P1079)
这种题要想到的细节比较多,所以要先有一个清析的思路,特别是边界最容易出问题,#include#include#include #include#include#include#include#include#include#include#include#includeusing namespace std; int gcd(int big,int sma原创 2012-06-11 21:55:08 · 2335 阅读 · 0 评论 -
Adjacent Bit Counts(P3786)
这样的题就要按这样的思路好好想,,,,#include#include#include#includeusing namespace std;int dp[101][101][2];int main(){ freopen("in.txt","r",stdin); int i,j,k; int t; dp[1][0][0]=1; dp[1][0]原创 2012-05-20 17:55:21 · 756 阅读 · 0 评论 -
Binomial Showdown(P2249)
注意其计算的时候要保证边计算边减少其计算的数字不能超过long long的范围。#include#include#include #include#include#include#include#include#includeusing namespace std; long long gcd(long long big,long long small){原创 2012-06-07 23:56:10 · 494 阅读 · 0 评论 -
train2(H1023)
Problem DescriptionAs we all know the Train Problem I, the boss of the IgnatiusTrain Station want to know if all the trains come instrict-increasing order, how many orders that all the trains canget转载 2012-05-19 16:32:37 · 766 阅读 · 0 评论 -
反正切函数(P1183)
#include#include#includeusing namespace std;int main(){ __int64 a,b,i; scanf("%I64d",&a); //b=ceil(sqrt(4*a*a+4.0)+2*a); for(i=a;i>=1;i--) if ((a*a+1)%i==0) break; printf("%I64d\n",(a*a+1转载 2012-05-15 23:12:03 · 2362 阅读 · 0 评论 -
PM3 (P3213)
这个题,比较巧妙#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;//freopen("C://i.txt","r",stdin);#define N 1001int a[N][N];原创 2012-07-25 23:17:43 · 490 阅读 · 0 评论