Submission #117043
Source Code Expand
#include <iostream> #include <cstdio> #include <iomanip> #include <vector> #include <map> #include <set> #include <queue> #include <bitset> #include <stack> #include <utility> #include <numeric> #include <algorithm> #include <functional> #include <cctype> #include <complex> #include <string> #include <sstream> #include <fstream> #include <cassert> using namespace std; //common using i32=int;using i64=long long;using ll =i64; using uint=unsigned int;using ull=unsigned long long; template<typename T> using matrix=vector<vector<T> >; #define BR "\n" #define ALL(c) (c).begin(),(c).end() #define REP(i,n) for(int i=0;i<(int)(n);++i) #define EACH(it,o) for(auto it = (o).begin(); it != (o).end(); ++it) #define IN(l,v,r) ((l)<=(v) && (v)<(r)) //config //#undef NDEBUG //#define INF 1<<30 //#define EPS 1e-8 //const ll MOD =100000007; //debug #ifdef NDEBUG #define DUMP(x) #define DUMPLN(x) #define DEBUG(x) #define DEBUGLN(x) #define LINE() #define LINELN() #define CHECK(exp,act) #define STOP(e) #else #define DUMP(x) cerr << #x << " = " << (x) #define DUMPLN(x) DUMP(x) <<endl #define DEBUG(x) DUMP(x) << LINE() << " " << __FILE__ #define DEBUGLN(x) DEBUG(x)<<endl #define LINE() cerr<< " (L" << __LINE__ << ")" #define LINELN() LINE()<<endl #define CHECK(exp,act) if(exp!=act){DUMPLN(exp);DEBUGLN(act);} #define STOP(e) CHECK(e,true);if(!(e)) exit(1); #endif template<class T> inline string toString(const vector<T>& x) { stringstream ss; REP(i,x.size()){ if(i!=0)ss<<" "; ss<< x[i]; } return ss.str(); } template<class T> inline string toString(const vector<vector<T> >& map) { stringstream ss; REP(i,map.size()){ if(i!=0)ss<<BR; ss<< toString(map[i]); } return ss.str(); } template<class K,class V> string toString(map<K,V>& x) { string res;stringstream ss; for(auto& p:x)ss<< p.first<<":" << p.second<<" "; return ss.str(); } string BITtoString(int bit){ stringstream ss; while(bit!=0){ss<<(bit%2);bit/=2;} string res=ss.str();reverse(ALL(res)); return res; } template<typename T,typename V> inline T mod(T v,V MOD){ return (v%MOD+MOD)%MOD; } //prime vector<bool> sieve(const int M){ vector<bool> isPrime(M); for(int i=2;i<M;i++) isPrime[i] = true; for(int i=2;i*i < M;i++){ if(! isPrime[i]) continue; for(int j=i*i;j<M;j+=i)isPrime[j] = false; } return isPrime; } class Main{ public: void run(){ // ifstream cin("in"); // ofstream cout( "out" ); vector<bool> isP=sieve(10050); while(true){ int n;cin >> n; if(n==0)break; int Mp=1; for(int p=2;p<=sqrt(n);p++){ while(n%p==0){ n/=p; Mp=p; } } Mp=max(Mp,n); cout <<Mp<<endl; } } }; int main(){ ios::sync_with_stdio(false); Main().run(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Working for the World |
User | shimomire |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 2861 Byte |
Status | AC |
Exec Time | 24 ms |
Memory | 932 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00-sample, 10-minimum, 11-maximum, 12-little, 13-large, 14-middle, 15-zero, 50-random00, 50-random01, 50-random02, 50-random03, 50-random04, 50-random05, 50-random06, 50-random07, 50-random08, 50-random09, 50-random10, 50-random11, 50-random12, 50-random13, 50-random14, 50-random15, 50-random16, 50-random17, 50-random18, 50-random19 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00-sample | AC | 21 ms | 924 KB |
10-minimum | AC | 20 ms | 800 KB |
11-maximum | AC | 20 ms | 796 KB |
12-little | AC | 21 ms | 796 KB |
13-large | AC | 22 ms | 920 KB |
14-middle | AC | 21 ms | 924 KB |
15-zero | AC | 20 ms | 840 KB |
50-random00 | AC | 21 ms | 796 KB |
50-random01 | AC | 21 ms | 804 KB |
50-random02 | AC | 22 ms | 800 KB |
50-random03 | AC | 20 ms | 920 KB |
50-random04 | AC | 22 ms | 928 KB |
50-random05 | AC | 21 ms | 928 KB |
50-random06 | AC | 22 ms | 812 KB |
50-random07 | AC | 21 ms | 796 KB |
50-random08 | AC | 24 ms | 808 KB |
50-random09 | AC | 22 ms | 928 KB |
50-random10 | AC | 21 ms | 748 KB |
50-random11 | AC | 21 ms | 932 KB |
50-random12 | AC | 21 ms | 800 KB |
50-random13 | AC | 21 ms | 800 KB |
50-random14 | AC | 22 ms | 804 KB |
50-random15 | AC | 21 ms | 800 KB |
50-random16 | AC | 22 ms | 924 KB |
50-random17 | AC | 21 ms | 924 KB |
50-random18 | AC | 22 ms | 744 KB |
50-random19 | AC | 21 ms | 932 KB |