1 278
订阅者
无数据24 小时
无数据7 天
无数据30 天
帖子存档
1 278
Company: IBM
Category: IT-Software-Software Services
Employment Type: Full Time/Permanent Position
Role/Designation: Associate System Engineer [Development/Networking/Testing/Product support etc.. based on company needs]
Apply Below Link:
Career portal job apply link: https://krb-sjobs.brassring.com/TGnewUI/Search/home/HomeWithPreLoad?PageType=JobDetails&partnerid=26059&siteid=5016&jobid=634726&codes=IBM_CareerWebSite#jobDetails=634726_5016
[Once you applied successfully in portal you will receive an email from IBM for the confirmation and reference number. Very important IBM reference number should be correct]
Registration form 1: https://ibm.biz/BdPfEm
Registration form 2:
https://ibmglobal.yello.co/app/collect/event/hXPwq09k1Km3z3vH-i8V-g
CTC:
1. BE/B.Tech/MCA – 4.50 Lakh Per Annum (inclusive of one-time amount)
2. ME/M.Tech/M.Sc – 4.90 Lakh Per Annum (inclusive of one time amount)
Eligibility:
1. Course: BE/B.Tech/ME/ M.Tech/MCA/ MSc in CS/ IT/ Mathematics OR other Semi IT/ circuit branches
2. YOP: 2020, 2021 & 2022
3. Stream: CS/ IT/ Mathematics OR other Semi IT/ circuit branches.
4.Percentage: 6.0 CGPA Or 60%(Calculation of qualifying marks =Sum of marks obtained divided by
5. Sum total of maximum marks obtainable. All subjects will be considered including elective/optional subjects)
6. Educational gaps: Not more than 1 year
Selection Process:
1. Coding Capability
2. English Language
3. Personal Interview
Note:
1. IBM job id: 605227BR
2. IBM Candidate Reference Number(You will receive it on your registered email id post completion of registration on IBM Career Portal)
3. Do you have work experience? (Excluding Internship): Choose "NO" Option
4. You have to use same email id and phone number for both the above links
5. If already attended any IBM drive in last 1 year please use new email id , new phone number and change one letter of D.O. B
Last date to register 29th Oct 2022 - 11 AM
1 278
n=int(input ())
k=0
for i in n:
k=i-80
print (k)
Telegram:- n=int(input ())
k=0
for i in n:
k=i-80
print (k)
Telegram:- https://t.me/coding_solution
1 278
#include <bits/stdc++.h>
using namespace std;
void solve(){
vector<int> ans;
string s;
cin>>s;
string c;
cin>>c;
int m=c.size();
int n=s.size();
int i=0;
int j=0;
while(i<n){
ans.allcoding_back((s[i]-'a')+1 +(c[j]-'0'));
j = (j+1)%m;
i++;
}
for(auto &it: ans ) {
cout<<it <<" ";
}
}
int main() {
solve();
return 0;
}
C++
Telegram:- https://t.me/coding_solution
1 278
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.next();
int harryCuts = sc.nextInt(), potterCuts = sc.nextInt();
int iterations = 0;
String afterCuts = str;
while(true) {
iterations++;
if(shiftString(afterCuts, harryCuts+potterCuts).equals(str)) {
iterations++;
break;
}
else if(shiftString(afterCuts, harryCuts).equals(str)) {
break;
}else if(shiftString(afterCuts, potterCuts).equals(str)) {
break;
}
afterCuts = shiftString(afterCuts, harryCuts+potterCuts);
iterations++;
}
System.out.println(iterations);
}
public static String shiftString(String str, int shiftCount) {
String result;
result = str.substring(str.length() - shiftCount, str.length()) + str.substring(0, str.length() - shiftCount);
return result;
}
}
2nd code mount blue java
1 278
a = list(input())
b =[]
c = ""
for i in a:
if i not in b:
x = a.count(i)
if x==1:
c=c+i
else:
c=c+i+str(x)
b.append(i)
print(c)
mount blue 1st code -python
