CoDeft 3.0 (Biggest Coding Event of Pune)

№	Пользователь	Рейтинг
1	ecnerwala	3649
2	Benq	3581
3	jiangly	3578
4	orzdevinwang	3570
5	Geothermal	3569
5	cnnfls_csy	3569
7	tourist	3565
8	maroonrk	3531
9	Radewoosh	3521
10	Um_nik	3482

№	Пользователь	Вклад
1	maomao90	174
2	awoo	165
3	adamant	161
4	TheScrasse	159
5	nor	158
6	maroonrk	156
7	-is-this-fft-	152
8	orz	146
8	SecondThread	146
10	pajenegod	145

Greetings Codeforces,

Competitive Programming Club, AIT Pune is excited to invite you to CoDeft 3.0 which will take place on Monday, March 27, 2023, at 20:00 IST. This contest will be an ICPC-styled contest to provide an exciting learning platform to showcase your CP skills. Many thanks to all the individuals who made this contest possible:

• Problem Setters: (_AbRn_, RohitRKS)

• (novaa, shreyas__09_) for testing and providing detailed feedback that improved the quality and balance of the round significantly.

• (Dev_Manus, hugewarriors) for coordinating the event!

This event will be conducted in 2 stages:

Qualifiers

• Date & Time: Monday, March 27, 2023, at 20:00 IST

• Participation: Individual

• Contest Link: https://www.codechef.com/CDFT2023

• Registration Link: http://shorturl.at/frIMN

• The top 100 Participants willing to come for the onsite finals will qualify for the final round.

Finals

• Date: Friday, April 14, 2023

• Participation: Individual

• Mode: Onsite, the Top 100 participants from online qualifiers will be invited for onsite finals at AIT, Pune Campus.

• Participants reporting for onsite finals will have four events CodeRed, Bug-Off, Retracer, and Short-Code to take part in.

Onsite Final Events:

◉ Codered: Competitive Programming event

◉ Retracer: Figuring out the code using only the input and output files

◉ Bug-Off: Debug the Code

◉ Short-Code: Smaller Code Wins!!

Prizes and Goodies

Qualifiers

• The top 25 Indian participants will receive goodies, delivered to their addresses.

• 5 Random Indian participants from the top 300 will receive goodies, delivered to their addresses.

• 5 Random students from AIT will receive goodies.

Finals

• All the onsite finalists will receive a CoDeft T-shirt + Goodies

• Event Winner, Runner Up

• CodeRed: 12,000/- INR and 8,000/- INR

• Retracer: 6,000/- INR and 4,000/- INR

• Bug-Off: 6,000/- INR and 4,000/- INR

• Short-Code: 6,000/- INR and 4,000/- INR

• Goodies for the top 7 participants on the leaderboard for all three events separately.

Don't forget to register to be eligible for goodies and prizes — http://shorturl.at/frIMN

Join Discord Server for regular updates — https://discord.gg/dCSUUmRBBM

int count = 0; for (int i = 0; i < n; ++i) { int _gcd = 0; for (int j = i; j < n; ++j) { _gcd = gcd(_gcd, A[i]); count += (_gcd >= L && _gcd <= R); if (_gcd < L) { break; } } }

Комментарии (31)

Показать архивные | Написать комментарий?

RohitRKS

13 месяцев назад, # |

-9

Auto comment: topic has been updated by RohitRKS (previous revision, new revision, compare).

→ Ответить

novaa

← Rev. 2 →

Reach ++

Rishi_Kumar_Singh

13 месяцев назад, # ^ |

Good Luck !!

cs_mshr

Excited !!

As a participant, Wish you Luck !!

ASHISH__

All the best to every participant

spybit

What about international participants? Are they allowed to participate onsite if they qualify? If yes how will they join onsite? I mean by their own financing or there are any sponsors?

18o3

I appreciate that you are sending reminders for the contest. But please use bcc instead of cc while sending the emails.

Ok will look into it from next time...

Java_programmer__

Will the problems be sorted by their difficulties?

sharmaharisam

How to solve SUMPROD? I know some n*k solutions passed; how to do it faster, though?

shadow9236

+20

You can use D&C + FFT. You need the coefficient of $$$x^k$$$ in $$$(1 + a[0]x)(1 + a[1]x)...(1 + a[n-1]x)$$$.

Snapper_001

n*k solution give tle to me , i dont know why

You can try doing space optimization in your dp.

Yus I did that , i create 2 dps and swap the old dp with new dp

475D - CGCDSSQ similar question to GCDSUBARR

vishwajeet7381

How to solve GCD on Subarrays?

I can think of O(N^2 * Log(max(A[i])) solution;

Edit1: If there's a different approach than above.

sobhagyaSD

If you take all the gcd ending at arr[i] there will be atmost log(n) different gcd possible. So for finding all the gcd ending at (i+1) you can just do gcd(arr[i+1],ending at i) log(n) time.

fun.contest.id

+21

Can you please move problems to practice section. It is showing an error when trying to submit in practice.

arunavabanerjee2018

Can anyone tell me how to solve the "MAXIMISING SUM" ! I don't know whether I am missing a case or unable to understand the question statement properly I am doing this : Link

addycoder0110

Elements can be negative too therefore sometimes it will be better to not choose any or choose only 1 element.

consider the case when a,b,c,d are negative values, then you should choose none

can you share your code

Code

#include <algorithm>
#include <cctype>
#include <cmath>
#include <ctime>
#include <deque>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define sz(x) static_cast<int>(x.size())
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const char nl = '\n';

void setIO(string name = "") {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    if (name.size()) {
        (void)!freopen((name + ".in").c_str(), "r", stdin);
        (void)!freopen((name + ".out").c_str(), "w", stdout);
    }
}

int main() {
    setIO();

    int t;
    cin >> t;
    while (t--) {
        vector<int> v1(4);
        for (auto& x : v1) {
            cin >> x;
        }
        int ans = 0;
        for (int i = 0; i < 4; ++i) {
            ans = max(ans, v1[i]);
            for (int j = i + 2; j < 4; ++j) {
                ans = max(ans, v1[i] + v1[j]);
            }
        }
        cout << ans << nl;
    }

    return 0;
}

/***Author: Vishwajeet Prasad***/

you can do like a b c d max({a , b ,c ,d ,0ll, a +c , b +d ,a +d})

mknayam

When will the problems be available for submission in the practice section?

Nachiket

THRIARR was already used in one of your past contests link. Not sure if the solution was leaked.. Could you post the solutions or atleast make submissions public? Thank you!

jalanprakhar

How to solve zero tree?

Sorry, for the delay. We will publish editorial today itself.

still waiting :)

l1ability

-13

BASTI KA HASTI BRO CODEFT AARELE KALTI LO,BOMBAY ME BACHAYA BACHI KO,PTOWN PTOWN

Any updates, will there be an offline event and who are the finalist?

Блог пользователя RohitRKS