Pagini recente » Borderou de evaluare (job #419728) | Borderou de evaluare (job #2643502) | Borderou de evaluare (job #1648222) | Borderou de evaluare (job #1656943) | Borderou de evaluare (job #2148183)
Borderou de evaluare (job #2148183)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:2:90: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;char v[1000];int main(){int n,i;char c;freopen("numar3.in","r",stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);if (n<=1000000) {for (i=1;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);for (i=1;i<=n;i++)printf("%c", v[i]);}else {for (i=1;i<=4*n/5;i++)scanf("%c", &c),printf("%c", c);for (;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);fclose(stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);for (i=1;i<=4*n/5;i++)scanf("%c", &c);for (i=0;i<n/5;i++)printf("%c", v[i]);}return 0;}
^
user.cpp:2:123: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;char v[1000];int main(){int n,i;char c;freopen("numar3.in","r",stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);if (n<=1000000) {for (i=1;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);for (i=1;i<=n;i++)printf("%c", v[i]);}else {for (i=1;i<=4*n/5;i++)scanf("%c", &c),printf("%c", c);for (;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);fclose(stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);for (i=1;i<=4*n/5;i++)scanf("%c", &c);for (i=0;i<n/5;i++)printf("%c", v[i]);}return 0;}
^
user.cpp:2:141: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;char v[1000];int main(){int n,i;char c;freopen("numar3.in","r",stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);if (n<=1000000) {for (i=1;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);for (i=1;i<=n;i++)printf("%c", v[i]);}else {for (i=1;i<=4*n/5;i++)scanf("%c", &c),printf("%c", c);for (;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);fclose(stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);for (i=1;i<=4*n/5;i++)scanf("%c", &c);for (i=0;i<n/5;i++)printf("%c", v[i]);}return 0;}
^
user.cpp:2:195: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;char v[1000];int main(){int n,i;char c;freopen("numar3.in","r",stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);if (n<=1000000) {for (i=1;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);for (i=1;i<=n;i++)printf("%c", v[i]);}else {for (i=1;i<=4*n/5;i++)scanf("%c", &c),printf("%c", c);for (;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);fclose(stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);for (i=1;i<=4*n/5;i++)scanf("%c", &c);for (i=0;i<n/5;i++)printf("%c", v[i]);}return 0;}
^
user.cpp:2:321: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;char v[1000];int main(){int n,i;char c;freopen("numar3.in","r",stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);if (n<=1000000) {for (i=1;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);for (i=1;i<=n;i++)printf("%c", v[i]);}else {for (i=1;i<=4*n/5;i++)scanf("%c", &c),printf("%c", c);for (;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);fclose(stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);for (i=1;i<=4*n/5;i++)scanf("%c", &c);for (i=0;i<n/5;i++)printf("%c", v[i]);}return 0;}
^
user.cpp:2:355: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;char v[1000];int main(){int n,i;char c;freopen("numar3.in","r",stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);if (n<=1000000) {for (i=1;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);for (i=1;i<=n;i++)printf("%c", v[i]);}else {for (i=1;i<=4*n/5;i++)scanf("%c", &c),printf("%c", c);for (;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);fclose(stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);for (i=1;i<=4*n/5;i++)scanf("%c", &c);for (i=0;i<n/5;i++)printf("%c", v[i]);}return 0;}
^
user.cpp:2:430: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;char v[1000];int main(){int n,i;char c;freopen("numar3.in","r",stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);if (n<=1000000) {for (i=1;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);for (i=1;i<=n;i++)printf("%c", v[i]);}else {for (i=1;i<=4*n/5;i++)scanf("%c", &c),printf("%c", c);for (;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);fclose(stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);for (i=1;i<=4*n/5;i++)scanf("%c", &c);for (i=0;i<n/5;i++)printf("%c", v[i]);}return 0;}
^
user.cpp:2:448: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;char v[1000];int main(){int n,i;char c;freopen("numar3.in","r",stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);if (n<=1000000) {for (i=1;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);for (i=1;i<=n;i++)printf("%c", v[i]);}else {for (i=1;i<=4*n/5;i++)scanf("%c", &c),printf("%c", c);for (;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);fclose(stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);for (i=1;i<=4*n/5;i++)scanf("%c", &c);for (i=0;i<n/5;i++)printf("%c", v[i]);}return 0;}
^
user.cpp:2:486: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;char v[1000];int main(){int n,i;char c;freopen("numar3.in","r",stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);if (n<=1000000) {for (i=1;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);for (i=1;i<=n;i++)printf("%c", v[i]);}else {for (i=1;i<=4*n/5;i++)scanf("%c", &c),printf("%c", c);for (;i<=n;i++)scanf("%c", &v[i]);next_permutation(v+1,v+n+1);fclose(stdin);freopen("numar3.out","w",stdout);scanf("%d\n", &n);for (i=1;i<=4*n/5;i++)scanf("%c", &c);for (i=0;i<n/5;i++)printf("%c", v[i]);}return 0;}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 1500kb | OK | 10 |
2 | 0ms | 1500kb | OK | 10 |
3 | 0ms | 1496kb | OK | 10 |
4 | 0ms | 1428kb | Wall time limit exceeded. | 0 |
5 | 0ms | 1424kb | Wall time limit exceeded. | 0 |
6 | 424ms | 1436kb | Killed by signal 11(SIGSEGV). | 0 |
7 | Depăşit | 1436kb | Time limit exceeded. | 0 |
8 | Depăşit | 1432kb | Time limit exceeded. | 0 |
9 | Depăşit | 1436kb | Time limit exceeded. | 0 |
10 | Depăşit | 1432kb | Time limit exceeded. | 0 |
Punctaj total | 30 |