INFOSYS EXAM SOLUTIONS
الذهاب إلى القناة على Telegram
🎖️Main Channel: @PlacementStudio 👉Stop fearing for exams 📝📃 👉 @Ramhelper is here to help you all at lowest cost possible.👨💻👩💻 👉Chances of getting qualified = 100% ✅✅ 👉Effort from our side = 💯 🎖️Main Channel: @PlacementStudio
إظهار المزيد2 141
المشتركون
+124 ساعات
-67 أيام
-3630 أيام
أرشيف المشاركات
ACCENTURE Exam
b=int(input())
e=int(input())
m=int(input())
print((b**e)%m) //main operation
Modular Exponentiation
Python
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
https://t.me/problemssolution123
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
Problem and solution group
https://t.me/problemssolution123
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
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 ");
}
}
}
}
Java
Smith number Code
ACCENTURE CODING SOLUTION: (PYTHON 3)
1.) Number Sum
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))
2.) Modular Exponentiation
b=int(input())
e=int(input())
m=int(input())
print((b**e)%m) #main operation
3.) Next Greater Number
from itertools import permutations
r=int(input()) #length
n=input() #taking the input as a string
a = permutations(n, r)
#print(a)
y = [''.join(i) for i in a] # joining the digits to a y
y=sorted(y)
q=y.index(n) #finding the index of the input value from the list
#print(q)
print(y[q+1])
4.) Factorials
n=int(input())
fact=1
for i in range(1,n+1):
fact=fact*i;
print(str(fact))
5.) Anagrams
n=input()
m=input()
count=0
l=len(m)
for i in n:
if i in m:
count=count+1
else:
pass
if count == l:
print("Yes")
else:
print("No")
6.) String within String
n=input()
m=input()
if m in n:
print("yes")
else:
print("No")
7.) Maximum Sum of Column and Row (Java 3)
public class CodeWindow {
public static void main(String[] args) {
int input1=3;
int input2=3;
int [] input3={3,6,9,1,4,7,2,8,9};
int ans= max( input1,input2,input3);
System.out.println(ans);
}
private static int max(int input1, int input2, int[] input3) {
int rows = input1;
int cols = input2;
int sumRow, sumCol;
int [] [] a= new int[input1][input2];
int count=0;
for(int i=0;i<input1;i++)
{
for(int j=0;j<input2;j++)
{
if(count==input3.length) break;
a[i][j]=input3[count];
count++;
}
}
int maxRow = Integer.MIN_VALUE;
for(int i = 0; i < rows; i++){
sumRow = 0;
for(int j = 0; j < cols; j++){
sumRow = sumRow + a[i][j];
}
maxRow=Math.max(maxRow,sumRow);
}
int maxCol=Integer.MIN_VALUE;
for(int i = 0; i < cols; i++){
sumCol = 0;
for(int j = 0; j < rows; j++){
sumCol = sumCol + a[j][i];
}
maxCol=Math.max(maxCol,sumCol);
}
return maxCol+maxRow;
}
}
8.) Nth Prime Number
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
if count==1:
a.append(i)
n+=1
#print(a) #to check the series
print(a[l])
9.) Second Largest Number
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])
10.) Adam’s Charity
n=int(input())
sum=0
for i in range(1,n+1):
sum=sum+(i**2)
print(sum)
Python 3
ACCENTURE CODING SOLUTION
ACCENTURE Exam
n=int(input())
fact=1
for i in range(1,n+1):
fact=fact*i;
print(str(fact))
Factorial code
python
