Leko

function Main(inp) {
	inp = inp.split("\n");
	i = inp[0];
	if ( i%4==0 && i%100!=0 || i%400==0 ) console.log("YES");
	else console.log("NO");
}
Main(require("fs").readFileSync("/dev/stdin", "utf8"));

Leko

r="";for(y=-1;++y<40;r+="\n")for(x=0;x<80;a=40-x++,b=40-y*2,r+=a*a+b*b<900?"*":"-");return r;

Leko

<?php
require_once('workflows.php');
$wf = new Workflows();

/*
利用可能なカテゴリ一覧
datamanipu      データ操作
string          文字列
probability     確率
geometry        幾何

Leko

#include <iostream>
#include <string>
#include <vector>
#include <cmath>

#define TIMES(i) while(i--)
#define REP(i, n) for ( int i = 0; i < n; i++ )

using namespace std;

Leko

#include <iostream>
#include <string>
#include <vector>
#include <climits>
#include <cmath>

#define REP(i, n) for ( int i = 0; i < n; i++ )

using namespace std;

Leko

#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>

using namespace std;
typedef pair<string, int> bug;
typedef map<string, int> closeMap;

Leko

// 横型探索
#include <iostream>
#include <string>
#include <vector>
#include <queue>

using namespace std;

int w, h;
int mx[] = {0, 0, -1, 1};

Leko

// 縦型探索
#include <iostream>
#include <string>
#include <vector>

using namespace std;

int w, h;
int mx[] = {0, 0, -1, 1};
int my[] = {-1, 1, 0, 0};

Leko

#include <iostream>
#include <string>

#define REP(i, n) for ( int i = 0; i < n; i++ )

using namespace std;

int month[] = {0, 0, 20, 39, 59, 78, 98, 117, 137, 156, 176, 195, 215, 234 };

int year(int y) {

Leko

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>

#define REP(i, n) for ( int i = 0; i < n; i++ )

using namespace std;