九度1049(水题)
来源:互联网 发布:php正则表达式匹配邮箱 编辑:程序博客网 时间:2024/06/07 05:11
题目链接:http://ac.jobdu.com/problem.php?pid=1049
解题思路:
水
完整代码:
#include <functional>#include <algorithm>#include <iostream>#include <fstream>#include <sstream>#include <iomanip>#include <numeric>#include <cstring>#include <climits>#include <cassert>#include <complex>#include <cstdio>#include <string>#include <vector>#include <bitset>#include <queue>#include <stack>#include <cmath>#include <ctime>#include <list>#include <set>#include <map>using namespace std;#pragma comment(linker, "/STACK:102400000,102400000")typedef long long LL;typedef double DB;typedef unsigned uint;typedef unsigned long long uLL;/** Constant List .. **/const int MOD = int(1e9)+7;const int INF = 0x3f3f3f3f;const LL INFF = 0x3f3f3f3f3f3f3f3fLL;const DB EPS = 1e-9;const DB OO = 1e20;const DB PI = acos(-1.0); //M_PI;/**BigNumber..**/const int ten[4] = {1 , 10 , 100 , 1000};const int maxl = 1000;struct BigNumber{ int d[maxl]; BigNumber(string s){ int len = s.size(); d[0] = (len - 1) / 4 + 1; int i , j , k; for(i = 1 ; i < maxl ; i ++) d[i] = 0; for(i = len - 1 ; i >= 0 ; i --){ j = (len - i - 1) / 4 + 1; k = (len - i - 1) % 4; d[j] += ten[k] * (s[i] - '0'); } while(d[0] > 1 && d[d[0]] == 0) --d[0]; } BigNumber(){ *this = BigNumber(string("0")); } string toString(){ string s(""); int i , j , temp; for(i = 3 ; i >= 1 ; i --){ if(d[d[0]] >= ten[i]) break; } temp = d[d[0]]; for(j = i ; j >= 0 ; j --){ s = s + (char)(temp / ten[j] + '0'); temp %= ten[j]; } for(i = d[0] - 1 ; i > 0 ; i --){ temp = d[i]; for(j = 3 ; j >= 0 ; j --){ s = s + (char)(temp / ten[j] + '0'); temp %= ten[j]; } } return s; }}zero("0") , d , temp , midl[15];BigNumber operator + (const BigNumber &a , const BigNumber &b){ BigNumber c; c.d[0] = max(a.d[0] , b.d[0]); int i , x = 0; for(i = 1 ; i <= c.d[0] ; i ++){ x = a.d[i] + b.d[i] + x; c.d[i] = x % 10000; x /= 10000; } while(x != 0){ c.d[++c.d[0]] = x % 10000; x /= 10000; } return c;}BigNumber operator - (const BigNumber &a , const BigNumber &b){ BigNumber c; c.d[0] = a.d[0]; int i , x = 0; for(i = 1 ; i <= c.d[0] ; i ++){ x = 10000 + a.d[i] - b.d[i] + x; c.d[i] = x % 10000; x = x / 10000 - 1; } while((c.d[0] > 1) && (c.d[c.d[0]] == 0)) -- c.d[0]; return c;}string s;int main(){ #ifdef DoubleQ freopen("in.txt","r",stdin); #endif std::ios::sync_with_stdio(false); std::cin.tie(0); while(cin >> s) { getchar(); char ch; cin >> ch; int len = s.length(); string t = ""; for(int i = 0 ; i < len ; i ++) { if(s[i] != ch) t += s[i]; } cout << t << endl; }}
0 0
- 九度1049(水题)
- 九度1031(水题)
- 九度OJ---1049
- 九度oj 1049
- 九度1047 水题
- 九度1013(排序)
- 九度1014(排序)
- 九度1017(Krustral)
- 九度1046(排序)
- 九度1045(排序)
- 九度练习(序)
- C 字符串去特定字符(九度OJ 1049)
- 九度1049:字符串去特定字符
- 【九度OJ】:1049 去掉字符串问题
- 九度oj--1003和1049
- nyoj--105--九的余数(水题)
- 搬水果(九度oj)
- 九度-1199 找位置(链表)
- 大型网站架构改进历程:存储的瓶颈(中)
- 五、语句
- Java关键字static
- 前端面试知识整理
- 用select实现的简单聊天室
- 九度1049(水题)
- break,continue,return的区别
- 回溯法求 1-n 全排列
- Dom解析XML
- C语言编程(练习3:字符串与字符串函数)
- HTK-3.4.1在ubuntu 14.04下的安装及Demo测试
- [整理]程序员编程艺术:第二章、字符串是否包含问题
- 使用RICHEDIT
- contiki 源码分析之其他(八)