1. Home
  2. Record
  1. Login
  2. Language
    1. English
    2. 한국어
    3. 简体中文
    4. 正體中文

BC20260031

UID: 1166, Registered at 2023-9-3 20:07:17, last login at 2025-5-6 8:52:39, currently offline.

Solved 29 problems, RP: 181.09 (No. 234)

♂
  • Bio

    d⁡r⃗=x⃗\operatorname{d}\vec{r}=\vec{x} dr=x No,commander!\huge{\texttt{No,commander!}} No,commander!
    #include <bits/stdc++.h>
    using namespace std;
    #define ll long long
    #define ull unsigned ll
    const int maxn=1e5+10;
    
    int main(){
    	ios::sync_with_stdio(0);
    	cin.tie(0),cout.tie(0);
    	
    	return 0;
    }
    
    #include <bits/stdc++.h>
    using namespace std;
    #define ll long long
    #define ull unsigned ll
    const int maxn=1e5+10;
    
    class s{
    	public:
    		s(){
    		}
    };
    s a;
    
    int main(){}
    
    #include <bits/stdc++.h>
    using namespace std;
    #define ll long long
    #define ull unsigned ll
    const int maxn=1e5+10;
    
    int a[200],top=0;
    int b[]={113,116,122,129,212,231,226,233,225,307,311,326,331,237};
    bool f(int x){
    for(int i=0;i<14;i++)if(x==b[i])return 0;
    return 1;
    }
    
    int main(){
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    
    srand(time(NULL));
    for(int i=1;i<=13;i++)if(f(i+100))a[++top]=i+100;for(int i=15;i<=37;i++)if(f(i+100))a[++top]=i+100;
    for(int i=1;i<=36;i++)if(f(i+200))a[++top]=i+200;
    for(int i=1;i<=36;i++)if(f(i+300))a[++top]=i+300;
    cout<<'0'<<a[rand()%top+1]<<" love(s) 0"<<b[rand()%14];
    
    return 0;
    
    }
    
    
  • Recent Activities

    • GDOI2025 信心赛 OI
    • 2024-2025上学期初二竞赛组期末考下半场 IOI
    • 2024-2025第一学期初一竞赛组期末考 IOI
    • 2024-2025上学期初二竞赛组期末考上半场 IOI
    • NOIP 2024 模拟赛(广附联测) OI
    • 1116DP ACM/ICPC
    • 妙妙题 eJOI蓝题 IOI
    • CSP难度的题目 IOI
    • 初中练习 IOI
    • NOIP模拟赛 OI
    • CSP-S 2024 信心赛 IOI(Strict)
    • 国庆提高组30题(1~3号) IOI
    • 10.8 提高组后两题训练 OI
    • IOI2024 IOI
    • 2023-2024第二学期初一信息竞赛组期末考 IOI
    • 初一竞赛组作业——背包基础2 Assignment
    • 初一竞赛组作业——背包DP Assignment
    • 初一竞赛组作业——DP基础 Assignment
    • 20240118期望的线性选讲 ACM/ICPC
    • 20240116杂题选讲 IOI
    • 寒假集训1 Assignment
    • 2023上学期初一竞赛组期末考 OI
    • NOIP 题目选讲 IOI
    • CSP模拟 IOI
    • CSP-J 前两题真题汇总 Ledo
    • 初一2班从0开始学C++ Assignment
    • Uoib 2023 第二场 OI
    • S组初赛模拟题 OI
    • 9月8日居家练习 IOI
    • 初一上学习信息学入门测(1、2班) OI
49
Submitted
29
Accepted
0
Solutions Liked

Status

  • Judging Queue
  • Service Status

Development

  • Open Source
  • API

Support

  • Help
  • QQ Group
  1. About
  2. Contact Us
  3. Privacy
  4. Terms of Service
  5. Copyright Complaint
  6. Language
    1. English
    2. 한국어
    3. 简体中文
    4. 正體中文
  7. Legacy mode
  8. Theme
    1. Light
    2. Dark
  1. 粤ICP备2021104657号
  2. Worker 0, 12ms
  3. Powered by Hydro v4.14.1 Community

Don't have an account?

By signing up a HFOJ universal account, you can submit code and join discussions in all online judging services provided by us.

CLOSE

SIGN IN

Using your HFOJ universal account

Forgot password or username?