Submission #1406747
Source Code Expand
//Typical Dynamic programming Contest #include<stdio.h> int point[10000];//その点数が存在するなら!0 int N; int P[100]; int count; int search(int n); main(){ scanf("%d",&N); for(int i = 0;i < N;i++){ scanf("%d",&P[i]); } point[0] = 1; point[P[0]] = 1; count+= 2; for(int i = 1;i < N;i++){ for(int j = 0;j < 10000;j++){ if(point[j] && point[j] != i+1 && !point[j+P[i]]){ point[j+P[i]] = i+1; count++; } } } printf("%d\n",count); }
Submission Info
Submission Time | |
---|---|
Task | A - コンテスト |
User | Bantako |
Language | C++14 (GCC 5.4.1) |
Score | 2 |
Code Size | 579 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:9:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&N); ^ ./Main.cpp:11:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&P[i]); ^
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 2 / 2 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00, 01, 02, 90, 91 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00 | AC | 1 ms | 128 KB |
01 | AC | 1 ms | 128 KB |
02 | AC | 1 ms | 128 KB |
90 | AC | 1 ms | 128 KB |
91 | AC | 1 ms | 128 KB |