# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3446 | mjy0503 | Great Pow! (kriii1_G) | C++98 | 0 ms | 1100 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <math.h>
int n;
int main(){
int m,c;
scanf("%d %d",&n,&m);
if(m==0 || n==1)
printf("%d\n",n);
else{
int i;
c=sqrt((double)n);
for(i=2;i<=c;i++){
if(n%i==0) break;
}
if(i==c+1 && n!=2)
printf("%d\n",n);
else
printf("1\n");
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |