- Bio
- Accepted Problems
- Recent Activities
- Recent Solutions
Problem Tags
- 顺序结构
- 11
- 模拟
- 9
- 2023
- 7
- 分支结构
- 7
- O2优化
- 6
- GESP
- 6
- 循环结构
- 5
- 数学
- 4
- 2022
- 3
- 数组
- 3
- 语言月赛
- 3
- 贪心
- 2
- NOIp 提高组
- 2
- 排序
- 2
- NOIp 普及组
- 2
- 字符串
- 2
- 高精度
- 2
- 递归
- 2
- USACO
- 2
- 队列
- 2
#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;
}
By signing up a HFOJ universal account, you can submit code and join discussions in all online judging services provided by us.