The Seven Percent Solution
来源:互联网 发布:北京世纪中彩网络诈骗 编辑:程序博客网 时间:2024/05/16 14:32
想复杂了。。。
#include <stdio.h> #include <string.h> #define M 80 int main() { char a[M]; int i; while(gets(a)) { if(a[0] == '#') break; for(i=0;((a[i]!='\0')&&(a[i] != '\n')); i++) { if(a[i]==' ') printf("%%20"); else if(a[i]=='!') printf("%%21"); else if(a[i]=='$') printf("%%24"); else if(a[i]=='%') printf("%%25"); else if(a[i]=='(') printf("%%28"); else if(a[i]==')') printf("%%29"); else if(a[i]=='*') printf("%%2a"); else printf("%c",a[i]); } printf("\n"); } return 0; }
一开始想的是这样的,但是一直出不来结果,不知道是哪里错了,求大神指点。。。
#include<stdio.h>#include<string.h>#define N 80char b[240];int len, length;int fun1(char a, int len){ int n = len; switch(a){ case ' ': a = '0'; len -= 2; break; case '!': a = '1'; len -= 2; break; case '$': a = '4'; len -= 2; break; case '%': a = '5'; len -= 2; break; case '(': a = '8'; len -= 2; break; case ')': a = '9'; len -= 2; break; case '*': a = 'a'; len -= 2; break; default: break; } if(n-len == 2) { b[len] = '\%'; b[len+1] = '2'; b[len+2] = a; } else b[len] = a; len -= 1; return 0;}int main(){ char a[N]; int i=0; while(gets(a)) { len = 0; length = 0; if(a[0] == '#') break; while(a[i] != '\0' ) { if(a[i] == ' '||a[i] == '!'||a[i] == '$'||a[i] == '%' || a[i] == '('||a[i] == ')'||a[i] == '*') len++; length ++; i++; } len = length + 2*len; b[len+1] = '\0'; while(length--) { fun1(a[length], len); } printf("%s\n", b); } return 0;}
- the seven percent solution
- The Seven Percent Solution
- The Seven Percent Solution
- The Seven Percent Solution
- The Seven Percent Solution
- The Seven Percent Solution
- 1530. The Seven Percent Solution
- Sicily1530 The Seven Percent Solution
- HDU2719:The Seven Percent Solution
- POJ3650----The Seven Percent Solution
- HDU_OJ-The Seven Percent Solution
- HDU The Seven Percent Solution
- zoj 2932 The Seven Percent Solution
- poj 3650 The Seven Percent Solution
- poj 3650 The Seven Percent Solution
- ZOJ 2932 The Seven Percent Solution
- hd 2719 The Seven Percent Solution
- hdu1.2.5 The Seven Percent Solution
- 这才是真正的“匈牙利命名法”
- Ajax面试题
- int(Integer) 与 short(Short)
- 无废话SharePoint入门教程一[SharePoint概述]
- UISnapBehavior-动画效果:迅猛移动弹跳摆动
- The Seven Percent Solution
- oracle 模糊查询
- Linux内核中的hash和bucket
- ASP.NET MVC4 IN ACTION学习笔记-第二波
- android charts -- 开源android绘图软件
- 移动终端开发必备知识
- 遇到 oracle11g failed login delay
- (编程基础)void main的误用
- 英语电子词典