Submission #1652368
Source Code Expand
#include <bits/stdc++.h> #define REP(i,a,b) for(int i=(a);i<(b);i++) #define RREP(i,a,b) for(int i=(a);i>=(b);i--) typedef long long ll; typedef long double ld; using namespace std; const int INF=1e9, MOD=1e9+7; int n; set<int> st; int main(){ REP(i,2,100010) st.insert(i); REP(i,2,st.size()) if(st.count(i)) REP(j,2,st.size()) st.erase(i*j); vector<pair<ll,ll>> num; REP(i,1,101){ ll s=1,c=0; for(auto j:st){ bool f=false; REP(k,1,i+1){ s*=j; if(s>=1e9){s/=j; c*=k; f=true; break;} } if(f) break; c*=(i+1); } num.push_back(make_pair(c,s)); } sort(num.rbegin(),num.rend()); REP(i,0,100) cout << num[i].second << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 約数をたくさんつくろう! |
User | ecasdqina |
Language | Bash (GNU bash v4.3.11) |
Score | 0 |
Code Size | 708 Byte |
Status | RE |
Exec Time | 16 ms |
Memory | 1492 KB |
Judge Result
Set Name | test_01 | ||
---|---|---|---|
Score / Max Score | 0 / 100000 | ||
Status |
|
Set Name | Test Cases |
---|---|
test_01 | noinput.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
noinput.txt | RE | 16 ms | 1492 KB |