Code With Virus
前往频道在 Telegram
Coding channel @codewithvirus. 👈 Main group @avirustech 👈 Accenture @Accenturavirustech 👈 IBM. @IBMavirustech 👈 Tech Mahindra. @TechMavirustech 👈
显示更多📈 Telegram 频道 Code With Virus 的分析概览
频道 Code With Virus (@codewithvirus) 英语 语言赛道中的 是活跃参与者。目前社区聚集了 10 559 名订阅者，在 技术与应用 类别中位列第 10 501，并在 印度 地区排名第 43 593 位。
📊 受众指标与增长动态
自 невідомо 创建以来，项目保持高速增长，吸引了 10 559 名订阅者。
根据 04 十二月, 2025 的最新数据，频道保持稳定运转。过去 30 天订阅人数变化为 -87，过去 24 小时变化为 0，整体触达仍然可观。
- 认证状态： 未认证
- 互动率 (ER)： 平均受众互动率为 0%。内容发布后 24 小时内通常能获得 N/A% 的反应，占订阅者总量。
- 帖子覆盖： 每篇帖子平均可获得 0 次浏览，首日通常累积 0 次浏览。
- 互动与反馈： 受众积极参与，单帖平均反应数为 0。
📝 描述与内容策略
作者将该频道定位为表达主观观点的平台：
“Coding channel @codewithvirus. 👈
Main group @avirustech 👈
Accenture @Accenturavirustech 👈
IBM. @IBMavirustech 👈
Tech Mahindra. @TechMavirustech 👈”
凭借高频更新（最新数据采集于 05 十二月, 2025），频道始终保持新鲜度与高覆盖。分析显示受众积极互动，使其成为 技术与应用 类别中的关键影响点。
10 559
订阅者
无数据24 小时
-227 天
-8730 天
帖子存档
10 559
Atlassian Women in Tech Program!
Internship and FTE at Atlassian.
Batch : 2023 and 2024 female passouts!
CTC : 80 Lakhs 😛
Link : https://docs.google.com/forms/d/e/1FAIpQLSff4uzWGW49qXXj9tv_8NLJprI4gUunElRPgqbRZgVdpk1pXQ/viewform?usp=send_form
10 559
Guys who are applied
If you are applied then please message me on my Instagram then i will try to help you in exam 🙂
10 559
Zoho
1 If I were ever impolite, I apologize.
2 Agnes is not such an arrogant person as people say.
3 I was thrilled to see my cousins after 20 years.
4 It is time you went home
5 He had left for Shimla early and he must be reached by now.
6 Krishnamachari Shrikanth is a union official.
7 It was already informed that each of the students must produce his/her aadhar card before participating in the competition
8 We have a few kilometers to go but there is only tiny petrol left in the tank!
9 When Samhita reached the station, the train had already left.
10 Musharraf had saved seats for all of us at the theatre
By the time he comes back from Kochi, the paper boy will have left 15 newspapers.
10 559
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<pair<int, int> > times;
while (N--)
{
string str;
cin >> str;
stringstream ss(str);
string tmp, start_time, end_time;
int st = 0, et = 0;
getline(ss, tmp, ',');
getline(ss, start_time, ',');
getline(ss, end_time, ',');
stringstream s1(start_time);
getline(s1, tmp, ':');
st += stoi(tmp) * 60 * 60;
getline(s1, tmp, ':');
st += stoi(tmp) * 60;
getline(s1, tmp, ':');
st += stoi(tmp);
stringstream s2(end_time);
getline(s2, tmp, ':');
et += stoi(tmp) * 60 * 60;
getline(s2, tmp, ':');
et += stoi(tmp) * 60;
getline(s2, tmp, ':');
et += stoi(tmp);
times.push_back({st, et});
}
int check_time = 0;
string tmp;
cin >> tmp;
stringstream ss(tmp);
getline(ss, tmp, ':');
check_time += stoi(tmp) * 60 * 60;
getline(ss, tmp, ':');
check_time += stoi(tmp) * 60;
getline(ss, tmp, ':');
check_time += stoi(tmp);
int ans = 0;
for (auto i : times)
{
if (check_time >= i.first && check_time <= i.second)
ans++;
}
cout << ans << endl;
return 0;
}
10 559
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<pair<int, int> > times;
while (N--)
{
string str;
cin >> str;
stringstream ss(str);
string tmp, start_time, end_time;
int st = 0, et = 0;
getline(ss, tmp, ',');
getline(ss, start_time, ',');
getline(ss, end_time, ',');
stringstream s1(start_time);
getline(s1, tmp, ':');
st += stoi(tmp) * 60 * 60;
getline(s1, tmp, ':');
st += stoi(tmp) * 60;
getline(s1, tmp, ':');
st += stoi(tmp);
stringstream s2(end_time);
getline(s2, tmp, ':');
et += stoi(tmp) * 60 * 60;
getline(s2, tmp, ':');
et += stoi(tmp) * 60;
getline(s2, tmp, ':');
et += stoi(tmp);
times.push_back({st, et});
}
int check_time = 0;
string tmp;
cin >> tmp;
stringstream ss(tmp);
getline(ss, tmp, ':');
check_time += stoi(tmp) * 60 * 60;
getline(ss, tmp, ':');
check_time += stoi(tmp) * 60;
getline(ss, tmp, ':');
check_time += stoi(tmp);
int ans = 0;
for (auto i : times)
{
if (check_time >= i.first && check_time <= i.second)
ans++;
}
cout << ans << endl;
return 0;
}
