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
#include <bits/stdc++.h>
#define n 3
using namespace std;
int findLongestFromACell(int i, int j, int mat[n][n], int dp[n][n])
{
if (i < 0 i >= n j < 0 || j >= n)
return 0;
if (dp[i][j] != -1)
return dp[i][j];
int x = INT_MIN, y = INT_MIN, z = INT_MIN, w = INT_MIN;
if (j < n - 1 && ((mat[i][j] + 1) == mat[i][j + 1]))
x = 1 + findLongestFromACell(i, j + 1, mat, dp);
if (j > 0 && (mat[i][j] + 1 == mat[i][j - 1]))
y = 1 + findLongestFromACell(i, j - 1, mat, dp);
if (i > 0 && (mat[i][j] + 1 == mat[i - 1][j]))
z = 1 + findLongestFromACell(i - 1, j, mat, dp);
if (i < n - 1 && (mat[i][j] + 1 == mat[i + 1][j]))
w = 1 + findLongestFromACell(i + 1, j, mat, dp);
return dp[i][j] = max({x, y, z, w, 1});
}
int LongestPath(int mat[n][n])
{
int result = 1;
int dp[n][n];
memset(dp, -1, sizeof dp);
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (dp[i][j] == -1)
findLongestFromACell(i, j, mat, dp);
result = max(result, dp[i][j]);
}
}
return result;
}
int main()
{
int mat[n][n] = {{1, 2, 9}, {5, 3, 8}, {4, 6, 7}};
cout << "Length of the longest path is "
<< LongestPath(mat);
return 0;
}
10 559
Atlassian
Software Development Engineer I, Backend
https://jobs.lever.co/atlassian/db4f7e89-091b-47c1-8971-0b8abd9f959c
10 559
Coding channel @codewithvirus. 👈
Main group @avirustech 🔴 👈
Accenture. @Accenturavirustech👈
IBM. @IBMavirustech 👈
Tech Mahindra. @TechMavirustech 👈
Infosys. @Infosyavirustech 👈
TCS. @TCSavirustech 👈
Amazon. @Amazonavirustech 👈
10 559
// C Solution The Third Problem
void codewithvirus()
{
ll n, mn = 0, p0 = -1, p1 = -1, cnt = 0, CountS = 2, ans = 1;
cin >> n;
vector<int> vec(n), vec1(n);
for (int i = 0; i < n; i++)
{
cin >> vec[i];
}
if (n == 1 || n == 2)
{
cout << 1;
return;
}
for (int i = 0; i < n; i++)
{
if (vec[i] == 0)
p0 = i;
else if (vec[i] == 1)
p1 = i;
vec1[vec[i]] = i;
}
sort(vec.begin() + min(p0, p1), vec.begin() + max(p0, p1) + 1);
for (int i = min(p0, p1); i <= max(p0, p1); i++)
{
if (mn != vec[i])
break;
else
mn++;
}
ll minn = min(p0, p1), maxxx = max(p0, p1);
ll lengthss = maxxx - minn + 1;
for (int i = 2; i < n; i++)
{
if (vec1[i] < minn)
{
CountS++;
minn = vec1[i];
lengthss = maxxx - minn + 1;
}
else if (vec1[i] > maxxx)
{
CountS++;
maxxx = vec1[i];
lengthss = maxxx - minn + 1;
}
else
{
ans = (ans * (lengthss - CountS)) % 1000000007;
CountS++;
}
}
cout << ans;
}
10 559
//B Solution Almost Ternary Matrix
void codewithvirus()
{
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
cout << ((((i / 2) + (j / 2)) & 1) ^ (((i & 1) + (j & 1)) & 1)) << " ";
}
cout << endl;
}
}
10 559
//A Solution The Third Three Number Problem
void codewithvirus()
{
int n;
cin >> n;
if (n % 2 != 0)
cout << -1;
else
cout << 0 << " " << 0 << " " << n / 2;
}
10 559
// Infosys
// N flowers on a Recatangular pana
int ans = 100000000;
void solve(vector<int> a, int n, int k, int index, int sum,
int maxsum)
{
if (k == 1)
{
maxsum = max(maxsum, sum);
sum = 0;
for (int i = index; i < n; i++)
{
sum += a[i];
}
maxsum = max(maxsum, sum);
ans = min(ans, maxsum);
return;
}
sum = 0;
for (int i = index; i < n; i++)
{
sum += a[i];
maxsum = max(maxsum, sum);
solve(a, n, k - 1, i + 1, sum, maxsum);
}
}
int GetMaxBeauty(int N, int K, vector<int> A)
{
solve(A, N, K, 0, 0, 0);
return ans;
}
// @codewithvirus
// @codewithvirus
// @codewithvirus
// @codewithvirus
