QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#391164#3792. 搞笑版费马大定理秦始皇派蒙恬还原神舟十二 (Jiancong Wen, Chu Jin, Zekai Zhang)100 ✓10ms3676kbC++171.1kb2024-04-16 14:16:502024-04-16 14:16:50

Judging History

This is the latest submission verdict.

  • [2024-04-16 14:16:50]
  • Judged
  • Verdict: 100
  • Time: 10ms
  • Memory: 3676kb
  • [2024-04-16 14:16:50]
  • Submitted

answer

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <bitset>
#include <cstdio>
#include <string>
#include <iomanip>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define lowbit(x) x&(-x)
#define pi 3.14159265358
#define lc k<<1;
#define rc k<<1|1
#define ppb push_back
#define int long long
#define mod 1000000007
#define fori(i,l,r) for(int i=l;i<=r;i++)
#define forj(j,l,r) for(int j=l;j<=r;j++)
using namespace std;
typedef long long ll;
typedef unsigned long long ULL;
typedef pair <int, int> pll;
const int N = 2e5 + 10;
const int P = 131;
ll t, n, m;
signed main() {
	ios::sync_with_stdio(0);
	cin.tie();
	cout.tie();
	ll x, y;
	int cnt = 1;
	while (cin >> x >> y) {
		int ans = 0;
		for (int i = x; i <= min(x + 1000, y); i++) {
			for (int j = x; j <= min(x + 1000, y); j++) {
				if (((i * i * i + j * j * j) - 3) % 10 == 0 && ((i * i * i + j * j * j) - 3) / 10 <= y) {

					ans++;
				}
			}
		}
		cout << "Case " << cnt << ":" << " " << ans << "\n";
		cnt++;
	}

}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 10ms
memory: 3676kb

input:

2 13
123 456789
111 9999999
1 100000000
500 100000000
700 100000000
750 100000000
780 98765432
788 98421754
788 98421753

output:

Case 1: 2
Case 2: 16
Case 3: 9998
Case 4: 88224
Case 5: 14440
Case 6: 1650
Case 7: 370
Case 8: 26
Case 9: 2
Case 10: 0

result:

ok 10 lines