結果
問題 | No.300 平方数 |
ユーザー | omu |
提出日時 | 2015-11-13 22:44:18 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 12 ms / 1,000 ms |
コード長 | 3,042 bytes |
コンパイル時間 | 948 ms |
コンパイル使用メモリ | 99,516 KB |
実行使用メモリ | 4,356 KB |
最終ジャッジ日時 | 2023-10-11 15:58:22 |
合計ジャッジ時間 | 2,638 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,348 KB |
testcase_01 | AC | 2 ms
4,352 KB |
testcase_02 | AC | 1 ms
4,348 KB |
testcase_03 | AC | 1 ms
4,348 KB |
testcase_04 | AC | 2 ms
4,348 KB |
testcase_05 | AC | 2 ms
4,348 KB |
testcase_06 | AC | 2 ms
4,352 KB |
testcase_07 | AC | 1 ms
4,352 KB |
testcase_08 | AC | 2 ms
4,348 KB |
testcase_09 | AC | 1 ms
4,348 KB |
testcase_10 | AC | 1 ms
4,352 KB |
testcase_11 | AC | 2 ms
4,356 KB |
testcase_12 | AC | 2 ms
4,352 KB |
testcase_13 | AC | 12 ms
4,348 KB |
testcase_14 | AC | 1 ms
4,348 KB |
testcase_15 | AC | 2 ms
4,348 KB |
testcase_16 | AC | 1 ms
4,352 KB |
testcase_17 | AC | 1 ms
4,352 KB |
testcase_18 | AC | 1 ms
4,348 KB |
testcase_19 | AC | 2 ms
4,348 KB |
testcase_20 | AC | 2 ms
4,352 KB |
testcase_21 | AC | 1 ms
4,352 KB |
testcase_22 | AC | 2 ms
4,348 KB |
testcase_23 | AC | 2 ms
4,348 KB |
testcase_24 | AC | 3 ms
4,348 KB |
testcase_25 | AC | 10 ms
4,352 KB |
testcase_26 | AC | 5 ms
4,348 KB |
testcase_27 | AC | 3 ms
4,352 KB |
testcase_28 | AC | 10 ms
4,348 KB |
testcase_29 | AC | 9 ms
4,348 KB |
testcase_30 | AC | 3 ms
4,348 KB |
testcase_31 | AC | 2 ms
4,348 KB |
testcase_32 | AC | 3 ms
4,348 KB |
testcase_33 | AC | 5 ms
4,352 KB |
testcase_34 | AC | 12 ms
4,348 KB |
testcase_35 | AC | 8 ms
4,352 KB |
testcase_36 | AC | 4 ms
4,348 KB |
testcase_37 | AC | 4 ms
4,348 KB |
testcase_38 | AC | 2 ms
4,348 KB |
testcase_39 | AC | 2 ms
4,352 KB |
testcase_40 | AC | 1 ms
4,348 KB |
testcase_41 | AC | 4 ms
4,352 KB |
testcase_42 | AC | 2 ms
4,348 KB |
testcase_43 | AC | 1 ms
4,348 KB |
testcase_44 | AC | 1 ms
4,348 KB |
testcase_45 | AC | 1 ms
4,352 KB |
ソースコード
#include <cstdio> #include <iostream> #include <vector> #include <map> #include <unordered_map> #include <set> #include <unordered_set> #include <string> #include <cstring> #include <sstream> #include <algorithm> #include <functional> #include <queue> #include <stack> #include <cmath> #include <iomanip> #include <list> #include <tuple> #include <bitset> #include <ciso646> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll, ll> P; typedef tuple<ll, ll, ll> T; typedef vector<ll> vec; inline bool cheak(ll x, ll y, ll xMax, ll yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; } inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; } struct UnionFind { vector<ll> data; UnionFind(int size) : data(size, -1) { } bool unionSet(ll x, ll y) { x = root(x); y = root(y); if (x != y) { if (data[y] < data[x]) swap(x, y); data[x] += data[y]; data[y] = x; } return x != y; } bool findSet(ll x, ll y) { return root(x) == root(y); } ll root(ll x) { return data[x] < 0 ? x : data[x] = root(data[x]); } int size(ll x) { return -data[root(x)]; } }; template<class T> inline T sqr(T x) { return x*x; } template<class T> inline T mypow(T x, ll n){ T res = 1; while (n > 0){ if (n & 1)res = res * x; x = x * x; n >>= 1; }return res; } inline int gcd(ll a, ll b){ return b ? gcd(b, a%b) : a; } inline int lcm(ll a, ll b){ return a / gcd(a, b) * b; } template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } template<class _RanIt> inline string toString(_RanIt _First, _RanIt _Last, string sep) { if (_First == _Last)return ""; ostringstream sout; sout << *_First; for (_First = next(_First); _First != _Last; _First = next(_First)) { sout << sep << *_First; }return sout.str(); } template<class _RanIt> inline string toString(_RanIt _First, _RanIt _Last, string sep, string sep2) { if (_First == _Last)return ""; ostringstream sout; sout << toString(all(*_First), sep); for (_First = next(_First); _First != _Last; _First = next(_First)) { sout << sep2 << toString(all(*_First), sep); }return sout.str(); } #define For(i,a,b) for(ll (i) = (a);i < (b);(i)++) #define rep(i,n) For(i,0,n) #define rFor(i,a,b) for(ll (i) = (a-1);i >= (b);(i)--) #define rrep(i,n) rFor(i,n,0) #define clr(a) memset((a), 0 ,sizeof(a)) #define mclr(a) memset((a), -1 ,sizeof(a)) #define all(a) (a).begin(),(a).end() #define sz(a) (sizeof(a)) #define dump(val) cerr << #val " = " << val << endl; #define toint toInt #define tostr toString const ll dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 }; const ll mod = 1e9 + 7; const ll INF = 1e9 + 9; map<ll, int> prime_factor(ll n){ map<ll, int> res; for (ll i = 2; i * i <= n; i++){ while (n % i == 0){ ++res[i]; n /= i; } } if (n != 1)res[n] = 1; return res; } int main(){ ll x; cin >> x; ll ans = 1; auto mp = prime_factor(x); for (auto i : mp){ if (i.second % 2){ ans *= i.first; } } cout << ans << endl; return 0; }