Submission #1246871
Source Code Expand
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cctype>
#include <cstdlib>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cfloat>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <string>
#include <set>
#include <complex>
#include <utility>
#include <numeric>
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,a,n) for(int i=a;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define VI vector<int>
#define VS vector<string>
#define all(a) (a).begin(),(a).end()
#define debug(x) cout<<#x<<": "<<x<<endl
using namespace std;
typedef long long ll;
typedef string::const_iterator State;
typedef pair<int,int> P;
class ParseError {};
const int INF=1e9;
char fi[101][101];
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};
double EPS = 1e-10;
int N,M;
int sx,sy;
int gx,gy;
int w,h;
int ans;
const int MAX_V=100;
const int MAX_N=100;
char o[3]={'+','-','*'};
#define md 1000003
int bow[353][353]={0};
double add(double a,double b){
if(abs(a+b)<EPS*(abs(a)+abs(b)))
return 0;
return a+b;
}
/*struct P{
double x,y;
P(){}
P(double x,double y):x(x),y(y){
}
P operator + (P p){
return P(add(x,p.x),add(y,p.y));
}
P operator - (P p){
return P(add(x,-p.x),add(y,-p.y));
}
P operator *(double d){
return P(x*d,y*d);
}
double dot(P p){
return add(x*p.x,y*p.y);
}
double det(P p){
return add(x*p.y,-y*p.x);
}
};
bool cmp_x(const P& p,const P& q){
if(p.x!=q.x) return p.x<q.x;
return p.y<q.y;
}
vector<P> convex_hull(P* ps, int n){
sort(ps,ps+n,cmp_x);
int k=0;
vector<P> qs(n*2);
rep(i,n){
while(k>1&&(qs[k-1]-qs[k-2]).det(ps[i]-qs[k-1])<=0)
k--;
qs[k++]=ps[i];
}
for(int i=n-2,t=k;i>=0;i--){
while(k>t&&(qs[k-1]-qs[k-2]).det(ps[i]-qs[k-1])<=0)
k--;
qs[k++]=ps[i];
}
qs.resize(k-1);
return qs;
}
int n,m;
vector<double> p;
P ps[101];
*/
char c[520][520];
long long mod=1000000007;
long long pow(ll i,ll j){
ll tmp=1;
while(j){
if(j%2) tmp=tmp*i%mod;
i=i*i%mod;
j/=2;
}
return tmp;
}
int expression(State&);
int term(State&);
int factor(State&);
int number(State&);
int expression(State &begin){
int ret = term(begin);
for(;;){
if(*begin == '+'){
begin++;
ret += term(begin);
}
else if(*begin == '-'){
begin++;
ret -= term(begin);
}
else
break;
}
return ret;
}
int term(State &begin){
int ret = factor(begin);
for(;;){
if(*begin=='*'){
begin++;
ret *= factor(begin);
}
else if(*begin=='/'){
begin++;
ret /= factor(begin);
}
else
break;
}
return ret;
}
int factor(State &begin){
int ret;
if(*begin == '('){
begin++;
ret = expression(begin);
begin++;
}
else
ret = number(begin);
return ret;
}
int number(State &begin){
int ret =0;
while(isdigit(*begin)){
ret*=10;
ret+=*begin - '0';
begin++;
}
return ret;
}
int henkan(string s){
map<char, int> moji;
moji['m']=1000;
moji['c']=100;
moji['x']=10;
moji['i']=1;
int value=0;
int temp=1;
for(int i=0;i<s.size();i++){
if(s[i]>='2'&&s[i]<='9')
temp=temp*(s[i]-'0');
else{
value+=temp*moji[s[i]];
temp=1;
}
}
return value;
}
int main(){
long long int n;
cin>>n;
string ans="Prime";
string s=to_string(n);
long long a=0;
for(int i=0;i<s.size();i++){
a+=s[i]-'0';
}
for(int i=3;i*i<=sqrt(n);i+=2){
if(n%i==0){
ans="Not Prime";
break;
}
}
if(n==1||(n!=2&&n%2==0)||(n!=5&&n%5==0)||(n!=3&&a%3==0))
ans="Not Prime";
cout<<ans<<endl;
}
Submission Info
Submission Time |
|
Task |
A - 素数判定 |
User |
yata |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3782 Byte |
Status |
WA |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
sample_03.txt |
AC |
1 ms |
256 KB |
sample_04.txt |
AC |
1 ms |
256 KB |
test_01.txt |
AC |
1 ms |
256 KB |
test_02.txt |
AC |
1 ms |
256 KB |
test_03.txt |
AC |
1 ms |
256 KB |
test_04.txt |
AC |
1 ms |
256 KB |
test_05.txt |
AC |
1 ms |
256 KB |
test_06.txt |
AC |
1 ms |
256 KB |
test_07.txt |
AC |
1 ms |
256 KB |
test_08.txt |
AC |
1 ms |
256 KB |
test_09.txt |
AC |
1 ms |
256 KB |
test_10.txt |
AC |
1 ms |
256 KB |
test_11.txt |
AC |
1 ms |
256 KB |
test_12.txt |
AC |
1 ms |
256 KB |
test_13.txt |
AC |
1 ms |
256 KB |
test_14.txt |
AC |
1 ms |
256 KB |
test_15.txt |
AC |
1 ms |
256 KB |
test_16.txt |
AC |
1 ms |
256 KB |
test_17.txt |
AC |
1 ms |
256 KB |
test_18.txt |
AC |
1 ms |
256 KB |
test_19.txt |
AC |
1 ms |
256 KB |
test_20.txt |
AC |
1 ms |
256 KB |
test_21.txt |
AC |
1 ms |
256 KB |
test_22.txt |
AC |
1 ms |
256 KB |
test_23.txt |
AC |
1 ms |
256 KB |
test_24.txt |
AC |
1 ms |
256 KB |
test_25.txt |
WA |
1 ms |
256 KB |
test_26.txt |
WA |
1 ms |
256 KB |
test_27.txt |
AC |
1 ms |
256 KB |
test_28.txt |
AC |
1 ms |
256 KB |
test_29.txt |
AC |
1 ms |
256 KB |
test_30.txt |
WA |
1 ms |
256 KB |