Compilare: user.cpp: In function ‘int main()’: user.cpp:2:162: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘short int*’ [-Wformat=] using namespace std;const int MOD = 666013;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:2:98: 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 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:2:129: 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 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:2:163: 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 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;} ^