Borderou de evaluare (job #1978127)

Utilizator 2016Teo@Balan 2016 Data 6 mai 2017 23:13:16
Problema 100m Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 100

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
10ms280kbOK4
20ms276kbOK4
3236ms308kbOK4
40ms280kbOK4
50ms276kbOK4
6140ms304kbOK4
78ms284kbOK4
8444ms316kbOK4
940ms300kbOK4
1060ms292kbOK4
11120ms308kbOK4
12172ms304kbOK4
13216ms308kbOK4
14260ms316kbOK4
15304ms312kbOK4
16348ms312kbOK4
17376ms312kbOK4
18408ms312kbOK4
19476ms312kbOK4
20480ms316kbOK4
214ms288kbOK4
220ms292kbOK4
230ms276kbOK4
240ms280kbOK4
25428ms312kbOK4
Punctaj total100

Ceva nu functioneaza?