Tag: Codeforces Round #384 (Div. 2)

C/C++

Codeforces Round #384 (Div. 2), problem: (D) Chloe and pleasant prizes Solution in C/C++

#include <stdio.h> #include <string.h> #define MAX(X,Y) ((X)>(Y) ? (X) : (Y)) #define INF 1000000000000000 typedef long long LL; int n,sz,first,next,tail,son,bro,vis; LL a,s,maxs,maxs2; void addedge(int...
Admin -
Read
C/C++

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

#include<stdio.h> int main(){ long x; scanf("%ld",&x); if(x==1) printf("-1"); else printf("%ld %ld %ld",x,x+1,x*(x+1)); return 0; } 📦 Looking for Codeforces Round 384 Div Problem Vladik? Check the best...
Admin -
Read
C/C++

Codeforces Round #384 (Div. 2), problem: (A) Vladik and flights Solution in C/C++

#include<stdio.h> int main() { int i,j,n,a,b; char s; scanf("%d%d%d",&n,&a,&b); scanf("%s",s); if(s==s) { printf("0"); } else printf("1"); return 0; } 📦 Looking for Codeforces Round 384 Div Problem Vladik? Check the best deals...
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!