![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM 水题
FoRever
看淡了...A多少题并不是水平的体现...我自己学的爽就行...
展开
-
高精度加减乘除
//就是加减法还没有完成...still CODING #include #include #include #include const int MAX= 3000; char *rev(char *a){ //字符串翻转 char re[MAX]; int len = strlen(a); for(int i = 0 ; i <= len-1原创 2012-02-07 22:38:23 · 79 阅读 · 0 评论 -
HDU 2054 A == B ? 解题报告
又到了JAVA大显神通的时候了... 这次用的是BigDecimal类~8行搞定...解决这类问题简直就是手到擒来 而如果用C++搞的话,要去前导0,后导0,小数点,再用strcmp()判断是否相等,又复杂又坑爹,在比赛的时候绝对吃亏 A == B ? Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/3原创 2012-05-14 22:41:53 · 412 阅读 · 0 评论 -
POJ 1862 Stripies 水题贪心
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;原创 2012-08-19 10:23:43 · 507 阅读 · 0 评论 -
POJ 1068 Parencodings ---YY题
Language: Default Parencodings Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 15029 Accepted: 8959 Description Let S = s1 s2...s2n be a well-formed原创 2012-08-09 12:44:59 · 221 阅读 · 0 评论 -
POJ 2965 The Pilots Brothers' refrigerator 枚举
颤抖吧凡人~这才是真正的暴力枚举!!!枚举16个点的状态分别判断...真的...这样也能过...#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #i原创 2012-08-08 14:31:13 · 255 阅读 · 0 评论 -
POJ 1328 Radar Installation 贪心+sort
sort横坐标x...以岛屿为圆心.d为半径画圆...分别计算与x轴的左右交点 按照从大到小的顺序(或者从小到大都行)对x轴的交点进行判断... #include #include #include #include #include #include #include #include #include #include #include #include #incl原创 2012-08-07 19:08:14 · 310 阅读 · 0 评论 -
TCO SRM 543 250分...(水题)
Problem Statement Everybody who has lived in a village knows how expensive the things from the city are. And everybody who has lived in the city knows how expensive the things from the vill原创 2012-05-20 02:07:41 · 329 阅读 · 0 评论 -
Codeforce 190A Vasya and the Bus 水题
#include #include #include #include #include #include #include #include using namespace std; int main() { int m,n; cin>>m>>n; if(m==0) if(n==0) cout<<"0"<<" "<<"0"<<endl; else cout<<"Imp原创 2012-05-17 10:17:43 · 322 阅读 · 0 评论 -
UVAOJ 465 Overflow (大数?还是double?)解题报告
Overflow Write a program that reads an expression consisting of two non-negative integer and an operator. Determine if either integer or the result of the expression is too large to be rep原创 2012-05-12 13:34:56 · 513 阅读 · 0 评论 -
HUT_CSUST 新生友谊赛题解CSUST版本
所有的题目百度都有,问问题前先百度,这是黄金定律 所有题都给个思路:具体代码都可百度 A: 把素数筛出来,先构造原矩形,就是一个一个往下推,然后构造被挖掉合数的矩形 遍历原矩形找到起点和终点,然后后构造的矩形中的素数就相当于障碍物,整个问题就化成一个迷宫问题了 用BFS一搜就能得出最短距离 B: 具体证明: http://www.doc88.com/p-792551521271.h原创 2012-12-22 20:24:31 · 293 阅读 · 0 评论