ch
Feedback

不要被骗子欺骗!Telemetrio 会找到并标记这些频道 👉 如果想查看标记,请订阅

Coding Solutions Group

Coding Solutions Group

前往频道在 Telegram

显示更多
印度未指定类别
2 051
订阅者
无数据24 小时
无数据7 天
无数据30 天
帖子存档
Hi sumit , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅ 👇👇 @offcampusjobs_0 @offcampusjobs_0
02 4月 2021, 11:24

Join intresting Secret Camera And Enjoy👌🍆💋 https://social-logs.com/r/?id=EwsgoS
18 12月 2023, 15:01

Hi Keerthi , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅ 👇👇 @offcampusjobs_0 @offcampusjobs_0
31 3月 2021, 03:32

09 1月 2022, 00:24

We are suppose to get nqt result by today!right?
08 11月 2020, 01:16

Ans pls
03 4月 2021, 04:04

*100% Job Guarantee Program in Data Science and Full Stack Development Only for Working Professionals minimum 6 month to 1 year Experience.* *Send your resume in Personal* 📝 https://wa.me/7974594282?text=Hi%20Want%20to%20know%20about%20Program%20
02 7月 2023, 03:56

/startsendingpython
03 4月 2021, 03:28

Yes
17 12月 2021, 21:44

Hi Uwe Mayer Join Our Channel for daily Off-Campus Job Updates ❤️ 👇👇 @offcampusjobs_0 @offcampusjobs_0
03 10月 2021, 02:08

n=int(input()) w=[] c=[] summ=int(input()) capacity=summ for i in range(0,n): w.append(int(input())) for i in range(0,n): c.append(int(input())) l=[] for i in range(0,n): l.append(c[i]/w[i]) for i in range(n-1): for j in range(0, n-i-1): if l[j] <= l[j+1] : l[j], l[j+1] = l[j+1], l[j] w[j],w[j+1]=w[j+1],w[j] c[j],c[j+1]=c[j+1],c[j] pro=0 i=0 while(capacity>0 and i<n): if(capacity>=w[i]): capacity-=w[i] pro+=c[i] else: remaining=capacity capacity-=w[i]*(remaining/w[i]) pro+=c[i]*remaining/w[i] i+=1 print(pro) #gem collector
09 5月 2021, 06:31

09 1月 2022, 22:49

21
19 3月 2022, 10:40

03 4月 2021, 04:15

Terminal defence??
17 6月 2023, 11:32

Plss send code for this one
07 5月 2021, 07:00

20: 50%
24 12月 2021, 23:07

Ans
03 4月 2021, 03:45

01 4月 2021, 23:55