![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数学
Change_ZHONG
成在坚持
展开
-
tjut 4655
#include #include #include #include #include #include using namespace std; #define maxn 1000010 typedef __int64 LL; vectorv; const LL mod = 1e9+7; LL num[maxn]; LL Pow原创 2016-07-30 08:59:51 · 218 阅读 · 0 评论 -
tjut 4873
#include #include #include #include #include using namespace std ; #define REP( i , n ) for ( int i = 0 ; i #define REPF( i , a , b ) for ( int i = a ; i #define REP原创 2016-07-22 22:25:20 · 252 阅读 · 0 评论 -
tjut 4861
include #include #include using namespace std; int main() { int k,p; while(scanf("%d%d",&k,&p)!=EOF) { if((k/(p-1))%2==1) printf("YES\n");原创 2016-07-22 15:41:48 · 287 阅读 · 0 评论 -
tjut 4869
#include #include #include #include #include #include #include #include using namespace std; #define LL __int64 const int maxn=1e5+10; const int mod=1e9+9;原创 2016-07-22 16:54:58 · 197 阅读 · 0 评论 -
tjut 5288
#include #include #include using namespace std ; const int maxn = 100010 ; const int mod = 1e9+7 ; int a[maxn]; typedef __int64 ll ; ll last[maxn] ; ll pre[maxn] ; ll l[maxn] ; ll r[maxn] ;原创 2016-06-05 18:04:17 · 164 阅读 · 0 评论 -
tjut 3524
#include using namespace std; typedef long long ll; const ll mod=10007; ll pow(ll n) { ll ans=1,base=2; while(n) { if(n&1) ans=ans*base%mod; base=base*b原创 2016-08-31 09:35:12 · 157 阅读 · 0 评论 -
tjut 3530
#include struct mart { double mat[105][105]; }; mart kk,xx; int n; mart multi(mart a,mart b) { mart c; int i,j,k; for(i=1;i<=n;i++) for(j=1;j<=n;j原创 2016-08-31 08:55:51 · 151 阅读 · 0 评论 -
tjut 5407
#include #include #include set> #include string> #include #include #include #include #include #include #include #include #include #define mod 1000000007 #define LL long long #define ULL u原创 2016-07-22 12:30:26 · 230 阅读 · 0 评论 -
tjut 5954
#include using namespace std; double Pi = acos(-1.0); double eps = 1e-100; double tran = 180/Pi; double vd; double V(double a) { return Pi*cos(a) - a*cos(a) + sin(a) - pow(sin(a), 3)/3; } double原创 2016-11-03 10:09:05 · 171 阅读 · 0 评论