Channel address:
Categories:
Technologies
Language: English
Subscribers:
27.56K
Description from channel
🌀 ” Our Only Aim Is To Let Get Placed To You In A Reputed Company. “
🔥 Free materials of all companies
🔥 Off campus updates
🔥 Interview experiences
Ratings & Reviews
Reviews can be left only by registered users. All reviews are moderated by admins.
5 stars
1
4 stars
0
3 stars
0
2 stars
1
1 stars
0
The latest Messages 262
2021-08-30 08:29:30
#include
#include
#include
#include
#include
using namespace std;
int main() {
int k,n,s=0,s1,i;
cin>>n>>k;
for(i=2;i {
s=s+(pow(k-1,n-i)*(n-i));
}
s1=(pow(k,n-1)*(k-1))-s;
cout< /* Enter your code here. Read input from STDIN. Print output to STDOUT */
return 0;
}
665 views05:29
2021-08-30 08:22:59
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int[] rating = new int[n];
int[] score = new int[n];
for(int i = 0;i
rating[i] = scan.nextInt();
score[i] = 1;
}
for(int i=0;i
if(rating[i]
score[i+1] = score[i] + 1;
}
}
for(int i=n-1;i>0;i--){
if(rating[i]
score[i-1] = Math.max(score[i-1],score[i]+1);
}
}
long sum = 0;
for(int i=0;i
sum +=score[i];
}
System.out.println(sum);
}
}
Alice code
636 views05:22
2021-08-29 15:55:32
595 views12:55
2021-08-29 15:36:43
public int Cuckoo_Sequence(int input1)
{
int []cuck = new int[n+1];
cuck[1]=0;
cuck[2]=1;
for(int i=2;i<=n;i++)
{
cuck[i]=cuck[i-1]+2*cuckoo[n-2]+3;
}
return cuck[n];
}
Java code
Cuckoo sequence
607 views12:36
2021-08-29 15:05:04
/*package whatever //do not write package name here */
import java.util.*;
import java.io.*;
class GFG {
public static void main (String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.nextLine();
int n = str.length();
int loop = sc.nextInt();
for(int i=0; i
int a = sc.nextInt();
int b = sc.nextInt();
int count= 0;
while(b char firstVal = str.charAt(a);
char secondVal = str.charAt(b);
int compareOneTwo = Character.compare(firstVal, secondVal);
if(compareOneTwo == 0){
count= count +1;
}
else{
break;
}
a+=1;
b+=1;
}
System.out.println(count);
}
}
}
JAVA
Single file question program
584 views12:05
2021-08-29 14:20:32
576 views11:20
2021-08-29 10:37:04
@freejobs77
644 views07:37
2021-08-29 08:51:14
632 views05:51
2021-08-29 08:50:39
@freejobs77
630 views05:50