Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	seq := make([]int, 360)
	N := io.NextInt()
	for i := 0; i < N; i++ {
		M, D, V, S := io.NextInt(), io.NextInt(), io.NextInt(), io.NextInt()
		M = (M - 1) * 30
		D--
		for j := M + D; j < M+D+V; j++ {
			seq[j%360] = intMax(S, seq[j%360])
		}
		for j := 0; j < S; j++ {
			seq[(M+D-j+360)%360] = intMax(S-j, seq[(M+D-j+360)%360])
			seq[(M+D+V+j-1)%360] = intMax(S-j, seq[(M+D+V+j-1)%360])
		}
	}
	ans := 360
	for _, val := range seq {
		ans = intMin(val, ans)
	}
	io.Println(ans)
}

func intMin(a, b int) int {
	if a > b {
		return b
	}
	return a
}

func intMax(a, b int) int {
	if a < b {
		return b
	}
	return a
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;

int n;
int m[101],d[101],s[101],v[101];
int out[1000][101];

int main(void){
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d%d%d%d",&m[i],&d[i],&s[i],&v[i]);
		int id=(m[i]-1)*30+d[i]-1;
		for(int j=id;j<id+v[i];j++){
			out[j][i]+=s[i];
		}
		int now=(id-1+360)%360;
		int cnt=s[i];
		while(cnt>0){
			out[now][i]=max(out[now][i],cnt);
			cnt--;
			now=(id-1+360)%360;
		}
		now=(id+1+360)%360;
		cnt=s[i];
		while(cnt>0){
			out[now][i]=max(out[now][i],cnt);
			cnt--;
			now=(id+1+360)%360;
		}
	}
	int res=11451419;
	for(int i=0;i<360;i++){
		int now=0;
		for(int j=0;j<n;j++){
			now=max(out[i][j],now);
		}
		res=min(now,res);
	}
	printf("%d\n",res);
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n;i++)
#define INF 1e9
int main(){
    vector<int>array(600,0);
    int n; cin>>n;
    using pii = pair<int,int>;
    using piii=pair<pii,int>;
    vector<piii>holiday;
    for(int i=0;i<n;i++){
        int m,d,v,s; cin>>m>>d>>v>>s;
        holiday.push_back(piii(pii((m-1)*30+d,v),s));
        int x=(m-1)*30+d;
        int cnt=0;
        for(int i=0;i<v;i++){
            array[x+cnt]=max(array[x+cnt],s);
            if(x+cnt==360){x=0,cnt=0;}
            cnt++;
        }
    }
    for(int j=1;j<=360;j++){
        if(array[j]!=0)continue;
        for(int i=0;i<holiday.size();i++){
            int fi=(holiday[i].first.first-j);
            int sec=(j-(holiday[i].first.first+holiday[i].first.second-1));
            if(fi<0)fi=360-j+holiday[i].first.first;
            if(sec<0)sec=j+360-(holiday[i].first.first+holiday[i].first.second-1);
            array[j]=max(array[j],max(0,holiday[i].second-min(fi,sec)));
        }
    }
    int ans=INF;
    for(int i=1; i<=360;i++)ans=min(ans,array[i]);
    cout<<ans<<endl;
}

C++: #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
  int N, x[361] = {};
  cin >> N;
  for (int i = 1; i <= N; i++) {
    int M, D, V, S;
    cin >> M >> D >> V >> S;
    int a = (M - 1) * 30 + D + V - 1;
    int b = (M - 1) * 30 + D;
    for (int k = 0; k < V; k++) x[(b + k) % 360] = max(S, x[(b + k) % 360]);
    for (int j = 1; j <= 360; j++) {
      x[(a + j) % 360] = max(S - j, x[(a + j) % 360]);
      x[(b - j + 360) % 360] = max(S - j, x[(b - j + 360) % 360]);
    }
  }
  sort(x, x + 361);
  cout << x[1] << endl;
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()
#define INF 1<<28

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int crowd[100][720];
int max_crowd[720];

bool in_range(int x, int left, int right){
	return (left <= x && x <= right);
} 

void disp_crowd(int n){

	for (int x = 0; x < 360; ++x){
		cerr << setw(4) << x+1;
	} // end for
	cerr << endl;

	rep (i, n){
		for (int x = 0; x < 360; ++x){
			cerr << setw(4) << crowd[i][x];
		} // end for
		cerr << endl;
	} // end rep
}

int main()
{

	memset(crowd, -1, sizeof(crowd));
	memset(max_crowd, -1, sizeof(max_crowd));

	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n; cin >> n;
	vector<int> start_v(n, 0);
	vector<int> end_v(n, 0);
	vector<int> s(n, 0);
	rep (i, n){
		int m, d, v; cin >> m >> d >> v >> s[i];
		--m;--d;--v;
		start_v[i] = m * 30 + d;
		end_v[i] = m * 30 + d + v;
	} // end rep

	for (int x = 0; x < 360; ++x){
		int curr = 0;
		rep (i, n){
			if (in_range(x, start_v[i], end_v[i])){
				crowd[i][x] = s[i];
			}else{
				crowd[i][x] = max(0, s[i] - min(abs(start_v[i] - x), abs(x - end_v[i])));
			} // end if
			curr = max(crowd[i][x], curr);
		} // end for
		max_crowd[x] = curr;
	} // end rep

//	disp_crowd(n);

	int res = INF;
	for (int day = 0; day < 360; ++day){
		if (max_crowd[day] != -1){
			res = min(res, max_crowd[day]);
		} // end if
	} // end for
	cout << res << endl;

	return 0;
}

C++: #include<bits/stdc++.h>

using namespace std;

void chmax(int &a, int b) { a = max(a, b); }

int main()
{
  int N, cost[360] = {};

  cin >> N;
  for(int i = 0; i < N; i++) {
    int m, d, v, s;
    cin >> m >> d >> v >> s;
    d = (m - 1) * 30 + d - 1;
    for(int j = 0; j < v; j++) chmax(cost[(d + j) % 360], s);
    for(int j = 1; j < 360; j++) chmax(cost[(d - j + 360) % 360], s - j);
    for(int j = 1; j < 360; j++) chmax(cost[(d + v + j-1) % 360], s - j);
  }

  cout << *min_element(cost, cost + 360) << endl;
}