水题
阿龙的圈子
仰望星空 脚踏实地
向前走 永不停
展开
-
蓝桥杯 小模拟
#include using namespace std;#define maxn 105int m, n, x, y, k;char s;int a[maxn][maxn];int cnt;void solve(){ while(cnt++ < k) { if(s == 'U') { if(a[x原创 2015-04-07 14:59:52 · 635 阅读 · 0 评论 -
Rikka with string
Accepts: 395 Submissions: 2281 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionAs we know, Rikka is poor at math. Yuta原创 2015-04-12 17:10:39 · 866 阅读 · 0 评论 -
Flod
#include using namespace std;#define maxn 105#define INF 10000000int n;int d[maxn][maxn];void init(){ for(int i=1; i<=n; i++) for(int j=1; j<=n; j++) d[i][j] = (i==j ? 0 :原创 2015-04-08 19:53:38 · 1088 阅读 · 0 评论 -
蓝桥杯 大臣的旅费
#include using namespace std;#define maxn 1000000 + 10struct edge{ int v, dist;};int n;int index = 1;int M = -1;vectorG[maxn];bool vis[maxn] = {false};void DFS(int u, int dist){原创 2015-04-08 21:26:04 · 665 阅读 · 0 评论 -
POJ 2456 Aggressive cows
#include #include #include #include #include using namespace std;#define maxn 100000int n, m, x[maxn];int Max;bool judge(int d){ int cnt = 1; int a = x[0]; for(int i=1; i<n; i原创 2015-04-15 16:41:18 · 794 阅读 · 0 评论 -
连通图染色
#include using namespace std;#define maxn 1000000 + 10int n, m;int color[maxn];vector G[maxn];bool dfs(int u, int c){ color[u] = c; for(int i=0; i<G[u].size(); i++) { int原创 2015-04-09 11:31:50 · 1001 阅读 · 0 评论 -
线段树水题 #1077 : RMQ问题再临-线段树
#include #include #include #include #include using namespace std;#define maxn 1000000 + 10#define Lson L, mid, root<<1#define Rson mid+1, R, root<<1|1#define INF 0x7ffffffint Min[maxn<<2],原创 2015-05-02 20:26:19 · 962 阅读 · 0 评论 -
离散化 + 线段树
#include #include #include #include #include using namespace std;#define maxn 200000 + 10#define lson L, mid, rt<<1#define rson mid, R, rt<<1|1int X1[maxn], X2[maxn];int n;int lazy[maxn<<原创 2015-05-03 17:27:23 · 595 阅读 · 0 评论 -
水题
#include using namespace std;#define maxn 200 + 10char p1[maxn];int p2[maxn];int n;void solve(){ int len = strlen(p1); reverse(p1, p1+len); memset(p2, 0, sizeof(p2)); int c原创 2015-04-28 11:09:05 · 780 阅读 · 0 评论 -
矩阵快速幂 poj 3070
#include #include using namespace std;const int MOD = 10000;struct Matrix{ int m[2][2];};Matrix Mul(Matrix a, Matrix b){ Matrix tmp; for(int i=0; i<2; i++) for(int j=0;原创 2015-05-02 11:43:17 · 549 阅读 · 0 评论 -
HDU 5199
GunnerTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1323 Accepted Submission(s): 586Problem DescriptionLong long ago, there原创 2015-05-28 10:40:01 · 784 阅读 · 0 评论 -
HDu 5233
#include #include #include #include #include using namespace std;#define maxn 100000 + 10//保存每个高度所包含的位置set S[maxn];int n, m;int len;int h[maxn], t[maxn];void read(){ for(int i=1;原创 2015-05-28 11:56:22 · 727 阅读 · 0 评论 -
HDU 5264
pog loves szh I Accepts: 497 Submissions: 822 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述pog拥有很多字符串,它喜欢将两个长度相等字符串交错拼在一起,如abcd与ef原创 2015-06-10 12:00:08 · 823 阅读 · 0 评论 -
切了几道水题复习
1. poj 1088#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define eps 1e-8#define PI acos(-1.0)#define INF 0x3f3f3原创 2015-08-10 17:39:35 · 638 阅读 · 0 评论 -
topcoders 666
早起切两水:222:class DevuAndGame{ public: int vis[55]; int a[55]; int dfs(int u) { if(u == -1) return 1; vis[u] = 1; int v原创 2015-08-26 11:57:22 · 861 阅读 · 0 评论 -
蓝桥杯 水水搜索
#include using namespace std;#define maxn 10int vis[maxn][maxn] = {0};int cnt = 0;bool judge(int i, int j){ if(i<4 && j<5) return true; return false;}void dfs(int i, int j){ i原创 2015-04-07 17:25:20 · 889 阅读 · 0 评论 -
蓝桥杯 排他平方数
#include using namespace std;#define maxn 999999int mark[20] = {0};int cnt = 0;int main(){ for(int i=203879; i<=maxn; i++) { memset(mark, 0, sizeof(mark)); int tmp = i;原创 2015-04-07 16:43:50 · 1507 阅读 · 0 评论 -
蓝桥杯 分糖果
#include using namespace std;#define maxn 105int a[maxn];int b[maxn];int n;int ans;void solve(){ while(1) { for(int i=1; i<=n; i++) { b[i] = a[i]/2;原创 2015-04-07 15:51:34 · 864 阅读 · 0 评论 -
POJ Goldbach's Conjecture
Language:DefaultGoldbach's ConjectureTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 38074 Accepted: 14647DescriptionIn 1742, Christian Goldbach,原创 2014-10-04 19:49:28 · 485 阅读 · 0 评论 -
HDU 5186
#include using namespace std;int n, b, a[205];char s[205];int main(){ while(scanf("%d%d", &n, &b) != EOF) { memset(a, 0, sizeof(a)); int MAX = 0; for(int i=0; i<原创 2015-03-15 11:06:45 · 952 阅读 · 0 评论 -
codeblocks B - Little Elephant and Numbers
#include using namespace std;#define eps 1e-8int n, a[11];vector v;int main(){ memset(a, 0, sizeof(a)); cin>>n; int m = sqrt(n + 0.5); for(int i = 1; i <= m; i++) if(n % i原创 2015-03-16 09:30:27 · 121 阅读 · 0 评论 -
动态规划小练习
#include using namespace std;#define maxn 105int w[maxn], v[maxn], dp[maxn][maxn * maxn];int W, n;int main(){ while(cin>>n>>W) { memset(dp, 0, sizeof(dp)); for(int i=0原创 2015-03-20 21:31:18 · 489 阅读 · 0 评论 -
hdu 4405
//#include //#include //#include ////using namespace std;//#define maxn 100000+10////int n, m;//bool vis[maxn];//double d[maxn];//int a[maxn];//////double dp(int k)//{//// if(vis[k]原创 2015-03-21 21:10:21 · 665 阅读 · 0 评论 -
POJ Ants
#include using namespace std;#define maxn 1000000+10int pos[maxn], L, n, T;int mi, ma;int main(){ cin>>T; while(T--) { cin>>L>>n; for(int i=0; i<n; i++) c原创 2015-03-12 17:22:25 · 534 阅读 · 0 评论 -
每天水一水 水水更健康
#include using namespace std;typedef struct Node{ int num; struct Node *next;}LinkList;LinkList* create(int n){ LinkList *p, *q, *head; head = p = (LinkList *)malloc(sizeof(Li原创 2015-04-02 22:03:20 · 583 阅读 · 0 评论 -
每天水一水 Crazy Rows (2009 Round2 A) GCJ
#include using namespace std;#define maxn 10000 + 10int M[maxn][maxn];int mark[maxn];int n, m;int solve(){ int ans = 0; for(int i=1; i<=n; i++) { int pos = -1;原创 2015-04-01 17:32:18 · 926 阅读 · 0 评论 -
每天水一水 水水更健康
///设定停车场有(Size)个车位///有趣///同学们要是参考的话麻烦改一下 这个是要交作业的 如有雷同 如何是好? #include using namespace std;int n;int Size = 5;typedef struct Car{ int num; time_t time; int price;} CarNode;type原创 2015-04-04 16:10:25 · 829 阅读 · 0 评论 -
HDU 1232
#include #include #include #include #include using namespace std;#define maxn 1000 + 10int p[maxn], n, m;//bool mark[maxn];//int Rank[maxn];void init(){ for(int i=1; i<=n; i++) p原创 2015-04-10 21:52:41 · 633 阅读 · 0 评论 -
递归 八皇后复习
#include using namespace std;#define maxn 20int map[maxn][maxn];bool vis[3][2*maxn];int ans, C[maxn];int N;int tot;void print(){ printf("第%d种摆放方法: ", ++tot); for(int i=0; i<N; i++)原创 2015-04-04 19:48:22 · 660 阅读 · 0 评论 -
KMP 水水
#include #include #include #include #include using namespace std;#define maxn 400000 + 10int len, next[maxn], cnt = 0;int L;string s1, s;void getnext(){ int i = 0; int j = -1;原创 2015-04-10 17:40:28 · 619 阅读 · 0 评论 -
HDU 1232 另外一种写法
#include #include #include #include #include #include using namespace std;#define maxn 1000 + 10int n, m;vectorG[maxn];int cnt ;bool vis[maxn];void DFS(int u){ vis[u] = true;原创 2015-04-10 22:14:03 · 549 阅读 · 0 评论 -
BC 水水就好
#include #include #include #include using namespace std;#define maxn 10char s[maxn];bool solve(){ int len = strlen(s); int tmp = len/3; if(len % 3) return fa原创 2015-04-06 11:22:01 · 494 阅读 · 0 评论 -
Codeforces Bayan Bus
A. Bayan Bustime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe final round of Bayan Programming Contest w原创 2014-10-05 22:13:35 · 724 阅读 · 0 评论