计算几何的题目,很简单: 自己随手敲了个,纪念下! #include<cstdio> #include<cmath> using namespace std; struct point { double x,y; point(,):x(x),y(y) { } } a,b,c,d; point midd(point a,point b) { return point((a.x+b.x)/2.0,(a.y+b.y)/2.0); } point operator + (point a,p…

一道比较简单但是繁琐的三维计算几何,找错误找的我好心酸,没想到就把一个变量给写错了 = =: 题目的意思是求平面切长方体的截面面积+正方体顶部所遮盖的面积: 找出所有的切点,然后二维凸包一下直接算面积即可! 发个代码纪念一下! 代码: #include<cstdio> #include<cmath> #include<algorithm> #include<cstring> #define eps 1e-8 using namespace std; inli…

也是一个数学题: 主要用到的是排列组合的知识,推推公式就行了,挺简单的: 唯一要注意的是A(0,0)=1: 在这个上面WA了几次,= = 代码: #include<stdio.h> #define ULL unsigned long long #define maxn 21 using namespace std; ULL C[maxn+][maxn+];//范围可向上变更 ULL A[maxn]; void builtC(){ memset(C,,sizeof(C)); C[][]=; ;i…

一个简单的规律题,每一列都是一个等差数列: 代码: #include<cstdio> #define ll long long using namespace std; int main() { int p; ; scanf("%d",&p); while(p--) { int a,b; scanf("%d",&ca); scanf("%d%d",&a,&b); ll ans=(a-b)*b+; pri…

Problem G Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 16   Accepted Submission(s) : 5 Font: Times New Roman | Verdana | Georgia Font Size: ← → Problem Description There are Y lines parallel t…

题目链接:http://poj.org/problem?id=2407 Relatives Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 13599   Accepted: 6772 Description Given n, a positive integer, how many positive integers less than n are relatively prime to n? Two integers…

题面 题目分析 (默认\(n<m\)) 题目要求\(\sum\limits_{i=1}^n\sum\limits_{j=1}^mlcm(i,j)\). 由\(lcm(i,j)=\frac{i\cdot j}{gcd(i,j)}\) 得: \[ \begin{split} ans & =\sum\limits_{i=1}^n\sum\limits_{j=1}^m\frac{i\cdot j}{gcd(i,j)} \\ & =\sum\limits_{d=1}^n\sum\limits_…

/*====================================================================== [NOIp 1998 提高组]Probelm 2 连接多位数 总时间限制: 10000ms 内存限制: 65536kB 描述 设有n个正整数(n≤20),将它们联接成一排,组成一个最大的多位整数. 例如:n=3时,3个整数13,312,343联接成的最大整数为:34331213 又如:n=4时,4个整数7,13,4,246联接成的最大整数为:74246…

The Problem to Slow Down You Problem's Link: http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=141572 Mean: 给你两个字符串,求这两个字符串相同回文串的匹配对数. analyse: 每个字符串建一棵回文树,分别从0结点和1结点两棵树一起往下dfs,对于同一条路径上的结点,一定是相同的回文,然后两个的数量相乘加到answer中. Time complexity: O(N)…

题目链接:http://codeforces.com/gym/101981/attachments The use of the triangle in the New Age practices seems to be very important as it represents the unholytrinity (Satan, the Antichrist and the False Prophet bringing mankind to the New World Order with…