Borderou de evaluare (job #2092400)

Utilizator andrei20003Ionescu Andrei andrei20003 Data 21 decembrie 2017 17:05:19
Problema Permutari Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 100

Raport evaluator

Compilare: user.cpp: In function ‘int mult(int*, int*, int)’: user.cpp:2:137: warning: no return statement in function returning non-void [-Wreturn-type] int d[2][205][20005];int mult(int a[],int b[],int c){int i,t=0;for(i=1;i<=b[0] || t;i++){a[i]=b[i]*c+t;t=a[i]/10;a[i]=a[i]%10;}a[0]=i-1;}int add(int a[],int b[]){int i,t=0;for(i=1;i<=a[0] || i<=b[0] || t;i++){a[i]=a[i]+b[i]+t;t=a[i]/10;a[i]=a[i]%10;}a[0]=i-1;}int main(){freopen("perm.in","r",stdin);freopen("perm.out","w",stdout);int n,k,i,j;scanf("%d%d",&n,&k);d[0][0][0]=d[0][0][1]=1;for(i=1;i<=n;i++){if (i==2)d[0][0][0]=d[0][0][1]=0;for(j=1;j<=k;j++){mult(d[i%2][j],d[1-i%2][j],i-1);add(d[i%2][j],d[1-i%2][j-1]);}}for(i=d[n%2][k][0];i>=1;i--)printf("%d",d[n%2][k][i]);return 0;} ^ user.cpp: In function ‘int add(int*, int*)’: user.cpp:2:260: warning: no return statement in function returning non-void [-Wreturn-type] int d[2][205][20005];int mult(int a[],int b[],int c){int i,t=0;for(i=1;i<=b[0] || t;i++){a[i]=b[i]*c+t;t=a[i]/10;a[i]=a[i]%10;}a[0]=i-1;}int add(int a[],int b[]){int i,t=0;for(i=1;i<=a[0] || i<=b[0] || t;i++){a[i]=a[i]+b[i]+t;t=a[i]/10;a[i]=a[i]%10;}a[0]=i-1;}int main(){freopen("perm.in","r",stdin);freopen("perm.out","w",stdout);int n,k,i,j;scanf("%d%d",&n,&k);d[0][0][0]=d[0][0][1]=1;for(i=1;i<=n;i++){if (i==2)d[0][0][0]=d[0][0][1]=0;for(j=1;j<=k;j++){mult(d[i%2][j],d[1-i%2][j],i-1);add(d[i%2][j],d[1-i%2][j-1]);}}for(i=d[n%2][k][0];i>=1;i--)printf("%d",d[n%2][k][i]);return 0;} ^ user.cpp: In function ‘int main()’: user.cpp:2:300: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] int d[2][205][20005];int mult(int a[],int b[],int c){int i,t=0;for(i=1;i<=b[0] || t;i++){a[i]=b[i]*c+t;t=a[i]/10;a[i]=a[i]%10;}a[0]=i-1;}int add(int a[],int b[]){int i,t=0;for(i=1;i<=a[0] || i<=b[0] || t;i++){a[i]=a[i]+b[i]+t;t=a[i]/10;a[i]=a[i]%10;}a[0]=i-1;}int main(){freopen("perm.in","r",stdin);freopen("perm.out","w",stdout);int n,k,i,j;scanf("%d%d",&n,&k);d[0][0][0]=d[0][0][1]=1;for(i=1;i<=n;i++){if (i==2)d[0][0][0]=d[0][0][1]=0;for(j=1;j<=k;j++){mult(d[i%2][j],d[1-i%2][j],i-1);add(d[i%2][j],d[1-i%2][j-1]);}}for(i=d[n%2][k][0];i>=1;i--)printf("%d",d[n%2][k][i]);return 0;} ^ user.cpp:2:331: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] int d[2][205][20005];int mult(int a[],int b[],int c){int i,t=0;for(i=1;i<=b[0] || t;i++){a[i]=b[i]*c+t;t=a[i]/10;a[i]=a[i]%10;}a[0]=i-1;}int add(int a[],int b[]){int i,t=0;for(i=1;i<=a[0] || i<=b[0] || t;i++){a[i]=a[i]+b[i]+t;t=a[i]/10;a[i]=a[i]%10;}a[0]=i-1;}int main(){freopen("perm.in","r",stdin);freopen("perm.out","w",stdout);int n,k,i,j;scanf("%d%d",&n,&k);d[0][0][0]=d[0][0][1]=1;for(i=1;i<=n;i++){if (i==2)d[0][0][0]=d[0][0][1]=0;for(j=1;j<=k;j++){mult(d[i%2][j],d[1-i%2][j],i-1);add(d[i%2][j],d[1-i%2][j-1]);}}for(i=d[n%2][k][0];i>=1;i--)printf("%d",d[n%2][k][i]);return 0;} ^ user.cpp:2:363: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int d[2][205][20005];int mult(int a[],int b[],int c){int i,t=0;for(i=1;i<=b[0] || t;i++){a[i]=b[i]*c+t;t=a[i]/10;a[i]=a[i]%10;}a[0]=i-1;}int add(int a[],int b[]){int i,t=0;for(i=1;i<=a[0] || i<=b[0] || t;i++){a[i]=a[i]+b[i]+t;t=a[i]/10;a[i]=a[i]%10;}a[0]=i-1;}int main(){freopen("perm.in","r",stdin);freopen("perm.out","w",stdout);int n,k,i,j;scanf("%d%d",&n,&k);d[0][0][0]=d[0][0][1]=1;for(i=1;i<=n;i++){if (i==2)d[0][0][0]=d[0][0][1]=0;for(j=1;j<=k;j++){mult(d[i%2][j],d[1-i%2][j],i-1);add(d[i%2][j],d[1-i%2][j-1]);}}for(i=d[n%2][k][0];i>=1;i--)printf("%d",d[n%2][k][i]);return 0;} ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms504kbOk!10
20ms568kbOk!10
30ms812kbOk!10
48ms1052kbOk!10
536ms1504kbOk!10
60ms448kbOk!10
70ms996kbOk!10
832ms1520kbOk!10
90ms776kbOk!10
1028ms1812kbOk!10
Punctaj total100

Ceva nu functioneaza?