![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
HDU--Math
Suvigo
程序猿很好玩的大家不要黑啊
展开
-
HDU-1018 Big Numbei
#include #include #include #include using namespace std;char A[10000];int main(){ int n; double z; memset(A,0,sizeof(A)); scanf("%d",&n); while(n--) {原创 2013-08-07 13:19:37 · 589 阅读 · 0 评论 -
HDU1248--寒冰王座 HDU(96)
#pragma warning(disable:4786)#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define pi acos(-1.0)//#define LL __int6原创 2013-08-13 00:00:04 · 682 阅读 · 0 评论 -
HDU1249--三角形 HDU(97)
#pragma warning(disable:4786)#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define pi acos(-1.0)//#define LL __int6原创 2013-08-13 00:00:17 · 678 阅读 · 0 评论 -
HDU1250--Hat's Fibonacci hdu(98)
#pragma warning(disable:4786)#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define pi acos(-1.0)//#define LL __int6原创 2013-08-13 10:30:32 · 609 阅读 · 0 评论 -
HDU1259--ZJUTACM HDU(99)
#pragma warning(disable:4786)#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define pi acos(-1.0)//#define LL __int6原创 2013-08-13 21:11:58 · 654 阅读 · 0 评论 -
HDU1273--漫步森林 HDU(101)
#pragma warning(disable:4786)#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define pi acos(-1.0)//#define LL __int6原创 2013-08-14 16:04:11 · 669 阅读 · 0 评论 -
HDU1271---整数对 HDU(100)
#include#include#include#include#includeusing namespace std;int ans[100];int main(){ int n, a, b, c; //a右,c左 while(scanf("%d", &n) != EOF && n) { int count = 0; for(int k = 1; k <= n;原创 2013-08-14 15:00:16 · 657 阅读 · 0 评论 -
HDU1286---找新朋友 HDU(104)
#pragma warning(disable:4786)#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define pi acos(-1.0)//#define LL __int6原创 2013-08-14 23:05:08 · 625 阅读 · 0 评论 -
HDU1288--Hat's Tea HDU(105)
#pragma warning(disable:4786)#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define pi acos(-1.0)//#define LL __int6原创 2013-08-15 11:58:59 · 821 阅读 · 0 评论 -
HDU1275--两车追及或相遇问题 HDU(102)
#pragma warning(disable:4786)#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define pi acos(-1.0)//#define LL __int6原创 2013-08-14 22:04:22 · 1072 阅读 · 1 评论 -
HDU1284--钱币兑换问题 HDU(103)
#pragma warning(disable:4786)#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define pi acos(-1.0)//#define LL __int6原创 2013-08-14 22:36:18 · 614 阅读 · 0 评论 -
HDU1290---献给杭电五十周年校庆的礼物 HDU(106)
#pragma warning(disable:4786)#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define pi acos(-1.0)//#define LL __int6原创 2013-08-15 16:50:09 · 781 阅读 · 0 评论 -
HDU1299--Diophantus of Alexandria HDU(109)
看到这题的时候想到了刘汝佳里面的原题,就直接暴力枚举一下。#pragma warning(disable:4786)#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define pi a原创 2013-08-15 21:26:57 · 668 阅读 · 0 评论 -
HDU1713--相遇周期 HDU(110)
#pragma warning(disable:4786)#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define pi acos(-1.0)//#define LL __int6原创 2013-08-15 21:35:53 · 657 阅读 · 0 评论 -
HDU1319---Prime Cuts HDU(111)
#pragma warning(disable:4786)#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define pi acos(-1.0)//#define LL __int6原创 2013-08-16 22:13:27 · 777 阅读 · 0 评论 -
HDU1221---Rectangle and Circle HDU(94)
#include #include #include #include #include #define eps 1e-8using namespace std;struct point{ double x; double y;}circle,a,b,c,d;double r;double dis(point &a,point &b){ return原创 2013-08-12 09:06:36 · 1141 阅读 · 0 评论 -
HDU1216--Assistance Required HDU(92)
#include #define N 35000int main(){ int arr[N] = {0}; int lucky[N]; int i, j, k, n; n = 0; for (i = 2; i < N; i++) { if(arr[i]==0) { lucky[n++]=i;原创 2013-08-11 22:42:10 · 691 阅读 · 0 评论 -
HDU1222--Wolf and Rabbit HDU(95)
#pragma warning(disable:4786)#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define pi acos(-1.0)//#define LL __int6原创 2013-08-12 09:27:34 · 817 阅读 · 0 评论 -
HDU--1028 Ignatius and the Princess III
#include#include#include#include#include#includeusing namespace std;typedef long long LL;const LL MAXN = 120 ;int F[MAXN+1];int P[MAXN+1] ;void Prepare() { LL i , j , k , s原创 2013-08-07 14:09:20 · 767 阅读 · 0 评论 -
HDU1056--HangOver
#include #include #include #include #define m 300using namespace std;double p[m+10];void pr(){ double f=0; for(int i=2;i<=300;i++) { f+=(double)1/i; p[i]=f; }}原创 2013-08-07 22:51:34 · 758 阅读 · 0 评论 -
HDU1060--Leftmost Digit
#include #include #includeusing namespace std;int main(){ int n; scanf("%d",&n);while(n--) { __int64 m; scanf("%I64d",&m); double a;a=m*log10((double)m)-( __int64)(m*log10((double)m原创 2013-08-07 23:21:04 · 674 阅读 · 0 评论 -
HDU1065---I Think I Need a Houseboat----HDU(82)
#include #include #include #define PI 3.1415926using namespace std;int main(){ int n,k=1; scanf("%d",&n); while(n--) { int c; double a,b; scanf("%lf %lf",&原创 2013-08-08 23:03:47 · 556 阅读 · 0 评论 -
HDU1071-----The are--- hdu(84)
#includeint main(){ int n,i; double x0,y0,x1,y1,x2,y2,k,b,a,c,h,s; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%lf%lf%lf%lf%lf%lf",&x0,&y0,&x1,&y1,&x2,&y2); k=(y2-原创 2013-08-10 00:24:01 · 566 阅读 · 0 评论 -
HDU1077---Catching Fish HDU(85)
#include #include #include using namespace std;const static double eps = 1e-6;struct Point{ double x,y;};double distancess(Point a,Point b){ return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.原创 2013-08-10 12:42:55 · 747 阅读 · 0 评论 -
HDU1099————Lottery HDU(86)
#include #include #include #include #include using namespace std;long long GCD (__int64 a, __int64 b) { if (b == 0) { return a; } return GCD (b, a % b);}int main () {原创 2013-08-10 15:56:15 · 764 阅读 · 0 评论 -
HDU1066---Last non-zero Digit in N!
#include#includeint s[20]={1,1,2,6,4,2,2,4,2,8,4,4,8,4,6,8,8,6,8,2};char f[1000];int a[1000];int main(){ int i,c,t,l; while(scanf("%s",f)!=EOF) { t=1; l=strlen(f); for(i=0;i<l;i++)原创 2013-08-09 21:45:11 · 625 阅读 · 0 评论 -
HDU1110--Equipment Box HDU(87)
#include #include using namespace std;int Check(double a,double b,double x,double y){ if(a*b <= x*y) return 0; if(a <= x) return 0; if(a>x && b>y) return 1; double Dist = sqrt(x*x+原创 2013-08-10 16:38:37 · 1111 阅读 · 0 评论 -
HDU1214--圆桌会议 HDU(90)
#include #include #include #include using namespace std;int main(){ int n; while(cin>>n) { int x,f,z; f=n/2; x=n-f; z=f*(f-1)/2+x*(x-1)/2; cout<<z<<end原创 2013-08-11 15:30:11 · 653 阅读 · 0 评论 -
HDU1210---Eddy's 洗牌问题 HDU(89)
#include #include #include #include using namespace std;int main(){ int n; while(cin>>n) { int x,f;x=0; f=1; do { if(f<=n) f*=2; else f=(f*2-1)%(2*n); x++原创 2013-08-11 14:59:52 · 699 阅读 · 0 评论 -
HDU1155--Bungee Jumping HDU(88)
#include #include #include using namespace std;const double G=9.81;int main(){ double k,l,s,w; while(scanf("%lf %lf %lf %lf",&k,&l,&s,&w)) { if(k==0&&l==0&&s==0&&w==0)break;原创 2013-08-11 12:18:52 · 980 阅读 · 0 评论 -
HDU1215---七夕节 HDU(91)
#include #include #include #include using namespace std;typedef long long LL;const int f=500000;LL a[f];void prime(){ int i,j; for(i=1;i<=500000;i++) a[i]=1; for(i=2;i<=250原创 2013-08-11 15:43:50 · 631 阅读 · 0 评论 -
HDU1220--Cube HDU(93)
#include #include #include #include using namespace std;int a[2050];int main(){ int n,s; while(scanf("%d",&n)!=EOF) { s=n*n*n*(n*n*n-1)/2-3*n*n*(n-1); printf("%d\n",s原创 2013-08-11 23:05:15 · 648 阅读 · 0 评论 -
HDU4772--Zhuge Liang's Password(160)
【题目】点击打开链接【题解】这道题就是考察一个矩阵旋转的算法。输入并不难,就是对两个矩阵进行0度,90度,180度,270度旋转看是否有数字相同。 设i,j是行和列,则对于0度:a[i][j]=b[i][j]; 90度:列号变为行号(n - 行号 + 1)变成列号规律: a[i][j] = b[j][n - i + 1]180度:原创 2013-11-11 19:00:40 · 652 阅读 · 0 评论