結果

問題 No.1464 Number Conversion
ユーザー leaf_1415leaf_1415
提出日時 2021-04-02 21:37:15
言語 C++11
(gcc 13.3.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 4,733 bytes
コンパイル時間 979 ms
コンパイル使用メモリ 83,708 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-12-23 18:35:48
合計ジャッジ時間 1,993 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define inf 1e18
using namespace std;
typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;
struct edge{
ll to, cost;
edge(){}
edge(ll a, ll b){ to = a, cost = b;}
};
const ll dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
const ll mod = 1000000007;
const ll mod2 = 998244353;
struct mint{
ll x = 0;
mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}
mint(const mint &ope) {x = ope.x;}
mint operator-(){return mint(-x);}
mint operator+(const mint &ope){return mint(x) += ope;}
mint operator-(const mint &ope){return mint(x) -= ope;}
mint operator*(const mint &ope){return mint(x) *= ope;}
mint operator/(const mint &ope){return mint(x) /= ope;}
mint& operator+=(const mint &ope){
x += ope.x;
if(x >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint &ope){
x += mod - ope.x;
if(x >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint &ope){
x *= ope.x, x %= mod;
return *this;
}
mint& operator/=(const mint &ope){
ll n = mod-2; mint mul = ope;
while(n){
if(n & 1) *this *= mul;
mul *= mul;
n >>= 1;
}
return *this;
}
mint inverse(){return mint(1) / *this;}
bool operator ==(const mint &ope){return x == ope.x;}
bool operator !=(const mint &ope){return x != ope.x;}
};
mint modpow(mint a, ll n){
if(n == 0) return mint(1);
if(n % 2) return a * modpow(a, n-1);
else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){
ll t; is >> t, ope.x = t;
return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}
bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "Yes" << endl; }
void no(){ cout << "No" << endl; }
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
for(int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
}
return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
for(int i = 0; i < deq.size(); i++) {
os << deq[i] << (i + 1 == deq.size() ? "" : " ");
}
return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
os << "(" << itr->first << ", " << itr->second << ")";
itr++;
if(itr != map_var.end()) os << ",";
itr--;
}
return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
os << *itr;
++itr;
if(itr != set_var.end()) os << " ";
itr--;
}
return os;
}
template<typename T>
void outa(T a[], ll s, ll t)
{
for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}
cout << endl;
}
void dump_func() {cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
cout << head;
if(sizeof...(Tail) > 0) cout << " ";
dump_func(std::move(tail)...);
}
string s;
int main(void)
{
ios::sync_with_stdio(0);
cin.tie(0);
cin >> s;
ll p = sz(s)-1; string t;
reps(i, s){
if(s[i] == '.') p = i;
else t += s[i];
}
p = sz(s)-1-p;
ll bunbo = 1;
rep(i, 1, p) bunbo *= 10;
ll bunsi = 0;
for(auto c : t){
bunsi *= 10, bunsi += c - '0';
}
//outl(bunsi, bunbo);
ll g = gcd(bunsi, bunbo);
bunsi /= g, bunbo /= g;
cout << bunsi << "/" << bunbo << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0