- 博客(72)
- 收藏
- 关注
RSS订阅原创 tjut 5900
#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; ll a[310],b[310]; l
2016-09-21 10:32:17
196
原创 tjut 3639
#include#include#include#include#define MAXN 5010 using namespace std; vector g[MAXN],g2[MAXN];//g保存原图，g2保存缩点反向后的图stack st; int n,index,num,dfn[MAXN],low[MAXN],f[MAXN]; bool vis[MAXN],instack
2016-09-20 13:54:12
160
原创 tjut 3608
#include #include #include #include #include #include #include #include #include #define INF 99999999 using namespace std; const int MAX=500000+10; char s[MAX*2]; int p[MA
2016-09-20 09:08:16
142
原创 tjut 5879
#include#include#include#includeusing namespace std;const int N = 1e6 + 5;char a[N];double sum[N];void yu(){ for(int i = 1 ; i < N ; i++){ sum[i] = sum[i - 1] + (double)1/i/i;
2016-09-18 11:36:41
137
原创 tjut 5883
#include using namespace std; const int maxn = 1e5+7; int a[maxn]; int degree[maxn]; int main() { int T; scanf("%d",&T); while(T--) { memset(degree,0,size
2016-09-18 11:33:26
162
原创 tjut 2516
#includeusing namespace std;int main(){ int n,fib[45]; int i,flag; fib[0]=2; fib[1]=3; for(i=2;i<45;i++) fib[i]=fib[i-1]+fib[i-2]; while(cin>>n&&n) {
2016-09-17 09:09:45
175
原创 tjut 1847
#include using namespace std; int main(void) { int n; while(scanf("%d",&n)==1) { if(n%3==0) cout<<"Cici"<<endl; else cout<<"Kiki"<<endl;
2016-09-17 09:06:21
190
原创 tjut 1846
#include #include #include using namespace std; int main() { int t,n,m; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); if(n%(m+1))
2016-09-17 09:04:33
144
原创 tjut 1564
#include #include #include #include using namespace std;int main(){ int n; while(scanf("%d",&n)==1 &&n) { if(n%2==0)printf("8600\n"); else printf("ailyanlu\n"); }
2016-09-17 09:01:56
149
原创 tjut 3603
#include #include #include #include #include #define N 1000005 using namespace std; int n,vis[N],d[N][30],pre[N],len[N]; int search(int l,int r){ int m,t=l; do{
2016-09-17 08:57:09
137
原创 tjut 3607
#include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned long long ull; const int inf=0x3f3f3f3f; const ll INF=0x3f3f3f3f3f3f3f3f
2016-09-17 08:52:56
190
原创 tjut 3609
#include using namespace std; #define LL unsigned __int64 #define M 205 int phi[M]; int Euler (int n) //求n的欧拉值 { int i, res = n; for (i = 2; i * i <= n; i++) {
2016-09-17 08:39:39
133
原创 tjut 3652
#include #include #include using namespace std; int bit[15]; int dp[15][15][3]; //dp[i][j][k] //i:数位 //j:余数 //k:3种操作状况，0：末尾不是1,1：末尾是1,2：含有13 int dfs(int pos,int mod,int ha
2016-09-16 22:17:39
331
原创 tjut 4722
#include #include #include using namespace std; __int64 bit[20]; __int64 dp[20][10]; //dp[i][j]，长度为i的数与10模为j的个数 __int64 solve(__int64 n) { __int64 ans; __int64 tem1 =
2016-09-16 22:15:47
128
原创 tjut 3595
#include #include #include #include #define M 1002 using namespace std; int n,sg[M][M],step[M][M]; int find(int a,int b) { if(sg[a][b]>=0) return sg[a][b]; if(a>b) swap(
2016-09-14 11:36:22
133
原创 tjut 3600
#include#define SIZE_N 90010int ary[2][SIZE_N];int sum,len;void reverseNum(int l,int h,int idx){ int i,j,k; int mid,idxt; idxt = 1 - idx; if(l == h) { ary[1][l] = ary[
2016-09-14 11:09:14
180
原创 tjut 3593
#include #include #define MAX 100005 using namespace std; bool leaf[MAX]; int dp[505][10005];//非叶子节点最多500个 int G; int cost[MAX],val[MAX]; struct node{ int to,nxt; }edg[MAX];
2016-09-14 08:51:03
171
原创 tjut 3599
#include#include#include#include#include#includeusing namespace std;#define MAXN 4444#define inf 1<<30struct Node{ int v,w; Node(int vv,int ww):v(vv),w(ww){};};int n;bool mark[MA
2016-09-14 08:37:59
184
原创 tjut 1269
#include #include #include using namespace std; #define maxn 10010 int n; vector g[maxn]; int Bcnt; /// 强连通分量的个数； int Top; /// 栈顶； int Index; /// 时间戳； int low[maxn], dfn[m
2016-09-14 08:06:04
126
原创 tjut 3594
# include# include# define N 20005# define M 50005# includeusing namespace std;struct node{ int from,to,next;}edge[M];int tol,head[N],dfn[N],low[N],flag,count,cnt,n;bool visit[N],vis[N];
2016-09-13 22:49:32
159
原创 tjut 1530
#include#define N 60int map[N][N] ,n;int now[N] ,Ans;bool ok(int sum ,int to){ for(int i = 1 ;i <= sum ;i ++) if(!map[now[i]][to]) return 0; return 1;}void DFS(int to ,int sum ,int
2016-09-13 11:03:20
180
原创 tjut 3585
#include#include#include#include#define N 60using namespace std;typedef struct{ double x ,y;}NODE;NODE node[N];int n ,k ,Ans;int map[N][N] ,now[N];int dp[N];double dis[N][N] ,num[N
2016-09-13 10:50:04
197
原创 tjut 3591
#include #include #include #include #include #include #include #include using namespace std; const int maxn=1e2+10; const int maxm=2e4+10; const int INF=1e8; int c[maxn
2016-09-13 10:34:47
134
原创 tjut 3592
#include #include #define MAXN 1010 #define MAXM 20010 #define INF 0x7fffffff using namespace std; struct edge { int to,w,next; }E[MAXM]; int head[MAXN],ecnt; int Stack[MA
2016-09-13 09:58:19
196
原创 tjut 3586
#include#include#includeusing namespace std;const int VM=1010;const int INF=1000010; //开始设为0x3f3f3f3f给了WAstruct Edge{ int to,nxt; int cap;}edge[VM<<1];int n,m,cnt,head[VM];int dp
2016-09-12 23:09:55
143
原创 tjut 3584
#include #include #include using namespace std; const int N = 110; int num[N][N][N]; int inline lowbit(int x){ return x & (-x); } void inline update(int x,int y,int z,int a
2016-09-12 22:40:05
141
原创 tjut 3573
#include"stdio.h" #include"string.h" #include"stdlib.h" int min(int a,int b) { return a>b?b:a; } int main() { int T,Case; int temp; int a,b,c; int ans;
2016-09-12 21:57:57
189
原创 tjut 3578
#include #include #include #include #include using namespace std;int a[2005],dp[105][4005];int main(){ //dp[i][j]表示到第i个物品，两个数差值是j时 int t,i,j,n,an
2016-09-12 20:25:07
173
原创 tjut 3577
#include #include #include #include #include #include #include #include #include using namespace std; const int N=1000005; int ans[N]; struct node { int l,r,v,lazy; }
2016-09-12 19:35:52
147
原创 tjut 3579
#include #include #include #include using namespace std; __int64 x, y, t; __int64 egcd(__int64 a, __int64 b) { if (b==0) { x=1;
2016-09-12 17:32:17
160
原创 tjut 3569
#include #include #include using namespace std; typedef long long ll; const int N = 1005; int main() { int n, m, K, cas, T = 0, x; scanf("%d", &cas); while (cas-->0) {
2016-09-12 16:51:52
158
原创 tjut 3565
#include"cstdlib" #include"cstdio" #include"cstring" #include"cmath" #include"queue" #include"algorithm" #include"iostream" using namespace std; #define ll unsigned __int64 int dp[30
2016-09-12 16:32:14
151
原创 tjut 3567
#include #include #include #include #include #include #include using namespace std; struct node { int x,y; char map[5][5]; node() {} node(char *s)
2016-09-08 22:44:17
206
原创 poj 1087
#include #include #include #include using namespace std; #define MAXV 810 //最大值设为400贡献了RE一次 #define INF INT_MAX #define min(a,b) (a>b?b:a) map rec_dev; char str
2016-09-07 10:35:37
225
原创 poj 2069
#include #include #include #include #define N 55 #define eps 1e-7 #define T 100 #define delta 0.98 #define INF 1e99 using namespace std; struct Point { double
2016-09-07 08:29:42
201
原创 tjut 5769
#include #include #include #include using namespace std;typedef long long ll;const int N = int(2e5)+10;int cmp(int *r,int a,int b,int l){ return (r[a]==r[b]) && (r[a+l]==r[b+l]);}// 用于比较
2016-09-07 08:06:03
126
原创 poj 3067
#include #include #include #include #define LL long long using namespace std; const int M=1003; LL C[M]; int n,m,k; struct Node { int x,y; }edge[1003*1002]; bool cmp(No
2016-09-06 22:01:18
165
原创 tjut 1525
#include #include #include #include using namespace std;int main(){ int a,b; while(scanf("%d%d",&a,&b) == 2) { if( a == 0 && b == 0)break; if( a < b)swap(a,b);
2016-09-06 20:59:28
154
原创 poj 2420
#include #include #include #include #include #include #define N 1005 #define eps 1e-8 //搜索停止条件阀值 #define INF 1e99 #define delta 0.98 //温度下降速度 #define T 100
2016-09-06 20:37:20
160
原创 poj 3450
#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define LS 2*i #define RS 2*
2016-09-06 20:21:08
190
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人