import sys
grid = [list(input().strip()) for _ in range(4)]
def is_valid(r, c, ch):
for i in range(4):
if grid[r][i] == ch or grid[i][c] == ch:
return False
sr, sc = (r // 2) * 2, (c // 2) * 2
for i in range(sr, sr + 2):
for j in range(sc, sc + 2):
if grid[i][j] == ch:
return False
return True
def solve(pos=0):
if pos == 16:
return True
r, c = divmod(pos, 4)
if grid[r][c] != '*':
return solve(pos + 1)
for ch in 'ABCD':
if is_valid(r, c, ch):
grid[r][c] = ch
if solve(pos + 1):
return True
grid[r][c] = '*'
return False
if solve():
for row in grid:
print(''.join(row))
else:
print(-1)
def dv(n):
r = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
r.append(i)
if i != n // i:
r.append(n // i)
return r
def pts(n, a):
dvs = dv(n)
ans = 0
for k in dvs:
if k == 1:
continue
gs = [a[i:i+k] for i in range(0, n, k)]
for d in range(2, max(a)+1):
rems = [tuple(x % d for x in g) for g in gs]
if all(r == rems[0] for r in rems):
ans += 1
break
return ans
n = int(input())
a = list(map(int, input().split()))
print(pts(n, a))
r = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
r.append(i)
if i != n // i:
r.append(n // i)
return r
def pts(n, a):
dvs = dv(n)
ans = 0
for k in dvs:
if k == 1:
continue
gs = [a[i:i+k] for i in range(0, n, k)]
for d in range(2, max(a)+1):
rems = [tuple(x % d for x in g) for g in gs]
if all(r == rems[0] for r in rems):
ans += 1
break
return ans
n = int(input())
a = list(map(int, input().split()))
print(pts(n, a))
Cognizant 8th Aptitude Help available
- All Slots are available
DM @Mrtrueliving_ix for test clearance
Recent proofs & scroll down
https://t.me/code_alphix/6437
Those who need 💯 test Clearance ❤️
- All Slots are available
DM @Mrtrueliving_ix for test clearance
Recent proofs & scroll down
https://t.me/code_alphix/6437
Those who need 💯 test Clearance ❤️
Final reminder 🎗️
Cognizant Genc Interview experience 7th May 2025
1. Self introduction
2. Final year project
3. Directly asking write a code to add 2 numbers
4. Choose 1 language either python or Java write a code and execute
5. Python libraries and deep explanation
6. List and tuple
7. fibonacci series explanation and he asked to write a code
8. Linked list from DSA
9. Trees and graphs deep explanation
10. Sql tables and queries
11. All joints explanation with real time examples
12. Are you ready to relocate
13. Are you ready to work on any technology
14. Are you ready to work on coimbatore or Chennai
15. Finally do you have any questions ❓👍1
All placement help available
- cognizant || Aptitude
- infocepts
- solera
- mykaarma
- Amazon SDE
- IBM
- Rupeek
- Capgemini......more
Any other OA on // off campus
DM for help
@Mrtrueliving_ix || @Mrtrueliving_ix
NO DOUBT FOR CLEARANCE 💯
WE WILL GIVE 💯 TEST ASSURANCE 👍
Today CTS Aptitude Help
12 pm == 2 pm == 4 pm == 6 pm
Slots are available ....
Those who need test Clearance 🤗
Ping me limited slots are available
DM @Mrtrueliving_ix...
Cognizant Aptitude 12 pm Help done ✅
Test accomplished 🪄
MCQs along with gaming 🤝
DM @Mrtrueliving_ix for test clearance 💯
#Cognizant #Offcampus
Test accomplished 🪄
MCQs along with gaming 🤝
DM @Mrtrueliving_ix for test clearance 💯
#Cognizant #Offcampus
Tech Mahindra Help Available
DM @Mrtrueliving_ix for test clearance
Preview
https://t.me/code_alphix/3553
DM @Mrtrueliving_ix for test clearance
Preview
https://t.me/code_alphix/3553
Cognizant 2 pm Help Available