code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
void solve() {
int n;
cin >> n;
string a, b;
cin >> a >> b;
for (int i = 0; i < n; i++) {
int f = 0;
for (int j = 0; i + j < n; j++) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
int N;
cin >> N;
string s;
cin >> s;
string t;
cin >> t;
int max_length = ... | 1 |
// J'aime
// Chemise Blanche
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
string s, t;
cin >> s >> t;
co... | #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()
{
string s, t;
cin >> s >> t;
cout << t+s << endl;
} | 1 |
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
using lint = long long;
template <class T>
T gcd(T a, T b) {
while (b > 0) {
a %= b;
std::swap(a, b);
}
return a;
}
bool solve(int N, std::vector<lint>& A) {
lint sum = std::accumulate(A.begin(), A.end(), 0L... | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const long long MAXN=100005;
long long n;
long long a[MAXN];
long long gcd(long long a,long long b)
{
return b==0?a:gcd(b,a%b);
}
void pr(long long x)
{
if(x==1)
printf("First\n");
else
printf("Second\n");
exit(0);
}
void dfs(long long ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n !=... | #include<bits/stdc++.h>
using namespace std;
int main()
{
bool prime[10001];
memset(prime,0,sizeof(prime));
for(int i=2;i<sqrt(10001);i++){
if(!prime[i])for(int j=i*2;j<10005;j+=i)prime[j]=1;
}
int n;
while(cin>>n,n){
for(int i=n;i>2;i--){
if(!prime[i]&&!prime[i-2]){
... | 0 |
#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 dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> a(h, vector<char>(w));
rep(i, h) rep(j, w) cin >> a[i][j];
v... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <climits>
#include <cmath>
#include <string>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep01(i, n) for(int i = 0; i < (n) + 1; i++)
#define rep10(i, n) for(int i = 1; i < (n);... | 1 |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.tie(0);... | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main(){
ll n;
cin >> n;
vector<ll> vec(5);
rep(i,5) cin >> vec.at(i);
sort(vec.begin(),vec.end());
ll an... | 1 |
#include<bits/stdc++.h>
typedef long long ll;
//forループ
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) f... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A,B,C; cin >> A >> B >> C;
int a,b,c;
a = A.size();
b = B.size();
c = C.size();
char s,t,u,v;
s = A.at(a-1);
t = B.at(0);
u = B.at(b-1);
v = C.at(0);
if (s == t && v == u){
cout << "YES";
}
else cout << "NO";
} | #include <iostream>
#include <numeric>
using namespace std;
const string YES = "POSSIBLE";
const string NO = "IMPOSSIBLE";
int main() {
int N, K, M{}, D{}, A;
cin >> N >> K;
while (cin >> A) {
M = max(M, A);
if (D) D = gcd(D, A);
else D = A;
}
cout << (K <= M && (M - K) % D == 0 ? YES : NO) << ... | 0 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<functional>
#include<queue>
#include<algorithm>
#include<complex>
#include<cstdlib>
#include<cctype>
#define REP(i,n) for(int i = 0;i < (n);i++)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n... | #include<bits/stdc++.h>
#define ll long long
#define maxn 1000100
#define mod 1000000007
using namespace std;
char a[maxn];
int n,q,k;
ll ans=0;
void sol(){
ans=0;
ll d=0,dm=0,m=0;
for(int i=0;i<n;i++){
if(i>=k){
if(a[i-k]=='D'){
dm-=m;
d--;
}
if(a[i-k]=='M') m--;
}
if(a[i]=='C') ans+=dm;
if... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i<n; i++){
cin >> a[i];
}
for (int i = n-1; i>=1; i--){
cout << a[i] << " ";
}
cout <<a[0]<< endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int c;
cin >> c;
int *a = new int[c];
for (int cc = 0; cc < c; cc++) {
cin >> a[cc];
}
string str;
for (int cc = c - 1; cc >= 0; cc--) {
str += to_string(a[cc]) + " ";
}
str.erase(str.length() -... | 1 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <queue>
#include <math.h>
#include <assert.h>
#include <set>
#include <map>
#include <bitset>
#include <ctime>
#include <time.h>
#include <algorithm>
#include <cstdio>
#include <fstre... | #include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <array>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <iomanip>
#include <numeric>
#include <climits>
#include <algorithm>
#include <cstdint>
using namespace... | 1 |
//
// main.cpp
// Atcoder1
//
// Created by Hamske on 2020/09/17.
// Copyright © 2020 Author. All rights reserved.
//
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <iomanip>
using namespace std;
//#define pb push_back
//#define mp make_pair
//
//#define F ... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
#include<cmath>
using namespace std;
double len(int x1,int x2, int y1,int y2){
double res;
double x=x1-x2;
double y=y1-y2;
res=pow(x*x+y*y,0.5);
return res;
}
int main(){
int n;
cin>>n;
int x[n],... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int dx... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
vector<double> v(N);
for (int i = 0; i < N ; ++i)
cin >> v[i];
double roll = 0;
for (int i = 0; i < K; ++ i)
roll += 0.5 * (1. + v[i]);
double maxima = roll;
for (int i = 0; i < v.size() - K; ++i)
{
// cout << "subtr... | 0 |
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int ... | #include<iostream>
#include<vector>
using namespace std;
using ll = long long;
int main(){
int n;
cin>>n;
vector<ll> c(100005);
for(int i=0;i<n;i++){
int d;
cin>>d;
c[d]++;
if(i==0&&d!=0){
cout<<0<<endl;
return 0;
}
}
ll ans=0;
... | 0 |
#include <iostream>
#include <string>
using namespace std;
typedef struct{
string id;
long long sales;
} staff;
int main(void)
{
long long n;
while(cin>>n){
if(!n) break;
staff staff1[4001];
int pt = 0;
for(int i=0; i< n; i++){
string id;
cin >> id;
long long price;
int bnum;
cin >> price >>... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
int main(){
int n;
cin >> n;
while(n != 0){
vector < pair<long long, long long> > v(n);
int order[n];
int num = 0;
for (int i = 0; i < n; ++i){
long long id, p, q;
cin >> id >> p >> q;
v[i] = make_p... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using vi = vector<ll>;
using vv = vector<vi>;
int main(){
int n;cin>>n;
vv faclist(19, vi (19, 0));
rep(i,n){
double a;cin>>a;
ll anum = a*1e9+0.5;
//ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define fir first
#define sec second
#define rep(i,a,b) for (int i = (a); i <= (b); ++ i)
#define rrp(i,a,b) for (int i = (a); i >= (b); -- i)
#define gc() getchar()
template <typename tp>
inline void read(tp& x) {
x = 0; c... | 1 |
#include<iostream>
#include<iomanip>
#include<stack>
#include<queue>
#include<list>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<ctime>
#define ll long long
#define ld double
#define inf 2001
#define infm ... | // Template
#include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, r) for (int i = (l); i < (r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size(... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define bgn begin()
#define sz size()
#define en end()
#define pb push_b... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
int main(void) {
Int a, b, c,... | 0 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
using namespace std;
const ll MAX_N=1e5,MAX_X=1e5;
ll N,X,psm[MAX_N+2],inx[MAX_N+1];
typedef tuple<ll,ll,ll> TUP;
TUP blu[MAX_N+1];
ll tsm(ll i){
return get<1>(blu[i])*get<0>(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
#define rep(i, n) for (... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
void solve() {
int n, k, p;
cin >> n >> k;
vector <int> am;
vector <int> dig(10, 0);
for (int i = 0; i < k; ++i) {
int t;
cin >> t;
++dig[t];
}
bool flag = false;
int N = n;
wh... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long long
#define poly vector<ll>
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l)... | 0 |
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<queue>
using ll = long long;
using namespace std;
ll mod=1e9+7;
int main() {
int h,w;
cin>>h>>w;
vector<vector<bool>>map(h,vector<bool>(w));
queue<pair<pair<int,int>,int>>todo;
for(int i=0;i<h;i++){
f... | #include<iostream>
using namespace std;
int n,k;
int d[10]={-1,-1,-1, -1, -1, -1, -1 ,-1,-1,-1};
bool check(int n){
bool flag=true;
int a;
for(int i=n;i!=0;i/=10){
a=i%10;
for(int j=0;j<10;j++){
if(a==d[j]) flag=false;
}
}
return flag;
}
int main(){
cin>>n>>k;
for(int i=0;i<k;i++){
... | 0 |
#include<stdio.h>
int main()
{
int n,i,dig,flag=0;
scanf("%d",&n);
while(n!=0)
{
dig = n%10;
n = n/10;
if(dig==7)
flag++;
}
if(flag>0)
printf("Yes\n");
else
printf("No\n");
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
string n;
cin>>n;
bool a=true;
for(int i=0;i<3;i++){
if(n.at(i)=='7'){
a=false;
}
}
if(a){
cout<<"No"<<endl;
}
else{
cout<<"Yes"<<endl;
}
}
| 1 |
#include<bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
static const ULL M = 1000000007;
void Solve() {
UL N; cin >> N;
vector<ULL> F(N + 1); F[0] = 1;
for (UL i = 1... | #include<bits/stdc++.h>
using namespace std;
// type definitions
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector< vi > vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef complex<int> ci;
typedef complex<double> cd;
typedef complex<long double> cld;
typedef long dou... | 1 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <list>
#include <numeric>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
//================================================
int... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
char ch[20];
int i=0;
while(cin >> ch[i]){
i++;
}
for(int j=i-1 ; j>=0 ; j--){
cout<<ch[j];
}
cout<<endl;
return 0;
} | 0 |
//{{{
#pragma GCC diagnostic ignored "-Wunknown-pragmas"
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define pb push_back
#define all(x) (... | #include<bits/stdc++.h>
using namespace std;
#define lint long long
#define inf 1000000007
#define mod 1000000007
#define MAX 100005
#define pb push_back
#define mp make_pair
#define vit vector<int>::iterator
typedef pair<int,int> pii;
vector<pii> V[MAX];
int pos[MAX],flg,visited[MAX];
void dfs(int u){
visited[u]=1... | 1 |
#include <bits/stdc++.h>
#include <iostream>
#include <math.h> //pow(x,y)=x^y 99999とかの場合+1するif文
#include <algorithm> //sort(a.begin(), a.end());reverse(a.begin(), a.end());
#include <ctime> //実行時間を測る
#define ll long long
#define vecvec(h, w, name) vector<vector<ll>> name(h, vector<ll>(w));
#define rep(init, i, n... | #include <bits/stdc++.h>
using namespace std;
int main(){
int k;
char arr[100];
cin >> k;
scanf("%s", arr);
if(strlen(arr) <=k){
printf("%s", arr);
}
else{
for(int i=0; i<k; ++i){
cout << arr[i];
}
cout << "...";
}
}
| 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_io(); std::ios_bas... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define l first
#define r second
#define int long long
int n;
long long a[500000];
vector<long long> multi;
int upper_bit(long long c)
{
for (int i = 60; i >= 0; i--)
{
if (c & (1LL << i)) r... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, x;
cin >> n >> x;
long long ans = 0, now = 0;
for(int i = 0; i < n; i++){
long long a;
cin >> a;
long long dis = max((long long)0, now + a - x);
ans += dis;
now = a - dis;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
int main(){
fast;
ll n,x,ans=0,diff=0;
cin>>n>>x;
ll arr[n];
for(ll i=0;i<n;i++)
cin>>arr[i];
for(ll i=1;i<n;i++)
if(a... | 1 |
#include<bits/stdc++.h>
using namespace std;
int dp[1<<15][15];
int g[15][15];
int dis[1<<15];
int n,m,ans=0x3f3f3f3f,sum;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>m;
for(int i=0;i<m;i++){
int a,b,c;
cin>>a>>b>>c;a--;b--;
g[a][b]=g[b][a]=c... | #include<bits/stdc++.h>
using namespace std;
inline int read()
{
char ch=getchar(); int f=1,x=0;
while (ch<'0' || ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
while (ch>='0' && ch<='9') { x=x*10+ch-'0'; ch=getchar(); }
return f*x;
}
int n,m,a,b,c,sum,dis[17][17],v[1<<15],f[1<<15][17];
signed main()
... | 1 |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) f... | #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
ce... | 1 |
/*G - Travelling Salesman Problem*/
/*F - PLUR @ EDC*/
/*A - Headphones */
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a, b, c;
int ans;
int maximo;
cin >> a >> b >> c;
ans = a + b + c;
maximo = max(a, b);
maximo = max(maximo, c)... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <cstdio>
#include <new>
#include <vector>
#include <cstdlib>
#include <string>
#include <set>
#include <tuple>
#include<map>
using namespace std;
int main() {
string A, B, C;
cin >> A >> B >> C;
bool ans = true;... | 0 |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
template <typename T>
struct RUQ //calculateはminimum
{
int n;
const T ex = 1 << 30; //dat 初期値(minなので)
const T em = 1 << 30; //lazy 初期値(minなので)
vector<T> dat, lazy; //tree本体
RUQ(vector<T>... | #include<iostream>
#include<algorithm>
#include<math.h>
#include<queue>
#include<vector>
#include<climits>
#include<map>
#include<string>
#include<functional>
#include<iomanip>
#include<deque>
#include<random>
#include<set>
#include<bitset>
#include<cassert>
using namespace std;
typedef long long ll;
typedef double ll... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 100;
int main() {
// freopen("in.txt", "r", stdin);
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> v;
for(int i = 0; i < n+n; i++) {
int x;
cin >> x;
v.push_back(x);
}
sort... | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG //FOR THE DEBUG! COMMENT OUT THIS WHEN SUBMITTING!
#endif
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vec... | 1 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
//GCD,LCM
ll gcd(ll a, ll b){ return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b){ return a/gcd(a,b)*b;}
int main()
{
string S;
int w;
cin>>S>>w;
for(int i=0;i<S.length();i++){
if(i%w==0){
cout<<S[i];
}
}
co... | #include <bits/stdc++.h>
using namespace std;
#define N 1000010
inline int read() {
int x=0;
char ch=getchar();
while (!isdigit(ch)) ch=getchar();
while (isdigit(ch)) x=x*10+ch-'0',ch=getchar();
return x;
}
int x[N];
char s[N],t[N];
int main() {
int n=read(),p=0;
scanf("%s%s",&s,&t);
for (int i=n-1,j=n,k=0,l=0;... | 0 |
// 去吧！皮卡丘! 把AC带回来！
// へ ／|
// /＼7 ∠＿/
// / │ ／ ／ AC AC AC AC
// │ Z ＿,＜ ／ /`ヽ AC AC AC AC
// │ ヽ / 〉 AC AC AC AC
// Y ` / / / AC AC AC AC
// 亻● . ● 〈 / / AC AC AC AC
// () へ | ＼〈 AC AC AC AC
// >- ._ ィ │ ／／ AC A... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
const int n_max=1e3+10;
const int inf=INT_MAX/4;
vector<int> g[n_max];
vector<int> rg[n_max];
int main(){
ios::sync_with... | 1 |
#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.... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
int N;cin>>N;
int mini=N+1;
int ans=0;
for (int i = 0; i < N; i++){
int P;cin>>P;
if(P<=mini)ans++;
mini=min(mini,P);
}
cout<<ans<<endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int H, W;
const int di[] = {1, -1, 0, 0};
const int dj[] = {0, 0, 1, -1};
int main(void){
cin >> H >> W;
vector<vector<char>> m(H+2, vector<char>(W+2));
for(int i = 1; i <= H; i++){
for(int j = 1; j <= W; j++){
cin >> m[i][j];
}
}
bool ans = true;
for(int i =... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
//UnionFind Template
s... | 1 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int levenshtein(string a, string b) {
int alen = a.length(), blen = b.length();
int dp[alen+1][blen+1];
for (int i = 0; i <= alen; i++) dp[i][0] = i;
for (int j = 0; j <= blen; j++) dp[0][j] = j;
int l, m, r;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).be... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl;
#define INF 1ll<<60;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve()
{
int n, k;
cin >> n >> k;
int ans = 1;
rep(i, n)
{
ans = min(ans * 2, ans + k);
}
cout << ans << en... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(),(a).end()
const ll INF = 1e18+18;
const ll MAX = 200000;
const ll M... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define INF (1ll<<60)
#define mod 1000000007
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long int> l(2*n);
for(int i=0; i<2*n; i++){
cin >> l[i];
}
sort(l.begin(),l.end());
long long int ans = 0;
for(int i=0; i<n; i++){
ans += l[2*i];
}
cout << ans << endl;
r... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int getResult(vector<int> &L, const int size){
sort(L.begin(), L.end());
int sum = 0;
for(int i = 0; i < size; i += 2){
sum += L[i];
}
return sum;
}
int main(){
int N;
cin >> N;
const int N2 = N * 2;
vector<int> L... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
vector<P> G[1001][1001];
int dp[1001][1001];
vector<P> tp;
int dfs(int x,int y,int px=1000,int py=1000)
{
if(dp[x][y]!=0)return dp[x][y];
if(G[x][y].empty())return dp[x][y] = 1;
for(auto i:G[x][y])
{
dp[x][y] = max(dp[x... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
vector<queue<int>> a(n);
rep(i, n)
rep(j, n - 1)
{
int ipt;
cin >> ipt;
ipt--;
a[i].push(ipt);
}
set<pair<int, int>> s;
rep(i... | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
template<class T>
T gcd(T a, T b) {
if (a == 0) return b;
return gcd(b % a, a);
}
int main() {
cin.tie(0)->sync_with_stdio(false);
ll a, b; cin >> a >> b;
ll n = gcd(a, b);
int res = 1;
for (ll... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x, ll y) {return x/gcd(x,y)*y;}
// 素因数分解 O(√n)
// たとえば 60 = 2^2 ... | 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr... | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
vector<int> pa, pb;
int find_roota(int x) {
if (pa[x] != x) pa[x] = find_roota(pa[x]);
return pa[x];
}
void unitea(int x, int y) {
int nx = find_roota(x);
int ny = find_roota(y);
if (nx == ny) return;
else if (nx > ny) pa[nx] = ny;
els... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
const ll MOD = 1e9+7;
const ll LINF = 1LL << 60;
const int INF = 1e9 + 7;
bool isgood(vector<string> bd, int ... | #include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | 0 |
#include <bits/stdc++.h>
#define For(i, j, k) for(int i = j; i <= k; i++)
#define Forr(i, j, k) for(int i = j; i >= k; i--)
using namespace std;
const int N = 1e6 + 10;
char S[N], T[N];
int n;
int delt[N];
int main(){
scanf("%d%s%s", &n, S + 1, T + 1);
bool flag = true;
For(i, 1, n) if(S[i] ^ T[i]){
flag = f... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#include <ext/pb_ds/detail/standard_policies.hpp>
/*
* coder :: ATUL_PANDEY_2608
* >>> INDIA <<<
*/
using namespace std;
using namespace __gnu_... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
typedef queue<int> qi;
typedef stack<int> si;
typedef deque<int> dqi;
#define reps(i, a, b... | #include<stdio.h>
#include<string.h>
int main(){
int r=0,a[4],b[2],i,s=100,nf;
scanf("%d%d%d%d%d%d",&a[0],&a[1],&a[2],&a[3],&b[0],&b[1]);
for(i=0;i<4;i++){
if(s>=a[i]){
s=a[i];
nf=i;
}
}
for(i=0;i<4;i++){
if(i!=nf){
r+=a[i];
}
}
if(b[0]>b[1]){
r+=b[0];
}else{
r+=b[1];
}
printf("%d\n",r);... | 1 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int W[10],K[10];
for(int i=0;i<10;i++) cin>>W[i];
for(int i=0;i<10;i++) cin>>K[i];
sort(W,W+10);
sort(K,K+10);
int max1,max2;
max1=max2=0;
max1=W[9]+W[8]+W[7];
max2=K[9]+K[8]+K[7];
cout<<max1<<" "<<max2<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int solve()
{
int a,b;
cin>>a>>b;
return a*b;
}
int main()
{
int t;
t=1;
while(t--)
{
cout<<solve()<<'\n';
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for(int i=0;i<n;i++){
cin >> a[i];
}
int len=0;
sort(a,a+n);
for(int i=n-1;i>=n-k;i--){
len+=a[i];
}
cout << len << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
... | 0 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int A, B;
string S;
int check = 1;
cin >> A >> B >> S;
for (int i = 0; i < A; i++) {
if (S[i] < 48) check = 0;
}
if (S[A] != '-') check = 0;
for (int i = A + 1; i < B + A + 1; i++) {
if (S[i] < 48) check = 0;
}
if (c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int a,b,k;cin>>a>>b>>k;
rep(i,k){
if(i%2==0){
if(a%2==1){
a--;
}
a/=2;
b+=a;
}
else {
if(b%2==1){
... | 0 |
#if 0
2019.12.30
朴素 dp 设 f[i][p][q] 表示前 i 次操作后当前棋子为 (p, q) 的最小代价。
事实上由于第 i 次操作后一定有一个棋子是 x[i] ，因此可以优化一维：
f[i][j] 表示前 i 次操作后当前棋子为 (j, x[i]) 的最小代价。
转移有两种：
1) f[i - 1][j] + |x[i - 1] - x[i]| -> f[i][j]
2) min(f[i - 1][k] + |x[i] - k|) -> f[i][x[i - 1]]
用线段树维护 f[~][j] ，第一种转移就是全局加，第二种是单点取 min 。
第二种转移可以把左边的绝对值拆开：
f[i - 1][k... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
printf("%3f",n*2*M_PI);
} | 0 |
#include <bits/stdc++.h>
#define DAU ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC return 0;
using namespace std;
string s;
int res;
int main() {
DAU
cin >> s;
s = '0' + s;
for (int i = (int)s.size() - 1; i > 0; --i) {
if (s[i] <= '4' || (s[i] == '5' && s[i-1] < '5'))
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
string s;
cin >> s;
s.at(3) = '8';
cout << s << endl;
return 0;
}
| 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#include <string>
#include <tuple>
#include <functional>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <map>
#include <random>
//#include "toollib.h"
//#include "puzzle.h"
#def... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
void init(vector<int>& v){
int n = 0;
int input;
cin >> n;
for(int i = 0; i < n; i++){
cin >> input;
v.push_back(input);
}
sort(v.begin(), v.end());
v.erase( unique(v.begin(), v.end()), v.end() );
}
int linearsearch... | 1 |
#include <stdio.h>
int main(void){
int i;
scanf("%d", &i);
i = i*i*i;
printf("%d\n", i);
} | #include <iostream>
#include <cmath>
#include <cstdlib>
using namespace std;
int main(int argc, char* argv[])
{
int n = 0, n2 = 0;
cin >> n;
//n = atoi(argv[1]);
if(n < 1 || n > 100) {
return 1;
}
n2 = pow(n, 3.0);
cout << n2 << endl;
}
| 1 |
///_________________________________ B I S M I L L A H I R R A H M A N I R R A H I M __________________________________________________
#include<bits/stdc++.h>
using namespace std;
typedef bool boo;
typedef int li;
typedef long il;
typedef unsigned long ... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main() {
long l, r;
cin>>l >>r;
long ans=2019;
for(long i=l+1;i<=r;i++){
for(long k=l;k<i;k++){
long a=(i*k)%2019;
ans=min(ans,a);
if(ans==0){
cout<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int MAX = 510000;
// https://drken1215.hatenablog.com/entry/2018/06/08/210000
ll fac[MAX], finv[MAX], inv[MAX];
void combinationInit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i... | 0 |
# include <bits/stdc++.h>
# define ll long long
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
using namespace std;
int main()
{
int N; cin >> N;
vector<ll> A(N); rep (i, N) cin >> A[i];
vector<ll> B(N); rep (i, N) cin >> B[i];
vector<ll> C(N); rep (i, N) cin >> C[i];
sort(A.begin(),... | #include<iostream>
using namespace std;
struct Dice{
int s[6];
void roll(char c){
int b;
if(c=='E'){
b=s[0];
s[0]=s[3];
s[3]=s[5];
s[5]=s[2];
s[2]=b;
}
if(c=='W'){
b=s[0];
s[0]=s[2];
s[2]=s[5];
s[5]=s[3];
s[3]=b;
}
if(c=='N'){
... | 0 |
#pragma once
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#define rep(i,n) for(auto i=0;i<(n);i++)
#define all(vs) (vs).begin(),(vs).end()
#define roundup(A,B) (A)/(B)+((A)%(B)==0?0:1)
#define read(type,name) type name;cin>>name
using namespace std;
/*
予想と答えをすべて比較するのが最速。O(n)
... | #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>
using namespace std;
#define fast_io ios_base::sync_wi... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define ll long long
#define inf 0x3f3f3f3f
#define maxn 200010
inline ll read()
{
ll x=0; char c=getchar(),f=1;
for(;c<'0'||'9'<c;c=getchar())if(c=='-')f=-1;
for(;'0'<=c&&c<='9';c=getchar())x=x*10+c-'0';
return x*f;
}
inline v... | 0 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = 0, before;
cin >> before;
bool HasNoAns = (before > 0);
for (int i = 1; i < N; i++) {
int now;
cin >> now;
if (now == 0) {
before = now;
continue;
}
if (now == before + 1) ans++;
else {
if (now <= before) ... | #include <iostream>
using namespace std;
int main(void) {
long a, n, min, max;
long sum = 0;
cin >> n;
cin >> a;
max = a;
min = a;
sum += a;
for(int i = 1; i < n; ++i) {
cin >> a;
if(a < min) {
min = a;
}
if(a > max) {
ma... | 0 |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<int,int>
#define endl "\n"
#define MAXN 100005
#define mod 1000000007
using namespace std;
void solve()
{
}
int main... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string>
#include <vector>
#include <cctype>
#include <cstdio>
#include <iomanip>
using namespace std;
string in, t;
double a, b, c, d;
int main(){
cin >> a >> c >> b >> d;
cout << fixed << setprec... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
double a[n];
pair<int,int>p[n];
int fac[20][20]={};
for(int i=0;i<n;i++){
cin>>a[i];
long long x=(a[i]+0.0000000001)*1000000000;
int two=0,five=0;
while(x%2==0)two++,x/=2;
while(x%5==0... | #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <map>
#include <utility>
using ll = long long ;
#define MAXN 200009
#define MAXL 29
std::map<std::pair<int,int>, int> bucket;
class Rat
{
private:
int cofp2,cofp5;
public:
Rat(){}
Rat(ll nn,ll dd)
... | 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
#define int long long
int read(){
int s = 0,ne = 1; char c = getchar();
while(c < '0' || c > '9') ne = c == '-' ? -1 : 1, c = getchar();
while(c >= '0' && c <= '9') s = (s << 1) + (s << 3) + c - '... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
int a[N];
int main(){
int n;cin>>n;
ll sum=0;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=1;i<n;i++){
if(a[i]<a[i-1])
sum+=a[i-1]-a[i],a[i]=a[i-1];
}
cout<<sum<<endl;
return 0;
} | 1 |
#include <stdio.h>
int main (){
char tanggal[20];
scanf("2017/01/%s",tanggal);
printf("2018/01/%s",tanggal);
return 0;
} | #include <stdio.h>
int main()
{
char op[11];
int ans[2];
scanf("%s", op);
for (int i = 8 ; i <= 9 ; i++){
ans[i-8] = op[i]-48;
}
printf("2018/01/%d%d", ans[0], ans[1]);
return 0;
}
| 1 |
#include<bits/stdc++.h>
const int N = 5005;
const long long inf = 1e18;
using namespace std;
typedef pair <int, int> ii;
vector <ii> mv;
int n, ans;
long long dp[N][N], Min[N];
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++){
int x, y;... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int n, a[15], x[15][15], y[15][15];
int cnt(int i)
{
if (!i) return 0;
return (i & 1) + cnt(i >> 1);
}
int main()
{
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
for (int j = 0; j < a[i]; j++)
... | 0 |
//Name: Space Coconut Crab
//Level: 2
//Category: 数学,探索
//Note:
/**
* zの範囲は0≦z≦E^(1/3)、yの範囲は0≦y≦E^(1/2)で表される。
* zとyが決まればxも一意に決まるので、zとyを全探索し、x,y,z≧0を満たすような組み合わせについてx+y+zの最小値を求めればよい。
*
* オーダーは O(E^(5/6))。
*/
#include <iostream>
#include <algorithm>
using namespace std;
bool solve(bool first) {
int E;
if(... | #include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair(a,b)
#de... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define loop(i, a, b) for (int i = (a); i < (b); i++)
const int MAX = 405;
char grid[MAX][MAX];
int visited[MAX][MAX];
int h, w;
bool inside(int x, int y)
{
return 0 <= x && x < h && 0 <= y && y < w;
}
bool check(int x, int y, int a, int b){
if (!inside(x + a, y... | // https://atcoder.jp/contests/aising2019/tasks/aising2019_c
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep(i, n) for(ll i = 0;i < n;i++)
#define all(i) i.begin(), i.end()
template<class T, class U> bool cmax(T& ... | 1 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I = F; I < (int)(N... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int n;
cin >> n;
vector<pii> s(n),l(n);
rep(i,n){
int a,b;
cin >> a >> b;
s[i] = make_pair(b,a);
}
rep(i,n){
int... | 0 |
#include<stdio.h>
int main(void)
{
int a,b,c,d,e,x[101],X[101],cnt=0,i,j,flg[101],S,s,w=0;
scanf("%d",&a);
for(i=1;i<=a;i++){
x[i]=0;
X[i]=i;
flg[i]=0;
}
for(i=0;i<a*(a-1)/2;i++){
scanf("%d%d%d%d",&b,&c,&d,&e);
if(d>e){
x[b]+=3;
}
else if(e>d){
x[c]+=3;
}
else{
x[b]++;
x[c]++;
}
}
... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <sstream>
#include <functional>
#include <numeric>
#include <cmath>
#include <cstring>
#include <queue>
using namespace std;
int n;
const int INF = 1 << 29;
typedef pair<int,int> P;
vector<P> teams;
bool sortSecond(c... | 1 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
using namespace std;
int main() {
int N = 0;
cin >> N;
int cnt_w = 0, cnt_e = 0;
int ans = pow(10, 6);
vector<char> A(N);
vector<int> S_W(N, 0)... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
string S;
int LW = 0;
int LE = 0;
int RW = 0;
int RE = 0;
cin >> N >> S;
for (int i = 1;i<N;++i) {
if ('E' == S[i]) {
RE++;
}
else {
RW++;
}
}
int ans = 1e9;
for (int i = 0; i < N; ++i) {
ans = min(ans,LW+RE);
if ('E' == S[... | 1 |
#include <iostream>
#include <string.h>
#include <algorithm>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("../data.txt");
char sa[104], sb[104], sc[104], *s;
int ia, ib, ic, *i;
char winner;
int main() {
cin.getline(sa, 104);
cin.getline(sb, 104);
cin.getline(sc, 104);
s = sa;
... | #include <bits/stdc++.h>
#define int long long
#define fast_io(); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define loop(i,a,b) for(int i=a;i<b;i++)
#define all(x) x.begin(),x.end()
#define pb push_back
#define ins insert
#define fi first
#define se second
#define _max max_element
#define _min min_element... | 0 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string a;
cin >> a;
int b;
b=a.size();
int c;
c=0;
int e[b];
while(c<b){
string d(a,c,1);
if(d=="J"){e[c]=1;}
if(d=="O"){e[c]=2;}
if(d=="I"){e[c]=3;}
c=c+1;}
int f;
f=0;
int g;
g=0;
int h;
int i;
c=0;
while(c<b){
h=0;
i=0;
if(e[c]==2){f=f+1;}
if(e[... |
#include <iostream>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <math.h>
#include <list>
#include <algorithm>
using namespace std;
int main(void){
//FILE* fp_in = freopen("data.txt", "r", stdin);
while( 1 ) {
int e;
cin >> e;
if( e == 0 ) break;
u... | 0 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<iostream>
#include<ctime>
#include<cstdlib>
#define MP make_pair
#define fi first
#define se second
#define pb push_back
#define rep(i,a,b) for(i=a;i<=b;i++)
using namespace std;
const int N=610;
bool vis[N][N];
int col[N]... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
const int N = 605;
inline int input() {
int x; char ch; while (!isdigit(ch = getchar()));
for (x = ch ^ 48; isdigit(ch = getchar()); x = x * 10 + (ch ^ 48));
return x;
}
inline void chkmin(int &x, int y) { x = x < y ? x ... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
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; }
ll mod= 1e9 + 7;
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define drep(i,cc,n) for(int i=cc;i>n;--i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a)... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; } //最大公約数
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } //最小公倍数
using Graph = vector<vector<int>>;
const double PI = 3.141592653589793... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b)
{
if(a%b==0)
{
return b;
}
else
{
return gcd(b, a%b);
}
}
int main()
{
int n, k;
bool ans = 0, ma = 0;
cin >> n >> k;
int A[100001];
for (int i = 0; i < n; ++i)
{
cin >> A[i];
if(A[i] == k)
{
ans = 1;
}
if(A[i] > k)
{
... | 1 |
#include<bits/stdc++.h>
#define F(i,a,b) for(int i=(a);i<=(b);++i)
int n,x[101],y[101];
const double PI=acos(-1);
double k[101];
int main(){
scanf("%d",&n);
if(n==2){puts("0.5\n0.5");return 0;}
F(i,1,n) scanf("%d%d",x+i,y+i);
F(i,1,n){
int cnt=0;
F(j,1,n) if(j!=i){
k[++cnt]=atan2(x[j]-x[i],y[j]-y[i]);
}
... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <cassert>
using namespace std;
typedef long long ll;
double cross(pair<double, double> a, pair<double, d... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(),(a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
int main(){
ll... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=1LL<<61;
const ll N=2e5+50;
vec l(N),r(N);
vec a(N);
ll cal(ll x) {
if(x<3) {
return 0;
}
return max({l[x-1]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll a[200005],dp[200005][3],ans=-0x3f3f3f3f3f3f3f3fll;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%lld",a+i);
memset(dp,0xc0,sizeof(dp));
dp[0][1]=0;
for(int i=1;i<=n;i++)
for(int j=0;j<3;j++)
... | 1 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n;
cin >> n;
int a[100] = {0};
double sum;
for(int i = 0; i < n; i++){
cin >> a[i];
sum += a[i];
}
int minIndex = 0;
double avr = sum / n;
double minDist = abs(avr - a[0]);
for(int i = 1; i < n; i++){
if(minDist > abs(av... | #include <bits/stdc++.h>
using namespace std;
const int md = 998244353;
inline int mul(int a, int b) {
return (long long) a * b % md;
}
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
int maxd = *max_element(d.begin... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> pint;
constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
constexpr int MOD = 1e9 + 7;
int main() {
int n; cin >> n;
vector<ll> a(n); rep(i, n) cin >> a[i];
v... | #include<iostream>
#include<string.h>
using namespace std;
int D[6];
void spin(char c)
{
if(c=='E'){
swap(D[0],D[3]);swap(D[3],D[5]);swap(D[5],D[2]);
}
else if(c=='W'){
swap(D[0],D[2]);swap(D[2],D[5]);swap(D[5],D[3]);
}
else if(c=='S'){
swap(D[0],D[1]);swap(D[0],D[4]);swap(D[4],D[5]);
}
else... | 0 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;
else if (n =... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool flag = false;
for(int i=0;i<s.size();i++){
if(s[i+1]=='C'&&s[i]=='A'){
flag = true;
break;
}
}
if(flag) cout << "Yes" << endl;
else cout << "No" << endl;
}
| 0 |
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> ... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
//*********************************************DO IT NOW****************************************************************
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#... | 0 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#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 mp make_pair
#d... | #define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(c) begin(c), end(c)
#define range(i,a,b) for(int i = a; i < (int)(b); i++)
#define rep(i,b) range(i,0,b)
#define eb emplace_back
typedef long long ll;
#define int ll
auto const inf = numeric_limits<int>::... | 1 |
#include<bits/stdc++.h>
#define int long long
using namespace std ;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL) ;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
ll n, ans = 0;
string s;
vector<int> r, g;
int b[4010], rn = 0, bn = 0, gn = 0;
for(int i = 0; i < 4010; i++) b[i] = 0;
cin >> n >> s;
for(int i = 0; i < n; i++){
if(s[i] == 'R') {r.push_back(i); rn+... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | #include<iostream>
#include<vector>
int main() {
int vec=0;
int n;
int a=0;
int b=0;
int game_a, game_b;
std::vector<int>veca, vecb;
while (1) {
std::cin >> n;
if (n == 0)break;
else {
for (int i = 0; i < n; ++i) {
std::cin >> game_a>>game_b;
if (game_a == game_b) { a += game_a; b += game_b; }
... | 0 |
#include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n, m;
cin >> n >> m;
vector<vector<int64_t>> a(n, vector<int64_t>(m));
for (auto i : irange(0L, n)) {
... | #include<bits/stdc++.h>
using namespace std;
const int N=305;
#define fi first
#define se second
typedef pair<int,int>P;
priority_queue<P>que;
int n,m,b[N],vi[N],cnt[N],a[N][N];
bool check(int mid){
while(!que.empty()) que.pop();
for(int i=1;i<=m;i++) b[i]=0;
for(int i=1;i<=n;i++) ++b[a[i][cnt[i]=1]];
for(int i=1;i... | 1 |
#include<stdio.h>
#include<string.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,ptr-buf,stdout),ptr=buf;}*ptr++=c;
}
static inline int IN(void)
... | #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() //reverse
#define strall(v) (v).cbegin(),(v).cend() //const_itterator
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int... | 0 |
#include<bits/stdc++.h>
#define ll long long
#define inf(x) (ll)(1e##x)
using namespace std;
template<typename tn> void read(tn &a){
tn x=0,f=1; char c=' ';
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(;isdigit(c);c=getchar()) x=x*10+c-'0';
a=x*f;
}
int fa[101000],n,k,ans,f[101000];
vector<int> e[101000];
voi... | #include <iostream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;
int main(int argc, char **argv)
{
int V, E, r;
cin >> V >> E >> r;
vector<vector< pair<int, int>>> A(V);
for (int i = 0; i < E; i++) {
int s, t, d;
cin >> s >>... | 0 |
#include <stdio.h>
#include <string.h>
int main(){
int y;
char s[5];
scanf("%d/%s", &y, s);
printf("%d/%s", y+=1, s);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
char s[4]={};
cin>>s;
if(s[0]=='S'){
if(s[1]=='U'){
cout<<7<<endl;
}else{
cout<<1<<endl;
}
}else if(s[0]=='M'){
cout<<6<<endl;
}else if(s[0]=='W'){
cout<<4<<endl;
}else if(s[0]=='F'){
cout<<2<<endl;
}else if(s[0]=='T... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
char arr[405][405];
bool vis[405][405];
int h, w;
int cb;
int cw;
bool f(int i, int j, int l, int m){
if(l<0 || l>=h || m<0 || m>=w){
return 0;
}
if(vis[l][m]==1){
return 0;
}
if(arr[i][j]==arr[l][m]){
return 0;
}
return 1;
}
void d... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using P = p... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>
#include <utility>
#include <queue>
#define INF 1000000007
using namespace std;
typedef long long int ll;
int main(){
vector<int> dp(31,0);
dp[0]=1;
dp[1]=1;
dp[2]=2;
for (int i=3; i<31; i++) {
dp[i] = dp[i-1]+dp... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
pair<int, int> mod(int a, int b){
int d = a/b;
int r = a%b;
if(r<0){
d++;
r = a-(d*b);
}
return make_pair(d, r);
}
int main(){
int32_t n;
int bits[32] = {0};
scanf("%d", &n);
if(n == 0){
cout... | 0 |
#include <iostream>
#include <bits/stdc++.h>
#include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{
int n;
long long sum=3;
scanf("%d",&n);
if(n==1) sum=1;
else if(n==2) sum=2;
else
{
while(n>2)
{
if(n%3!=0&&n%5!=0)
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N;
cin >> N;
string A,B,C;
cin >> A >>B >>C;
ll ans =0;
for(int i=0;i<N;i++){
set<char> s;
s.insert(A[i]);
s.insert(B[i]);
s.insert(C[i]);
ans += (s.size()-1);
}
cou... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a[5], k, ans = 0;
for(int i = 0; i < 5; i++)
cin >> a[i];
cin >> k;
for(int i = 0; i < 5; i++)
for(int j = 0; j < 5; j++)
if(a[i] < a[j] && a[j] - a[i] > k)
ans++;
if(ans)cout << ":(";
else... | #include <string>
#include <vector>
using namespace std;
vector<int> border(vector<int> S)
{
int n = (int)S.size();
vector<int> B(n+1);
B[0] = -1;
int j = -1;
for (int i=1; i<=n; i++)
{
while (j>=0 && S[i-1]!=S[j])
j = B[j];
j++;
B[i] = j;
}
return ... | 0 |
#include<algorithm>
#include<chrono>
#include<climits>
#include<numeric>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<random>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<vector>
#include<cassert>
#include<cstdio>
#include<cstdlib>
#include<cstrin... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using vi = vector<int>;
using pii = pair<int,int>;
#define ST first
#define ND second
#define PB push_back
const int nax = 301;
const int mod = 998244353;
int n,a[nax];
int dp[nax][nax*nax];
int ans,sum,sub;
int main() {
scanf("%d",&n);
for(int i... | 1 |
/*
* Project: AtCoder Beginners Contest 146 A - Can't Wait for Holiday /
* Author: toms74209200 <https://github.com/toms74209200>
*
* Created on 2020/08/07
* Copyright (c) 2020 toms74209200
*
* This software is released under the MIT License.
* http://opensource.org/licenses/mit-license.php
*/
#include <cst... | #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(){
string s;
cin >> s;
if(s == "SUN") cout << 7 << endl;
if(s == "MON") cout << 6 << endl;
if(s == "TUE") cout << 5 << endl;
if(s == "WED") cout << 4 << endl;
if(s... | 1 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int ll
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define endl "\n"
typedef long long ll;
int fact(int n)
{
if(n==0)
return 1;
int ans=1;
for(int i=1;i<=n;i++)
ans*=i;
... | 0 |
//Radhe Radhe
#include<bits/stdc++.h>
#define godspeed ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define rep1(i,a,b) for(ll i=a; i<=b; i++)
#define repVect(i,n) for(ll i=0; i<sum.size(); i++)
#d... |
#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... | 1 |
#include <bits/stdc++.h>
#define f first
#define s second
#define endl '\n'
#define LL long long
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define debug(x) cerr << #x << " is " << x << endl;
using namespace std;
int const MAXN = 2e6... | #include <bits/stdc++.h>
#define reps(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define rep(i, n) reps(i, 0, n - 1)
#define sper(i, s, n) for (int i = (s); i >= (int)(n); i--)
#define per(i, n) sper(i, n - 1, 0)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void solve()
{
int n, k;
... | 1 |
// #include "pch.h"
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include <unordered_map>
#... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=205;
int T;
int n;
long long a[N];
char s[N];
struct Basis
{
static const int M=60;
long long d[N];
void clear()
{
memset(d,0,sizeof(d));
return;
}
void insert(long long t)
{
for(int i=M;i>=0;i--)
if(t&(1LL<<i))
{
... | 1 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
int k, x;
cin >> k >> x;
int l = x - (k-1);
int r = x + (k-1);
for(int i = l; i < r ;... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#defin... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.