結果
問題 | No.312 置換処理 |
ユーザー |
![]() |
提出日時 | 2015-12-07 05:33:09 |
言語 | C++11(廃止可能性あり) (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 19 ms / 2,000 ms |
コード長 | 2,307 bytes |
コンパイル時間 | 742 ms |
コンパイル使用メモリ | 91,204 KB |
実行使用メモリ | 7,404 KB |
最終ジャッジ日時 | 2024-11-15 11:57:12 |
合計ジャッジ時間 | 2,780 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 45 |
ソースコード
// Standard I/O#include <iostream>#include <sstream>#include <cstdio>// Standard Library#include <cstdlib>#include <cstring>#include <ctime>#include <cmath>// Template Class#include <complex>#include <string>#include <vector>#include <list>#include <set>#include <map>#include <queue>#include <stack>// Container Control#include <algorithm>using namespace std;#define rep( i, n ) for( int i = 0; i < n; ++i )#define irep( i, n ) for( int i = n-1; i >= 0; --i )#define reep( i, s, n ) for ( int i = s; i < n; ++i )#define ireep( i, n, s ) for ( int i = n-1; i >= s; --i )#define foreach(itr, x) for( typeof(x.begin()) itr = x.begin(); itr != x.end(); ++itr)#define mp( a, b ) make_pair( a, b )#define pb( a ) push_back( a )#define all( v ) v.begin(), v.end()#define fs first#define sc second#define vc vector// for visualizer.htmldouble SCALE = 1.0;double OFFSET_X = 0.0;double OFFSET_Y = 0.0;#define LINE(x,y,a,b) cerr << "line(" << SCALE*(x) + OFFSET_X << "," \<< SCALE*(y) + OFFSET_Y << "," \<< SCALE*(a) + OFFSET_X << "," \<< SCALE*(b) + OFFSET_Y << ")" << endl;#define CIRCLE(x,y,r) cerr << "circle(" << SCALE*(x) + OFFSET_X << "," \<< SCALE*(y) + OFFSET_Y << "," \<< SCALE*(r) << ")" << endl;typedef long long ll;typedef complex<double> Point;typedef pair<int, int> pii;typedef pair<int, pii> ipii;typedef vector<int> vi;typedef vector<double> vd;typedef vector< vector<int> > vii;typedef vector< vector<double> > vdd;typedef vector<int>::iterator vi_itr;const int IINF = 1 << 28;const double INF = 1e30;const double EPS = 1e-10;const double PI = acos(-1.0);// Direction : L U R Dconst int dx[] = { -1, 0, 1, 0};const int dy[] = { 0, -1, 0, 1 };bool isprime[2000010];vector<ll> prime;int main(){ll n;cin >> n;reep(i, 2, 2000010) isprime[i] = true;reep(i, 2, 2000010) if( isprime[i] ){prime.pb(i);for( int j = 2*i; j < 2000010; j+= i ) isprime[j] = false;}set<ll> factor;rep(i, prime.size()){ll tmp = prime[i];while( n % prime[i] == 0 ){factor.insert(n / tmp);factor.insert(tmp);n /= prime[i];tmp *= prime[i];}}if( factor.size() == 0 ) cout << n << endl;else{for( auto i : factor )if( i > 2 ){cout << i << endl;break;}}}