QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#846344 | #9999. 好成绩 | dxbt | AC ✓ | 0ms | 3696kb | C++23 | 440b | 2025-01-07 07:34:03 | 2025-01-07 07:34:08 |
Judging History
answer
#include<bits/stdc++.h>
#define F(i,l,r) for(int i=(l),i##end=(r);i<=i##end;++i)
#define G(i,l,r) for(int i=(l),i##end=(r);i>=i##end;--i)
#define pii pair<int,int>
#define x first
#define y second
#define mp(x,y) make_pair(x,y)
#define ep emplace_back
using namespace std;
typedef long long ll;
int main()
{
cin.tie(0)->sync_with_stdio(false);
F(i,1,150)
{
if(i%3==2&&i%5==3&&i%7==6)cout<<i<<'\n';
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3696kb
input:
output:
83
result:
ok single line: '83'