| Problem 2504 >> hh |
|
bianjianguo @ 2024-04-24 17:39:42
ege
|
|
bianjianguo @ 2024-04-24 17:39:59
s
|
|
bianjianguo @ 2024-04-24 17:40:57
s
|
|
bianjianguo @ 2024-04-24 17:41:18
https://poki.com/zh
|
|
bianjianguo @ 2024-04-24 17:41:42
https://im.popoim.com/im/web
|
|
bianjianguo @ 2024-04-24 17:41:46
https://liferestart.syaro.io/public/index.html
|
|
bianjianguo @ 2024-04-24 17:42:01
https://www.360kuai.com/91c79e6419d71b474?nsid=d195753bb7200c75a4d0c9ac22c8c9c6&refer_scene=QGGhODxtVLw&scene=&sign=360_6453942f&sv=1&tj_sid=d195753bb7200c75a4d0c9ac22c8c9c6&tj_url=91c79e6419d71b474&tmprtp=expf%3Dcibasea2035%2Csearchb2098%2Ca2149%2Ctest2244%2Cbase2542%2Cc2925%2Ca2927%2Ca3019%2Ca3020%2Ca3058%2Ca3062%2Ca2985%26yk%3D%26cubeid%3DQGGhODxtVLw%26add%3D1%26pos%3D3%26idx%3D1%26sign%3D360_6453942f&ucheck=dbf075b366ff51ad2613013efa40633a&uid=aa266a54cfdbf3d6091f03d67fec0edd
|
|
bianjianguo @ 2024-04-24 17:42:14
http://120.26.98.83/discuss.php
|
|
bianjianguo @ 2024-04-24 17:42:32
https://dinoswords.gg/
|
|
yinziyang @ 2024-07-06 12:03:55
#include<bits/stdc++.h>
using namespace std; long long b[1000005]; long long a[1000005]; int main() { int n; cin>>n; for(int i=1;i<=n;i++){ scanf("%d",&a[i]); } int m; cin>>m; int l[m],r[m]; for(int i=1;i<=m;i++){ scanf("%d",&l[i]); scanf("%d",&r[i]); a[l[i]]=a[l[i]]+1; a[r[i]+1]=a[r[i]+1]-1; } for(int i=1;i<=n;i++){ b[i-1]=a[i]; } for(int i=1;i<=n;i++){ int sum=b[r[i]]-b[l[i]-1]; printf("%d\n",sum); } return 0; } |
|
yinziyang @ 2024-07-17 15:44:02
Level Devil
|
|
yinziyang @ 2024-07-25 11:02:43
//回不去的,不是曾经的我,而是曾经的我们
|
|
yinziyang @ 2024-08-02 16:25:31
齐爱周
|
|
yinziyang @ 2024-08-02 19:28:34
#include<bits/stdc++.h>
using namespace std; struct f{ int a; int b; }; f x[100005]; int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>x[i].a; x[i].b=x[0].b; x[0].b=i; } int k; cin>>k; int t=x[0].b; int p=0; while(t!=0){ if(x[t].a==k){ x[p].b=x[t].b; t=x[t].b; }else{ p=t; t=x[t].b; } } t=x[0].b; while(t!=0){ cout<<x[t].a<<" "; t=x[t].b; } return 0; } |
|
yinziyang @ 2024-08-10 14:20:52
https://shequ.codemao.cn/work/189354657
|
|
yinziyang @ 2024-08-12 15:07:54
https://shequ.codemao.cn/
|
|
luoen @ 2024-08-15 17:50:01
所以你发的是个哈子
|
|
yinziyang @ 2024-08-30 15:12:47
YI SI LIN QI LIN BA
|
|
luoen @ 2024-09-04 17:42:32
？
|
|
chenrui @ 2024-09-05 17:23:19
https://www.crazygames.com/game/
|
|
zhaodongqiang @ 2024-09-06 18:29:49
？？？
|
|
luoen @ 2024-09-26 18:21:24
摸鱼的小陈瑞
|
|
luoen @ 2024-09-26 18:21:51
爱play the games的小陈瑞
|
|
chenrui @ 2024-09-28 11:33:01
那咋了
|
|
chenrui @ 2024-09-28 11:36:33
#include <iostream>
using namespace std; int b[200]; int main() { string s; cin>>s; int max=-1; int maxi; int sum=0; for(int i=0;i<s.size();i++){ b[s[i]]++; } for(int i=0;i<200;i++){ if(max<b[i]){ max=b[i]; maxi=i; } } char c=maxi; cout<<c<<" "<<max; return 0; } |
|
luoen @ 2024-09-28 15:42:04
啊
|
|
luoen @ 2024-09-28 15:42:28
陈瑞你-J考96分，你咋考的
|
|
pengyufan @ 2024-10-03 18:04:43
吹牛逼
|
|
pengyufan @ 2024-10-03 18:04:51
吹牛逼
|
|
pengyufan @ 2024-10-03 18:05:02
就是我
|