1 278
订阅者
无数据24 小时
无数据7 天
无数据30 天
帖子存档
1 278
🚨Few Slots left for February 23rd Wiley Edge Exam🚨
Closing slots soon✅
Contact fast @Daanveer ❤️
100% clearance guarantee 🔥🔥
Share @wiley_edge_discussion ❤️
1 278
🟡 WILEY EDGE exam is on 22nd and 23rd Feb
Book your slot 👨💻👇
Contact here @Daanveer❤️
100% clearance guarantee 🔥🔥
Share @wiley_edge_discussion ❤️
1 278
def update_matrix(matrix):
m = len(matrix)
n = len(matrix[0])
updated_matrix = [[matrix[i][j] for j in range(n)] for i in range(m)] # create a copy of the original matrix
for i in range(m):
for j in range(n):
if matrix[i][j] == "C": # if a copying student is found
for di, dj in [(-1,-1), (-1,1), (1,-1), (1,1)]: # check diagonally adjacent elements
ni, nj = i + di, j + dj
if 0 <= ni < m and 0 <= nj < n and matrix[ni][nj] != "C":
updated_matrix[ni][nj] = "C" # replace the element with "C"
return updated_matrix
L2✅ IDP PYTHON
1 278
Codeforces
C
C++
https://t.me/+LSxpvOv-Yw1lNDk9
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define SIZE 1e6+2
#define endl "\n"
void solve(){
ll n,k ; cin>>n>>k;
ll st=0,end=0;
for(ll i=0; i<n; i++){
ll l,r; cin>>l>>r;
if(l==k) st++;
if(r==k) end++;
}
if(st>0 and end>0) cout<<k+1<<endl;
else cout<<k+5<<endl;
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll t; cin>>t;
while(t--){
solve();
}
return 0;
}
Codeforces
C
C++
https://t.me/+LSxpvOv-Yw1lNDk9
1 278
Codeforces
B
C++
https://t.me/+LSxpvOv-Yw1lNDk9
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define SIZE 1e6+2
#define endl "\n"
void solve(){
ll n,k ; cin>>n>>k;
ll st=0,end=0;
for(ll i=0; i<n; i++){
ll l,r; cin>>l>>r;
if(l==k) st++;
if(r==k) end++;
}
if(st>0 and end>0) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll t; cin>>t;
while(t--){
solve();
}
return 0;
}
Codeforces
B
C++
https://t.me/+LSxpvOv-Yw1lNDk9
1 278
Codeforces
A
C++
https://t.me/+LSxpvOv-Yw1lNDk9
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define SIZE 1e6+2
#define endl "\n"
void solve(){
ll n,m ; cin>>n>>m;
string s1,s2; cin>>s1>>s2;
ll found=0,found2=0;
for(ll i=1; i<n; i++){
if(s1[i]==s1[i-1]){
found=i;
break;
}
}
for(ll i=1; i<m; i++){
if(s2[i]==s2[i-1]){
found2=i;
break;
}
}
if(found){
string temp= s1.substr(found);
reverse(temp.begin(),temp.end());
s2+=temp;
for(ll i=1; i<s2.size(); i++){
if(s2[i]==s2[i-1]){
cout<<"NO"<<endl;
return;
}
}
cout<<"YES"<<endl;
return;
}
if(found2){
string temp= s2.substr(found2);
reverse(temp.begin(),temp.end());
s1+=temp;
for(ll i=1; i<s1.size(); i++){
if(s1[i]==s1[i-1]){
cout<<"NO"<<endl;
return;
}
}
cout<<"YES"<<endl;
return;
}
cout<<"YES"<<endl;
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll t; cin>>t;
while(t--){
solve();
}
return 0;
}
Codeforces
A
C++
https://t.me/+LSxpvOv-Yw1lNDk9
1 278
🔥DHL is Hiring Freshers/Experience for the role of Junior Full Stack Developer🔥
✅Experience:- Freshers/Experience
✅Qualification:- BE,BTech,ME,MTech,BCA,MCA,BSC
✅Description:- Junior Full Stack Developer
✅Job Type:- Full Time
✅Apply Now:- https://tech2bropro.blogspot.com/2023/01/DHL%20is%20Hiring%20for%20the%20role%20of%20Junior%20Full%20Stack%20Developer.html
