code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long LL;
LL n,d;
LL col[2][500005] = {0};
LL v[4][500005],cnt[4] = {0};
LL id(LL x,LL y){ return x * n + y + 1; } // (x,y) -> id
LL getx(LL x){ return (x - 1) / n; } // id(x,y) -> x
LL gety... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | 0 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define put(x) cout << x << endl;
using namespace std;
int main()
{
ll x;
cin >> x;
put(1000 * (x / 500) + 5 * ((... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=unsigned long long;
using namespace std;
int main() {
string s;
cin>>s;
int minv=1000000005;
size_t l=s.length();
rep(i,l-2){
string ss=s.substr(i,3);
int num=stoi(ss);
minv=min(minv,abs(num-753));
... | 0 |
#include <map>
#include <cstdio>
#include <string>
#include <iostream>
#include <algorithm>
typedef long long ll;
int n;
char s[40];
std::map<std::pair<std::string,std::string>,int> C;
int main()
{
scanf("%d%s",&n,s);
std::reverse(s+n,s+(n<<1));
for(int i=0;i<(1<<n);++i)
{
std::string a,b;
... | #include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
#include <bitset>
#include <functional>
using namespace std;
#define fas... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int ll;
pair<ll,int> p[100005];
int main(){
ll n,x; cin >> n >> x;
vector<ll> b(n),l(n),u(n);
for(int i=0;i<n;i++){
cin >> b[i] >> l[i] >> u[i];
}
ll sum=0;
for(int i=0;i<n;i++){
p[i]=pair<ll,int>((x-b[i])*u[i]+b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(ll i=(x);i<(y);i++)
#define rrep(i,x,y) for(ll i=(ll)(y)-1;i>=(x);i--)
#define all(x) (x).begin(),(x).end()
#define itrout(x) for(int i=0;i<x.size();i++) {cout << x[i] << (i==x.size()-1 ? "\n" : " ");}
#ifdef LOCAL
#define debug(x) cerr << #x << " = ... | 0 |
#include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
u... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n; cin >> n;
vector<long long> v(n, 0);
bool fail = false;
int tmp;
cin >> tmp;
if (tmp != 0) fail = true;
for (int i = 1; i < n; i++) {
cin >> tmp;
if (tmp == 0) fail = true;
v[tmp]++;
}
if (fail) cout << 0... | 1 |
#include <bits/stdc++.h>
using namespace std;
//#define cerr if (false) cerr
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define dbv(v) cerr <<... | #include<stdio.h>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n,k,i,a,b,c,f[1000],sum_max=-999999999,sum;
scanf("%d%d",&n,&k);
for(i=0;i<n;i++)
{
scanf("%d",&f[i]);
}
for(a=0;a<=k;a++)
{
for(b=0;b<=k;b++)
{
for(c=0;c<=k;c++)
{
p... | 0 |
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
using namespace std;
int main(){
char x[52];
for(int i='a';i<='z';i++){
x[i-'a']=i;
}
for(int i='A';i<='Z';i++){
x[26+i-'A']=i;
}
int n;
while(cin>>n,n!=0){
int k[n];
string s;
for(... | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int dp[3][100010];
int main(){
rep(i,3){
rep(j,100010){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,p,q,r;
cin >> a >> b >> c;
p = a+b;
q = a+c;
r = b+c;
if(p>=q){
if(q >= r){
cout << r;
}else{
cout << q;
}
}else{
if(p >= r){
cout << r;
}else{
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define agewari(a, b) ((ll)a + ((ll)b - 1)) / b
const int MOD = 1000000007;
const long long INF = 1LL << 60;
using Graph = vector<vector<ll>>;
int main()
{
ll n, m;
cin >> n >> m;
ll maL... | #include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
templat... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define agewari(a, b) ((ll)a + ((ll)b - 1)) / b
const int MOD = 1000000007;
const long long INF = 1LL << 60;
using Graph = vector<vector<ll>>;
Graph G;
//2部グラフ判定
vector<ll> color; //1と-1に塗り分ける
bool ... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define vl vector
#define ff first
#define ss second
using namespace std;
int main()
{
ll a,b,i,j,n,t,c,m;
cin>>n>>m;
ll l,r;
ll arr[n+1]={0};
for(i=0;i<m;i++)
{
cin>>l>>r;
l--;
arr[... | 0 |
#include <stdio.h>
int check(int a,int b,int c)
{
//printf("[%d][%d][%d]\n",a,b,c);
if(a != 14)return 0;
else if(b == 23)return 1;
else if(b == 1 && c == 10)return 1;
else if(b == 19 && c == 19)return 1;
else return 0;
}
int main()
{
int longth,mem = 0;
while(1)
{
char str[9... | #include <cstdio>
#include <cstdlib>
#include <cstdint>
#include <cstring>
#include <cctype>
#include <iostream>
#include <sstream>
#include <vector>
#include <list>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#i... | 1 |
//Author:xht37
#include <bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double
#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)
#define vi vector <int>
#d... | #include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 11;
#define LL long long
int n;
LL ans, s, x[N];
LL a[N];
LL sol(int l, int r){
//printf("l=%d r=%d al=%lld ar=%lld\n", l, r, a[l], a[r]);
if(x[l] > s){
ans += x[r] - s;
return x[r];
}
if(x[r] < s){
ans += s - x[l];
return x[l];
}
if(a[l] >... | 1 |
#include <bits/stdc++.h>
#include <atcoder/fenwicktree>
using namespace atcoder;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<double,double> pdd;
#define SQ(i) ((i)*(i))
#define MEM(a, b) memset(a, (b... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int bfs(vector<string> A,int H,int W)
{
queue<pair<int,int>> que;
vector<vector<int>> cost(H,vector<int>(W,-1));
int lp=H*W;
rep(i,H)
{
rep(j,W)
{
i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
int out=0;
cin>>N;
N*=3;
string str;
int ans=0;
int run=0;
while(out<N){
cin>>str;
if(str=="HIT"){
run++;
if(... | #include <iostream>
#include <cstring>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int score = 0, out = 0;
int bases[3] = {};
while (true) {
char event[8];
cin >> event;
if (strcmp(event, "OUT") == 0) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for(int i = 0; i < N; i++)
#define Reps(i, x, N) for(int i = x; i < N; i++)
const int LLINF = 1LL << 60;
signed main()
{
int N, P;
while(cin >> N >> P, N || P) {
int w = P;
int have[55] = {0};
int i = 0;
wh... | /*** ?¬?????????? ***/
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, p;
int i;
int count, size;
int max, num;
cin >> n >> p;
while(n!=0 || p!=0){
vector<int> v;
for(i=0; i<n; ++i) v.push_back(0);
count=0;
size=p;
while(1){
for(i=size; 0<i; --i){
++v[count];
count=(co... | 1 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define EACH(i, a) for (auto &&i : a)
#define FOR(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RFOR(i, a, b) for (int i = (int)b - 1; i >= (int)a; --i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, int(n) + 1)
#define RREP(i, n) ... | #define C
typedef long long readtype;
/* Header {{{ */
#ifdef C
#include <stdio.h>
#include <math.h>
#include <string.h>
#define isdigit(a) ((a) >= '0' && (a) <= '9' ? true : false)
template<typename type> type abs(type a) { return a < 0 ? -a : a; }
template<typename type> type min(type a, type b) { return a < b ? a :... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll=vector<ll>;
using vvll=vector<vll>;
using vi=vector<int>;
using vvi=vector<vector<int>>;
using vb=vector<bool>;
using pii=pair<int,int>;
using vpii=vector<pair<int,int>>;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;retu... | #include<bits/stdc++.h>
#define Fst first
#define Snd second
#define RG register
#define mp make_pair
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned int UI;
typedef unsigned long long ULL;
template<typename T> inline void read(T& x) {
char c =... | 0 |
#include<iostream>
#include<cctype>
#include<string>
using namespace std;
int main(int argc, char const *argv[])
{
string str,str1,str2;
int a=0, b=0, n;
cin >> str;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> str1;
cin >> a >> b;
if(str1 == "print"){
str... | #include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;
typedef pair<int, int> pii;
#define hashset unordered_set
#define hashmap unordered_map
#define newline fast_writechar('\n')
#define unify(arr) arr.resize(unique(arr.begin(), arr.... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
type... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,q,k;
char s[1000005];
int main(){
scanf("%lld%s%lld",&n,s,&q);
while(q--){
scanf("%lld",&k);
ll D=0,M=0,DM=0,DMC=0;
for(ll i=0;i<n;i++){
if(i>=k){
if(s[i-k]=='D'){
DM-=M;
D--;
}
if(s[i-k]=='M')
M--;
}
if(... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 |
#include <stdio.h>
#include <string.h>
#include <string>
#include <iostream>
#include <vector>
#include <sstream>
#include <memory>
#include <iomanip>
std::vector<int> parse_line(std::string const& line) {
using namespace std;
vector<int> result;
istringstream s(line);
string element;
while (getlin... | #include <cstdio>
int matrix[12][12];
int n;
int main() {
while(scanf("%d", &n) != EOF, n) {
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
scanf("%d", &matrix[i][j]);
}
}
// output
for (int i=0; i<n; i++) {
int sum = 0;
for (int j=0; j<n; j++) {
sum += matrix[i][j];
... | 1 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I... | #include <cstdio>
#include <algorithm>
using namespace std;
int a, b, c, N, i[1000], j[1000], k[1000], r[1000], h[301];
int main(){
while(scanf("%d%d%d", &a, &b, &c), a+b+c){
scanf("%d", &N);
for(int x = 0; x < N; x++){
scanf("%d%d%d%d", i+x, j+x, k+x, r+x);
}
fill(h, h... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
char c[3]={};
int k,ans=999;
cin>>s;
for(int i=0;i<s.size()-2;i++)
{
c[0]=s[i];
c[1]=s[i+1];
c[2]=s[i+2];
k=atoi(c);
// cout<<"k = "<<k<<'\n';
ans=min(abs(k-753),ans);
}
c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void)
{
vector<ll> cost(5);
ll N;
cin >> N;
for (int i = 0; i < 5; i++)
{
cin >> cost[i];
}
ll result = (ll) ceil((double) N / *min_element(cost.begin(), cost.end())) + 4;
cout << result << endl;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N,M;
cin>>N>>M;
vector<long long> l(M);
vector<long long> r(M);
for(long long i=0;i<M;i++)
cin>>l.at(i)>>r.at(i);
sort(l.begin(),l.end());
sort(r.begin(),r.end());
long long a=r.at(0)-l.at(M-1)+1;
if(a>0)
cout<<a<<endl;
else
... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
using nam... | 1 |
#include "bits/stdc++.h"
using namespace std;
typedef unsigned long long li;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
li n;
cin >> n;
vector<li> xs(n);
for (int i = 0; i < n; ++i) {
cin >> xs[i];
}
li xorsum = 0;
for (int i = 0; i < n; ++i) {
xorsum ^... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
#include<stack>
const long long MOD = 1000000007;
using namespace std;
typedef long long llong;
//int isalpha(char ch): ch... | 0 |
#include <iostream>
using namespace std;
using LL = long long;
const LL INF = 1L << 32;
LL G[101][101];
int main() {
int V, E;
cin >> V >> E;
//
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
if (i == j) G[i][j] = 0;
else G[i][j] = INF;
}
}
... | #include <iostream>
#include <algorithm>
using namespace std;
bool isSmallAlphabet(char& ch) {
/* a ~ z(ascii) : 97 ~ 122 */
if('a' <= ch && ch <= 'z') return true;
else return false;
}
bool isHit(string& str) {
if(str.find("the") != str.npos) return true;
else if(str.find("this") != str.npos) return true;
... | 0 |
#include <string>
#include <vector>
#include <iostream>
using namespace std;
vector<string> R;
const vector<int> dx = { 0, 1, 0, -1 };
const vector<int> dy = { -1, 0, 1, 0 };
int rec(int x, int y)
{
R[y][x] = '0';
for (int dir = 0; dir < 4; dir++)
{
if (0 <= x + dx[dir] && x + dx[dir] < 12 && 0 <= y + dy[dir]... | #include <cstdio>
#include <vector>
using namespace std;
typedef pair<int, int> P;
int par[16][16];
int rank[16][16];
char map[16][16];
int cnt;
void init();
void unite(int y1, int x1, int y2, int x2);
int find(int y, int x);
int main()
{
while (scanf("%s", &map[1][1]) != EOF){
for (int i = 2; i <= 12; i++) scan... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | #include<iostream>
#include<cstdlib>
#include<utility>
#include<tuple>
#include<string>
#include<vector>
#include<numeric>
#include<algorithm>
#include<queue>
#include<deque>
#include<bitset>
#include<cmath>
#include<map>
#include<iomanip>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
#define rep(i... | 1 |
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<iostream>
#define N 101
using namespace std;
short n,m,f[N][N][N][N],sx,sy,h[N][N],L[N][N];
char s[N][N];
void upd(short &x,short y)
{
if(x<y) x=y;
}
int main()
{
cin>>n>>m;
for(short i=1;i<=n;i++)
{
scanf("%s",s[i]+1);
for(short j=1;... | #include<bits/stdc++.h>
using namespace std;
int w,h;
bool isRange(int i,int j){
return 0<=i && i<w && 0<=j && j<h;
}
int dw[]={-1,0,1,0};
int dh[]={0,1,0,-1};
int dfs(pair<int,int> p,const pair<int,int> g,vector<vector<int>>& grid,int turn){
if(turn==11)
return 100;
int res=100;
for(int i=0;i<4... | 0 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i,n,init) for(ll i=init;i<(n);i++)
int main()
{
int n,q;
string s;
cin >> n >> q >> s;
vector<int> cnt(n,0);
repi(i,n,1){
... | /*
ID: hafiz.i1
TASK: milk2
LANG: C++
*/
#include<bits/stdc++.h>
#define ll long long
#define debug(x) cout<<x<<"DE"<<endl;
using namespace std;
int main()
{
// freopen("milk2.in", "r", stdin);
// freopen("milk2.out", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,q;
cin... | 1 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n,t;
cin >> n >> t;
vector<int> v(n);
int i;
for(i=0;i<n;i++) cin >> v[i];
long long cnt = 0;
for(i=0;i<n-1;i++){
if(v[i+1]-v[i]<=t) cnt+= v[i+1]-v[i];
else cnt += t;
}
cnt += t;
cout << cnt << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 0 |
#include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <queue>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
long long ans=0,n,a,b;
cin>>n>>a>>b;
vector<long long>p(n);
rep(i,n)cin>>p[i]... | #include <cstdio>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
int x[6];
int main(){
rep(i, 6){
scanf("%d", &x[i]);
}
int s = 0;
rep(i, 6){
s += x[i];
}
printf("%d\n", s - *min_element(x, x + 4) - min(x[4], x[5]));
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int N;
int sum = 0;
int main()
{
cin >> N;
vector<int> L(2 * N);
for (int i = 0; i < 2 * N; i++)
{
cin >> L[i];
}
sort(L.begin(), L.end());
for (int i = 0; i < 2 * N; i ... | #include<stdio.h>
#define N 101
int main(){
int n;
int p[N];
int m[N][N];
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d%d",&p[i-1],&p[i]);}
for(int i=1;i<=n;i++)
m[i][i]=0;
for(int l=2;l<=n;l++){
for(int i=1;i<=n-l+1;i++){
int j=i+l-1;
/*2<<21*/
m[i][j]=2097152;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<bool> > vvb;
typedef map<int, bool> mib;
typedef long long ll;
typedef vector<long long> vl;
type... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } retu... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include <sstream>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include <iomanip>
#include <numeric>
#include <iterator>
#include <math.h>
#include <list>
using namespace std;... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define dump(...) cout<<"# "<<#__VA_ARGS__<<'='<<(__VA_ARGS__)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) begin(c),end(c)
#define mp mak... | /*
Author: QAQ-Automaton
LANG: C++
PROG: e.cpp
Mail: cnyalilk@vip.qq.com
*/
#include<bits/stdc++.h>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define all(x) x.begin(),x.end... | 1 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n;
cin >> n;
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,... | 1 |
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <math.h>
#include <fstream>
#include <iter... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
#define rrep(i, j, n) for (int i = (int)n - 1; ... | 0 |
#include<stdio.h>
int d,t,s;
int main()
{
scanf("%d %d %d", &d, &t, &s);
d=d+s-1;
if(t>=(d/s))printf("Yes");
else printf("No");
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int d,t,s;
cin>>d>>t>>s;
float time = (d/(s*1.0));
if(time<=t)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | 1 |
#include<iostream>
#include<sstream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cfloat>
#include<functional>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<bit... | #include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(n);i++)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; retur... | 1 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | 0 |
//O(n^2)
#include<stdio.h>
#include<math.h>
long long n,rui[10000];
long long max( long long x,long long y ){
if( x > y )
return x;
return y;
}
int main()
{
long long i,j;
long long ans;
while( scanf("%lld",&n) != EOF )
{
if( n == 0 )break;
ans = -10000000000;
for( i = 0;i < n;i++ ){
scanf("%lld",ru... | #include <bits/stdc++.h>
using namespace std;
int N, M;
vector<int> ItemInfo, PersonInfo;
void solve() {
int curValue;
int total[1000];
memset(total, 0, sizeof(total));
for (int i = 0; i < M; ++i) {
curValue = PersonInfo[i];
for (int j = 0; j < N; ++j) {
if (ItemInfo[j] <= curValue) {
//cout << "=" <... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
int x,y; cin>>x>>y;
int sum{};
if(x==1&&y==1) sum += 400000;
sum += max(0, 400000-x*100000);
sum += max(0, 400000-y*100000);
cout << sum << endl;
}
| #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int N, X, T;
cin >> N >> X >> T;
int S = 0;
S += N / X * T;
if (N % X >= 1) {
S += T;
}
cout << S << endl;
} | 0 |
#include<iostream>
const int INF = 1 << 24, MAX_N = 101;
int n, cost[MAX_N][MAX_N], d[MAX_N], used[MAX_N];
int dijkstra(int s, int g){
for(int i=1;i<=n;i++){
d[i] = INF;
used[i] = false;
}
d[s] = 0;
while(true){
int v = -1;
for(int i=1;i<=n;i++){
if(!used[i] && (v == -1 || d[i] < d[v])){
v = i;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr first
#define sc second
#define ii pair < ll, ll >
const int N = (int)5e3 + 7;
const ll inf = (ll)1e18 + 7;
ii p[N];
ll dp[N];
bool comp (const ii &a, const ii &b) {
return a.fr + a.sc < b.fr + b.sc;
}
main() {
int n; scanf ("%d"... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i = 0; i < n; i++)
#define Rep(i,n) for(ll i = 1; i < n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#defin... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#include <iomanip>
//cout << fixed << setprecision(20) << *** << endl;
#define rep(i,N) for(int i=0;i... | 0 |
#include <stdio.h>
int main(void)
{
int n, pm, pe, pj;
char c;
while (1) {
scanf("%d", &n);
if (n == 0) {
break;
} else {
for(int i = 0; i < n; ++i) {
scanf("%d %d %d", &pm, &pe, &pj);
if (pm == 100 || pe == 100 || pj == 100 ||... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#inclu... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
bool Bsearch(int key, int A[], int len) {
int l = 0, r = len - 1;
while (l <= r) {
int mid = l + (r - l) / 2;
if (A[mid] > key)
r = mid - 1;
else if (A[mid] < key)
l = mid + 1;
else
return true;
}
return false;
}
int main() {
int n, ... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#include <fstream>
#include <cmath>
#include <random>
#include <complex>
#include <functional>
#include <b... | 0 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N;
cin >> N;
string ret;
vector<s... | #include <iostream>
using namespace std;
int main(){
int n, a, b;
while (true)
{
int point_a = 0, point_b = 0;
cin >> n;
if (cin.eof()||n==0) { break; }
for(int i =0;i<n;i++){
cin >> a >> b;
if(a==b){
point_a += a;
point_b += b;
}
else if (a>b){
point_a += a + b;
}
else {
p... | 0 |
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long long ... | // C++ 14
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "["; for (int i = 0; i < v.size(); ++i) { os << v[i]; if (i != v.size() - 1) os << ", "; } os << "]"; return os; }
template <typename T> void print(T v, string s = "\n") ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll r;cin>>r;
if(r<1200)puts("ABC");
else if(r<2800)puts("ARC");
else puts("A... | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG //FOR THE DEBUG! COMMENT OUT THIS WHEN SUBMITTING!
#endif
/* I REALLY HOPE MY WISH REACH YOU , ATCODER'S ONLINE JUDGE */
#define WOULD
#define YOU
#define ... | 0 |
#include <iostream>
#include <algorithm>
#include <map>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
using namespace std;
int main(void)
{
int l[10];
int a,b;
while(~scanf("%d,", &l[0])) {
double sum = 0;
for(int i=1; i<10; i++) scanf("%d,", &l[i]);
scanf(... | #include<cstdio>
#include<iostream>
using namespace std;
int main(){
int a[10];
int v1,v2;
while(scanf("%d",a)!=EOF){
for(int i=1;i<10;i++){
scanf(",%d",&a[i]);
a[i] += a[i-1];
}
scanf(",%d,%d\n",&v1,&v2);
int ans;
for(int i=9;i>=0;i--){
if(v1*a[9] <= a[i]*(v1+v2))ans=i;
}
cout<<ans+1<<endl;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{int N, K; cin >> N >> K;
int L[N]; for (int &l : L) cin >> l; sort(L, L + N);
cout << accumulate(L + N - K, L + N, 0);} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vp... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true;... | #include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sst... | 0 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { retur... | #include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#define LL long long
#define M 200020
using namespace std;
LL read(){
LL nm=0,fh=1; char cw=getchar();
for(;!isdigit(cw);cw=getchar()) if(cw=='-') fh=-fh;
for(;isdigit(cw);cw=getchar()) nm=nm*10+(cw-'0');
return nm... | 0 |
#include <stdio.h>
#include <string.h>
int main(){
char tulisanA[11];
char tulisanB[11];
char tulisanC[11];
scanf("%s %s %s", &tulisanA, &tulisanB, &tulisanC);
int panjangA = strlen (tulisanA);
int panjangB = strlen(tulisanB);
if(tulisanA[panjangA-1] == tulisanB[0] && tulisanB[panjangB-... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end... | 0 |
#include<bits/stdc++.h>
using namespace std;
set<unsigned int> s;
int n,m;
int cards[100];
bool used[100];
void solve(int cnt,string a){
string tmp=a;
if(cnt==m){
s.insert(atoi(a.c_str()));
return;
}
for(int i=0;i<n;i++){
if(used[i]==true)continue;
used[i]=true;
stringstream ss;
ss << ca... | #include<bits/stdc++.h>
using namespace std;
vector <string> card,memo;
string suzi,m;
int n,k,ans,p,but;
int main(){
while(1){
cin >> n >> k;
if(n==0&&k==0)break;
for(int i=0;i<n;i++){
cin >> m;
card.push_back(m);
}
if(k==2){
for(int... | 1 |
#include <iostream>
#include <cstdio>
using namespace std;
int ary[15];
char str[7][12]={"Monday","Tuesday","Wednesday","Thursday","Friday","Saturday","Sunday"};
int main(){
ary[1]=2;
for(int i=1;i<12;i++){
if(i==4||i==6||i==9||i==11){
ary[i+1]=(ary[i]+30)%7;
}
else if(i==2){
ary[i+1]=(ary[i]+29)%7;
}
... | #include <bits/stdc++.h>
#define FOR(v, a, b) for(int v = (a); v < (b); ++v)
#define FORE(v, a, b) for(int v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(int v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define ITR(it, c) for(auto it = (... | 0 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#... | #include<iostream>
#include<vector>
#include<string>
#include<cstdlib>
#include<sstream>
#include<queue>
#include<deque>
#include<cmath>
#include<algorithm>
#include<stack>
#include<map>
#include<set>
#include<iomanip>
#define INF 2147483647
#define lli long long int
#define MOD 1000000007
using namespace std;
typedef... | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
long long int A[5001]={0};
long long int n,MAX = -100000;
while(1){
cin >> n;
if( n == 0 ) break;
for(int i = 1; i <= n; i++){
cin >> A[i];
}
MAX = -100000;
for(int i = 1; i <= n; i++){
A[i] = max(A[i], A[... | // 2016-12-05
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int e, x, y, z, m;
while (cin >> e, e) {
m = 1000000;
for (z = 0; z * z * z <= e; z++) {
y = (int)sqrt(e - z * z * z);
x = e - z * z * z - y * y;
m = min(m, x + y + z);
}
cout << m << endl;
}
return 0;
} | 0 |
#include<vector>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int MAX=10000;
int V;
vector<int> G[MAX];
vector<int> rG[MAX];
vector<int> vs;
bool used[MAX];
int cmp[MAX];
void add_edge(int from,int to)
{
G[from].push_back(to);
rG[to].push_back(from);
return;
}
void dfs(int... | #include "bits/stdc++.h"
using namespace std;
vector<long long>Col(100005);
struct Edge {
int to, id;
Edge(int to, long long id) :to(to), id(id) {}
};
vector<Edge>g[100005];
void dfs(int v, long long d = 0, int p = -1) {
Col[v] = d;
for (Edge e : g[v]) {
if (p == e.to) {
continue;
}
dfs(e.to, d + e.id, v)... | 0 |
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
double n;
cin >> n;
cout << fixed << setprecision(20) << (2 * (n) * 3.14159265359);
return 0;
}
| #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
using ll = long long;
int main() {
int x;
cin >> x;
int a = x / 500;
int b = (x % 500) / 5;
cout << a * 1000 + b * 5 << endl;
} | 0 |
#include <iostream>
using namespace std;
#define Q 1000000007
int main(void){
int n;
int a[200010];
long long acc[200010], ans;
cin >> n;
acc[0] = 0;
for (int i=1; i<=n; i++){
cin >> a[i];
acc[i] = acc[i-1] + a[i];
acc[i] %= Q;
}
ans = 0;
for (int i=1; i<=n-1; i++){
ans += (a[i]*(... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define IN freopen("perimetric_chapter_1_input.txt","r",stdin)
#define OUT freopen("output.txt","w",stdout)
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a ; i<=b ; i++)
#define DBG printf("Hi\... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
struct Dimension {
int N;
vector< LL >basis;
Dimension(int N) : N(N), basis(N, 0) { }
bool add(LL x) {
for (int i = 0; i < N; i++) {
if (x&(1LL<<i)) {
if (basis[i]) x ^= basis[i];
els... | typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
void solve(){
ll n;
std::cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
string s;
std::cin >> s;
vector<vector<ll>> dp(n+1);
dp[n] = {0};
for ... | 1 |
#include<iostream>
#include<map>
#include<string>
#include<vector>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef int Def;
typedef vector<Def> vi;
ty... | #include <cstdio>
using namespace std;
int main() {
int n;
while (scanf("%d", &n), n!=0) {
int k[100];
char s[101];
for (int i=0;i<n;i++) scanf("%d", &k[i]);
scanf("%s", s);
for (int i=0;s[i]!='\0';i++) {
int c = s[i];
for (int j=0;j<k[i%n];j++) {
if (c == 'a') c = 'Z';
... | 1 |
#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef vector<double> Vec;
typedef vector<Vec> Mat;
typedef pair<ll,ll> P;
typedef pair<double,ll> Pd;
typedef pair<double,double> PD;
typedef priority_queue<P,vector<P>,greater<P> >... | #include<bits/stdc++.h>
using namespace std;
#define Nitroboost ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
const int mod=1e9+7;
const int N=1e6+5;
int main()
{
Nitroboost;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("out... | 1 |
#include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define INF 1 << 30
#define LLINF 1LL << 60
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define DOWN(i,b,a) for(int i=b;i>=a;i--)
#define SET(a,c) memset(a,c,sizeof a)
#define FORALL(i,c) for(__typeof((c).begin())i=... | #include<iostream>
#include<vector>
#include<string>
using namespace std;
int tisei[12][12];
void shima(int x, int y) {
tisei[x][y] = 0;
if (x < 11 && tisei[x+1][y]) shima(x + 1, y);
if (x > 0 && tisei[x - 1][y]) shima(x -1, y);
if (y < 11 && tisei[x][y+1]) shima(x , y+1);
if (y > 0 && tisei[x][y-1]) shima(x, y... | 1 |
#include<iostream>
#include<tuple>
#include<vector>
#include<algorithm>
#include<iterator>
#include<cmath>
#include<functional>
#include<map>
using namespace std;
int main(){
int N;
cin >> N;
map<int, int> o, e;
for(int i=0; i<N/2; i++){
int ot, et;
cin >> ot;
cin >> et;
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int N;
int odd[100010], even[100010];
signed main()
{
cin >> N;
for(int i = 0; i < N; i++)
{
int a;
cin >> a;
if(i & 1) even[a]++;
else odd[a]++;
}
int odd_index = -1, odd_max = -1;
for(int i =... | 1 |
#include <cstdio>
const int mod = 1e9 + 7;
const int MAXN = 45, MAXS = ( 1 << 17 ) + 5;
template<typename _T>
void read( _T &x )
{
x = 0;char s = getchar();int f = 1;
while( s > '9' || s < '0' ){if( s == '-' ) f = -1; s = getchar();}
while( s >= '0' && s <= '9' ){x = ( x << 3 ) + ( x << 1 ) + ( s - '0' ), s = getc... | //#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define owo(i,a, b) for(int i=(a);i<(b); ++i)
#define uwu(i,a, b) for(int i=(a)-1; i>=(b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout<<"ayaya~"<<endl
using n... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int __SIZE = 1 << 18;
char ibuf[__SIZE], *iS, *iT;
#define ge (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin), (iS == iT ? EOF : *iS++)) : *iS++)
#define ri read_int()
#define rl read_ll()
#define FILE(s) freopen(s"in", "r", std... | #include <cstdio>
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long llint;
typedef pair < int, int> pii;
typedef pair < llint, llint> pll;
const int N = 1e5 + 500;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int n,a[N],nep,ind;
llint su... | 0 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#define DIV 1000000007
#define TE 2e6+5
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
int N; cin >> N;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define DEBUG(x) std::cerr << #x << "... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int mod=1e9+7;
const int N = 2e5+5;
vector<ll>ans,veca,vecb;
vector<int>adj[N];
vector<double>aka;
vector<pair<int,double>>dp[N];
vector<bool>vis;
void init(int n){
ans.clear();veca.clear();aka.clear();vis.clear();ans.resize(n);
vecb.cle... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, count;
cin >> N;
count = 0;
vector<int> vec(N);
for(int i = 0; i < N; i++){
cin >> vec.at(i);
}
for(int i = 0; i < N; i++){
for(int j = 0; j < i; j++){
for(int k = 0; k < j; k++){
if... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intll int long long
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int n ;
cin >> n ;
string s , t ;
cin >> s >> t ;
deque<char> S , T ;
rep(i,n){
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
string s, t;
cin >> n >> s >> t;
int cnt = 0;
for (int i = 0; i < n; i++)
{
string subs = s.substr(i, n - i); //後半を抽出
string subt = t.substr(0, n - i); //前半を抽出
if (subs == subt) //抽出した部分がもし重複したら
cnt = max(cnt, n - i); //重複部分がながければ長いほど最小にな... | 1 |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
... | #include <algorithm>
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
#define bit(n, k) ((n) >> (k) & 1)
const int MOD = (int)1e9 + 7;
template<class T> void add(T &a, T b) { (a += (b % MOD + MOD) % MOD) %= MOD; }
int main() {
int h, w; cin >> h >> w;
int K; cin >> K; K--;
vect... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
long mod = (long) 1e9 + 7;
int main(){
int n;
long cnt = 0, r = 0, g = 0, b = 0;
cin >> n;
strin... | #include<iostream>
#include<string>
using namespace std;
int main()
{
char s[5000];
long long n,i,j,k,total=0,red[5000]={0},green[5000]={0},blue[5000]={0},r=0,g=0,b=0,x,y;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>s[i];
}
for(i=1;i<=n;i++)
{
if(s[i]=='R')
{
r++... | 1 |
#include<stdio.h>
#include<stdio.h>
#include<bits/stdc++.h>
#include<vector>
#define int long long int
#define rep(a,b,c) for(int a=b;a<c;a++)
using namespace std;
void a1(){
int i, len = 3;
char str[] = "abc";
for(i=0;i<len;i++){
printf("%c\n",str[2-i]);
}
return;
}
int length(char str[5])... | #include <iostream>
#include <algorithm>
using namespace std;
int m, n, p[1001], pp[1001*1001];
int main(){
while( true ){
cin >> n >> m;
if( m == 0 && n == 0 ) break;
for(int i = 0; i < n; i++){
cin >> p[i];
}
p[n] = 0;
n++;
for(int i = 0; i < n... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 40;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) {x = max(x, y); }
template <typename T> void chkmin(T &x, T y) {x = min(x, y); }
template <typename T> void read(T &x) {
x = 0; i... | #pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | 1 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int N = 123;
int a[N];
void solve() {
int k, t; scanf("%d%d", &k, &t);
for (in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n), d;
rep(i, n) cin >> a[i];
rep(i, n) {
auto itr = lower_bound(d.rbegin(), d.rend(), a[i]);
if (itr == d.rbegin())
d.push_back(a[i]);... | 0 |
#include <iostream>
#include <stdio.h>
#include <math.h>
using namespace std;
int main(){
int n;
cin >> n;
if(n < 3 || n > 10000) return -1;
for(int i = 1 ;i <= n ; i ++){
int x = i;
if(x % 3 == 0){
cout << " " << i ;
continue;
}else if(x % 10 == 3){
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main (){
string s;
cin >> s;
s = s.substr(0, s.size()... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long long i=0;i<x;i++)
#define repn(i,x) for(long lo... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <functional>
#include <queue>
#include <string>
#include <cstring>
#include <numeric>
#include <cstdlib>
#include <cmath>
#include <map>
using namespace std;
typedef long long ll;
#define INF 10e17 // 4倍しても(4回足しても)long longを溢れない
#de... | 1 |
#include<bits/stdc++.h>
using namespace std;
static const int64_t INF=100000000000000;
int main(){
int N;cin>>N;
vector<tuple<int64_t,int64_t,int64_t>>A(N);
for(int i=0;i<N;i++){
int64_t h,p;cin>>h>>p;
tuple<int64_t,int64_t,int64_t>q(h+p,h,p);
A.at(i)=q;
}sort(A.begin(),A.end());
vector<pair<int64_t... | #include<algorithm>
#include<iostream>
#include<cstdio>
typedef long long ll;
using namespace std;
struct Node{
int h,p;
}a[5005];
int n;
ll f[5005][5005];
bool cmp(Node a,Node b){
return a.h+a.p<b.h+b.p;
}
int main(){
ios::sync_with_stdio(false);
int i,j;
cin>>n;
fill(f[0],f[0]+n+1,2e9+1);
for(i=1;i<=n;i++)
c... | 1 |
#include <iostream>
using namespace std;
void solve()
{
int x;
cin >> x;
cout << x * x * x << endl;
}
int main()
{
solve();
return(0);
} | #include <stdio.h>
long long n, a, b;
int main() {
scanf("%lld", &n);
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
a = i;
b = n / i;
}
}
a = 0;
while (b) {
b /= 10;
a++;
}
printf("%lld\n", a);
} | 0 |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <string.h>
#include <ctype.h>
#include <algorithm>
using namespace std;
int main() {
int a,b,c,d;
string s;
cin >> s;
a = s[0] - '0'; b = s[1] - '0';
c = s[2] - '0'; d = s[3] - '0';
if(a+b+c+d == 7)
cout << a << "+" << b << "... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int i, j;
for (i = 0; i < (1 << 3); i++) {
bitset<3> a(i);
int sum = s.at(0) - '0';
for (j = 0; j < 3; j++) {
if (a.test(j) == 1) { sum += s.at(j + 1) - '0'; }
else { sum -= s.at(j + 1) - '0'; }
}
if ... | 1 |
#include <iostream>
#include <algorithm>
#include <cstring>
#define rep(X, Y) for( int X = 0; X < Y; ++X )
int n, m;
int N[1001], M[1001];
int cnt[1001];
int main(){
memset( cnt, 0, sizeof(cnt) );
std::cin >> n >> m;
rep( i, n ) std::cin >> N[i];
rep( i, m ) std::cin >> M[i];
rep( i, m ) rep( l, n ) if( N[l... | #include <bits/stdc++.h>
#define maxn 105
using namespace std;
int n, m;
char s[maxn][maxn];
short f[maxn][maxn][maxn][maxn];
int x, y;
int sum1[maxn][maxn], sum2[maxn][maxn];
inline void Max(short &x, short y){
x = max(x, y);
}
int main(){
scanf("%d%d", &n, &m);
for(int i = 1;i <= n;i++) scanf("%s", s[i] + 1);
... | 0 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll a[100];
int main()
{
ll n;
cin>>n;
memset(a,0,sizeof(a));
for(ll i=1;i<=50;i++)
{
a[i]=(49+n/50);
}
ll m=n%50;
for(ll i=1;i<=50;i++)
{
a[i]=a[i]-m;
}
for(ll i=1;i<=m;i++)
{
a[i]+=... | #include <bits/stdc++.h>
#define err(args...) {}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream& operator>>(istream& is, vector<T>& a) { for(T& x : a) { is >> x; } return is; ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rg register
template <typename _Tp> inline _Tp read(_Tp&x){
char c11=getchar();x=0;while(!isdigit(c11))c11=getchar();
while(isdigit(c11))x=x*10+c11-'0',c11=getchar();return x;
}
int n,m,tot,a[105];
int main(){
read(n),read(m);
for(rg int i=1;i<=m;i++)read(a[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
using iii = pair<ii, ll>;
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define __lcm(a, b) a * b / __gcd(a, b)
const ll MOD = 1e9 + 7;
const ll INF = 2e9;
// const ll N = ;
... | 0 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#define... | #include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REP(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define rep1(i,x,n) for(int (i)=(x);(i)<(int)(n);(i)++)
#define REP1(i,x,n) for(int (i)=(x);(i)<=(int)(n);(i)++)
#define rrep(i,x) for(int i=((int)(x)-1);i>=0;i--)
using namespace std;
using l... | 0 |
#include <bits/stdc++.h>
using namespace std;
int f(int x)
{
return x * x;
}
int main(void)
{
int n;
while(cin >> n){
int s = 0;
for(int i = 1; i * n < 600; i++)
s += f(i * n) * n;
cout << s << endl;
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <stack>
using namespace std;
int main(){
stack<char> str;
char c;
while(1){
scanf("%c",&c);
if(c=='\n'||c==EOF) break;
str.push(c);
}
while(!str.empty()){
printf("%c",str.top());
str.pop();
}
printf("\n")... | 0 |
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 0
#define dump(o) if(DBG){cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=... | #include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n, m;
while(1){
scanf("%d%d", &n, &m);
if(n == 0 && m == 0)return 0;
int res = 0, tmp;
vector<int> points, points2;
for(int i = 0;i < n;i++){
scanf("%d", &tmp);
points.push_back(tmp);
}
... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int n,k,x[maxn];
const int inf=0x3f3f3f3f;
long long a,b,now;
int topp,topn;
long long ans;
int main(){
cin>>n>>k;
ans=inf;
for(int i=1;i<=n;i++){
cin>>x[i];
}
for(int i=1;i+k-1<=n;i++){
a=min(abs(x[i]),abs(x[i+k-1]));
b=x[i+k-1]-x[i];
ans... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
int main(){
ll n, k; cin >> n >> k;
vector<ll> x(n); ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 5e5+15;
const int mod = 1e9+7;
const int M = (1<<22);
int A[N];
int add(int x,int y) {
return (x+y)%mod;
}
int mul(int x,int y) {
return (ll)x*y%mod;
}
int dp[M];
int sum[M],X[M];
void solve() {
int n;
scanf("%d",&n);
... | #include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloa... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int64_t> A(N);
int minus = 0;
for(int i = 0; i < N; i++) {
cin >> A.at(i);
if(A.at(i) < 0) {
minus++;
}
}
if(minus % 2 == 0) {
int64_t ans = 0;
for(int i = 0; i < N; i++) {
ans += abs(A.at(i... | #include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n;
cin >> n;
vector<ll> a(n);
ll sum = 0;
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
sum += a[i];
}
ll ans = sum;
fo... | 1 |
#include<stdio.h>
#include<algorithm>
using namespace std;
int partition(int array[], int p, int r) {
int x = array[r];
int i = p - 1;
for(int j = p; j < r; j++) {
if(array[j] <= x) {
i++;
swap(array[i], array[j]);
}
}
swap(array[i + 1], array[r]);
return i + 1;
}
int main(void) {... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
typedef vector<int>vint;
typedef pair<int,int>pint;
signed main(){
int N,p[100]={0},r[100];
cin>>N;
rep(i,N*(N-1)/2){
int a,b,c,d;
cin>>a>>b>>c>>... | 0 |
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <math.h>
using namespace std;
int main(void){
int N,X;
cin >> N >> X;
vector<int> A(N);
for(int i=0;i<N;i++){
cin >> A[i];
}
sort(A.begin(),A.end());
int ans=0;
for(int i=0;i<N;i++){
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main() {
int k,t;
cin >> k >> t;
int ma=0;
rep(i,t){
int u;
cin >> u;
ma=max(ma,u);
}
if(ma>(k*1)/2){
cout << k-1-(k-ma)*2 << endl;
}
else cout << 0 << endl;
}
| 0 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
// output
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout << "YES" << endl
#define Yes cout << "Yes"... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod=1000000007;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main() {
string s;
cin>>s;
int a=0;
int b=0;
int n=s.size();
int c[n]={};
char w;
int p=0;
if(n!=26){
for(int i=0; i<n;... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
#define loop(i,a,b) for(int i=(a);i<ull(b);++i)
#define rep(i,n) loop(i,0,n)
#define all(a) (a).begin(), (a).end()
const double eps = 1e-10;
const double pi = acos(-1.0);
const double inf = (int)1e8;
string field[12];
bool b[12][12];
in... | #include <stdio.h>
int par[12 * 12]; // 島の座標の個数
void init(int n)
{
for (int i = 0; i < n; i++){
par[i] = i; // i 番目の頂点のグループは最初は i
}
}
int find(int x)
{
if (par[x] == x){
return (x);
}
return (par[x] = find(par[x]));
}
void merge(int x, int y)
{
x = find(x);
y = find(y);
... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int x,y;
cin>>x>>y;
int ans=2e9;
if(y>=x)ans=min(ans,y-x);
x=-x;
if(y>=x)ans=min(ans,y-x+1);
x=-x,y=-y;
if(y>=x)ans=min(ans,y-x+1);
x=-... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)... | 1 |
// Created by Vignesh Manoharan
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <cstring>
#include <cassert>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int>... | #include <iostream>
#include <vector>
#include <string.h>
#include <stack>
#include <queue>
#include <algorithm>
#include <climits>
#include <cmath>
#include <map>
#include <set>
#include <assert.h>
#include <sstream>
#define REP(i,n) for(ll i=0;i<(n);i++)
#define MOD 1000000007
#define int long long
#ifdef int
const l... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s; cin >> s;
int ans = 9999;
for(int i = 0; i < s.size()-2; i++){
string a;
for(int j = i; j < 3 + i; j++)
a.push_back(s.at(j));
//cout << a << endl;
ans = min(ans,abs(stoi(a)-753));
a.erase(a.begin(),a.end());
}
cout <... | #include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
typede... | 1 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
#define endl '\n'
using namespace std;
const int N = 1e5 + 5;
int n, a[4][N];
int inv[2], flip[2];
int label[N];
void add_col(vector <int> v, int id)
{
if(abs(v[2] - v[0]) != 2 || abs(v[1] - v[0]) != 1 || v[1] % 3 < 2)
{
... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
typedef long long ll;
typedef double ld;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } retur... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main()
{
string s;
cin >> s;
if (s == "SAT")
cout << 1;
else if (s == "MON")
cout << 6;
else if (s == "TUE")
cout << 5;
else if (s == "WED")
cout << 4;
else if (s ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i,0,n)
#define BFOR(bit,a,b) for(int bit = (a); bit < (1<<(b)); ++bit)
#define BREP(bit,n) BFOR(bit,0,n)
using namespace std;
using ll = long long;
int main() {
ll x;
cin >> x;
ll ans = 0;
... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.