Borderou de evaluare (job #1876937)

Utilizator MoodyFaresFares Mohamad MoodyFares Data 12 februarie 2017 19:14:36
Problema Origami Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 100

Raport evaluator

Compilare: user.cpp: In function ‘int main()’: user.cpp:4:48: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] int main() { freopen ("origami.in", "r", stdin); freopen ("origami.out", "w", stdout); int N, K, max1 = 0, max2 = 0; scanf ("%d%d", &N, &K); n1 = n2 = N; for (int i = 1; i <= N; ++i) v1[i] = v2[i] = 1; for (int i = 1; i <= K; ++i) { int tip, x; scanf ("%d%d", &tip, &x); if (tip == 1) make (v1, x, n1); else make (v2, x, n2); } for (int i = 1; i <= n1; ++i) max1 = max (max1, v1[i]); for (int i = 1; i <= n2; ++i) max2 = max (max2, v2[i]); printf ("%d %d %d\n", n2, n1, max1 * max2); return 0; } ^ user.cpp:4:86: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] int main() { freopen ("origami.in", "r", stdin); freopen ("origami.out", "w", stdout); int N, K, max1 = 0, max2 = 0; scanf ("%d%d", &N, &K); n1 = n2 = N; for (int i = 1; i <= N; ++i) v1[i] = v2[i] = 1; for (int i = 1; i <= K; ++i) { int tip, x; scanf ("%d%d", &tip, &x); if (tip == 1) make (v1, x, n1); else make (v2, x, n2); } for (int i = 1; i <= n1; ++i) max1 = max (max1, v1[i]); for (int i = 1; i <= n2; ++i) max2 = max (max2, v2[i]); printf ("%d %d %d\n", n2, n1, max1 * max2); return 0; } ^ user.cpp:4:140: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int main() { freopen ("origami.in", "r", stdin); freopen ("origami.out", "w", stdout); int N, K, max1 = 0, max2 = 0; scanf ("%d%d", &N, &K); n1 = n2 = N; for (int i = 1; i <= N; ++i) v1[i] = v2[i] = 1; for (int i = 1; i <= K; ++i) { int tip, x; scanf ("%d%d", &tip, &x); if (tip == 1) make (v1, x, n1); else make (v2, x, n2); } for (int i = 1; i <= n1; ++i) max1 = max (max1, v1[i]); for (int i = 1; i <= n2; ++i) max2 = max (max2, v2[i]); printf ("%d %d %d\n", n2, n1, max1 * max2); return 0; } ^ user.cpp:4:270: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int main() { freopen ("origami.in", "r", stdin); freopen ("origami.out", "w", stdout); int N, K, max1 = 0, max2 = 0; scanf ("%d%d", &N, &K); n1 = n2 = N; for (int i = 1; i <= N; ++i) v1[i] = v2[i] = 1; for (int i = 1; i <= K; ++i) { int tip, x; scanf ("%d%d", &tip, &x); if (tip == 1) make (v1, x, n1); else make (v2, x, n2); } for (int i = 1; i <= n1; ++i) max1 = max (max1, v1[i]); for (int i = 1; i <= n2; ++i) max2 = max (max2, v2[i]); printf ("%d %d %d\n", n2, n1, max1 * max2); return 0; } ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms260kbOK10
20ms264kbOK10
30ms260kbOK10
40ms260kbOK10
50ms264kbOK10
60ms264kbOK10
70ms264kbOK10
80ms264kbOK10
90ms264kbOK10
100ms260kbOK10
Punctaj total100

Ceva nu functioneaza?