水题
jiangjiashi
这个作者很懒,什么都没留下…
展开
-
vasya (CF_#206_A)
题意:给定一个数字串,在串的最左边和最右边来回地取数, n,l,r,Ql,Qr分别代表数据长度,取左边时乘以的权值, 取右边时乘以的权值,连续两次取左边加上的额外的值 连续取右边时加上的额外的值。求:使取出的总值最小是多少。做法:直接假设前i个数是用左边法则取的,其余为右边法则取的。 一个一个地原创 2013-10-23 15:01:01 · 715 阅读 · 0 评论 -
BST (P2309)
这道题的关键的地方就是求到最低位最低位:在二进制代码中不为零的最低位。n&-n 即为n的最低位。#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;原创 2012-08-08 19:12:37 · 554 阅读 · 0 评论 -
Grandpa is Famous (P2092)
就是一个排序问题,题意:给出N周,然后每一周会对M个人进行排序。求出所有综合中排名第二的,(有并列情况时按ID号由小到大输出)#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;str原创 2012-08-05 20:09:31 · 550 阅读 · 0 评论 -
Argus (P2051)
#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;struct my{ int id; int t; int tt;} r[10010];bool cmp(my a,my b){ ret原创 2012-08-05 20:38:31 · 484 阅读 · 0 评论 -
Symmetric Order (P2013)
最近什么都不想做,一直没有状态。#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int n;char s[100][44];int main(){ freopen("in.txt","原创 2012-08-05 17:17:34 · 500 阅读 · 0 评论 -
考试松松过(CD1735)
#include#include#include #include#include#include#include#include#include#include#includeusing namespace std; int main(){ int i,j,k; long long n; while (cin>>n) { if (n==0) c原创 2012-06-24 18:54:29 · 896 阅读 · 0 评论 -
只要胆子大(CD1727)
#include#include#include #include#include#include#include#include#include#include#includeusing namespace std; struct my{ int x,y;}go[111];int n;bool cmp(my a,my b){ if (a.x!=b.x原创 2012-06-24 18:42:03 · 1237 阅读 · 0 评论 -
分数加减法(P3979)
#include#include#include #include #include#includeusing namespace std; #define N 6int gcd(int a,int b){ if (a<b) swap(a,b); if (a%b) return gcd(b,a%b); return b;}int main(){原创 2012-05-21 13:27:34 · 605 阅读 · 0 评论 -
Equal Sum Partitions(P3782)
#include#include#includeusing namespace std;int main(){ freopen("in.txt","r",stdin); int i,j,k; int t; scanf("%d",&t); while (t--) { int num; int go[11]; scanf("%d",&num); for (i原创 2012-05-20 17:50:49 · 705 阅读 · 0 评论 -
(快速查找set,map,string)Babelfish(P2503)
注意:string 不等同于char * ..但可以相互赋值。#include#include#include #include#include#include#include#include#include#include#includeusing namespace std; int main(){ int i,j,k; set s;原创 2012-06-08 00:27:24 · 831 阅读 · 0 评论 -
Guessing Game (P2328)
估计再过几天就不会做ACM了,最近也没有什么状态,在无聊的时候还是来水完 我最后几道吧。#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ freo原创 2012-08-08 19:27:49 · 658 阅读 · 0 评论 -
Beat the Spread! (P2301)
超水,直接if 判断#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ int t,sum,d; cin>>t; while (t--)原创 2012-08-08 19:41:33 · 677 阅读 · 0 评论 -
SPIN (P2316)
单纯密码锁#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ freopen("in.txt","r",stdin); int i,j,k; i原创 2012-08-08 20:35:27 · 676 阅读 · 0 评论 -
(强水过) Eqs (P1840)
本来这处题应该是用hash做的,,还是先用直接开数组的方式直接暴过好了。#includeusing namespace std;#define N 31250010short b[N*2];int main(){ int i,j,k; int go[11]; for (i=1;i<6;i++) cin>>go[i]; int a[121]; fo原创 2013-01-12 13:17:11 · 398 阅读 · 0 评论 -
<set> Double Queue (P3481)
就是先用set直接写一个吧,学习学习set。然后再慢慢看看平衡二叉树等等 是怎么写的。#include#include#include#include#include#include#includeusing namespace std;struct my{ int id,v;};set q;bool operator<(my a,my b){ re原创 2013-01-11 22:14:24 · 482 阅读 · 0 评论 -
C. Almost Arithmetical Progression (cf)
因为有重复的数,就让hi[]记录其值。go[]记录值对应的其中一个值的序列号。这样就把具有相同值的数统一起来了。昨天都是对的,今天发现自己提交的又被判成错误了,看来自己随便想的东东还是很容易有各种漏洞啊。自己找了一下,也不知道有什么例子不对的。真不好意思仅供小小的参考#include#include#include#include#inclu原创 2012-12-17 01:11:36 · 1210 阅读 · 3 评论 -
(简单搜索)Blocks (P2363)
这个题就是一个很简单的搜索,我只是想把速度提高了一些,所以我一开始的做法是把给的一个数进行因数分解。把分解出的有多少个质数进行组合搜索,不过也不知道哪里不对,一直没有AC。然后我就用很直白,很暴力的搜索。毫无压力地,还是0MS过的。#include#include#include#include#includeusing namespace std;int原创 2012-10-18 21:29:25 · 483 阅读 · 0 评论 -
Bull Math(P2389)
就是两个比较大的数相乘,用数组就可以解决。不过要注意一下数组存的时候数对应的前后顺序用里的reverse就行了,,#include#include#include#includeusing namespace std;#define N 105int lena,lenb;char a[N],b[N];int na[N],nb[N],ans[N];i原创 2012-09-22 20:32:49 · 356 阅读 · 0 评论 -
(高精度) Octal Fractions (P1131)
注意相乘的求余等的顺序#include#includeusing namespace std;//freopen("C://i.txt","r",stdin);#define N 1000001int n;char s[N];int go[N];int ans[N];int main(){ freopen("C://i.txt","r",stdin);原创 2012-07-30 17:31:49 · 954 阅读 · 0 评论 -
(高精度) Adding Reversed Numbers (P1504)
题意:求两个数相加,,不过先是把加数倒置再相加后再倒置输出。其中不能首尾有0的出现。注意:用一个数来存会出问题,所以我还是开了些数组。还是一次,,,省事了。#include#include#includeusing namespace std;//freopen("C://i.txt","r",stdin);#define N 1001int原创 2012-07-30 18:39:35 · 536 阅读 · 0 评论 -
(高精度) Round and Round We Go (1047)
这样的题对于一次AC来说,,我是多少不容易。#include#includeusing namespace std;//freopen("C://i.txt","r",stdin);#define N 1000int n;char a[N];char b[N];int na[N];int nb[N];int c[N];int main(){ freo原创 2012-07-30 16:32:23 · 521 阅读 · 0 评论 -
Brainman (P1804)
一开始还害得我去用树状数组,结果是错的思路,就是用冒泡排序法就可以了。#include//#includeusing namespace std;//freopen("C://i.txt","r",stdin);#define N 2000008int go[1111];int main(){ freopen("C://i.txt","r",st原创 2012-07-29 17:30:43 · 500 阅读 · 0 评论 -
(超水)Nth Largst Value(p3781)
#include#include#includeusing namespace std;int main(){ freopen("in.txt","r",stdin); int i,j,k; int t; scanf("%d",&t); while (t--) { int num; int go[11]; scanf("%d",&num); for (i原创 2012-05-20 17:49:58 · 1471 阅读 · 0 评论 -
(stack)Rails(P1363)
#include #include#includeusing namespace std;int go[1000000];int main(){ int i,j,k; int n; while (cin>>n,n) { while (true) { cin>>go[0]; if (go[0]==0) break; for (i=1;i<n原创 2012-05-17 21:39:00 · 797 阅读 · 1 评论 -
(杯子倒水问题)Jugs(p1606)
这个看了别人的代码水的。#include#include#include #include#include#includeusing namespace std; int main(){ int i,j,k; int a,b; int n; while (cin>>a>>b>>n) { k=b; b=0; while (b!=n) {转载 2012-06-07 00:33:27 · 1311 阅读 · 0 评论 -
CD1618
//还是WA了。#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int go[10000];int hi[10000];int find(int k){原创 2012-04-28 09:59:39 · 256 阅读 · 0 评论 -
CD1614
//坐标垂直的情况 让我WA了很多次。#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;bool bet(int from,int to,int aim,int f原创 2012-04-28 09:59:02 · 240 阅读 · 0 评论 -
CD1610
没有看仔细题,,WA了先,还。#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ int i,j,k; int go[原创 2012-04-28 09:58:17 · 287 阅读 · 0 评论 -
开门人和关门人(H1234)
忘了// freopen就WA了一次。#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;struct my{ char name[100]; ch原创 2012-04-24 18:47:43 · 987 阅读 · 0 评论 -
A+B(H1228)
当A+B为0时忘break了,#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int num(char c[]){ switch (c[0]) {原创 2012-04-24 17:26:08 · 498 阅读 · 0 评论 -
排名(H1236)
还是要注意细节。#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;struct my{ char name[100]; int s;}s原创 2012-04-24 18:31:13 · 918 阅读 · 0 评论 -
Least common multiple(H1019)
//其实用int就已经够用了,#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;long long lcm(long long i,long long j){ i原创 2012-04-26 13:00:02 · 399 阅读 · 0 评论 -
digitroots(H1013)
体会,数据大。要用string#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ int i,j,k; string go;原创 2012-04-24 16:45:11 · 307 阅读 · 0 评论 -
简易版最短距离(H2083)
这个题被坑了,,原点得选某一个朋友的家。#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int go[100002];int main(){原创 2012-04-25 10:28:17 · 381 阅读 · 0 评论 -
CD1608
上次没有做出来,这种题还是要分各种小情况仔细讨论的。#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int main(){ int i,j,k;原创 2012-04-28 09:57:31 · 492 阅读 · 0 评论 -
CD1611
//没有想仔细,,WA了几次。还好,#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;int get(int a,int b){ if (a>b)原创 2012-04-28 10:00:31 · 378 阅读 · 0 评论 -
CD1619
//自己又没有理解到题意,认为用过的人就不能用了,我怎么能这样,其中也出各种问题。#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;struct my{原创 2012-04-28 10:01:12 · 355 阅读 · 0 评论 -
Primary Arithmetic(P2562)
// KMP算法#include#include#include#include#include#includeusing namespace std;char s[2000000];int go[2000000];int main(){ //freopen("fuck.txt","r",stdin); int i,j,k; int a,b; wh原创 2012-05-17 11:16:28 · 858 阅读 · 0 评论 -
Tex Quotes(P1488)
#include#include#include#include#include#includeusing namespace std;int main(){ //freopen("fuck.txt","r",stdin); int i,j,k; int c,q=1; while ((c=getchar())!=EOF) { if (c=='"')原创 2012-05-17 10:11:29 · 387 阅读 · 0 评论 -
WERTYU(p2538)
#include#include#include#include#include#includeusing namespace std;char *s = "'1234567890-=QWERTYUIOP[]\\ASDFGHJKL;'ZXCVBNM,./";int main(){ //freopen("fuck.txt","r",stdin); int i,j,k;原创 2012-05-17 10:04:17 · 689 阅读 · 0 评论