Tag: Codeforces Round #390 (Div. 2)

C/C++

Codeforces Round #390 (Div. 2), problem: (E) Dasha and Cyclic Table Solution in C/C++

Codeforces Round #390 (Div. 2), problem: (E) Dasha and Cyclic Table Solution in C/C++       #include <bits/stdc++.h> using namespace std; typedef...
Admin -
Read
C/C++

Codeforces Round #390 (Div. 2), problem: (D) Fedor and Coupons Solution in C/C++

Codeforces Round #390 (Div. 2), problem: (D) Fedor and Coupons Solution in C/C++     #include <bits/stdc++.h> #include <iostream> #include <queue> #include <set> using...
Admin -
Read
C/C++

Codeforces Round #390 (Div. 2), problem: (C) Vladik and Chat Solution in C/C++

Codeforces Round #390 (Div. 2), problem: (C) Vladik and Chat Solution in C/C++ #include <stdio.h> #include <string.h> int main() { ...
Admin -
Read
C/C++

Codeforces Round #390 (Div. 2), problem: (B) Ilya and tic-tac-toe game Solution in C/C++

Codeforces Round #390 (Div. 2), problem: (B) Ilya and tic-tac-toe game Solution in C/C++   #include<stdio.h> #include<stdlib.h> typedef unsigned u; char S;u...
Admin -
Read
C/C++

Codeforces Round #390 (Div. 2), problem: (A) Lesha and array splitting Solution in C/C++

Codeforces Round #390 (Div. 2), problem: (A) Lesha and array splitting Solution in C/C++   #include<stdio.h> #include<stdlib.h> typedef unsigned u; u A; int...
Admin -
Read

Want to stay up to date with the latest news?

We would love to hear from you! Please fill in your details and we will stay in touch. It's that simple!