Pagini recente » Borderou de evaluare (job #2271403) | Borderou de evaluare (job #1535327) | Borderou de evaluare (job #2426914) | Borderou de evaluare (job #2244568) | Borderou de evaluare (job #1675951)
Borderou de evaluare (job #1675951)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:2:409: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int p;int x, n, m;int sol1[210][210];int sol2[210][210];void generare(){sol1[0][0] = sol2[0][0] = 1;for(int i = 1; i <= 200; i++){sol1[i][i] = 1;sol2[i][i] = 1;for(int j = 1; j <= i; j++){sol1[i][j] = sol1[i - 1][j - 1] - sol1[i - 1][j] * (i - 1);sol1[i][j] %= 98999;sol2[i][j] = sol2[i - 1][j - 1] + sol2[i - 1][j] * j;sol2[i][j] %= 98999;}}}int main(){freopen("stirling.in", "r", stdin);freopen("stirling.out", "w", stdout);scanf("%d", &p);generare();for(int i = 0; i < p; i++){scanf("%d %d %d", &x, &n, &m);if(x == 1){printf("%d\n", sol1[n][m]);}else if(x == 2){printf("%d\n", sol2[n][m]);}}return 0;}
^
user.cpp:2:446: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int p;int x, n, m;int sol1[210][210];int sol2[210][210];void generare(){sol1[0][0] = sol2[0][0] = 1;for(int i = 1; i <= 200; i++){sol1[i][i] = 1;sol2[i][i] = 1;for(int j = 1; j <= i; j++){sol1[i][j] = sol1[i - 1][j - 1] - sol1[i - 1][j] * (i - 1);sol1[i][j] %= 98999;sol2[i][j] = sol2[i - 1][j - 1] + sol2[i - 1][j] * j;sol2[i][j] %= 98999;}}}int main(){freopen("stirling.in", "r", stdin);freopen("stirling.out", "w", stdout);scanf("%d", &p);generare();for(int i = 0; i < p; i++){scanf("%d %d %d", &x, &n, &m);if(x == 1){printf("%d\n", sol1[n][m]);}else if(x == 2){printf("%d\n", sol2[n][m]);}}return 0;}
^
user.cpp:2:462: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int p;int x, n, m;int sol1[210][210];int sol2[210][210];void generare(){sol1[0][0] = sol2[0][0] = 1;for(int i = 1; i <= 200; i++){sol1[i][i] = 1;sol2[i][i] = 1;for(int j = 1; j <= i; j++){sol1[i][j] = sol1[i - 1][j - 1] - sol1[i - 1][j] * (i - 1);sol1[i][j] %= 98999;sol2[i][j] = sol2[i - 1][j - 1] + sol2[i - 1][j] * j;sol2[i][j] %= 98999;}}}int main(){freopen("stirling.in", "r", stdin);freopen("stirling.out", "w", stdout);scanf("%d", &p);generare();for(int i = 0; i < p; i++){scanf("%d %d %d", &x, &n, &m);if(x == 1){printf("%d\n", sol1[n][m]);}else if(x == 2){printf("%d\n", sol2[n][m]);}}return 0;}
^
user.cpp:2:530: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int p;int x, n, m;int sol1[210][210];int sol2[210][210];void generare(){sol1[0][0] = sol2[0][0] = 1;for(int i = 1; i <= 200; i++){sol1[i][i] = 1;sol2[i][i] = 1;for(int j = 1; j <= i; j++){sol1[i][j] = sol1[i - 1][j - 1] - sol1[i - 1][j] * (i - 1);sol1[i][j] %= 98999;sol2[i][j] = sol2[i - 1][j - 1] + sol2[i - 1][j] * j;sol2[i][j] %= 98999;}}}int main(){freopen("stirling.in", "r", stdin);freopen("stirling.out", "w", stdout);scanf("%d", &p);generare();for(int i = 0; i < p; i++){scanf("%d %d %d", &x, &n, &m);if(x == 1){printf("%d\n", sol1[n][m]);}else if(x == 2){printf("%d\n", sol2[n][m]);}}return 0;}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 600kb | OK | 10 |
2 | 0ms | 604kb | OK | 10 |
3 | 0ms | 596kb | OK | 10 |
4 | 0ms | 600kb | OK | 10 |
5 | 0ms | 596kb | OK | 10 |
6 | 0ms | 604kb | OK | 10 |
7 | 0ms | 596kb | OK | 10 |
8 | 0ms | 600kb | OK | 10 |
9 | 0ms | 596kb | OK | 10 |
10 | 0ms | 600kb | OK | 10 |
Punctaj total | 100 |