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>
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++,cnt++){
            array[x+cnt]=max(array[x+cnt],s);
            if(x+cnt==360){x=0,cnt=1;}
        }
    }
    for(int j=1;j<=360;j++){
        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 <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],&v[i],&s[i]);
		int id=(m[i]-1)*30+d[i]-1;
		for(int j=id;j<id+v[i];j++){
			out[j][i]+=s[i];
		}
		if(id+v[i]>=360){
			for(int j=0;j<id+v[i]-360;j++){
				out[j][i]=max(s[i],out[j][i]);
			}
		}
		int now=(id-1+360)%360;
		int cnt=s[i]-1;
		while(cnt>0){
			out[now][i]=max(out[now][i],cnt);
			cnt--;
			now=(now-1+360)%360;
		}
		now=(id+v[i]+360)%360;
		cnt=s[i]-1;
		while(cnt>0){
			out[now][i]=max(out[now][i],cnt);
			cnt--;
			now=(now+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;
        for(int i=0;i<v;i++){
            array[x+i]=max(array[x+i],s);
            if(x+i>360)x=0;
        }
    }
    for(int j=1;j<=360;j++){
        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<bits/stdc++.h>
using namespace std;
int N;
int M[100],D[100],V[100],S[100];
int fi[100],se[100];



int main(){
  cin>>N;
  for(int i=0;i<N;i++){
    cin>>M[i]>>D[i]>>V[i]>>S[i];
    fi[i]=(M[i]-1)*30+(D[i]-1);
    se[i]=(fi[i]+V[i])%360;
  }
  int ans=1e9;
  for(int x=0;x<360;x++){
    int val=0;
    for(int j=0;j<N;j++){
      int tmp = -1;
      if( (fi[j]<=x&&x<se[j]) || (fi[j]>=se[j]&&(fi[j]<=x || x<se[j])) ){
        tmp=S[j];
      }else{
        int a=(x-se[j]+360)%360;
        int b=(fi[j]-x+360)%360;
        tmp=S[j]-min(a,b);
      }

      val=max(val,tmp);
    }
    ans=min(ans,val);
  }
  cout<<ans<<endl;
  return 0;
}

C++: #include<bits/stdc++.h> 
#define range(i,a,b) for(int i = (a); i < (b); i++){
#define rep(i,b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
using namespace std;

struct Data{
	int m, d, s, v;
	int start, end;
};

int dayCount(int start, int end){
	int res = 0;
	while(start != end){
		res++;
		start++;
		if(start == 360) start = 0;
	}
	return res;
}

bool isHoliday(int x, Data d){
	for(int i = d.start; i != d.end + 1 ; i++){
		if(i == 360) i = 0;
		if(i == x) return true;
	}
	return false;
}

int main(){
	int n;
	cin >> n;


	Data d[205];
	rep(i,n){
		cin >> d[i].m >> d[i].d >> d[i].v >> d[i].s;
		d[i].start = (d[i].m - 1) * 30 + (d[i].d - 1);
		d[i].end = d[i].start + d[i].v - 1;
		if(d[i].end >= 360) d[i].end -= 360;
	}

	vector<int> v(360,0);
	rep(i,360){
		rep(j,n){
			if(isHoliday(i, d[j])) v[i] = max(v[i], d[j].s);
			else{
				v[i] = max(v[i], max(0, d[j].s - min(dayCount(i, d[j].start), dayCount(d[j].end, i))));
			}
				//cout << i << ' ' << d[j].start << endl;
		}
	}
	
	cout << *min_element(all(v)) << endl;
}

C++: #include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
#define MAXCH(a, b) a = max(a, b);
#define INF (1LL << 30)
using namespace std;
typedef long long ll;

ll N, M[100], D[100], V[100], S[100];

int main(void) {
  cin >> N;
  REP(i, 0, N) cin >> M[i] >> D[i] >> V[i] >> S[i];

  vector<ll> crowd(360, 0);
  REP(i, 0, N) {
    ll t = (M[i] - 1) * 30 + (D[i] - 1);
    REP(j, 0, V[i]) MAXCH(crowd[(t + j) % 360], S[i]);
    REP(j, 0, S[i]) MAXCH(crowd[(t + V[i] + j) % 360], S[i] - j - 1);
    REP(j, 0, S[i]) MAXCH(crowd[(t + 360 - j - 1) % 360], S[i] - j - 1);
  }

  // REP(i, 0, 360) cout << crowd[i] << " ";
  // cout << endl;

  cout << *min_element(crowd.begin(), crowd.end()) << endl;
}