Pagini recente » Borderou de evaluare (job #67534) | Borderou de evaluare (job #1978109) | Borderou de evaluare (job #2662391) | Borderou de evaluare (job #1978127)
Borderou de evaluare (job #1978127)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:3:139: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘short int*’ [-Wformat=]
using namespace std;int a[2][5005];int main(){freopen("100m.in","r",stdin);freopen("100m.out","w",stdout);short n,k,i;int p;scanf("%d", &n);a[1][1] = 1;for(i=2;i<=n;++i){p=i&1;a[p][1]=1;a[p][i]=(long long)a[1-p][i-1]*i%MOD;for(k=2;k<i;++k){a[p][k]=(long long)k*(a[1-p][k]+a[1-p][k-1])%MOD;}}p=0;for(i=1;i<=n;++i){p=(p+a[n&1][i])%MOD;}printf("%d\n",p);return 0;}
^
user.cpp:3:75: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int a[2][5005];int main(){freopen("100m.in","r",stdin);freopen("100m.out","w",stdout);short n,k,i;int p;scanf("%d", &n);a[1][1] = 1;for(i=2;i<=n;++i){p=i&1;a[p][1]=1;a[p][i]=(long long)a[1-p][i-1]*i%MOD;for(k=2;k<i;++k){a[p][k]=(long long)k*(a[1-p][k]+a[1-p][k-1])%MOD;}}p=0;for(i=1;i<=n;++i){p=(p+a[n&1][i])%MOD;}printf("%d\n",p);return 0;}
^
user.cpp:3:106: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int a[2][5005];int main(){freopen("100m.in","r",stdin);freopen("100m.out","w",stdout);short n,k,i;int p;scanf("%d", &n);a[1][1] = 1;for(i=2;i<=n;++i){p=i&1;a[p][1]=1;a[p][i]=(long long)a[1-p][i-1]*i%MOD;for(k=2;k<i;++k){a[p][k]=(long long)k*(a[1-p][k]+a[1-p][k-1])%MOD;}}p=0;for(i=1;i<=n;++i){p=(p+a[n&1][i])%MOD;}printf("%d\n",p);return 0;}
^
user.cpp:3:140: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int a[2][5005];int main(){freopen("100m.in","r",stdin);freopen("100m.out","w",stdout);short n,k,i;int p;scanf("%d", &n);a[1][1] = 1;for(i=2;i<=n;++i){p=i&1;a[p][1]=1;a[p][i]=(long long)a[1-p][i-1]*i%MOD;for(k=2;k<i;++k){a[p][k]=(long long)k*(a[1-p][k]+a[1-p][k-1])%MOD;}}p=0;for(i=1;i<=n;++i){p=(p+a[n&1][i])%MOD;}printf("%d\n",p);return 0;}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 280kb | OK | 4 |
2 | 0ms | 276kb | OK | 4 |
3 | 236ms | 308kb | OK | 4 |
4 | 0ms | 280kb | OK | 4 |
5 | 0ms | 276kb | OK | 4 |
6 | 140ms | 304kb | OK | 4 |
7 | 8ms | 284kb | OK | 4 |
8 | 444ms | 316kb | OK | 4 |
9 | 40ms | 300kb | OK | 4 |
10 | 60ms | 292kb | OK | 4 |
11 | 120ms | 308kb | OK | 4 |
12 | 172ms | 304kb | OK | 4 |
13 | 216ms | 308kb | OK | 4 |
14 | 260ms | 316kb | OK | 4 |
15 | 304ms | 312kb | OK | 4 |
16 | 348ms | 312kb | OK | 4 |
17 | 376ms | 312kb | OK | 4 |
18 | 408ms | 312kb | OK | 4 |
19 | 476ms | 312kb | OK | 4 |
20 | 480ms | 316kb | OK | 4 |
21 | 4ms | 288kb | OK | 4 |
22 | 0ms | 292kb | OK | 4 |
23 | 0ms | 276kb | OK | 4 |
24 | 0ms | 280kb | OK | 4 |
25 | 428ms | 312kb | OK | 4 |
Punctaj total | 100 |