高精度运算
冰阔落
Stay hungry, Stay foolish, Stop when you are perfect.
展开
-
UVA 10494 (暑假-高精度 -D - If We Were a Child Again)
#include #include #include int main() { char str_1[10001], op; long Max; while (scanf("%s %c%ld", str_1, &op, &Max) != EOF) { printf("%s %c %ld\n", str_1, op, Max); if (op == '/') print原创 2014-07-28 15:30:22 · 1660 阅读 · 0 评论 -
UVA 465 (暑假-高精度 -B - Overflow)
#include #include #include int main() { int Max = 2147483647; char str_1[10001], str_2[10001], op; while (scanf("%s %c %s", str_1, &op, str_2) != EOF) { printf("%s %c %s\n", str_1, op, s原创 2014-07-28 11:21:12 · 1602 阅读 · 0 评论 -
UVA 10106 (暑假-高精度-A - Product)
#include #include const int Max = 1000; int main() { char str_1[Max], str_2[Max]; memset(str_1, 0, 1000); memset(str_2, 0, 1000); while (gets(str_1)) { gets(str_2); int count = 0; int原创 2014-07-10 00:03:57 · 1487 阅读 · 0 评论 -
UVA 748 (暑假-高精度-C-Exponentiation)
#include #include #include const int Max = 1000; int main () { char str_1[Max];// str_2[Max]; memset(str_1, 0, 1000); // memset(str_2, 0, 1000); int n; while (scanf("%s%d", str原创 2014-07-09 23:59:43 · 1567 阅读 · 0 评论 -
UVA 424 Integer Inquiry
#include #include int main() { char str_1[120], sum[200] = {0}; while (gets(str_1)) { char str[120] = {0}; int len = strlen(str_1); if (len == 1 && str_1[0] == '0') break; for (int i =原创 2014-07-28 10:45:44 · 1612 阅读 · 0 评论