結果
問題 | No.713 素数の和 |
ユーザー |
![]() |
提出日時 | 2018-10-15 17:55:30 |
言語 | C++11 (gcc 13.3.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,098 bytes |
コンパイル時間 | 441 ms |
コンパイル使用メモリ | 33,636 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-12 18:34:37 |
合計ジャッジ時間 | 1,148 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 4 RE * 2 |
コンパイルメッセージ
main.cpp: In function ‘int main(int, char**)’: main.cpp:12:11: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘ull*’ {aka ‘long long unsigned int*’} [-Wformat=] 12 | scanf("%d", &N); | ~^ ~~ | | | | | ull* {aka long long unsigned int*} | int* | %lld main.cpp:16:12: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘ull’ {aka ‘long long unsigned int’} [-Wformat=] 16 | printf("%d\n", res); | ~^ ~~~ | | | | int ull {aka long long unsigned int} | %lld main.cpp:12:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 12 | scanf("%d", &N); | ~~~~~^~~~~~~~~~
ソースコード
#include <cstdio>#include <algorithm>using namespace std;typedef unsigned long long int ull;ull primes[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293,307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467,479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659,661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859,863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997};int main(int ac, char **av) {ull N, res = 0;scanf("%d", &N);for (ull i = 0; primes[i] <= N; i++) {res += primes[i];}printf("%d\n", res);return 0;}