QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#48538#3995. Terrible Additive Number Theory Problem13889577060#WA 28ms4568kbC++809b2022-09-14 15:09:002022-09-14 15:09:00

Judging History

This is the latest submission verdict.

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-09-14 15:09:00]
  • Judged
  • Verdict: WA
  • Time: 28ms
  • Memory: 4568kb
  • [2022-09-14 15:09:00]
  • Submitted

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> GetPrime(int n) {
  vector<bool> mark(n + 1);
  vector<int> Prime;
  for (int i = 2; i <= n; ++i) {
    if (!mark[i]) {
      Prime.emplace_back(i);
    }
    for (int j = 0; j < Prime.size() && i * Prime[j] <= n; ++j) {
      mark[i * Prime[j]] = true;
      if (i % Prime[j] == 0) {
        break;
      }
    }
  }
  return Prime;
}
int main() {
	long long n;
	cin >> n;
	auto p = GetPrime(2000000);
	int m = p.size();
	int ans = 0;
	for (int i = 3; i < m; ++i) {
		ll mul = 1ll * p[i - 1] * p[i - 2] * p[i - 3] + 1;
		if (mul <= n && mul % p[i] == 0) {
			ll div = mul / p[i];
			while (div % 2 == 0) {
				div /= 2;
			}
			if (div == 1) {
				ans++;
			}
		}
	}
	cout << ans << '\n';
}

详细

Test #1:

score: 100
Accepted
time: 25ms
memory: 4508kb

input:

100

output:

0

result:

ok 1 number(s): "0"

Test #2:

score: 0
Accepted
time: 15ms
memory: 4404kb

input:

10000

output:

1

result:

ok 1 number(s): "1"

Test #3:

score: 0
Accepted
time: 28ms
memory: 4440kb

input:

1767

output:

0

result:

ok 1 number(s): "0"

Test #4:

score: 0
Accepted
time: 20ms
memory: 4472kb

input:

9876

output:

1

result:

ok 1 number(s): "1"

Test #5:

score: 0
Accepted
time: 27ms
memory: 4524kb

input:

1800

output:

0

result:

ok 1 number(s): "0"

Test #6:

score: 0
Accepted
time: 20ms
memory: 4424kb

input:

9540

output:

1

result:

ok 1 number(s): "1"

Test #7:

score: 0
Accepted
time: 26ms
memory: 4420kb

input:

1926

output:

0

result:

ok 1 number(s): "0"

Test #8:

score: 0
Accepted
time: 12ms
memory: 4504kb

input:

8426

output:

1

result:

ok 1 number(s): "1"

Test #9:

score: 0
Accepted
time: 19ms
memory: 4500kb

input:

2022

output:

0

result:

ok 1 number(s): "0"

Test #10:

score: 0
Accepted
time: 19ms
memory: 4440kb

input:

7826

output:

1

result:

ok 1 number(s): "1"

Test #11:

score: 0
Accepted
time: 15ms
memory: 4424kb

input:

1000000000000000000

output:

1

result:

ok 1 number(s): "1"

Test #12:

score: 0
Accepted
time: 20ms
memory: 4500kb

input:

284398329857324927

output:

1

result:

ok 1 number(s): "1"

Test #13:

score: 0
Accepted
time: 19ms
memory: 4528kb

input:

928473658274163764

output:

1

result:

ok 1 number(s): "1"

Test #14:

score: 0
Accepted
time: 13ms
memory: 4568kb

input:

2435

output:

1

result:

ok 1 number(s): "1"

Test #15:

score: 0
Accepted
time: 15ms
memory: 4468kb

input:

2430

output:

0

result:

ok 1 number(s): "0"

Test #16:

score: 0
Accepted
time: 19ms
memory: 4504kb

input:

2425

output:

0

result:

ok 1 number(s): "0"

Test #17:

score: -100
Wrong Answer
time: 19ms
memory: 4532kb

input:

2431

output:

0

result:

wrong answer 1st numbers differ - expected: '1', found: '0'