//#include//atcoder #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include using namespace std; //using namespace atcoder;//atcoder using ll = long long; //using mint = modint1000000007;//atcoder using vi = vector; using vi2 = vector>; using vb = vector; using vb2 = vector>; using vc = vector; using vc2 = vector>; using si = set; using pii = pair; using mii = map; const int INF = 1e9+1; const ll LINF = 1e18+1; const long double LPI = acos(-1.0); const double PI = acos(-1.0); const ll mod = 1e9+7; #define MP(a,b) make_pair((a),(b)) #define MT(...) make_tuple(__VA_ARGS__) #define sz(x) (int)(x).size() #define FOR(i,a,b) for(ll i=(a);i<(b);i++) #define REP(i,x) for(ll i=0;i<(int)(x);i++) #define REPS(i,x) for(ll i=1;i<=(int)(x);i++) #define RREP(i,x) for(ll i=((int)(x)-1);i>=0;i--) #define RREPS(i,x) for(ll i=((int)(x));i>0;i--) #define endl "\n" #define ALL(x) (x).begin(),(x).end() #define RALL(x) (x).rbegin(),(x).rend() #define SORT(v) sort(ALL(v)); #define RSORT(v) sort(RALL(v)); #define IN(type,a) type a;cin >> a; #define VIN(type,a,n) vector a(n);cin >> a; #define YES(n) cout << ((n) ? "YES" : "NO" ) << endl; #define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl; #define COUT(x) cout << (x) << endl; #define CERR(x) cerr << (x) << endl; #define DCOUT(x,n) cout << fixed << setprecision(n) << (x) << endl; #define ENDL cout << endl; #define SP cout << " "; #define Debug(x) cout << #x << " : " << x << endl; #define PB(x) emplace_back(x) #define HOGE COUT("HOGE") #define AJA COUT("AJA") templateinline istream& operator>>(istream&i,vector&v) {REP(j,sz(v))i>>v[j];return i;} template bool chmax(T& a, const T& b){if(a bool chmin(T& a, const T& b){if(a>b){a=b;return true;}return false;} template T gcd(T a,T b){if(b==0){return a;}else{return gcd(b, a%b);}} template T lcm(T a,T b){return a*b/gcd(a, b);} template bool isPrime(T a){if(a<=1){return false;} for(T i=2;i*i<=a;i++){if (a%i==0) {return false;}}return true;} template T ord(T p,T n){T ans=0;while(true){if(n%p==0){n/=p;ans++;}else{break;}}return ans;} char janken(char a,char b){if(a==b){return a;}if(a=='R'){if(b=='P'){return b;}if(b=='S'){return a;}} if(a=='P'){if(b=='R'){return a;}if(b=='S'){return b;}}if(a=='S'){if(b=='P'){return a;}if (b=='R'){return b;}}return 'k';} struct UnionFind { vector parent;// vector siz; map> group; UnionFind(ll n) : parent(n),siz(n){ REP(i, n){ parent[i]=i; siz[i] = 1; } } ll root(ll k){ if (parent[k]==k) return k; return parent[k]=root(parent[k]); } void unite(ll a,ll b){ ll ra = root(a); ll rb = root(b); if (ra==rb) return; if (ra>rb) swap(ra, rb); parent[rb] = ra; siz[ra] += siz[rb]; } bool same(ll a,ll b){ return root(a)==root(b); } ll size(ll a){ return siz[root(a)]; } vector> grouping(){ ll n = parent.size(); REP(i,n)group[root(i)].emplace_back(i); vector> res; for (auto i : group) { res.emplace_back(i.second); } return res; } }; struct WGraph {//重みつきグラフ struct GEdge{ ll to; ll wei; }; GEdge make_GEdge(ll a, ll weight){ GEdge e; e.to = a; e.wei = weight; return e; } vector> g; WGraph(ll n) : g(n){}; void dlink(ll a, ll b, ll weight){ g[a].push_back(make_GEdge(b,weight)); } void link(ll a, ll b, ll weight){ g[a].push_back(make_GEdge(b,weight)); g[b].push_back(make_GEdge(a,weight)); } vector eges(ll a){ return g[a]; } ll size(){ return g.size(); } ll size(ll a){ return g[a].size(); } }; vi Dijkstra(ll start,WGraph &g) { vi ans(g.size(),LINF); ans[start] = 0; priority_queue,greater> que; que.push(MP(0,start)); while (!que.empty()) { ll dis = que.top().first; ll now = que.top().second; que.pop(); if (dis>ans[now])continue; for (auto i : g.eges(now)) { if (ans[i.to]>dis+i.wei) { ans[i.to] = dis+i.wei; que.push(MP(ans[i.to],i.to)); } } } return ans; } struct Edge{ ll u,v,wei; bool operator<(const Edge &e) const {return this->wei>(istream& i ,Edge& e){i >> e.u >> e.v >> e.wei;return i;} }; ll Kruskal(vector &g,ll n){ ll res = 0; SORT(g); UnionFind d(n); for (auto i : g) { if(d.same(i.u, i.v)) continue; res += i.wei; d.unite(i.u, i.v); } return res; } void solve(){ ll x,y; cin >> x >> y; COUT(lcm(x, y)); } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); solve(); }

提出日時	2021/01/08 18:42:56
問題	A: Happiness Number
ユーザ	graphium314
言語	C++17 (g++ 10.2.0)
得点
結果	IE

セット名	得点 / 配点	テストケース名
結果		テストケース名
sample	0 / 0

all	100 / 100

セットごとの結果