Codeforces Round #390 (Div. 2) Archive

Codeforces Round #390 (Div. 2), problem: (E) Dasha and Cyclic Table Solution in C/C++       #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const …

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 namespace std; #define mp make_pair #define fi first #define se second …

Codeforces Round #390 (Div. 2), problem: (C) Vladik and Chat Solution in C/C++ #include <stdio.h> #include <string.h> int main() { int t; scanf("%d", &t); while(t--) { int n, m; scanf("%d", &n); char Name; for(int i …

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 x,o; void chk(u r,u c,u dr,u dc,u s,u l) { if(!(dr|dc))dr=-(dc=1); if(r>3||c>3){x=o=0;return;} if(l)x=o=0; …

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 main() { u n,i=-1,j=0; for(scanf("%u",&n);++i<n;j+=A)scanf("%u",A+i); if(j){printf("YES\n1\n1 %u\n",n);return 0;} for(i=-1;++i<n&&!A;); printf(i!=n?"YES\n2\n1 %u\n%u %u\n":"NO\n",i+1,i+2,n); …