nyoj 73 比大小

來源:互聯網
上載者:User

http://acm.nyist.net/JudgeOnline/problem.php?pid=73

高精度問題

#include <iostream>#include <string.h>using namespace std;int main(){char a[1010],b[1010],ans[1000];while(cin>>a>>b){memset(ans,0,sizeof(ans));if(a[0]=='0'&&b[0]=='0') break;int len_a=strlen(a);int len_b=strlen(b);if(a[0]=='-'&&b[0]!='-'){cout<<"a<b"<<endl;}else if(a[0]!='-'&&b[0]=='-'){cout<<"a>b"<<endl;}else if(a[0]=='-'&&b[0]=='-'){if(len_a>len_b)cout<<"a<b"<<endl;else if(len_a<len_b)cout<<"a>b"<<endl;else {for(int i=1;i<len_a;i++){if(a[i]>b[i]){cout<<"a<b"<<endl;break;}else if(a[i]<b[i]){cout<<"a>b"<<endl;break;}if(i==len_a-1) cout<<"a==b"<<endl;}}}else if(a[0]!='-'&&b[0]!='-'){if(len_a>len_b)cout<<"a>b"<<endl;else if(len_a<len_b)cout<<"a<b"<<endl;else {for(int i=0;i<len_a;i++){if(a[i]>b[i]){cout<<"a>b"<<endl;break;}else if(a[i]<b[i]){cout<<"a<b"<<endl;break;}if(i==len_a-1) cout<<"a==b"<<endl;}}}}return 0;}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.