online judge
关注
分享
扫一扫
zevolo
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
1002
#include #include int char2int[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,原创 2011-09-09 10:47:33 · 352 阅读 · 0 评论 -
1008
Maya Calendar http://poj.org/problem?id=1008 #include char *maya[19] = { "pop", "no", "zip", "zotz", "tzec", "xul", "yoxkin",原创 2011-09-13 15:32:56 · 397 阅读 · 0 评论 -
1007
DNA Sorting http://poj.org/problem?id=1007 this is ok #include #include struct { char s[51]; int sort; } item[100]; int mai原创 2011-09-13 14:46:08 · 578 阅读 · 0 评论 -
1006
#include int main(int ac, char**av) { int a23 = 28 * 33 * 6; int a28 = 23 * 33 * 19; int a33 = 23 * 28 * 2; int a, b, c, s原创 2011-09-12 15:34:36 · 396 阅读 · 0 评论 -
1001
I will post my answer to poj.org, though they are not best Exponentiation http://poj.org/problem?id=1001 #include #include i原创 2011-09-09 10:44:43 · 402 阅读 · 0 评论 -
1005
#include #define PI 3.1415926 int main(int argc, char **argv) { int n; scanf("%d", &n); float x1, x2; int i = 0; for (i原创 2011-09-12 15:33:27 · 331 阅读 · 0 评论 -
1004
#include int main(int argc, char**argv) { double sum = 0; int n = 12; float in; while (n--) { scanf("%f", &in); sum +原创 2011-09-12 15:32:26 · 333 阅读 · 0 评论 -
1003
#include typedef struct _PAIR { float value; int n; } PAIR; PAIR data[200] = {{0.0, 0}}; int main() { double sum = 0; in原创 2011-09-10 13:38:42 · 450 阅读 · 0 评论 -
1009
The program isn't pass, and the result is RE-- run time error. although it can pass for the example data. I can't find the error. I felt i原创 2011-09-26 14:18:06 · 514 阅读 · 0 评论