Codeforces solutions | CodeSolve | discussion

02 Oct 2024 17:45

bro i cant see it can u send it like copy paste it here

Codeforces solutions | CodeSolve | discussion

02 Oct 2024 17:42

Triangle Count (Easy)

Codeforces solutions | CodeSolve | discussion

02 Oct 2024 17:39

Code bhejdo koi please

Codeforces solutions | CodeSolve | discussion

02 Oct 2024 17:26

can anyone hint me with gcd one

Codeforces solutions | CodeSolve | discussion

02 Oct 2024 17:14

Calorie LIMIT CODECHEF

Codeforces solutions | CodeSolve | discussion

01 Oct 2024 20:23

Har ke kesa lag raha he batau

Codeforces solutions | CodeSolve | discussion

01 Oct 2024 15:59

Means codeforces is sending similar solutions attention

Codeforces solutions | CodeSolve | discussion

01 Oct 2024 15:53

Bro how to escape skipped problems??

Codeforces solutions | CodeSolve | discussion

30 Sep 2024 17:56

write full code please

Codeforces solutions | CodeSolve | discussion

30 Sep 2024 16:55

fun main() {
val t = readLine()!!.toInt()
repeat(t) {
val n = readLine()!!.toInt()
val d = readLine()!!.split(" ").map { it.toInt() }
val maxFirst = d.take(n - 1).maxOrNull()!!
val last = d[n - 1]

if (maxFirst == last - 1) {
println(maxFirst)
} else {
println("Ambiguous")
}
}
}

A

Codeforces solutions | CodeSolve | discussion

30 Sep 2024 16:49

why monkey language again

Codeforces solutions | CodeSolve | discussion

21 Sep 2024 18:36

/channel/codesolvediscuss/22055

Codeforces solutions | CodeSolve | discussion

21 Sep 2024 18:29

Anyone can help me with C?

Codeforces solutions | CodeSolve | discussion

21 Sep 2024 18:23

is there a easier way for problem c?

Codeforces solutions | CodeSolve | discussion

21 Sep 2024 18:22

Give the correct one

Codeforces solutions | CodeSolve | discussion

02 Oct 2024 17:44

GCD XOR SOLUTION
SUBSCRIBE AND SHARE GROUP FOR MORE FREE CODES

Codeforces solutions | CodeSolve | discussion

02 Oct 2024 17:40

🔥CODECHEF 🔥


TRIANGLE COUNT EASY DONE. ✅ ✅✅✅

TREE CUT XOR.. ✅✅✅

TREE CUT XOR. DONE. ✅✅✅

TREE CUT XOR. ✅✅

DMM

@codercpp001

Codeforces solutions | CodeSolve | discussion

02 Oct 2024 17:27

yea same i aint getting it too

Codeforces solutions | CodeSolve | discussion

02 Oct 2024 17:19

Gcd and xor bhej bhai

Codeforces solutions | CodeSolve | discussion

02 Oct 2024 09:40

Harm blue dabudi dabuday and dabuti daputai daputi daputai

Codeforces solutions | CodeSolve | discussion

01 Oct 2024 19:39

Anyone from Bangladesh?

Codeforces solutions | CodeSolve | discussion

01 Oct 2024 15:54

Just change problems.

Codeforces solutions | CodeSolve | discussion

01 Oct 2024 13:56

Has anybody given oa of fastenal??? Pls msg

Codeforces solutions | CodeSolve | discussion

30 Sep 2024 17:02

B Just write first 1 and write from n , n - 1 , .... , 2

For example:
n = 5
Output : 1 5 4 3 2

Codeforces solutions | CodeSolve | discussion

30 Sep 2024 16:54

can we sumbit code in cpp

Codeforces solutions | CodeSolve | discussion

30 Sep 2024 16:46

🔥🔥CF 🔥🔥🔥


A DONE ✅✅✅


A DONE ✅✅✅

DMM

Codeforces solutions | CodeSolve | discussion

21 Sep 2024 18:33

You got me bro😍
Thanks

Codeforces solutions | CodeSolve | discussion

21 Sep 2024 18:24

Yes . But i dont no . Correct or not . Try

Codeforces solutions | CodeSolve | discussion

21 Sep 2024 18:22

#include <bits/stdc++.h>
using namespace std;
#define int long long


int32_t main(){
int t;
cin>>t;
while(t--){
int n,d,k;
cin>>n>>d>>k;
//vector<int>v(n+2,0);
int l,r;
map<int,int>start,end;
while(k--){
cin>>l>>r;
start[l]++;
end[r]++;
}
int mom=0,conv=0,bro=0,momind=1,broind=1;

for(int i=1; i<=d; i++){
if(start.find(i)!=start.end()){
conv+=start[i];
}
}
mom=bro=conv;
//cout<<conv<<" ";
for(int i=2; i<=n-d+1; i++){
if(start.find(i+d-1)!=start.end()){

conv+=start[i+d-1];
}
if(end.find(i-1)!=end.end()){
conv-=end[i-1];
}
//cout<<conv<< " ";
if(conv>bro){
bro=conv;
broind=i;
}
if(mom>conv){
mom=conv;
momind=i;
}
}
//cout<<endl;
cout<<broind<<" "<<momind<<endl;
}
}

Codeforces solutions | CodeSolve | discussion

21 Sep 2024 18:20

Yup and some r saying that it got accepted