水题
关注
分享
扫一扫
WGH_yesterday
这个作者很懒，什么都没留下…
展开
-
zoj 1889
//2588604 2011-07-21 09:08:32 Accepted 1889 C 0 160 ylwh!#include int main(void){ int n, i, j; while(scanf("%d", &n)!=EOF) {原创 2011-07-21 09:07:47 · 714 阅读 · 0 评论 -
zoj 1915
//2588701 2011-07-21 10:44:28 Accepted 1915 C 0 160 ylwh!#include int main(void){ int C, N, i, a[1005], count; float average; s原创 2011-07-21 10:43:31 · 449 阅读 · 0 评论 -
zoj 2001
//2588846 2011-07-21 13:21:22 Accepted 2001 C 0 160 ylwh!#include int fun(int x){ int y=0; while(x) { y=y*10+x%10; x/=10;原创 2011-07-21 13:20:33 · 608 阅读 · 0 评论 -
zoj 2099
//2588897 2011-07-21 13:57:26 Accepted 2099 C 0 160 ylwh!#include int main(void){ int x, y, a1, a2, b1, b2; while(scanf("%d%d",原创 2011-07-21 13:56:22 · 624 阅读 · 0 评论 -
zoj 2208
//2590493 2011-07-22 09:57:31 Accepted 2208 C 0 160 ylwh!#include #include int main(){ int n, i, j, len, x, y; char s[201原创 2011-07-22 09:56:34 · 550 阅读 · 0 评论 -
zoj 2172
//2588943 2011-07-21 14:26:33 Accepted 2172 C 0 160 ylwh!#include int main(){ int n, i, j, ok, t=0; char a[16][26]; wh原创 2011-07-21 14:25:36 · 538 阅读 · 0 评论 -
zoj 2321
//2593353 2011-07-23 15:13:49 Accepted 2321 C 0 160 ylwh!#include #define w "Wide Receiver"#define l "Lineman"#define q "Quarterb原创 2011-07-23 15:13:08 · 535 阅读 · 0 评论 -
zoj 2345
//2593430 2011-07-23 16:04:25 Accepted 2345 C 0 160 ylwh!//2593426 2011-07-23 16:01:54 Presentation Error 2345 C 0 160原创 2011-07-23 16:03:49 · 1321 阅读 · 0 评论 -
zoj 1337
//2587659 2011-07-20 15:22:47 Accepted 1337 C 150 160 ylwh!#include #include int fun(int x, int y){ int i; for(i=2; iy?y:x); i+原创 2011-07-20 15:23:34 · 548 阅读 · 0 评论 -
zoj 2954
//2603407 2011-07-28 14:39:28 Accepted 2954 C++ 20 180 ylwh!//2603398 2011-07-28 14:35:17 Wrong Answer 2954 C++ 20 180原创 2011-07-28 14:40:37 · 751 阅读 · 0 评论 -
zoj 1622
//2588080 2011-07-20 18:07:44 Accepted 1622 C 0 160 ylwh!#include int main(void){ char a[10005]; int n, i, p, q; while(scanf("%原创 2011-07-20 18:06:49 · 528 阅读 · 0 评论 -
zoj 1796
//2588253 2011-07-20 20:59:23 Non-zero Exit Code 1796 C 0 160 ylwh!//2588255 2011-07-20 20:59:50 Accepted 1796 C 0 160原创 2011-07-20 20:59:26 · 659 阅读 · 0 评论 -
zoj 1002
//2588200 2011-07-20 20:11:14 Accepted 1002 C 0 160 ylwh!#include int dxdy[5][3]={ {1,0}, {-1,0}, {0,1}, {0,-1} };char map[5][5],原创 2011-07-20 21:00:13 · 522 阅读 · 0 评论 -
zoj 1813
//2588294 2011-07-20 21:15:38 Accepted 1813 C 0 160 ylwh!#include #define PI 3.1415927int main(void){ float dis, mph, dia, rev,原创 2011-07-20 21:14:42 · 577 阅读 · 0 评论 -
zoj 1365
//2587738 2011-07-20 15:49:58 Wrong Answer 1365 C 0 160 ylwh!//2587796 2011-07-20 16:04:52 Compilation Error 1365 C 0 0 y原创 2011-07-20 16:06:57 · 494 阅读 · 0 评论 -
zoj 1949
//2588723 2011-07-21 11:07:16 Accepted 1949 C 0 160 ylwh!#include int main(void){ int n, i, j, bm[101][101], a, b, c, d; while(s原创 2011-07-21 11:06:16 · 563 阅读 · 0 评论 -
zoj 1110 Dick and Jane
//2605539 2011-07-29 19:58:34 Accepted 1110 C 0 160 ylwh!//2605535 2011-07-29 19:56:29 Wrong Answer 1110 C 0 160 ylwh!//原创 2011-07-29 20:00:10 · 1598 阅读 · 1 评论 -
zoj 1631 The King of the Survives
#include #include //2605663 2011-07-29 21:57:18 Accepted 1631 C++ 0 180 ylwh!//2605650 2011-07-29 21:31:26 Time Limit Exceeded原创 2011-07-29 21:58:37 · 721 阅读 · 0 评论 -
zoj 2405 Specialized Four-Digit Numbers
#include int main(){ int n, i, sum1, sum2, sum3; for(i=2992; i<10000; i++) { sum1 = sum2 = sum3 = 0; n = i; while(n) {原创 2011-07-31 08:53:39 · 643 阅读 · 0 评论 -
zoj 3479 Chinese Zodiac
//2609254 2011-07-31 20:08:14 Accepted 3479 C++ 0 180 ylwh!#include char codes[][10]={"Dragon", "Rabbit", "Tiger", "Ox", "Rat", "Pi原创 2011-07-31 20:08:28 · 790 阅读 · 0 评论 -
zoj 2417 Lowest Bit
#include int main(){ int i, n, ans; for(i=1; i<=100; i++) { ans = 1; n = i; while( !(n%2) ) { ans *= 2; n /=原创 2011-07-31 09:06:50 · 601 阅读 · 0 评论 -
zoj 2971 Give Me the Number
//2609243 2011-07-31 20:05:39 Accepted 2971 C++ 0 180 ylwh!#include #include using namespace std;char codes[][15]={"zero", "one",原创 2011-07-31 20:05:17 · 748 阅读 · 0 评论 -
zoj 3167 Find 7 Faster Than John Von Neumann
//2612468 2011-08-02 20:35:05 Accepted 3167 C 450 160 ylwh!#include #include int main(){ int n, k, m, i, j; int ans[1000]; whi原创 2011-08-02 20:34:57 · 665 阅读 · 0 评论 -
ZOJ 3483 Gaussian Prime
//ylwh ZOJ 3483 Accepted 188 KB 690 ms C++ (g++ 4.4.5) 1331 B 2011-08-04 17:44:00#include #include #include #include #include using na原创 2011-08-04 17:47:11 · 918 阅读 · 0 评论 -
ZOJ 1745 Are We There Yet?
//2615366 2011-08-04 19:16:25 Accepted 1745 C 0 160 ylwh!//2615361 2011-08-04 19:12:41 Presentation Error 1745 C 0原创 2011-08-04 19:17:26 · 553 阅读 · 0 评论 -
ZOJ 2807 Electrical Outlets
//2615566 2011-08-04 21:20:33 Accepted 2807 C 0 160 ylwh!#include int main(){ int n, k, x, sum, i; scanf("%d", &n); while(n--)原创 2011-08-04 21:20:01 · 515 阅读 · 0 评论 -
ZOJ 2388 Beat the Spread!
//2615589 2011-08-04 21:39:04 Accepted 2388 C 0 160 ylwh!//2615587 2011-08-04 21:36:35 Wrong Answer 2388 C 0 160 ylwh!//2615原创 2011-08-04 21:38:57 · 540 阅读 · 0 评论 -
zoj1716 Get Many Persimmon Trees
//2613762 2011-08-03 16:55:55 Accepted 1716 C++ 10 188 ylwh!#include #include #define MAX 101using namespace std;int w, h, n, s,原创 2011-08-03 16:55:29 · 491 阅读 · 0 评论 -
zoj 2164 Hanafuda Shuffle
wa了好多次没、一直找不到原因。后来就在网上搜测试数据，得出一个结论，放弃google吧，zf对google太狠了，果断用bing吧http://www.acm-japan.org/past-icpc/domestic2004/index.html测试数据地址。//2原创 2011-08-04 14:47:24 · 716 阅读 · 0 评论 -
ZOJ 2878 Parking
//2615438 2011-08-04 20:01:36 Accepted 2878 C 0 160 ylwh!#include int main(){ int t, n, min, max, i; int temp; scanf("%d", &t);原创 2011-08-04 20:01:42 · 495 阅读 · 0 评论 -
zoj 1095 Humble Numbers
2614635 2011-08-04 10:07:51 Accepted 1095 C 0 160 ylwh!#include int min(int x, int y){ return x>y?y:x;}int main(){ int n, a[原创 2011-08-04 10:08:22 · 440 阅读 · 0 评论 -
ZOJ 2857 Image Transformation
//2615493 2011-08-04 20:41:07 Accepted 2857 C 10 160 ylwh!//2615488 2011-08-04 20:39:44 Wrong Answer 2857 C 0 160原创 2011-08-04 20:41:45 · 718 阅读 · 0 评论 -
HDOJ 3833 YY's new problem
//4360643 2011-08-08 15:04:56 Accepted 3833 2671MS 224K 804 B C++ ylwh!#include int main(){ int t, n, i, j, k, ans, temp, s[10001]; sca原创 2011-08-08 15:22:29 · 692 阅读 · 0 评论 -
HDOJ 3866 Moonfang's Birthday
4357608 2011-08-08 08:53:29 Accepted 3866 578MS 312K 1259 B C++ ylwh!#include #include #include #include #include using namespace std;原创 2011-08-08 08:53:55 · 493 阅读 · 0 评论 -
ZOJ 1133 & POJ 1142 Smith Numbers
//9105982 ylwh 1142 Accepted 164K 16MS C 573B 2011-08-08 10:16:10//2619082 2011-08-08 10:15:46 Accepted 1133 C 20 160 ylwh!#include原创 2011-08-08 10:19:40 · 578 阅读 · 0 评论 -
HDOJ 3835 R(N)
//4359928 2011-08-08 13:40:09 Accepted 3835 31MS 176K 526 B C ylwh!#include #include int main(){ int n, i, j, counts, p, q; while(scan原创 2011-08-08 13:41:50 · 492 阅读 · 0 评论 -
ZOJ 2812 Quicksum
//2615529 2011-08-04 21:02:16 Accepted 2812 C 0 160 ylwh!#include #include #include int main(){ char s[256]; int sum, i; whil原创 2011-08-04 21:01:37 · 1308 阅读 · 0 评论 -
ZOJ 3179 Calculate With Abacus
//2619034 2011-08-08 08:58:38 Accepted 3179 C 0 160 ylwh!#include #include #include int main(){ int t, i, j, k, x, y, u, flag[1原创 2011-08-08 09:05:54 · 805 阅读 · 0 评论 -
zoj 2883 Shopaholic
//2603599 2011-07-28 16:26:51 Accepted 2883 C++ 50 180 ylwh!#include #include using namespace std;bool cmp(int a, int b){ retur原创 2011-07-28 16:26:37 · 676 阅读 · 0 评论 -
zoj 2892 Wavelet Compression
//2603529 2011-07-28 15:56:55 Accepted 2892 C 220 160 ylwh!//2603528 2011-07-28 15:56:00 Presentation Error 2892 C 210原创 2011-07-28 16:06:02 · 635 阅读 · 0 评论