- 博客(16)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 ZOJ Problem Set - 2736 Daffodil number
#include #include #include #include using namespace std;int main (){ vector vec; char ss[4]; int num; for (int i = 100; i < 1000; i++) { sprintf (ss , "%d" , i); if (i == (ss[0]-'0')*(
2014-09-20 19:41:26
374
原创 ZOJ Problem Set - 1188 DNA Sorting
#include #include #include using namespace std;bool comp (const string &s1, const string &s2);int main (){ vector vec; int block , n , m; string s; cin>>block; while (block--) { cin>>n
2014-09-20 19:05:50
397
原创 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
409
原创 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
409
原创 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
446
原创 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
456
原创 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
473
原创 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
449
原创 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
645
原创 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
329
原创 ZOJ Problem Set - 1383 Binary Numbers
#include using namespace std;int main(){ int d , n , i , flag; scanf ("%d" , &d); while (d--) { i = 0; flag = 0; scanf ("%d" , &n); while (n > 0) { if (n % 2 == 1) { if (fl
2014-09-18 15:46:10
406
原创 ZOJ Problem Set - 1240 IBM Minus One
#include using namespace std;int main(){ int n; cin>>n; string s; for (int i = 0; i < n; i++) { cin>>s; cout<<"String #"<<i+1<<endl; for (int j = 0; j < s.size(); j++) { if (s[j] !
2014-09-16 21:53:31
295
原创 ZOJ Problem Set - 2812 Quicksum
#include using namespace std;int main (){ char ch; int sum = 0; int i = 1; while (cin.get(ch)) { if (ch == '#') break; if (ch != '\n') { if (ch != ' ') sum += i * (ch - 64); i++;
2014-09-16 21:07:05
501
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人