Submission #3782069
Source Code Expand
#include "grader.h" void prime(int garr[]){ int i,j,c=1; bool fl[131072]={0}; for(i=2;i<131072;i++){ if(fl[i]){continue;} garr[c]=i;c++; for(j=2*i;j<131072;j+=i){ fl[j]=1; } } } void taro(int n){ int i,j,parr[131072],w=0; prime(parr); for(i=1;i<4096;i++){ if(n%parr[i]==0){ w=i;break; } } for(i=0;i<12;i++){ send(w%2); w/=2; } } int jiro(int s,int x[]){ int parr[131072],r=0,i; prime(parr); for(i=0;i<12;i++){ r+=(x[i]*(1<<i)); } if(r!=0){return parr[r];} return -1; }
Submission Info
Submission Time | |
---|---|
Task | B - 合成数を倒せ (Prime Hazard) |
User | physics0523 |
Language | IOI-Style C++ (GCC 5.4.1) |
Score | 50 |
Code Size | 589 Byte |
Status | WA |
Exec Time | 6 ms |
Memory | 1112 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 | 0 / 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 | 6 ms | 1104 KB |
subtask1/10 | AC | 6 ms | 1100 KB |
subtask1/2 | AC | 6 ms | 1096 KB |
subtask1/3 | AC | 6 ms | 1044 KB |
subtask1/4 | WA | 6 ms | 1112 KB |
subtask1/5 | WA | 6 ms | 1108 KB |
subtask1/6 | WA | 6 ms | 980 KB |
subtask1/7 | AC | 6 ms | 1044 KB |
subtask1/8 | AC | 6 ms | 1104 KB |
subtask1/9 | AC | 6 ms | 1052 KB |
subtask2/1 | AC | 6 ms | 980 KB |
subtask2/10 | AC | 6 ms | 1108 KB |
subtask2/2 | AC | 6 ms | 996 KB |
subtask2/3 | AC | 6 ms | 1056 KB |
subtask2/4 | AC | 6 ms | 1108 KB |
subtask2/5 | AC | 6 ms | 1060 KB |
subtask2/6 | AC | 6 ms | 1104 KB |
subtask2/7 | AC | 6 ms | 1044 KB |
subtask2/8 | AC | 6 ms | 996 KB |
subtask2/9 | AC | 6 ms | 852 KB |