Submission #3668208
Source Code Expand
#include "grader.h" #include <vector> using namespace std; const int MAX=32000; vector<int> prime; bool isprime[MAX]; void sieve(){ for(int i=3; i<MAX; i+=2){ isprime[i]=1; } isprime[2]=1; prime.push_back(2); for(int i=3; i<MAX; i++){ if(isprime[i]){ prime.push_back(i); for(int j=2*i; j<MAX; j+=i){ isprime[j]=0; } } } return; } void taro(int N) { sieve(); int i0=-1; for(int i=0; i<prime.size(); i++){ if(N%prime[i]==0){ N/=prime[i]; i0=i; break; } } if(i0==-1 || N==1){ send(1); return; } for(int i=0; i<12; i++){ if(i0&1) send(1); else send(0); i0/=2; } } int jiro(int S, int X[]) { if(S==1) return -1; sieve(); int ans=0; for(int i=0; i<12; i++){ if(X[i]) ans^=(1<<i); } return prime[ans]; }
Submission Info
Submission Time | |
---|---|
Task | B - 合成数を倒せ (Prime Hazard) |
User | chocorusk |
Language | IOI-Style C++ (GCC 5.4.1) |
Score | 100 |
Code Size | 813 Byte |
Status | AC |
Exec Time | 7 ms |
Memory | 988 KB |
Compile Error
./grader.cpp: In function ‘int main(int, char**)’: ./grader.cpp:30:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int N; scanf("%d", &N); ^ ./grader.cpp:41:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &bits_size); ^ ./grader.cpp:44:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", bits+i); ^
Judge Result
Set Name | Subtask1 | Subtask2 | ||||
---|---|---|---|---|---|---|
Score / Max Score | 50 / 50 | 50 / 50 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Subtask1 | subtask1/1, subtask1/10, subtask1/2, subtask1/3, subtask1/4, subtask1/5, subtask1/6, subtask1/7, subtask1/8, subtask1/9 |
Subtask2 | subtask2/1, subtask2/10, subtask2/2, subtask2/3, subtask2/4, subtask2/5, subtask2/6, subtask2/7, subtask2/8, subtask2/9 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask1/1 | AC | 7 ms | 880 KB |
subtask1/10 | AC | 5 ms | 856 KB |
subtask1/2 | AC | 5 ms | 964 KB |
subtask1/3 | AC | 5 ms | 968 KB |
subtask1/4 | AC | 5 ms | 980 KB |
subtask1/5 | AC | 5 ms | 964 KB |
subtask1/6 | AC | 5 ms | 980 KB |
subtask1/7 | AC | 5 ms | 980 KB |
subtask1/8 | AC | 5 ms | 976 KB |
subtask1/9 | AC | 5 ms | 840 KB |
subtask2/1 | AC | 5 ms | 972 KB |
subtask2/10 | AC | 5 ms | 976 KB |
subtask2/2 | AC | 5 ms | 852 KB |
subtask2/3 | AC | 5 ms | 984 KB |
subtask2/4 | AC | 5 ms | 976 KB |
subtask2/5 | AC | 5 ms | 980 KB |
subtask2/6 | AC | 5 ms | 988 KB |
subtask2/7 | AC | 5 ms | 980 KB |
subtask2/8 | AC | 5 ms | 964 KB |
subtask2/9 | AC | 4 ms | 792 KB |