Advance π―
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python
Share our channel screenshot in large groups for codes βοΈππ»ππ»
#include <stdio.h>
int main() {
int n, i, flag = 0;
printf("Enter a positive integer: ");
scanf("%d", &n);
if (n == 0 || n == 1)
flag = 1;
for (i = 2; i <= n / 2; ++i) {
if (n % i == 0) {
flag = 1;
break;
}
if (flag == 0)
printf("%d .", n);
else
printf("%d ", n);
return 0;
}
Tow parllel Roads code β
Stream: C language π―
ππ Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python
int main() {
int n, i, flag = 0;
printf("Enter a positive integer: ");
scanf("%d", &n);
if (n == 0 || n == 1)
flag = 1;
for (i = 2; i <= n / 2; ++i) {
if (n % i == 0) {
flag = 1;
break;
}
if (flag == 0)
printf("%d .", n);
else
printf("%d ", n);
return 0;
}
Tow parllel Roads code β
Stream: C language π―
ππ Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python
Tow parallel Roads code β
Stream: C language π―
ππ Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python
Stream: C language π―
ππ Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python
Channel name was changed to Β«TCS NQT 25th || TCS PRA JAVA/ PYTHON || IEVOLVE ANSWERSΒ»
1.1
2. 0.16
4. 450
5. 19
6.6
7.500,20
8.15%
9.2:1
10.28.24% loss
11.650
12.24
13.7/8
14.10
15.8.1
16.13/3
17.181.5
18.3%
19.5:6
20.75%
ππ Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python
β β Share our channel screenshot in large gorups for more answers β β
Make 14K Subscribeers for FREE codesπ―π―π―
2. 0.16
4. 450
5. 19
6.6
7.500,20
8.15%
9.2:1
10.28.24% loss
11.650
12.24
13.7/8
14.10
15.8.1
16.13/3
17.181.5
18.3%
19.5:6
20.75%
ππ Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python
β β Share our channel screenshot in large gorups for more answers β β
Make 14K Subscribeers for FREE codesπ―π―π―
TCS PRA 6th September || JAVA/ PYTHON || IEVOLVE ANSWERS pinned Β«1.1 2. 0.16 4. 450 5. 19 6.6 7.500,20 8.15% 9.2:1 10.28.24% loss 11.650 12.24 13.7/8 14.10 15.8.1 16.13/3 17.181.5 18.3% 19.5:6 20.75% ππ Telegram: https://t.me/tcs_pra_java_python https://t.me/tcs_pra_java_python β
β
Share our channel screenshot in largeβ¦Β»
Verebel π―
1.peremenent...
2.had completely sank
3.being witness
4.festival ...oration...laud
5.CDAB
6.cup of tea....a blessing in disguise
7.took the plung
8.spice of life.............laid out
9.2431
10.
ππ Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python
β β Share our channel screenshot in large gorups for more answers β β
Make 14K Subscribeers for FREE codesπ―π―π―
β Shareβ Shareβ Share
1.peremenent...
2.had completely sank
3.being witness
4.festival ...oration...laud
5.CDAB
6.cup of tea....a blessing in disguise
7.took the plung
8.spice of life.............laid out
9.2431
10.
ππ Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python
β β Share our channel screenshot in large gorups for more answers β β
Make 14K Subscribeers for FREE codesπ―π―π―
β Shareβ Shareβ Share
TCS PRA 6th September || JAVA/ PYTHON || IEVOLVE ANSWERS pinned Β«Verebel π― 1.peremenent... 2.had completely sank 3.being witness 4.festival ...oration...laud 5.CDAB 6.cup of tea....a blessing in disguise 7.took the plung 8.spice of life.............laid out 9.2431 10. ππ Telegram: https://t.me/tcs_pra_java_pythonβ¦Β»
Verebel π―
1.peremenent...
2.had completely sank
3.being witness
4.festival ...oration...laud
5.CDAB
6.cup of tea....a blessing in disguise
7.took the plung
8.spice of life.............laid out
9.2431
10.DABEC
11.CABDE
12.P and R
13.we all commeit error.......and blunders out of ignorance or inexperience in the course of acquire experience man everyone often stumbles and falls
14.incentivies of patakers will not aligned with some treating it disregarding the sustanblity of
15.ingenuous
16.
17.
ππ Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python
β β Share our channel screenshot in large gorups for more answers β β
Make 14K Subscribeers for FREE codesπ―π―π―
β Shareβ Shareβ Share
1.peremenent...
2.had completely sank
3.being witness
4.festival ...oration...laud
5.CDAB
6.cup of tea....a blessing in disguise
7.took the plung
8.spice of life.............laid out
9.2431
10.DABEC
11.CABDE
12.P and R
13.we all commeit error.......and blunders out of ignorance or inexperience in the course of acquire experience man everyone often stumbles and falls
14.incentivies of patakers will not aligned with some treating it disregarding the sustanblity of
15.ingenuous
16.
17.
ππ Telegram:
https://t.me/tcs_pra_java_python
https://t.me/tcs_pra_java_python
β β Share our channel screenshot in large gorups for more answers β β
Make 14K Subscribeers for FREE codesπ―π―π―
β Shareβ Shareβ Share
Tcs Query Mail I'd ππ
Careers.tcshub@mail.digialm.com
Those who are getting server issue just mail them guys βοΈβοΈ
Careers.tcshub@mail.digialm.com
Those who are getting server issue just mail them guys βοΈβοΈ
TCS PRA 6th September || JAVA/ PYTHON || IEVOLVE ANSWERS pinned Β«Tcs Query Mail I'd ππ Careers.tcshub@mail.digialm.com Those who are getting server issue just mail them guys βοΈβοΈΒ»
#include <iostream>
using namespace std;
// Returns sum of minimum sum subsequence
// such that one of every four consecutive
// elements is picked from arr[].
int minSum(int arr[], int n)
{
int dp[n];
if (n == 1)
return arr[0];
if (n == 2)
return min(arr[0], arr[1]);
if (n == 3)
return min(arr[0], min(arr[1], arr[2]));
if (n == 4)
return min(min(arr[0], arr[1]),
min(arr[2], arr[3]));
dp[0] = arr[0];
dp[1] = arr[1];
dp[2] = arr[2];
dp[3] = arr[3];
for (int i = 4; i < n; i++)
dp[i] = arr[i] + min(min(dp[i - 1], dp[i - 2]),
min(dp[i - 3], dp[i - 4]));
return min(min(dp[n - 1], dp[n - 2]),
min(dp[n - 4], dp[n - 3]));
}
int main()
{
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
cout << minSum(arr, n);
return 0;
}
Paul and peter code 100% working and say thanks to me atleast
using namespace std;
// Returns sum of minimum sum subsequence
// such that one of every four consecutive
// elements is picked from arr[].
int minSum(int arr[], int n)
{
int dp[n];
if (n == 1)
return arr[0];
if (n == 2)
return min(arr[0], arr[1]);
if (n == 3)
return min(arr[0], min(arr[1], arr[2]));
if (n == 4)
return min(min(arr[0], arr[1]),
min(arr[2], arr[3]));
dp[0] = arr[0];
dp[1] = arr[1];
dp[2] = arr[2];
dp[3] = arr[3];
for (int i = 4; i < n; i++)
dp[i] = arr[i] + min(min(dp[i - 1], dp[i - 2]),
min(dp[i - 3], dp[i - 4]));
return min(min(dp[n - 1], dp[n - 2]),
min(dp[n - 4], dp[n - 3]));
}
int main()
{
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
cout << minSum(arr, n);
return 0;
}
Paul and peter code 100% working and say thanks to me atleast