Codeforces solutions | CodeSolve | discussion

03 Sep 2024 17:21

Bhai koi questions bhejdo bs please

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 17:20

@saurabh phele C to bhej

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 17:15

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

int32_t main()
{
    int t;
    cin>>t;
   
    while(t--)
    {
       int n;
       cin>>n;
      
       vector<vector<char>>vec(n,vector<char>(4));
      
       for(int i=0;i<n;i++)
       {
           for(int j=0;j<4;j++)
           {
               cin>>vec[i][j];
           }
       }
      
       vector<int>ans;
      
       for(int i=n-1;i>=0;i--)
       {
           for(int j=0;j<4;j++)
           {
               if(vec[i][j]=='#')
               {
                   ans.push_back(j+1);
               }
           }
       }
      
       for(int i=0;i<ans.size();i++)
       {
           cout<<ans[i]<<" ";
       }
      
       cout<<endl;
    }
   
   
    return 0;
}

// B

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 17:13

There will be another case also right when minus 1 is done

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 17:10

Yeh toh question mae bhi diya hai

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 17:05

I found the max of ceil x and ceil y and multiplied with 2

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 17:05

lol codeforces is too lag

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 16:46

BBBB

void test()
{
int n;
cin >> n;

vector<string> v1(n);


for (int i = 0; i < n; ++i) {
cin >> v1[i];
}


for (int i = n - 1; i >= 0; --i) {

for (int j = 0; j < 4; ++j) {
if (v1[i][j] == '#') {

cout << (j + 1) <<" ";
break;
}
}
}

cout<<endl;
}

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 16:40

codeforces lag too much

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 12:39

Last div 4 contest my D number code was skipped for copying.. I changed the variabale name name and other format but stll skipped.. Anyone help me.. If I copy code in this group then which item I can change for avoide skipped?

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 09:23

code work is not working☺️

Codeforces solutions | CodeSolve | discussion

02 Sep 2024 21:16

Anyone have alt 1400+ on CF? If have please DM me.

Codeforces solutions | CodeSolve | discussion

01 Sep 2024 20:55

Does anyone has a hack for A or B?

Codeforces solutions | CodeSolve | discussion

01 Sep 2024 18:48

Fcking losers lmao..cheating karke lund kuch nhi ho rha tumhara...bas shortcut dhundte rahoge bhadwon...mehnat koi nhi karna chahta...

Codeforces solutions | CodeSolve | discussion

01 Sep 2024 18:37

i can give my code is working

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 17:21

Questions please send not answers

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 17:15

C ka logic btao yaar koi

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 17:14

Are u taking ceil value of x\k

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 17:13

par isme last tc fail ho ra

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 17:07

calculate the minimum moves on required, X axis and Y axis, and then sum of total number of most in the maximum of X and Y axis

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 17:05

i can't even submit my code

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 16:57

Pleaseeeeeeeeeeeeeee

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 16:45

#include <iostream>
using namespace std;

int main() {
int t;
cin >> t;

while (t--) {
int a, b;
cin >> a >> b;

int fck = b - a;
cout << fck << endl;
}

return 0;
}

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 15:24

Join @iscodefun for todays DIV4

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 12:11

Anyone wants Harkirat Cohort 0-100 at lowest price ? Dm me

Codeforces solutions | CodeSolve | discussion

03 Sep 2024 09:22

Hi. Today's Div.4 solutions will be available.✅✅✅

Codeforces solutions | CodeSolve | discussion

01 Sep 2024 23:43

Anyone giving cisco oa??

Codeforces solutions | CodeSolve | discussion

01 Sep 2024 18:49

#include <bits/stdc++.h>
using namespace std;
int main() {
int test_case;
cin >> test_case;
while(test_case-- > 0) {
int n, q;
cin >> n >> q;
vector<int>a(n);
for(int i = 0;i < n;i++) cin >> a[i];
vector<int>map(n+2);
for(int i = 0;i < n;i++) {
++map[a[i]];
}
vector<int>answer(n+2,-1);
while(q--) {
int x;
cin >> x;
if(answer[x] != -1) {
cout << answer[x] << ' ';
continue;
}
int count = 0;
for(int j = 0;j < x;j++) {
for(int i = j;i <= n;i += x) {
count += map[i];
}
if(count >= n / 2 + 1) {
answer[x] = j;
cout << j << ' ';
break;
}
}
}
cout << endl;
}
}

H solution✅

Codeforces solutions | CodeSolve | discussion

01 Sep 2024 18:37

itis giving runtime error

Codeforces solutions | CodeSolve | discussion

01 Sep 2024 18:28

Isn't this will fail in case of a=4 and b=5