Pagini recente » Borderou de evaluare (job #3004800) | Borderou de evaluare (job #2760491) | Borderou de evaluare (job #1434531) | Borderou de evaluare (job #1212356) | Borderou de evaluare (job #1978860)
Borderou de evaluare (job #1978860)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:2:107: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;const int mod=666013;int v[2][5010],fact[5010];int main(){freopen("100m.in","r",stdin);freopen("100m.out","w",stdout);int n,sol=0;scanf("%d",&n);fact[0]=1;for(int i=1;i<=n;i++) {fact[i]=(1LL*fact[i-1]*i)%mod;}for(int i=1;i<=n;i++){v[1][1]=1;v[1][i]=fact[i];for(int j=2;j<i;j++){v[1][j]=(1LL*(v[0][j-1]+v[0][j])*j)%mod;}for(int j=1;j<=i;j++){v[0][j]=v[1][j];}}for(int i=1;i<=n;i++){sol=(sol+v[1][i])%mod;}printf("%d",sol);return 0;}
^
user.cpp:2:138: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;const int mod=666013;int v[2][5010],fact[5010];int main(){freopen("100m.in","r",stdin);freopen("100m.out","w",stdout);int n,sol=0;scanf("%d",&n);fact[0]=1;for(int i=1;i<=n;i++) {fact[i]=(1LL*fact[i-1]*i)%mod;}for(int i=1;i<=n;i++){v[1][1]=1;v[1][i]=fact[i];for(int j=2;j<i;j++){v[1][j]=(1LL*(v[0][j-1]+v[0][j])*j)%mod;}for(int j=1;j<=i;j++){v[0][j]=v[1][j];}}for(int i=1;i<=n;i++){sol=(sol+v[1][i])%mod;}printf("%d",sol);return 0;}
^
user.cpp:2:165: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;const int mod=666013;int v[2][5010],fact[5010];int main(){freopen("100m.in","r",stdin);freopen("100m.out","w",stdout);int n,sol=0;scanf("%d",&n);fact[0]=1;for(int i=1;i<=n;i++) {fact[i]=(1LL*fact[i-1]*i)%mod;}for(int i=1;i<=n;i++){v[1][1]=1;v[1][i]=fact[i];for(int j=2;j<i;j++){v[1][j]=(1LL*(v[0][j-1]+v[0][j])*j)%mod;}for(int j=1;j<=i;j++){v[0][j]=v[1][j];}}for(int i=1;i<=n;i++){sol=(sol+v[1][i])%mod;}printf("%d",sol);return 0;}
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 288kb | OK | 4 |
| 2 | 0ms | 280kb | OK | 4 |
| 3 | 228ms | 332kb | OK | 4 |
| 4 | 0ms | 284kb | OK | 4 |
| 5 | 0ms | 288kb | OK | 4 |
| 6 | 136ms | 320kb | OK | 4 |
| 7 | 8ms | 296kb | OK | 4 |
| 8 | 428ms | 332kb | OK | 4 |
| 9 | 40ms | 304kb | OK | 4 |
| 10 | 56ms | 312kb | OK | 4 |
| 11 | 116ms | 320kb | OK | 4 |
| 12 | 164ms | 320kb | OK | 4 |
| 13 | 208ms | 324kb | OK | 4 |
| 14 | 252ms | 332kb | OK | 4 |
| 15 | 296ms | 332kb | OK | 4 |
| 16 | 336ms | 332kb | OK | 4 |
| 17 | 364ms | 332kb | OK | 4 |
| 18 | 392ms | 328kb | OK | 4 |
| 19 | 460ms | 328kb | OK | 4 |
| 20 | 460ms | 332kb | OK | 4 |
| 21 | 4ms | 296kb | OK | 4 |
| 22 | 0ms | 296kb | OK | 4 |
| 23 | 0ms | 288kb | OK | 4 |
| 24 | 0ms | 288kb | OK | 4 |
| 25 | 412ms | 336kb | OK | 4 |
| Punctaj total | 100 |