摘要: //qf#include #define f(i,j,n) for(register int i=j;i<=n;i++)using namespace std;typedef long long ll;inline ll read() { ll x=0; int f=... 阅读全文
posted @ 2019-01-02 17:45 Isaunoya 阅读(283) 评论(0) 推荐(0) 编辑
摘要: //qf#include #define f(i,j,n) for(register int i=j;i>x>>y>>a>>b; cout<<fixed<<setprecision(3)<<dis(x,y,a,b)<<endl; return 0;} ... 阅读全文
posted @ 2019-01-02 17:45 Isaunoya 阅读(289) 评论(0) 推荐(0) 编辑
摘要: //qf#include #define f(i,j,n) for(register int i=j;i<=n;i++)using namespace std;typedef long long ll;inline ll read() { ll x=0; int f=... 阅读全文
posted @ 2019-01-02 17:45 Isaunoya 阅读(183) 评论(0) 推荐(0) 编辑
摘要: //qf#include #define f(i,j,n) for(register int i=j;i<=n;i++)using namespace std;typedef long long ll;inline ll read() { ll x=0; int f=... 阅读全文
posted @ 2019-01-02 17:45 Isaunoya 阅读(196) 评论(0) 推荐(0) 编辑
摘要: //qf#include #define f(i,j,n) for(register int i=j;i>d>>D; r=d-int(d/D)*D; cout<<r<<endl; return 0;} 阅读全文
posted @ 2019-01-02 17:44 Isaunoya 阅读(299) 评论(0) 推荐(0) 编辑
摘要: //qf#include #define f(i,j,n) for(register int i=j;i>r; v=(4*r*r*r*p)/3.0; cout<<fixed<<setprecision(2)<<v<<endl; return 0;} ... 阅读全文
posted @ 2019-01-02 17:44 Isaunoya 阅读(173) 评论(0) 推荐(0) 编辑
摘要: //qf#include #define f(i,j,n) for(register int i=j;i<=n;i++)using namespace std;typedef long long ll;inline ll read() { ll x=0; int f=... 阅读全文
posted @ 2019-01-02 17:44 Isaunoya 阅读(317) 评论(0) 推荐(0) 编辑
摘要: //qf#include #define f(i,j,n) for(register int i=j;i<=n;i++)using namespace std;typedef long long ll;inline ll read() { ll x=0; int f=... 阅读全文
posted @ 2019-01-02 17:44 Isaunoya 阅读(306) 评论(0) 推荐(0) 编辑
摘要: //qf#include #define f(i,j,n) for(register int i=j;i>x>>y>>x2>>y2>>x3>>y3; a=dis(x,y,x2,y2),b=dis(x,y,x3,y3),c=dis(x2,y2,x3,y3); p=... 阅读全文
posted @ 2019-01-02 17:44 Isaunoya 阅读(433) 评论(0) 推荐(0) 编辑
摘要: 蒟蒻的日记有什么好看的 阅读全文
posted @ 2019-01-01 23:23 Isaunoya 阅读(437) 评论(0) 推荐(0) 编辑
TOP