OI
CKSteven
这个作者很懒,什么都没留下…
展开
-
我的笔记
详见https://onedrive.live.com/view.aspx?resid=C86D8FDF290140BE!618&app=OneNote&wdo=2&authkey=!AMS0B0rEg-K7E_0原创 2014-04-13 18:59:33 · 838 阅读 · 0 评论 -
UVa 401 - Palindromes
【问题描述】判断字符串是否回文或者“镜像”。原创 2014-06-13 00:07:27 · 518 阅读 · 0 评论 -
UVa 488 - Triangle Wave
13524184488Triangle WaveAcceptedANSI C0.3452014-04-20 13:25:25【问题描述】输出所要求的“三角形波”。原创 2014-04-20 21:34:10 · 703 阅读 · 0 评论 -
UVa 414 - Machined Surfaces
13520498414Machined SurfacesAcceptedANSI C0.0092014-04-19 15:52:55#include#includeint main(){ int n; while(scanf("%d",&n)==1){ int i,j,num[n],sum=0,max=-1;原创 2014-04-19 23:57:50 · 588 阅读 · 0 评论 -
UVa 445 - Marvelous Mazes
#include#includeint main(){ char c; int num=0,i; while((c=getchar())!=EOF){ if(isdigit(c)) num+=c-48; else if(isalpha(c)||c=='*'){ if(c!='b') for(i=1;i<=num;i++) putchar(c);原创 2014-04-20 18:31:16 · 627 阅读 · 0 评论 -
UVa 490 - Rotating Sentences
#include#include#define MAXN 100+10char s[MAXN][MAXN];int main(){ int n=0,i,j,maxl=0; memset(s,' ',sizeof(s)); while(fgets(s[n++],MAXN,stdin)) if(strlen(s[n-1])>maxl) maxl=strlen(s[n-1]);原创 2014-04-20 13:41:40 · 761 阅读 · 0 评论 -
UVa 494 - Kindergarten Counting Game
13518357494Kindergarten Counting GameAcceptedANSI C0.0092014-04-19 05:48:16原创 2014-04-19 13:57:53 · 732 阅读 · 0 评论 -
UVa 457 - Linear Cellular Automata
13583110457Linear Cellular AutomataAcceptedANSI C0.0122014-05-03 21:48:27原创 2014-05-03 22:00:50 · 646 阅读 · 0 评论 -
UVa 694 - The Collatz Sequence
13582659694The Collatz SequenceAcceptedANSI C0.0352014-05-03 11:59:05原创 2014-05-03 20:11:58 · 521 阅读 · 0 评论 -
UVa 458 - The Decoder
【#include int main(){ char c; while((c=getchar())!=EOF) if(c=='\n') printf("\n"); else printf("%c",c-7); return 0;}原创 2014-04-15 21:29:21 · 874 阅读 · 0 评论 -
UVa 10071 - Back to High School Physics
【题目描述】身为初三学生的我显然没学过高中物理……于是我原创 2014-04-14 21:16:33 · 835 阅读 · 0 评论 -
UVa 10300 - Ecological Premium
#includeint main(){ int n,f; scanf("%d",&n); while(scanf("%d",&f)==1){ int i,a,b,c,sum=0; for(i=1;i<=f;i++){ scanf("%d%d%d",&a,&b,&c); sum+=a*c; } printf("%d\n",sum); } return 0;原创 2014-04-14 23:36:30 · 743 阅读 · 0 评论 -
UVa 10055 - Hashmat the Brave Warrior
UVa1349171010055Hashmat the Brave WarriorAcceptedC++0.7452014-04-13 22:49:28原创 2014-04-13 23:09:08 · 731 阅读 · 0 评论 -
清澄A1052-数的读法
【问题描述】给定一个阿拉伯数字串,你帮他按照中文读写的规范转为汉语拼音字串,相邻的两个音节用一个空格符格开。【原创 2014-08-17 01:18:26 · 864 阅读 · 0 评论