Submission #1474397
Source Code Expand
//nupt2017team08 #include <iostream> #include <stdio.h> #include <math.h> #include <cstring> #include <algorithm> using namespace std; int N,a; const int mod = 1e9+7; int main() { //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); while(scanf("%d",&N)!=EOF) { long long ans = 1; int k=0; for(int i=1;i<=N;i++) { scanf("%d",&a); k++; if(a<2*k-1) { ans*=k; ans%=mod; k--; } } for(int i=1;i<=k;i++) { ans*=i; ans%=mod; } printf("%d\n",ans); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Robot Racing |
User | vjudge1 |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 693 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:34:26: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=] printf("%d\n",ans); ^ ./Main.cpp:20:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&a); ^
Judge Result
Set Name | Sample | Subtask | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | 400 / 400 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt |
Subtask | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | AC | 1 ms | 256 KB |
1_04.txt | AC | 1 ms | 256 KB |
1_05.txt | AC | 1 ms | 256 KB |
1_06.txt | AC | 1 ms | 256 KB |
1_07.txt | AC | 1 ms | 256 KB |
1_08.txt | AC | 1 ms | 256 KB |
1_09.txt | AC | 1 ms | 256 KB |
1_10.txt | AC | 1 ms | 256 KB |
2_00.txt | AC | 10 ms | 256 KB |
2_01.txt | AC | 11 ms | 256 KB |
2_02.txt | AC | 13 ms | 256 KB |
2_03.txt | AC | 11 ms | 256 KB |
2_04.txt | AC | 11 ms | 256 KB |
2_05.txt | AC | 11 ms | 256 KB |
2_06.txt | AC | 11 ms | 256 KB |
2_07.txt | AC | 11 ms | 256 KB |
2_08.txt | AC | 11 ms | 256 KB |
2_09.txt | AC | 11 ms | 256 KB |
2_10.txt | AC | 11 ms | 256 KB |
2_11.txt | AC | 12 ms | 256 KB |
2_12.txt | AC | 12 ms | 256 KB |