allcoding1_official
前往频道在 Telegram
📈 Telegram 频道 allcoding1_official 的分析概览
频道 allcoding1_official (@allcoding1_official) 英语 语言赛道中的 是活跃参与者。目前社区聚集了 84 420 名订阅者，在 技术与应用 类别中位列第 1 497，并在 印度 地区排名第 3 532 位。
📊 受众指标与增长动态
自 невідомо 创建以来，项目保持高速增长，吸引了 84 420 名订阅者。
根据 13 七月, 2026 的最新数据，频道保持稳定运转。过去 30 天订阅人数变化为 -1 602，过去 24 小时变化为 -72，整体触达仍然可观。
- 认证状态： 未认证
- 互动率 (ER)： 平均受众互动率为 1.89%。内容发布后 24 小时内通常能获得 0.82% 的反应，占订阅者总量。
- 帖子覆盖： 每篇帖子平均可获得 1 598 次浏览，首日通常累积 696 次浏览。
- 互动与反馈： 受众积极参与，单帖平均反应数为 1。
- 主题关注点： 内容集中在 dsa, stack, namaste, javascript, dev 等核心主题上。
📝 描述与内容策略
尚未提供频道描述。
凭借高频更新（最新数据采集于 14 七月, 2026），频道始终保持新鲜度与高覆盖。分析显示受众积极互动，使其成为 技术与应用 类别中的关键影响点。
84 420
订阅者
-7224 小时
-4097 天
-1 60230 天
帖子存档
84 420
Repost from allcoding1_official
Accenture Exam
Factorial Number code
python
Telegram 👇
@allcoding1
@allcoding1
@allcoding1
@allcoding1
@allcoding1
84 420
Repost from allcoding1_official
ACCENTURE Exam
n=int(input())
fact=1
for i in range(1,n+1):
fact=fact*i;
print(str(fact))
Factorial code
python
allcoding1 @allcoding1
@allcoding1 @allcoding1
@allcoding1 @allcoding1
⚠️ Share post in ur college and telegram Group's
84 420
Repost from allcoding1_official
ACCENTURE Exam
n=input()
s=list(map(int, input().split(',')))
maxi=max(s) # finding the maximum number
mini=min(s) # finding the minimum number
print((maxi)+(mini))
Number Sum
Python
Telegram 👇
@allcoding1
@allcoding1
@allcoding1
@allcoding1
@allcoding1
84 420
Repost from allcoding1_official
def se(n):
prime = [True for i in range(n+1)]
p = 2
while (p * p <= n):
if (prime[p] == True):
for i in range(p * p, n+1, p):
prime[i] = False
p += 1
return prime
def check(f,p1,p2,prime):
for i in range(p1,p2+1):
for j in range(i+1,p2+1):
if prime[i] or prime[j]:
if f<=0:
print(i,j)
return
else:
if (i*j)/((j-i)**2)>=f:
print(i,j)
return
print("None")
f,p1,p2=map(int,input().split())
prime=se(p2)
check(f,p1,p2,prime)
POINT FORCE Code
python
Telegram 👇
@allcoding1
@allcoding1
@allcoding1
@allcoding1
@allcoding1
84 420
Repost from allcoding1_official
Accenture exam
n=int(input())
sum=0
for i in range(1,n+1):
sum=sum+(i**2)
print(sum)
Adam's Charity
Python 3
Telegram 👇
@allcoding1
@allcoding1
@allcoding1
@allcoding1
@allcoding1
84 420
Repost from allcoding1_official
public class SmithNumbers {
public static boolean isPrime(int number) {
int loop;
int prime = 1;
for(loop = 2; loop < number; loop++) {
if((number % loop) == 0) {
prime = 0;
}
}
if (prime == 1) {
return true;
} else {
return false;
}
}
public static ArrayList<Integer> primeFactors(int number) {
int sum = 0;
ArrayList al = new ArrayList();
for(int i = 2; i< number; i++) {
while(number % i == 0) {
System.out.println(i+" ");
al.add(i);
number = number/i;
}
}
if(number >2) {
System.out.println(number);
al.add(number);
}
return al;
}
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter a number :");
int num = sc.nextInt();
int sum = 0;
if(isPrime(num)) {
System.out.println("Given number is not smith number ");
} else {
ArrayList<Integer> arrayList = primeFactors(num);
System.out.println("Prime factors of the given number are"+arrayList);
Iterator it = arrayList.iterator();
while(it.hasNext()) {
int n = (int) it.next();
System.out.println(n);
while(n!=0) {
sum = sum+n%10;
n = n/10;
}
}
int temp = 0;
while(num != 0) {
temp = temp + num%10;
num = num/10;
}
System.out.println("sum of the digits of the numbers of the prime factorization: "+sum);
System.out.println("Sum of digits in the given number: "+temp);
if(temp==sum) {
System.out.println("Given number is a smith number");
} else {
System.out.println("Given number is not smith number ");
}
}
}
}
Smith number Code
java
Telegram 👇
@allcoding1
@allcoding1
@allcoding1
@allcoding1
@allcoding1
84 420
Repost from allcoding1_official
+1Good sequence code
Python
Accenture Exam Answers
Telegram 👇
@allcoding1
@allcoding1
@allcoding1
@allcoding1
@allcoding1
84 420
Repost from allcoding1_official
Cluster code
python
@allcoding1 @allcoding1
@allcoding1 @allcoding1
@allcoding1 @allcoding1
⚠️ Share post in ur college and telegram Group's
84 420
Repost from allcoding1_official
int replace(int matrix,int n)
{
int i,j;
for(i=0;i<n;i++)
{
for (j=i;j==i;j++)
{
if(i==0)
{
matrix[i][j]=matrix[i][j+1]+matrix[i+1][j]+matrix[i+1][j+1];
}
else if(i==n-1)
{
matrix[i][j]=matrix[i-1][j-1]+matrix[i-1][j]+matrix[i][j-1];
}
else
{
matrix[i][j]=matrix[i-1][j-1] + matrix[i-1][j] + matrix[i-1][j+1]+ matrix[i][j-1] + matrix[i][j+1]+ matrix[i+1][j-1] + matrix[i+1][j] + matrix[i+1][j+1] ;
}
}
}
return matrix;
}
Replace diagonal Code
@allcoding1 @allcoding1
@allcoding1 @allcoding1
@allcoding1 @allcoding1
⚠️ Share post in ur college and telegram Group's
84 420
Repost from allcoding1_official
ACCENTURE Exam
n=int(input())
fact=1
for i in range(1,n+1):
fact=fact*i;
print(str(fact))
Factorial code
python
allcoding1 @allcoding1
@allcoding1 @allcoding1
@allcoding1 @allcoding1
⚠️ Share post in ur college and telegram Group's
84 420
84 420
Accenture Exam
l=int(input())
n=0
i=0
a=[]
while n<100:
i+=1
count=1
for j in range(2,i):
if i%j==0:
count=0
break
//allcoding1
if count==1:
a.append(i)
n+=1
#print(a) #to check the series
print(a[l])
Nth Prime Number
Python
84 420
Accenture Exam
l=int(input())
arr=list(map(int, input().split()))
arr=list(set(arr))
length_list=len(arr)
arr.sort()
#print("set = ",arr)
#print("length of set: ",length_list)
print(arr[length_list-2])
Second Largest Number
Python
84 420
Accenture exam 3/4/22
All codes are there once check it 👆👆👆☝☝☝
Telegram 👇
@allcoding1
@allcoding1
@allcoding1
@allcoding1
@allcoding1
84 420
ACCENTURE Exam
b=int(input())
e=int(input())
m=int(input())
print((b**e)%m) //main operation
Modular Exponentiation
Python
