Codeforces Round #421 (Div. 2) Archive

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.ArrayList; import java.util.List; import java.util.StringTokenizer; import java.util.TreeMap; /** * @author Don Li */ public class MisterBBeaconsField { int N = (int) 2e6 + 10; int SQRT …

#include<stdio.h> #include<stdlib.h> #define LL long long int p, cur; int main(void) { LL ans, sum; int n, L, r, i, temp; scanf(“%d”, &n); sum = L = r = temp = 0; for(i=1;i<=n;i++) scanf(“%d”, &p); …

import java.util.Scanner; public class C { public static void main(String args) { // TODO Auto-generated method stub Scanner in = new Scanner(System.in); int a=in.nextInt(); int b=in.nextInt(); int l=in.nextInt(); int r=in.nextInt(); System.out.println(fun(a,b,l,r)); } static int fun(int …

#include <iostream> using namespace std; int main(){ int n,m,q; cin>>n>>m; q=(n*m+90)/180+2; if(q<n){ n=q; } if(n<3){ n=3; } cout<<“2 1 “<<n; return 0; }

#include <iostream> using namespace std; int c,v,vl,l,a; int main(){ cin>>c>>v>>vl>>a>>l; int s=1; for(int i=v;i<c;){ v+=a; if(v>vl) v=vl; i-=l; i+=v; s++;} cout<<s<<endl; }