![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Zju
文章平均质量分 52
s916408679
这个作者很懒,什么都没留下…
展开
-
zju1115数字根Digital Root?
这个是在网上搜的,可惜提交也是WA,而且我还看不懂 #include int main() { freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); int i, n; char digit[1023]; while (1) { gets(digit); for (n = 0, i = 0; dig原创 2010-10-13 16:03:00 · 364 阅读 · 0 评论 -
zju1763一个简单的化学问题A Simple Question of Chemistry
用时:0ms #include int main() { freopen("in.in","r",stdin); freopen("out.out","w",stdout); float f1,f2; scanf("%f",&f1); if(f1==999.00) { printf("End of Output/n");//puts() return 0;原创 2010-10-21 12:35:00 · 640 阅读 · 0 评论 -
zju2830剑术冠军Champion of the Swordsmanship
用时:0ms #include int main() { freopen("2830.txt","r",stdin); freopen("output.txt","w",stdout); int n,d,m,sum; while(scanf("%d",&n)!=EOF) { sum=0; if(n==0) break; while(1)原创 2010-10-25 07:11:00 · 738 阅读 · 0 评论 -
zju2850漂亮的草坪Beautiful Meadow
用时:0ms #include #define ROW 10 #define Line 10 int main() { freopen("2850.txt","r",stdin); freopen("output.txt","w",stdout); int n,m,i,j,flag; int num[ROW][Line]; while(scanf("%d %d",&n,&m)==2) {原创 2010-10-25 07:14:00 · 393 阅读 · 0 评论 -
zju2807电源插座Electrical Outlets
用时:0ms #include #define MAX 10 //ok~ int main() { freopen("2807.txt","r",stdin); freopen("output.txt","w",stdout); int n,k,i,j,sum,num; scanf("%d",&n); for(i=0;i原创 2010-10-25 09:15:00 · 398 阅读 · 0 评论 -
zju2857图像转换Image Transformation
用时:0ms #include #define MAX 100 //ok~ int main() { freopen("2857.txt","r",stdin); freopen("output.txt","w",stdout); int n,m,i,j,k,mark=1; int r[MAX][MAX],g[MAX][MAX],b[MAX][MAX]; while(scanf("%d %d",&n,&m)==2)原创 2010-10-25 09:21:00 · 309 阅读 · 0 评论 -
zju2772快速找零Quick Change
没什么好说的,又是摔在格式上,字母都打错了,看来还是老老实实从网页上复制吧。 用时:0ms #include //ok~ int main() { freopen("2772.txt","r",stdin); freopen("output.txt","w",stdout); int n,i,c,mark=0,d,d1,d2; scanf("%d",&n); for(i=0;i原创 2010-10-27 00:40:00 · 398 阅读 · 0 评论 -
zju1251砖盒Box of Bricks
最近太挫了,老是不注意格式。 用时:0ms #include #define MAX 110 //ok~ int main() { freopen("1251.txt","r",stdin); freopen("output.txt","w",stdout); int n,num[MAX],i,sum,count,flag=0; while(scanf("%d",&n)==1) { fl原创 2010-10-27 00:31:00 · 361 阅读 · 0 评论 -
zju1241简化几何计算Geometry Made Simple
当一道WA了很多次的题AC了之后,我想说,我恨死空格了!! 用时:0ms #include #include int main() { freopen("1241.txt","r",stdin); freopen("output.txt","w",stdout); float a,b,c; int order=0; while(scanf("%f%f%f",&a,&b,&c)==3) {原创 2010-10-27 00:35:00 · 276 阅读 · 0 评论 -
zju2947缩写Abbreviation
好几天都没做题了~ 用时:0ms #include #include #define MAX 6 //ok~ int main() { freopen("2947.txt","r",stdin); freopen("output.txt","w",stdout); int t,i,n,m,j,k; char name[MAX][10]; char s[100]; scanf("%原创 2010-11-05 02:06:00 · 445 阅读 · 0 评论 -
zju2886看和说Look and Say
当我把数组的1000改为1001时,天啊,竟然……竟然……AC了~ 时间也算快吧。不过我看见一个高手是10ms。真是…… 用时:90ms #include #define MAX 1001 int main() { freopen("2886.txt","r",stdin); freopen("output.txt","w",stdout); char s[MAX]; char *p; char c;原创 2010-11-05 02:32:00 · 317 阅读 · 0 评论 -
zju2932七个百分比编码The Seven Percent Solution
用时:0ms #include #include #define MAX 80 char s[MAX]; void changeChar(char *c); int main() { freopen("2932.txt","r",stdin); freopen("output.txt","w",stdout); int i; while(gets(s)!=NULL)//gets()的参数必须为数组?原创 2010-10-21 12:24:00 · 374 阅读 · 0 评论 -
zju1295 反转文本Reverse Text
用时:0ms #include #include int main() { freopen("1295.txt","r",stdin); freopen("output.txt","w",stdout); int n,i,j; char s[100]; scanf("%d/n",&n); for(i=0;i原创 2010-10-21 11:13:00 · 298 阅读 · 0 评论 -
zju1392曾经最难的问题The Hardest Problem Ever
用时:0ms #include #include #define START "START" #define END "END" #define ENDOFINPUT "ENDOFINPUT" #define MAX 300 int main() { freopen("1392.txt","r",stdin); freopen("output.txt","w",stdout); char s[MAX]; int原创 2010-10-21 11:19:00 · 295 阅读 · 0 评论 -
zju1240 IBM减一 IBM Minus One
投机取巧,今天啊先把简单的提交提交。 用时:0ms #include int n; int main() { freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); int i; char c; scanf("%d/n",&n); for(i=1;i原创 2010-10-13 08:35:00 · 477 阅读 · 0 评论 -
zju2723半素数?
提交之前看了一下提示,我就知道会超时。不过,第一次在浙大提交,试试再说,然后,果不失望:超时1ms 。 用时:1001ms #include #define MAX 1000000 int num[MAX]; void getPrime() { int i,j,k; num[0]=2; num[1]=3; k=1; for(i=5;i原创 2010-10-13 15:29:00 · 469 阅读 · 0 评论 -
zju2736水仙花数
这道题……我也不明白为什么会放在一堆难一点题中间,大概是英文意思不好理解?不晓得不晓得……做这么久,还是第一次这么快。 用时:0ms #include #include int main() { freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); int n; while(scanf("%d",&n)==1) {原创 2010-10-13 15:37:00 · 228 阅读 · 0 评论 -
zju1383二进制数Binary Numbers
这道题格式要求太严了,每行的最后不能有空格,提交了两次才AC,用个标志变量就可以解决了。而且,好奇怪啊,是不是在浙大提交成功了都是这么快呢,大概巧合。 用时:0ms #include int d,n; int main() { freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); int i,j,k; scanf("%d",&d);原创 2010-10-13 16:25:00 · 280 阅读 · 0 评论 -
zju2136最长上升子序列Longest Ordered Subsequence
这是经典动态规划,终于终于啊~ 用时:0ms #include #define MAX 1500 typedef struct Info { int index; int a; int length; }Info; Info num[MAX]; int main() { freopen("input.txt","r",stdin); freopen("o原创 2010-10-17 08:14:00 · 1174 阅读 · 0 评论 -
zju2828漂亮数Beautiful Number
总算对了一个,我的打击啊~ 用时:0ms #include #define MAX 100000 int num[MAX]; int n; int main() { freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); int i,j,k; num[1]=3; num[2]=5; j=2; k原创 2010-10-17 09:07:00 · 369 阅读 · 0 评论 -
zju2417最低位Lowest Bit
今天终于明白什么是compilation error了,原来我太爱写注释了,不能提交带中文的东西啊。这道题不必把它的二进制先计算出来,只计算一部分即可。用十进制不断除2,到余数是1就终止。 用时:0ms #include #include int a; int main() { int i,t; while(scanf("%d",&a)==1) { if(a==0) ret原创 2010-10-18 09:39:00 · 254 阅读 · 0 评论 -
zju2812 Quicksum
这是一次读入一个字符的方法。 用时:0ms #include int main() { freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); char c; int sum=0,i=1; while(c=getchar()) { if(c=='#') break;原创 2010-10-20 08:48:00 · 357 阅读 · 0 评论 -
zju2201不费脑筋No Brainer
用时:0ms #include int n,x,y; int main() { freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); int i; scanf("%d",&n); for(i=0;i=y) printf("MMM BRAINS/n"); else printf("NO原创 2010-10-18 09:45:00 · 249 阅读 · 0 评论 -
zju2060又是斐波那契数列Fibonacci Again
这道题越界的可能性好像不小,所以一定要注意。 第一种思路: 先对3取余,存储余数表,肯定不会越界。 用时:10ms #include #define MAX 1000000 int num[MAX]; int main() { freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); int i,n; num[0]=7%3; num[1原创 2010-10-18 09:49:00 · 321 阅读 · 0 评论 -
zju2478编码Encoding
几乎和2886没差别,犯得错也一模一样,唉~ 用时:0ms #include #define MAX 101 //ok~ int main() { freopen("2478.txt","r",stdin); freopen("output.txt","w",stdout); int n,i,j,k,count; char s[MAX],c; scanf("%d/n",&n); for(i=0;i原创 2010-11-05 02:56:00 · 343 阅读 · 0 评论