QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#857253#9999. 好成绩myloveATRIAC ✓0ms3712kbC++20811b2025-01-15 13:51:372025-01-15 13:51:47

Judging History

你现在查看的是最新测评结果

  • [2025-01-15 13:51:47]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3712kb
  • [2025-01-15 13:51:37]
  • 提交

answer

#include<bits/stdc++.h>
#include<queue>
#include<string.h>
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#define int long long
#define ll long long
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define nl t[n].l
#define nr t[n].r
#define gcd __gcd
#define itn int
#define db long double
using namespace std;
const int maxn=3e6+50;
const int inf=1e18+10;
const int INF=2e18;
const int mod=998244353;
//const db eps=1e-8;
//const db pi=acos(-1.0);
#define pop_count __builtin_popcountll
int f[maxn];
int s[maxn],w[maxn],d[maxn];
int t[maxn];
void solve(){
    cout<<"83";

}


signed main()
{
   ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
   int __=1;
   srand((time(0)));
  // cin>>__;
  while(__--)
  {
       solve();
  }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3712kb

input:



output:

83

result:

ok single line: '83'