結果
| 問題 |
No.1464 Number Conversion
|
| コンテスト | |
| ユーザー |
mugen_1337
|
| 提出日時 | 2021-04-02 21:21:56 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 2 ms / 2,000 ms |
| コード長 | 4,420 bytes |
| コンパイル時間 | 1,983 ms |
| コンパイル使用メモリ | 196,932 KB |
| 最終ジャッジ日時 | 2025-01-20 08:07:32 |
|
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| other | AC * 29 |
ソースコード
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}
struct IOSetup{
IOSetup(){
cin.tie(0);
ios::sync_with_stdio(0);
cout<<fixed<<setprecision(12);
}
} iosetup;
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
for(T &x:v)is>>x;
return is;
}
// 2^127 = 170141183460469231731687303715884105728 ~ 10^38
ostream &operator<<(ostream &os,const __int128 &n){
if(n==0){
os<<0;
return os;
}
__int128 num=n;
bool neg=false;
if(num<0)neg=true,num=-num;
string res="";
while(num>0){
res.push_back('0'+num%10);
num/=10;
}
if(neg) res.push_back('-');
reverse(begin(res),end(res));
os<<res;
return os;
}
istream &operator>>(istream &is,__int128 &n){
string s;
is>>s;
int idx=0;
bool neg=false;
if(s[0]=='-')neg=true,idx++;
n=0;
for(;idx<(int)s.size();idx++){
n=10*n+s[idx]-'0';
}
if(neg) n=-n;
return is;
}
__int128 abs128(__int128 x){
return x<0?-x:x;
}
__int128 gcd128(__int128 a,__int128 b){
if(a==0) return b;
if(b==0) return a;
return b>0?gcd128(b,a%b):a;
}
using int128=__int128;
pair<int128,int> freader(){
string s;cin>>s;
int i=0;bool neg=false;
if(s[0]=='-')i++,neg=true;
int128 res=0;int b=0;bool t=false;
for(;i<(int)s.size();i++){
if(s[i]=='.'){
t=true;
continue;
}
res=10*res+(s[i]-'0');
if(t)b++;
}
if(neg)res=-res;
return make_pair(res,b);
}
template<class INT>
struct Fraction{
INT num,den;// numerator / denominator
INT Igcd(INT a,INT b){return (b?Igcd(b,a%b):a);}
void normalize(){
INT g=Igcd(num,den);
num/=g;den/=g;
if(den<0)num=-num,den=-den;
}
Fraction(INT num=0,INT den=1):num(num),den(den){normalize();}
long double to_ld()const{return (long double)num/den;}
double to_d()const{return (double)num/den;}
Fraction &operator+=(const Fraction &rhs){
num=num*rhs.den+rhs.num*den;
den*=rhs.den;
normalize();
return *this;
}
Fraction &operator-=(const Fraction &rhs){
num=num*rhs.den-rhs.num*den;
den*=rhs.den;
normalize();
return *this;
}
Fraction &operator*=(const Fraction &rhs){
num*=rhs.num;
den*=rhs.den;
normalize();
return *this;
}
Fraction &operator/=(const Fraction &rhs){
num*=rhs.den;
den*=rhs.num;
normalize();
return *this;
}
Fraction abs(){
Fraction ret(*this);
if(ret<0)ret.first=ret.first*(-1);
return ret;
}
Fraction operator-(){(*this).first*=-1;return *this;}
Fraction operator+(const Fraction &rhs)const{return Fraction(*this)+=rhs;}
Fraction operator-(const Fraction &rhs)const{return Fraction(*this)-=rhs;}
Fraction operator*(const Fraction &rhs)const{return Fraction(*this)*=rhs;}
Fraction operator/(const Fraction &rhs)const{return Fraction(*this)/=rhs;}
bool operator==(const Fraction &rhs)const{return num*rhs.den==den*rhs.num;}
bool operator!=(const Fraction &rhs)const{return !(*this==rhs);}
bool operator>=(const Fraction &rhs)const{return num*rhs.den>=den*rhs.num;}
bool operator<=(const Fraction &rhs)const{return num*rhs.den<=den*rhs.num;}
bool operator>(const Fraction &rhs)const{return num*rhs.den>den*rhs.num;}
bool operator<(const Fraction &rhs)const{return num*rhs.den<den*rhs.num;}
friend ostream &operator<<(ostream &os,const Fraction &p){return os<<p.num<<"/"<<p.den;}
};
using frac=Fraction<int128>;
signed main(){
auto p=freader();
frac x=p.first;
rep(i,p.second) x/=10;
cout<<x<<endl;
return 0;
}
mugen_1337