简单题
还是2一点好
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
ZOJ Problem Set - 2932 The Seven Percent Solution
#include #include using namespace std; string toChange (char ch); int main () { char ss[80]; string s; while (cin.getline(ss,80)) { if (ss[0] == '#') break; for (int i = 0; ss[i] != '\0';原创 2014-09-18 19:31:42 · 507 阅读 · 0 评论 -
ZOJ Problem Set - 2947 Abbreviation
#include #include using namespace std; int main() { int T , N , temp , flag; char word[6]; string s; cin>>T; while (T--) { flag = 1; cin>>N; for (int i = 0; i < N; i++) { cin>>s;原创 2014-09-18 18:45:03 · 685 阅读 · 0 评论 -
ZOJ Problem Set - 1115 Digital Roots
#include using namespace std; int summing(int n); int main () { string s; int sum; while (cin>>s) { if (s == "0") break; sum = 0; for (int i = 0; i < s.size(); i++) //第一次把所有的位数相加可能运算量很大原创 2014-09-18 20:22:02 · 541 阅读 · 0 评论 -
ZOJ Problem Set - 1241 Geometry Made Simple
#include #include int main () { int a , b , c; int step = 0; while (scanf("%d%d%d", &a , &b , &c) != 0) { if (a == 0 && b == 0 && c == 0) break; step++; printf ("Triangle #%d\n" , step);原创 2014-09-19 15:33:24 · 511 阅读 · 0 评论 -
ZOJ Problem Set - 1295 Reverse Text
#include #include using namespace std; int main () { int n; char ss[71]; string s; cin>>n; cin.get(); //吸收一个'\n',不然会影响到cin.getline() while (n--) { cin.getline(ss,71); s = ss; //讲字符数组赋值给原创 2014-09-19 15:53:56 · 481 阅读 · 0 评论 -
ZOJ Problem Set - 2857 Image Transformation
#include using namespace std; int main () { int N , M , step = 0; while (cin>>N>>M) { if (N == 0 && M == 0) break; int nn[3][N][M]; int result[N][M]; step++; for (int num = 0; num < 3;原创 2014-09-20 12:33:43 · 463 阅读 · 0 评论 -
ZOJ Problem Set - 2850 Beautiful Meadow
#include using namespace std; int main () { int N , M; bool flag; while (cin>>N>>M) { if (N == 0 && M ==0) break; char nn[N][M]; flag = false; for (int i = 0; i < N; i++) { for (int原创 2014-09-20 15:01:20 · 459 阅读 · 0 评论 -
ZOJ Problem Set - 2478 Encoding
#include #include using namespace std; int main () { int N , i , count; string s; char temp; cin>>N; while (N--) { i = 0; cin>>s; while (i < s.size()) { count = 0; temp = s[i];原创 2014-09-18 16:06:33 · 374 阅读 · 0 评论
分享