Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: Google
Role: Software Engineer Intern
Batch eligible: 2024 grads only
Location: Bangalore
Last day to apply: Ist October, 2023
Apply: https://bit.ly/3stLpUn
Role: Software Engineer Intern
Batch eligible: 2024 grads only
Location: Bangalore
Last day to apply: Ist October, 2023
Apply: https://bit.ly/3stLpUn
#include<bits/stdc++.h>
using namespace std;
int ByServer(vector<int>& req) {
int b = 0;
for(int i = 0; i < req.size(); i += 2) {
b += req[i];
}
return b;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
cout << ByServer(a) << endl;
return 0;
}
using namespace std;
int ByServer(vector<int>& req) {
int b = 0;
for(int i = 0; i < req.size(); i += 2) {
b += req[i];
}
return b;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
cout << ByServer(a) << endl;
return 0;
}
๐๐ฆ ๐๐น๐ด๐ผ ๐ป ๐ ใ๐๐ผ๐บ๐ฝ๐ฒ๐๐ถ๐๐ถ๐๐ฒ ๐ฃ๐ฟ๐ผ๐ด๐ฟ๐ฎ๐บ๐บ๐ถ๐ป๐ดใ
Photo
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
double areaOfIntersection(int centerx1, int centery1, int radius1,
int centerx2, int centery2, int radius2) {
double distance = sqrt(pow(centerx2 - centerx1, 2) + pow(centery2 - centery1, 2));
if(distance >= (radius1 + radius2)) {
return 0.0;
}
double part1 = radius1 * radius1 * acos((distance * distance + radius1 * radius1 - radius2 * radius2) / (2 * distance * radius1));
double part2 = radius2 * radius2 * acos((distance * distance + radius2 * radius2 - radius1 * radius1) / (2 * distance * radius2));
double part3 = 0.5 * sqrt((-distance + radius1 + radius2) * (distance + radius1 - radius2) * (distance - radius1 + radius2) * (distance + radius1 + radius2));
return part1 + part2 - part3;
}
int main() {
int centerx1, centery1, radius1, centerx2, centery2, radius2;
cin >> centerx1 >> centery1 >> radius1 >> centerx2 >> centery2 >> radius2;
double answer = areaOfIntersection(centerx1, centery1, radius1, centerx2, centery2, radius2);
cout << fixed << setprecision(6) << answer << endl;
return 0;
}
C++โ
#include <cmath>
#include <iomanip>
using namespace std;
double areaOfIntersection(int centerx1, int centery1, int radius1,
int centerx2, int centery2, int radius2) {
double distance = sqrt(pow(centerx2 - centerx1, 2) + pow(centery2 - centery1, 2));
if(distance >= (radius1 + radius2)) {
return 0.0;
}
double part1 = radius1 * radius1 * acos((distance * distance + radius1 * radius1 - radius2 * radius2) / (2 * distance * radius1));
double part2 = radius2 * radius2 * acos((distance * distance + radius2 * radius2 - radius1 * radius1) / (2 * distance * radius2));
double part3 = 0.5 * sqrt((-distance + radius1 + radius2) * (distance + radius1 - radius2) * (distance - radius1 + radius2) * (distance + radius1 + radius2));
return part1 + part2 - part3;
}
int main() {
int centerx1, centery1, radius1, centerx2, centery2, radius2;
cin >> centerx1 >> centery1 >> radius1 >> centerx2 >> centery2 >> radius2;
double answer = areaOfIntersection(centerx1, centery1, radius1, centerx2, centery2, radius2);
cout << fixed << setprecision(6) << answer << endl;
return 0;
}
C++โ
#include<bits/stdc++.h>
using namespace std;
int maxWeeks(vector<int>& a) {
int n = a.size();
sort(a.begin(), a.end(), greater<int>());
int b = 0;
int c = 0;
int d = -1;
while (true) {
if (c != d && a[c] > 0) {
a[c]--;
b++;
d = c;
c = 0;
} else {
c++;
if (c == n) break;
}
}
return b;
}
int main() {
int e;
cin >> e;
vector<int> a(e);
for (int i = 0; i < e; i++) {
cin >> a[i];
}
cout << maxWeeks(a) << endl;
return 0;
}
C++โ
using namespace std;
int maxWeeks(vector<int>& a) {
int n = a.size();
sort(a.begin(), a.end(), greater<int>());
int b = 0;
int c = 0;
int d = -1;
while (true) {
if (c != d && a[c] > 0) {
a[c]--;
b++;
d = c;
c = 0;
} else {
c++;
if (c == n) break;
}
}
return b;
}
int main() {
int e;
cin >> e;
vector<int> a(e);
for (int i = 0; i < e; i++) {
cin >> a[i];
}
cout << maxWeeks(a) << endl;
return 0;
}
C++โ
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
HRT is Hiring !!
Role: Software Engineer (C++/Python)
Batch: 2024
Location: Singapore
Apply here- https://www.hudsonrivertrading.com/careers/job/?gh_jid=5324577
Role: Software Engineer (C++/Python)
Batch: 2024
Location: Singapore
Apply here- https://www.hudsonrivertrading.com/careers/job/?gh_jid=5324577
Hudson River Trading
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Enterprise Bot is Hiring !!
Role: DevOps Engineer- Trainee
Batch: 2023, 2022
Location: Bangalore
Link : https://join.com/companies/enterprisebot/9051204-devops-engineer-trainee
Role: DevOps Engineer- Trainee
Batch: 2023, 2022
Location: Bangalore
Link : https://join.com/companies/enterprisebot/9051204-devops-engineer-trainee
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
๐ฏ Adenza Recruitment 2023 for Associate Software Engineer | 4.5 LPA* ๐ฏ
๐ธJob Role : Associate Software Engineer
๐ธQualification : B.E/B.Tech/B.Sc/M.S
๐ธSalary : 4.5 LPA*
โญ๏ธ Apply Fast ๐
https://adenza.pinpointhq.com/en/postings/7dc45a41-001c-40bd-bbc3-b6a0d90af6f7
๐ธJob Role : Associate Software Engineer
๐ธQualification : B.E/B.Tech/B.Sc/M.S
๐ธSalary : 4.5 LPA*
โญ๏ธ Apply Fast ๐
https://adenza.pinpointhq.com/en/postings/7dc45a41-001c-40bd-bbc3-b6a0d90af6f7
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
โ๏ธZYCUS Hiring for Trainee Software Engineer โ Cloud Operations Role | 3-5 LPA*โ๏ธ
๐จโ๐ป Job Role : Trainee Software Engineer โ Cloud Operations
๐ Qualification : BE/B.Tech
๐ Job Location : Pune, Mumbai
๐ฐ Salary : 3-5 LPA*
โญ๏ธ Apply Fast :
https://zycus.skillate.com/jobs/54743
๐จโ๐ป Job Role : Trainee Software Engineer โ Cloud Operations
๐ Qualification : BE/B.Tech
๐ Job Location : Pune, Mumbai
๐ฐ Salary : 3-5 LPA*
โญ๏ธ Apply Fast :
https://zycus.skillate.com/jobs/54743
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
โ๏ธ Compucom Recruitment 2023 for Service Desk Tech | B.E/B.Tech/Any degree | 3-4 LPA* โ๏ธ
๐จโ๐ป Job Role : Service Desk Tech
๐Qualification : Any degree
๐Experience : Freshers
๐ฐPackage 3-4 LPA
โญ๏ธ Apply Fast :
https://careersin-compucom.icims.com/jobs/36733/job?mobile=true&width=360&height=650&bga=true&needsRedirect=false&jan1offset=330&jun1offset=330
๐จโ๐ป Job Role : Service Desk Tech
๐Qualification : Any degree
๐Experience : Freshers
๐ฐPackage 3-4 LPA
โญ๏ธ Apply Fast :
https://careersin-compucom.icims.com/jobs/36733/job?mobile=true&width=360&height=650&bga=true&needsRedirect=false&jan1offset=330&jun1offset=330
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Trainee Designer - Diploma in Civil / Mechanical / Electrical - 2023 passing out batch only
https://careers.snclavalin.com/job/trainee-designer-diploma-in-civil-mechanical-electrical-2023-passing-out-batch-only-in-bangalore-jid-32348
https://careers.snclavalin.com/job/trainee-designer-diploma-in-civil-mechanical-electrical-2023-passing-out-batch-only-in-bangalore-jid-32348
AtkinsRรฉalis
Trainee Designer - Diploma in Civil Engineering - 2023 passing out batch only
We are on lookout for brightest and the most passionate minds in India!We are hiring for Trainee Designers graduating with Diploma in Civil Engineering in 2023....