HYDERABAD BANGLORE REAL-ESTATE ||STOCKS || INVESTMENTS || PLOTS || RENTS
رفتن به کانال در Telegram
نمایش بیشتر
1 831
مشترکین
اطلاعاتی وجود ندارد24 ساعت
اطلاعاتی وجود ندارد7 روز
اطلاعاتی وجود ندارد30 روز
آرشیو پست ها
/*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);
int n = sc.nextInt();
ArrayList<String> chola=new ArrayList<String>();
ArrayList<String> chera=new ArrayList<String>();
ArrayList<String> pallava=new ArrayList<String>();
ArrayList<String> pandya=new ArrayList<String>();
ArrayList<String> renounce=new ArrayList<String>();
for(int i=0; i<n;i++){
sc.nextLine();
String name = sc.nextLine();
int x = sc.nextInt();
int y = sc.nextInt();
if(x >0 && y> 0){
chola.add(name);
}
else if(x <0 && y>0){
chera.add(name);
}
else if(x <0 && y<0){
pallava.add(name);
}
else if(x >0 && y<0){
pandya.add(name);
}
else{
renounce.add(name);
}
}
System.out.println(chola);
System.out.println("chera");
System.out.println(chera);
System.out.println("pallava");
System.out.println(pallava);
System.out.println(pandya);
System.out.println("renounce");
System.out.println(renounce);
}
}
North India code
VIRTUSA ____àñß❗️
✅TreeSet treeSetObj = new TreeSet( Collections.reverseOrder() ) ;
✅Constructor can be declared as final
✅The catch blocks fr these 2.....
✅A=1,B=2,C=3
✅Two
✅All
✅Linked hash map
✅My thread bar
✅Set()
✅True
✅ Inheritance req that a class....
✅138
✅Listiterator
✅Final
✅Set permit only one
t1= list(map(int,input().split()))
t2= list(map(int,input().split()))
def authentication (t1,t2):
R1=t1[-1]
R2=t2[-1]
pi=3.14
Cov_t1 =Cov_t2= pi *( R1**2)
Ins=1.813
Tot=Cov_t1 + Cov_t2
print(round(Ins/Tot*(100),2)-0.01)
Python3 ✅ intersection area
Cognizant Off Campus Drive | 2019 2020 Batch | BCA BSc Arts & Science | 2.52Lpa
myamcat.com/jobRegistrationForm?id=cts_offcampus_ArtnS
Telegram - @placementupdatess
🎯IBM OFF CAMPUS DRIVE
Role: System Engineer
Batch: 2018/19/20
Eligibility: BE/B.Tech/ME/M.Tech/MCA
📌Link: https://forms.hireclap.com/hiyamee-ibm-off-campus-recruitment
Telegram: @placementupdatess
Join below discussion group https://t.me/joinchat/Vzv3LvUHsgnxExvP
🎯IBM OFF CAMPUS DRIVE
Role: System Engineer
Batch: 2018/19/20
Eligibility: BE/B.Tech/ME/M.Tech/MCA
📌Link: https://forms.hireclap.com/hiyamee-ibm-off-campus-recruitment
Telegram: @placementupdatess
#include<iostream>
using namespace std;
int main()
{
int tc;
cin>>tc;
while(tc != 0)
{
int s,i,even=0,odd=0;
cin>>s;
int *arr = new int[s];
for(int i = 0; i<s; i++ )
{
cin>>arr[i];
}
for(int i = 0; i<s; i++)
{
if((arr[i] % 2) == 0)
even++;
else
odd++;
}
if(even > odd)
{
for(int i = 0; i<s; i++)
{
if((arr[i] % 2) != 0)
cout<<i+1;
}
}
else
{
for(int i = 0; i<s; i++)
{
if((arr[i] % 2) == 0)
cout<<i+1;
}
}
tc--;
}
}
Test the IQ code
*PROLIFICS*
Aptitude
1)31kg
2)123.75
3)17
4)751
5)u is ranked 3 or 4
6)2,5,1,4,3
7)15days
8)
9)60days
10)1.6 litres
English
1)benefit
2)combined
3)over bythe water
4)formal structure
5)moribund
6)dont enjoy
7) non existent
8)A and B
9)game theory
10) around
Code
GAME OF NUMBERS
#include<stdio.h>
int main()
{
long long int n,flag,i,j,k,a[30000],stack[30000];
scanf("%lld",&n);
for(i=0;i<n;i++)
scanf("%lld",&a[i]);
for(i=0;i<n;i++)
{ flag=0;
for(j=i+1;j<n;j++)
{
if(a[j]>a[i])
break;}
for(k=j+1;k<n;k++)
{
if(a[j]>a[k]) {flag=1;
break;}
}
if (flag==1)
stack[i]=a[k]; else stack[i]=-1;
}
for(i=0;i<n;i++)
printf("%lld ",stack[i]);
}
Join. @placementupdatess
r,k=map(int,input().split())
for i in input().split(' ')):
count=0
for j in range(1,r+1):
s=bin(j).lstrip("0b")
occur=0
while True:
try:
indx=s.index("101")
occur+=1
s=s[indx+2:]
except:
break
if occur>=k:
count+=1
print count
Python3 ✅🤞🙂
Coolness
A1=A[::]
A=list(set(A))
A.sort()
ans=[]
Dict={}
for i in range(len(A)):
If(!Dict.get(A[i])):
Dict[A[i]]=i
for i in range(n):
j=Dict(A1[i])
if(j==0 or j==n-1):
ans.append(A[j])
else:
ans.append(A[j-1]+A[j+1])
return ans
Nearest greater
CDK GLOBAL Hiring Interns | 2022 Batch | BCA,BCS,MCS and MCA | 15000 Stipend
bit.ly/34AIUQW
Telegram - @placementupdatess
