Pixiv - KiraraShss
CloudFlare 自选IP测试
def p(ip):
ip_address = ip
response = ping(ip_address)
if response is not None:
delay = int(response * 1000)
return delay
else:
return 2333
Andy种树
using namespace std;
int n,q;
int l,r;
int a[5000000];
int main(){
cin>>n>>q;
while(q—){
cin>>l>>r;
for(int i=l;i<=r;i++){
a[i]++;
}
}
for(int i=1;i<=n;i++){
cout<
<a[i]<<” ”;="" }="" return="" 0;="" }<="" re="">
序列排序Ⅱ
using namespace std;
const int maxn=100005;
int n,a[maxn];
vector
<int>
G[maxn];
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
for(int j=2;j*j<=a[i];j++){
if(a[i]%j==0){
G[j].push_back(a[i]);
G[a[i]/j].push_back(a[i]);
}
}
}
for(int i=2;i<=n;i++){
for(int j=1;j
<g[i].size();j++){ if(g[i][j]<g[i][j-1]){="" cout<<“no”;="" return="" 0;="" }="" cout<<“yes”;="" }<="" ode=""></g[i].size();j++){>
</int>
</bits></code></pre>
<code> <p>
<!-- /wp:code --></p> </code>
无穷大?