1060. Are They Equal (25)PAT甲级
来源:互联网 发布:type c耳机推荐 知乎 编辑:程序博客网 时间:2024/05/16 15:01
传送门
#include<iostream>#include<string>using namespace std;string treat(string s,int &e,int n){ int pos=0; while(s.length()>0&&s[0]=='0'){ s.erase(s.begin()); } if(s[0]=='.'){ s.erase(s.begin()); while(s.length()>0&&s[0]=='0'){ s.erase(s.begin()); e--; } } else{ while(pos<s.length()&&s[pos]!='.'){ pos++; e++; } if(pos<s.length()){ s.erase(s.begin()+pos); } } if(s.length()==0){ e=0; } int num=0; pos=0; string result; while(num<n){ if(pos<s.length()) result+=s[pos++]; else result+='0'; num++; } return result;}int main(){ int n; string s1,s2,s3,s4; cin>>n>>s1>>s2; int e1=0,e2=0; s3=treat(s1,e1,n); s4=treat(s2,e2,n); if(s3==s4&&e1==e2){ cout<<"YES"<<" 0."<<s3<<"*10^"<<e1<<endl; } else{ cout<<"NO"<<" 0."<<s3<<"*10^"<<e1<<" 0."<<s4<<"*10^"<<e2<<endl; }}
0 0
- 【PAT甲级】1060. Are They Equal (25)
- 1060. Are They Equal (25)PAT甲级
- PAT甲级1060. Are They Equal (25)
- PAT 甲级 1060. Are They Equal (25)
- PAT甲级 1060. Are They Equal (25)
- PAT甲级1060. Are They Equal
- PAT甲级练习1060. Are They Equal (25)
- PAT 甲级 1060 Are They Equal
- 1060. Are They Equal (25)-PAT
- pat 1060. Are They Equal (25)
- PAT A 1060. Are They Equal (25)
- PAT 1060. Are They Equal (25)
- PAT 1060. Are They Equal (25)
- PAT 1060. Are They Equal (25)
- PAT(A) - 1060. Are They Equal (25)
- PAT 1060. Are They Equal (25)
- 1060. Are They Equal (25)-PAT甲级真题(科学计数法)
- 1060. Are They Equal (25)-PAT甲级真题(科学计数法)
- 自定义控件之SeekBar —— 我点灯 XSeekBar
- 使用自定义指令的方式实现导航class的切换(另有正则的知识点)
- 机房收费系统合作版——周结账单之报表
- A1099. Build A Binary Search Tree (30)
- V8 虚拟机的GC机制
- 1060. Are They Equal (25)PAT甲级
- 即使没有读者,你也应该写博客 (You should blog even if you have no readers)
- hdu 2571 命运(简单dp)
- 在AWS上部署Django+MySQL+Nginx+uwsgi
- Linux基本学习(1)
- centos7 cmake的模块
- centos6.5配置静态IP 时,出现BCAST不能设置的问题
- 1046. Shortest Distance (20)
- c++_ch04_02_修正版