Programming
文章平均质量分 69
chocolate_22
这个作者很懒,什么都没留下…
展开
-
sicily 1818 成绩转换
<br />//刚开始用结构体数组做的,超时了...这个程序是参考别人的,不是本人原创。//就当做是学习下map的用法吧!哎,觉得自己太水了....// source code of submission 764202, Zhongshan University Online Judge System#include<iostream>#include<string>#include<map>using namespace std;void print(int n){原创 2011-05-13 12:52:00 · 1189 阅读 · 0 评论 -
sicily 1625 Binary Clock
<br />蛮简单的一道题,10进制转2进制,然后数组操作就OK了.....<br /> <br />// source code of submission 734146, Zhongshan University Online Judge System#include <iostream>#include <cstring>#include <cstdio>using namespace std;int main(){ int n,i,j,h,m,s; i原创 2011-04-22 12:12:00 · 499 阅读 · 0 评论 -
sicily 1394 Root of the Problem
<br />这道题理解了题意应该就很简单了吧..我用的是枚举,同时利用了指数函数的单调递增性,一旦试到某个A的N次方减去B大于当前的min值,就跳出循环,因为就算继续下去,只会得到更大的AN -B。<br /> <br /> <br />// source code of submission 733659, Zhongshan University Online Judge System#include <iostream>#include <cmath>using namespace std原创 2011-04-22 10:59:00 · 714 阅读 · 0 评论 -
sicily 1006 Team Rankings
01.// source code of submission 731830, Zhongshan University Online Judge System 02.#include 03.#include 04.#include 05.usingnamespacestd; 06. 07.intfind(charx,charstr[]) //寻找字符在指定字符串中的位置 08.{ 09. intindex; 10. for(inti =原创 2011-04-21 13:11:00 · 1076 阅读 · 0 评论 -
sicily 1014 Specialized Four-Dig
<br />// source code of submission 721460, Zhongshan University Online Judge System#include <stdio.h>#include <string.h>void conversion(int num,char s2[],long d2){ long i,j,t; char c; i=0; while(1) { t=num%d2;原创 2011-04-21 14:01:00 · 721 阅读 · 0 评论 -
sicily 1153 马的周游问题
解法一: // source code of submission 799182, Zhongshan University Online Judge System#include #include #include #include using namespace std;int dir[8][2] = {-2,1,-1,2,1,2,2,1,2,-1,1,-2原创 2011-06-11 20:52:00 · 1078 阅读 · 0 评论 -
sicily 1372 Bovine Latin
这道题还是比较简单的,就当做复习C++ 的string用法好了..// source code of submission 733589, Zhongshan University Online Judge System#include #include using namespace std;int main(){ string s; int n,i,len; cin>>n; while(n--) { cin原创 2011-04-22 10:50:00 · 562 阅读 · 0 评论 -
sicily 1491 Look and Say
<br />简单题.....<br /> <br /> <br />// source code of submission 733747, Zhongshan University Online Judge System#include <iostream>#include <string>using namespace std;int main(){ int n,i,num; string s; cin>>n; while(n--)原创 2011-04-22 11:01:00 · 496 阅读 · 0 评论 -
sicily 1046 Plane Spotting
<br />// source code of submission 722250, Zhongshan University Online Judge System#include <iostream>#include <algorithm>using namespace std;struct node { float p_air; //某个时间段里的平均飞机数 int first; //时间段起点 int last; //时间原创 2011-04-21 14:06:00 · 1297 阅读 · 0 评论 -
sicily 1624 Cryptoquote
<br />很简单的一道题,只是这里输入的字符串包含空格,因此要用到getline或则gets,而不能用scanf("%s",str)。。。。。<br /> <br />// source code of submission 737435, Zhongshan University Online Judge System#include <iostream>#include <cstdio>#include <cctype>#include <string>using namespac原创 2011-04-25 16:16:00 · 450 阅读 · 0 评论 -
sicily 1685 Missile
<br />刚开始对题意理解错误,wa了几次....<br /> <br />// source code of submission 737521, Zhongshan University Online Judge System#include <iostream>using namespace std;int main(){ int n,i,j,mis[1006]; while(cin>>n,n) { int max = 1;原创 2011-04-25 16:25:00 · 703 阅读 · 0 评论 -
sicily 1150 简单魔板
//这里用到的方法很暴力,就是直接的BFS;//仅能过1150而已,就当做练习下BFS啦// source code of submission 804105, Zhongshan University Online Judge System#include #include #include using namespace std;struct status原创 2011-06-14 14:15:00 · 3436 阅读 · 1 评论 -
sicily 2002 Feeding Time
#include #include #include using namespace std;int row,col;int vis[1000][1000],farm[1000][1000];int dir[8][2] = { {-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1} };//移动的方向struct原创 2011-06-18 16:14:00 · 903 阅读 · 0 评论 -
sicily 1752 选择
<br />最近一直都在做水题找自信中,嘿嘿....<br /> <br />// source code of submission 743067, Zhongshan University Online Judge System#include <iostream>#include <cstring>#include <algorithm>using namespace std;int prime(int a[],int n) //筛法素数原创 2011-04-30 16:10:00 · 762 阅读 · 0 评论 -
sicily 1390 Surprising Strings
<br />这道题其实也不是很难,只是有些小细节需要注意而已,刚开始想着用C++的string类型,后来想到都是取出字符中的两个字符而已,就想到了用数组了,嘿嘿...<br /> <br />// source code of submission 758043, Zhongshan University Online Judge System#include <iostream>#include <cstdio>#include <cstring>int main(){ in原创 2011-05-08 22:37:00 · 724 阅读 · 0 评论 -
sicily 1152 简单的马周游问题
解法一:// source code of submission 799172, Zhongshan University Online Judge System#include #include #include #include using namespace std;int dir[8][2] = {-2,1,-1,2,1,2,2,1,2,-1,1,-2,-1原创 2011-06-11 20:49:00 · 1244 阅读 · 0 评论 -
sicily 1137 河床
<br />// source code of submission 733540, Zhongshan University Online Judge System#include <iostream>#include <algorithm>using namespace std;int depth[30006],a[30000];int max_dis(int a [],int t) //求某个区间内最大数与最小数之差 {原创 2011-04-21 19:55:00 · 712 阅读 · 0 评论 -
sicily 1934移动小球
这道题在刘汝佳的《算法竞赛入门经典》里面有讲,之前用vector,超时!参考了别人的程序以后才AC,要注意输出语句的写法,以下是该题的算法(非原创)。// source code of submission 733152, Zhongshan University Online Judge System//这道题解强调小球之间的相对顺序,而非绝对顺序;//我们定义了结构体node,并用left,right来表示小球i的左边和右边小球的编号。//移动的过程分为两步:把小球X逸出序列;把X重新插入序原创 2011-04-21 15:36:00 · 1950 阅读 · 1 评论 -
sicily 1122 Prerequisites?
<br />solution 1:<br /> <br />// source code of submission 765531, Zhongshan University Online Judge System#include <iostream>#include <vector>#include <algorithm>using namespace std;int main(){ int k,m,i,j,cour_num,flag; //co原创 2011-05-16 12:52:00 · 503 阅读 · 0 评论 -
sicily 1201 01000001
<br />// source code of submission 757941, Zhongshan University Online Judge System#include <iostream>#include <cstring>#include <cstdio>#include <malloc.h>void add(char a[],char b[],char back[]){ int i,j,k,up,x,y,z,l; char *c; i原创 2011-05-16 12:58:00 · 965 阅读 · 0 评论 -
sicily 2401 Judges' Time Calculation
<br />// source code of submission 757803, Zhongshan University Online Judge System#include <iostream>using namespace std;int main(){ int H,M,SH,SM,DH,DM,EH,EM; int n,i,cnt; cin>>n; while(n--) { cin>>SH>>SM>>DH>>原创 2011-05-16 13:00:00 · 465 阅读 · 0 评论 -
sicily 2382 Flowers Flourish from France
<br />// source code of submission 744571, Zhongshan University Online Judge System#include <iostream>#include <string>#include <vector>#include <cctype>using namespace std;int main(){ string s,sub_str; int mark,flag,i; while原创 2011-05-16 13:03:00 · 645 阅读 · 0 评论 -
sicily 1177 Take Your Vitamins
<br />感觉题目蛮无聊的....<br /> <br />// source code of submission 767064, Zhongshan University Online Judge System#include <iostream>#include <cstdio>#include <cstdlib>#include <string>using namespace std;struct node{ float a,r,ratio; s原创 2011-05-17 10:24:00 · 585 阅读 · 0 评论 -
sicily 1780 Faulty Odometer Again
<br />// source code of submission 766858, Zhongshan University Online Judge System#include <cstdio>#include <cstring>int change(int a){ if(a==3||a==4) return a-1; else if(a==6||a==7) return a-2; else if(a==9)原创 2011-05-17 10:28:00 · 774 阅读 · 0 评论 -
sicily 1035 DNA matching
//刚开始误以为输入的链长都是相同的,导致WA了半天,郁闷!//也正因为输入的链长是不一致的,所以对于输入我们用动态处理的方式去处理,而不是全部输入后再统计#include #include #include using namespace std;int main(){ int test,n,i,ix; cin>>test; while(test--) { cin>>n; int count = 0; set Set; for(i =原创 2011-05-20 21:09:00 · 1545 阅读 · 0 评论 -
sicily 1206. Stacking Cylinders
<br />解题思路:<br />(学习了别人的方法,原文地址http://hi.baidu.com/watermoon_littlegui/blog/item/ce42cfecd2c20edcb21cb1d6.html):<br />同一层每相邻两个可求出上一层的其中一个<br /> 直到只剩下一个即是最顶层的那个<br /> 知道两点坐标和三边长度(其中两边相等),求第三点的坐标。<br /> 如图:<br />已知A、B点坐标以及AC=BC=2,求C点的坐标。 <br /> <br />作辅助线AD垂原创 2011-05-21 19:00:00 · 1417 阅读 · 0 评论 -
sicily 1020 Big Integer
这里要利用到公式:(a+b) mod (n) = (a mod n) + (b mod n) mod (n);把大整数写成自左向右的形式:1234 = ((1*10+2)*10+3)*10+4,然后利用前面这个公式,每步取模,算法如下:#include #include using namespace std;int main(){ int test,n,i,k,ans,temp; int bas[106],res[106]; char oper[600];原创 2011-05-31 20:56:00 · 1402 阅读 · 0 评论 -
关于同余与模运算的总结
123456789*987654321 = ()A: 121932631112635266 B: 121932621112635267C: 121932631112635268 D: 121932631112635269解答: 利用公式(ab)mod n = (a mod n)(b mod n)mod n,可以得到 123456789原创 2011-05-31 21:55:00 · 8314 阅读 · 0 评论 -
sicily 1021 couples
<br />// source code of submission 781937, Zhongshan University Online Judge System#include <iostream>#include <cstring>#include <stack>using namespace std;int couple[200020];int main(){ int n,i,a,b; while(cin>>n,n) {原创 2011-05-31 20:58:00 · 1577 阅读 · 1 评论 -
sicily 1231 The Embarrassed Cryptography
这道题主要用到了一个筛法求素数,大数的模运算,以及暴力搜索的方法.....题意比较简单,关键要注意到大数的模运算问题!// source code of submission 784557, Zhongshan University Online Judge System#include #include #include using namespace std;int prime(int a[],int n) //筛法求n以内的素数{ int原创 2011-05-31 23:33:00 · 1605 阅读 · 0 评论 -
sicily 1172 Queens, Knights and Pawns
<br />#include <iostream>#include <cstdio>#include <cstring>using namespace std;struct node { int vis; int has; } board[1200][1200];int Q[120][2],K[120][2],P[120][2];int main(){ int row,col,q_num,k_num,p_num,i,j,k,Case = 1;原创 2011-06-02 11:45:00 · 853 阅读 · 0 评论 -
sicily 1099 Packing Passengers
<br /> //t的值要使得costA * x + costB * y 最小,如果有多个值,则取令x最大的t //上式子可以改写成(x+(capB/gcd)*t)*costA+(y-(capA/gcd)*t)*costB ==> ((costA*capB-capA*costB)*t)/gcd + capA * x + capB*y////于是,当costA*capB-capA*costB<0,t应取最大值; 当costA*capB-capA*costB>0,t应取最小值;//当costA*ca原创 2011-06-01 16:14:00 · 991 阅读 · 0 评论 -
sicily 1783 Large is Better
题目不难,但是有些细节还是要注意的.....很容易wrong answer,如果你碰到WA,试试123012400198和1234这两个测试用例吧! // source code of submission 766632, Zhongshan University Online Judge System#include #include #include using namespa原创 2011-05-16 12:47:00 · 1250 阅读 · 2 评论