Tag: Codeforces Round #392 (Div. 2)

C/C++

Codeforces Round #392 (Div. 2), problem: (F) Geometrical Progression Solution in C/C++

#include<stdio.h> #include<stdlib.h> #define N 10000001 #define SN 3163 typedef long long unsigned llu; typedef unsigned u; int F(const void*x,const void*y) { if(*(llu*)x>*(llu*)y)return 1; if(*(llu*)y>*(llu*)x)return-1; return 0; } u D,Ga,Gi;llu...
Admin -
Read
C/C++

Codeforces Round #392 (Div. 2), problem: (E) Broken Tree Solution in C/C++

#include <bits/stdc++.h> #define mk make_pair using namespace std; typedef long long ll; const int N=1e6+5; struct edge { int x,y,w,p; edge(){} void input() { scanf("%d%d%d%d",&x,&y,&w,&p); } }E,EE; int n; vector<int>...
Admin -
Read
C/C++

Codeforces Round #392 (Div. 2), problem: (D) Ability To Convert Solution in C/C++

#include <stdio.h> #include <string.h> int main() { static char s; static long long dp; int n, i, j, l; long long a, b; scanf("%d",...
Admin -
Read
C/C++

Codeforces Round #392 (Div. 2), problem: (C) Unfair Poll Solution in C/C++

#include <stdio.h> int n,m,X,Y; long long K; long long ans; int main() { int i,j,t; long long mn = 1e18, mx = 0; scanf("%d%d%I64d%d%d",&n,&m,&K,&X,&Y); t =...
Admin -
Read
C/C++

Codeforces Round #392 (Div. 2), problem: (B) Blown Garland Solution in C/C++

  #include <stdio.h> #include <string.h> int cnt(char *s, char c) { int l, i, j, k; l = strlen(s); j = -1; for (i...
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!