Submission #520887


Source Code Expand

#include<cstdio>
#include<cstring>
#include<cctype>
#include<cmath>
#include<climits>
#include<algorithm>
#include<vector>
#include<valarray>
#include<string>
#include<set>
#include<map>
#include<stack>
#include<queue>
using namespace std;
  
  
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define DREP(i,n) for(int i=n;i>0;i--)
#define Rep(i,m,n) for(int i=m;i<n;i++)
#define scani(a) scanf("%d",&a)
#define scand(a) scanf("%lf",&a)
#define scans(s) scanf("%s",s)
#define readi(a) int a;scanf("%d",&a)
#define printi(a) printf("%d",a)
#define prints(s) printf("%s",s)
#define even(n) (((n)+1)%2)
#define odd(n) ((n)%2)
#define sg(x) ((x)?1:0)
#define LF printf("\n")
#define SPACE printf(" ")
#define pb push_back
#define mp make_pair
#define bs binary_search
#define all(a) (a).begin(),(a).end()
#define MOD 100000007
  
typedef long long LL;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef pair<double,double> pdd;
typedef pair<int,int> pii;
  
const double pi=acos(-1.0);
double rad(double t){return t*pi/180.0;}
double deg(double d){return d*180.0/pi;}
int GCD(int x,int y){if(x<y)swap(x,y);return x%y?GCD(y,x%y):y;}
int LCM(int x,int y){return x/GCD(x,y)*y;}

bool Prime(int n){
  for(int i=2;i*i<=n;i++)
    if(n%i==0)return false;
  return true;
}

int main(){
  readi(n);
  if(n==1)printf("Not Prime\n");
  else if(Prime(n))printf("Prime\n");
  else if( n%2!=0 && n%5!=0 && n%3!=0)printf("Prime\n");
  else printf("Not Prime\n");
  return 0;
}

Submission Info

Submission Time
Task A - 素数判定
User buko1062000
Language C++ (GCC 4.9.2)
Score 100
Code Size 1610 Byte
Status AC
Exec Time 27 ms
Memory 800 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:58:11: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   readi(n);
           ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 4
AC × 34
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 24 ms 788 KiB
sample_02.txt AC 24 ms 708 KiB
sample_03.txt AC 27 ms 708 KiB
sample_04.txt AC 22 ms 792 KiB
test_01.txt AC 24 ms 712 KiB
test_02.txt AC 23 ms 792 KiB
test_03.txt AC 22 ms 708 KiB
test_04.txt AC 25 ms 796 KiB
test_05.txt AC 22 ms 796 KiB
test_06.txt AC 22 ms 792 KiB
test_07.txt AC 21 ms 672 KiB
test_08.txt AC 23 ms 684 KiB
test_09.txt AC 24 ms 792 KiB
test_10.txt AC 22 ms 700 KiB
test_11.txt AC 22 ms 800 KiB
test_12.txt AC 22 ms 708 KiB
test_13.txt AC 22 ms 796 KiB
test_14.txt AC 21 ms 792 KiB
test_15.txt AC 25 ms 668 KiB
test_16.txt AC 24 ms 796 KiB
test_17.txt AC 25 ms 704 KiB
test_18.txt AC 24 ms 788 KiB
test_19.txt AC 25 ms 792 KiB
test_20.txt AC 24 ms 796 KiB
test_21.txt AC 24 ms 792 KiB
test_22.txt AC 24 ms 792 KiB
test_23.txt AC 24 ms 796 KiB
test_24.txt AC 24 ms 800 KiB
test_25.txt AC 25 ms 788 KiB
test_26.txt AC 23 ms 692 KiB
test_27.txt AC 23 ms 792 KiB
test_28.txt AC 26 ms 800 KiB
test_29.txt AC 26 ms 788 KiB
test_30.txt AC 23 ms 800 KiB