code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
// 型
#define ll int64_t // ll -> int64_t
using graph = vector<vector<int>>; // グラフ型
// for文
#define lp(i,n) for(int i=0;i<n;i++) // 変数 i をおいて n 回繰り返し
#define lp_(i,n) for(int i=0;i<=n;i++) // 条件に＝つき
#define lpp(i,n,m) for(int i=n;i<m;i++) // 開始と終... | #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 rep2(i, n, m) for(int i=(int)n; i<=(int)m; i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
typedef vector<ll> vl;
const ll inf=1LL<<60;
int m... |
#include <bits/stdc++.h>
using namespace std;
//(1<<n)はオーバーフローすることがあるぞ！(1L<<n)にしような！
int main() {
string sx,sy,sr;
long x=0,y=0,r=0,ans=0;
cin >> sx >> sy >> sr;
long a=-1;
for(long i=0;i<sx.size();i++) {
if(a!=-1) x=x*10+(sx[i]-'0');
if(sx[i]=='.') a=i;
}
if(a!=-1) for(long i=0;i<5-sx.size()+a;i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define sc(x) scanf("%lld",&(x));
#define pb push_back
#define fi first
#define se second
int A[55];
int P[] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
int B[55];
int ans = -1;
int n;
void dfs(int x){
if(x == 15){
int y = 1;
for(... |
#include <stdio.h>
#include <string.h>
int ans[110][10010];
int a;
char x[110];
int y[110];
void func(int k)
{
printf("%d\n",k);
for(int i=0;i<=a;i++)
{
int s = y[i]/k;
int t = y[i]%k;
for(int j=1;j<=t;j++) ans[i][j] = s+1;
for(int j=t+1;j<=k;j++) ans[i][j] = s;
}
for(int j=1;j<=k;j++)
{
for(int i=0... | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n;
int cnt1[500][500];
int cnt2[500][500];
int team[500][500];
int tgt=0;
bool deta=false;
int col[500][500];
int main(void){
scanf("%d",&n);
if(n==1){
printf("1\n");
printf("AB\n");
retur... |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
#define LL long long
#define mem(s, v) memset(s, v, sizeof s)
#define FILEIN(s) freopen(s".in", "r", stdin)
#define FILEOUT(s) freopen(s".out", "w", stdout)
inline LL read(void) {
LL x = 0, f = 1; ch... | #include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define rep2(i,n) for(ll i=1;i<=(n);++i)
#define rep3(i,i0,n) for(ll i=i0;i<(n);++i)
#define rrep(i,n) for(ll i=((n)-1); i>=0; --i)
#define rrep2(i,n) for(ll i=(n); i>0; --i)
#define pb push_back
#define mo... |
# include<bits/stdc++.h>
using namespace std;
int main()
{
int m,n,i,j;
cin>>m>>n;
int a[m][n];
int min=99999999;
int res=0;
for (i=0;i<m;i++)
{
for (j=0;j<n;j++)
{
cin>>a[i][j];
if (a[i][j]<min){min=a[i][j];}
}
}
for (i=0;i<m;i++)
{
for (j=0;j<n;j++)
{
res+=(a[... | #include <bits/stdc++.h>
#define task "triangles"
#define pb push_back
#define pll pair<ll, ll>
#define pii pair< ll, pll>
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
const int N = 555;
const ll mod = 1e15+7;
const ll ex = 1e5;
ll n, m, t, k, tong, a[N][N], b[... |
#include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define MOD(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,n) for (int i = 0; i < int(n); i++)
#define forr(i,a,b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
#define pb push_back
using namespace std;
typedef long lo... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <regex>
#include <complex>
using namespace std;
#define all(v) v.begin(),v.end... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <iomanip>
#include <... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(in... |
#include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define ii pair<int, int>
#define OK (cerr << "OK" << endl)
#define debug(x) cerr << #x " = " << (x) << endl
#define ff first
#define ss second
#define int long long
#define tt tuple<int, int, int> n
#define all(x) x.begin(), x.end()
#define vi vec... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vld;
typedef ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n;
cin >> n;
set<ll> s;
for(ll a=2 ; a*a <= n; ++a){
ll x = a*a;
while(x <= n){
s.insert(x);
x *= a;
}
}
ll ans = n-s.size();
cout << ans << endl;
return 0;
}
|
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstring>
#include <regex>
#include <cmath>
#include <algorithm>
#include <vector>
#include <list>
#include <map>
#include <unordered_set>
#include <queue>
#include <unordered_map>
#include <set>
#include <cassert>
#include <climits... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int MAX32 = 2147483647;
const long long MAX64 = 9223372036854775807;
const double PI = 3.14159265358979323846;
int main() {
long long n, i = 0;
cin >> n;
while (n > 0) {
n -= ++i;
}
cout << i << endl;
} |
#include <iostream>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#inclu... | #include <iostream>
using namespace std;
int main() {
long X;
cin >> X;
long Y = 100 - (X % 100);
cout << Y << endl;
} |
/**
* author: zakhio (mttk1528)
* created: 31.01.2021 15:25:52
**/
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl
#... | #include <bits/stdc++.h>
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
///////////////////////////////////... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int, int>;
using T = tuple<int,int,int>;
using T2 = tuple<int,int,int, int>;
using Q = tuple<int,int,int, int, int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
void cout_line(v... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> pii;
int main(){
int n; cin >> n;
while(n%10==0 && n!=0) n /= 10;
auto s = to_string(n);
int t = (int)s.size();
bool f = true;
for (int i=0;i<t/2;i++){
... |
#include <cstdio>
int val[4];
int main()
{
scanf("%d%d%d%d", &val[0], &val[1], &val[2], &val[3]);
int sum = val[0] + val[1] + val[2] + val[3];
bool flag = false;
for (int i = 0; i < 16; ++i)
{
int tmp = 0;
for (int j = 0; j < 4; ++j) if (1 << j & i) tmp += val[j];
if (tmp * 2 == sum)
{
flag = true;
... | #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define... |
#include<cstdio>
#include<algorithm>
#include<vector>
#define ll long long
#define M 88
ll n;
ll f[M];
int m,g[M];
std::vector<int> ans;
int main(){
f[1]=f[2]=1;
for(int i=3;i<M;i++)
f[i]=f[i-1]+f[i-2];
scanf("%lld",&n);
for(int i=M-1;i;i--)
if(n>=f[i]){
if(!m)
m=i;
g[i]=n/f[i];
n%=f[i];
}
... | #include <iostream>
#include <vector>
using ll = long long;
int const sigma = 86;
//int const sigma = 6;
ll fib[1 + sigma];
int seen[1 + sigma];
ll eval(std::vector<int> sol) {
ll x = 0, y = 0;
for(int i = 0; i < sol.size(); i++) {
int op = sol[i];
if(op == 1)
x++;
else if(op == 2)
y++;... |
#include<bits/stdc++.h>
#define ll long long
typedef unsigned long long ull;
using namespace std;
const int Max=1e6+20;
const int Maxn=1e7+20;
const int mod=1e9+7;
const int c=231;
inline int read()
{
int f=1,x=0;char ch;
do{ch=getchar();if(ch=='-')f=-1;}
while(ch<'0'||ch>'9');
do{x=x*10+ch-'0';ch=getc... | #include <stdio.h>
#include <vector>
long long int MAX = 21;
std::pair<long long int, long long int> func(long long int k, long long int s, long long int t)
{
if(s<t)
{
if(s==0)
{
if(k%t==0) return std::make_pair(0,-(k/t));
else return std::make_pair(0,0);
}
long long int a = t/s;
std::pair<long l... |
#include<cstdio>
using namespace std;
int a,b;
int main()
{
scanf("%d %d",&a,&b);
printf("%d",a/b);
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main(){
int minv=100;
vector<int> a(4);
for (int i = 0; i < 4; ++i) cin >> a[i];
for (int i = 0; i < 4; ++i){
if (minv > a[i]) minv = a[i];
}
cout << minv << endl;
} |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std; using ll = long long;
using ull = unsigned long long; using P = pair<int, int>;
const int INF = 1e9; const int MOD = 1000000007;
const int dx[] = {-1,0,1,0}; const int dy[] = {0,-1,0,1};
//const int dx[] = {-1,-1,-1, 0, 0, 1, 1... | #pragma GCC optimize "trapv"
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define l... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, N) for(int i = 0; i < (int)N; i++)
#define all(v) v.begin(), v.end()
bool func(vector<int> x, vector<int> y, int N){
for(int i = 0; i < N-2; i++){
for(int j = i+1; j < N-1; j++){
for(int k = j+1; k < N ; k++){
if((x.at(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(intt i=0;i<(intt)(n);i++)
#define rept(i,n) for(intt i=1;i<(intt)(n);i++)
#define all(x) (x).begin(),(x).end()
#define siz(s) (s).size()
using intt = int64_t;
using ldou = long double;
intt gcd(intt a,intt b){if(a%b==0){return b;}else{return gcd(b,a%b);... |
#include "bits/stdc++.h"
#include <chrono>
#include <random>
#define INF 1000000007
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for (int i = a; i < b; i++)
#define NIL 0
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,s... | #include<bits/stdc++.h>
using namespace std;
const int mn=1e5+67;
int f[mn],n,siz[mn];
vector<int> to[mn];
void dfs(int x)
{
siz[x]=1;
int sum=0;
vector<int> vec;vec.clear();
for(auto t:to[x]) {
dfs(t);
siz[x]+=siz[t];
if(siz[t]%2) {
vec.push_back(-f[t]);
}
... |
#include <bits/stdc++.h>
#define sz(x) ((ll)x.size())
#define PB push_back
#define all(x) x.begin(),x.end()
#define i3 array<ll,3>
#define i2 array<ll,2>
using namespace std;
typedef long double ld;
typedef long long ll;
const ll N = 400100;
const int md = 3;
vector<int> g[N];
int n, dst[N], nxt[N], ans[N], tt = 0;
vo... | //雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se seco... |
#include <bits/stdc++.h>
typedef long long ll;
#define _GLIBCXX_DEBUG
#define int long long
using namespace std;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (ll i = (ll)(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 >= (ll)... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> remainder(200);
for(int i = 0; i < n; ++i) {
int a;
cin >> a;
remainder[a % 200]+... |
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using db = double;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = vector... | #include<bits/stdc++.h>
#define mod 998244353
#define INF LLONG_MAX
#define lli long long int
using namespace std;
#define PII pair<int, int>
#define PLL pair<lli, lli>
#define pub push_back
#define F first
#define S second
#define fastIO ios::sync_with_stdio(0); cin.tie(0);
int main() {
//fastIO
//freopen("IN... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... | #include <iostream>
#include <unordered_map>
#include <vector>
#include <bits/stdc++.h>
//#define int long long int
#define ll long long int
using namespace std;
void solve()
{
ll n;
cin>>n;
ll a[n];
ll b[n];
for(int i=0;i<n;i++)
{
int aa,bb;
cin>>aa>>bb;
a[i]=aa;
b[i]=bb;
}
int index1=0;
ll min1=IN... |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX
#define INFL LLONG_MAX
typedef long long ll;
using namespace std;
int main(){
ll n;
cin >> n;
std::vector<ll> p(n);
std::vecto... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
k=0;
cin>>n;
vector<int>p(n);
vector<int>a(200002);
for(int i=0;i<200002;i++){
a.at(i)=i;
}
for(int i=0;i<n;i++){
cin>>p.at(i);
}
for(int i=0;i<n;i++){
a.at(p.at(i))=-1;
for(int j=k;j<200002;j++){
if(a.at(j)!... |
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define all(a) a.begin(), a.end()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 200005;
const int inf = 1e9 + 5;
int ... |
#include <bits/stdc++.h>
using namespace std ;
#define i64 int64_t // typecast using i64(x)
#define int int64_t
#define ld long double
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int(b);++i)
#define pr pair
#define ar array
#define fr first
#define sc second
#define vt vector
#define pb push_back
#define... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
return (ull)rng() % B;
}
int to_int(string s){
bool f=false;
if(s[0]=='-'){
f=true;
s=s.substr(... |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
int i,count =0;
cin >> s;
for(i=0;i<12;i++){
if(s[i] == 'Z'){
if(s[i+1]=='O'){
if(s[i+2]=='N'){
if(s[i+3]=='e'){
count++;
i+=3;
... | #include<bits/stdc++.h>
using namespace std;
signed main(){
int n;cin>>n;
if(n%100!=0){
cout<<n/100 + 1<<endl;
}else{
cout<<n/100<<endl;
}
} |
/**
* author: AdityaHulk
**/
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rev(i,a,b) for(int i=a;i>=b;--i)
#define nl '\n'
#define sz(x) (int)((x).size())
#define pb ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a[3];
for(int i=0;i<3;i++)cin>>a[i];
sort(a,a+3);
if(a[0]+a[2]==2*a[1])puts("Yes");
else puts("No");
return 0;
} |
#include <bits/stdc++.h>
typedef long long ll;
typedef long l;
typedef std::vector<int> vi;
typedef std::vector<std::vector<int>> vii;
typedef std::queue<int> qi;
typedef std::priority_queue<int, std::vector<int>, std::less<int>> pqi;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i < (n); i++)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
using namespace std;
using ll = long long;
int INF = 1001001001;
int main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
for(ll a = 2; a <= 2 * n; a++) {
ll b = a - k;
if ... |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<iomanip>
#include<bitset>
#include<cstdio>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define neinf 0xc0c0c0c0c0c0c0c0ll
#define inf 0x3f3f3f3f3f3f3f3fll
#define uint unsigned int
#de... | #include <bits/stdc++.h>
// hardwork beats talent when tallent doent work hard...
#define ll long long
#define endl "\n"
ll m = 1000000000 + 7;
#define f(i, t) for (int i = 0; i < t; i++)
ll dp[3005][3005];
using namespace std;
double so(ll arr[], double o, int t)
{
// cout << t << endl;
double o1 = 0;
f... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setpre... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... |
#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<ll, ll>;
struct edge {
int to, color;
};
vector<vector<edge>> graph;
int main() {
ll N, M;
cin >> N >> M;
graph.resize(N);
set<P> uset;
rep(i, M) {
int u,... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using ld = long double;
using vld = vector<ld>;
using vb = vector<bool>;
#define rep(i, n) for ... |
#include <iostream>
#include <vector>
#include <map>
#include <bits/stdc++.h>
//#include <atcoder/dsu>
using namespace std;
//using namespace atcoder;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
template<class T> inline bool chmin(T& a,... | //@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#defi... |
#include <iostream>
#include <vector>
using namespace std;
#define int long long
vector<int> get_prime(int max_n)
{
vector<bool> is_prime(max_n + 1, true);
vector<int> res;
for (int i = 2; i < is_prime.size(); i++)
{
if (is_prime[i])
{
res.push_back(i);
for (in... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a),i##end=(b);i<=i##end;++i)
#define per(i,a,b) for(int i=(a),i##end=(b);i>=i##end;--i)
typedef long long ll;
int n,A[100];
int pri[]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
int main(){
cin>>n;
rep(i,1,n)cin>>A[i];
ll mx=-1;
rep(S... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read(){
int res=0;
bool zf=0;
char c;
while(((c=getchar())<'0'||c>'9')&&c!='-');
if(c=='-')zf=1;
else res=c-'0';
while((c=getchar())>='0'&&c<='9')res=(res<<3)+(res<<1)+c-'0';
return (zf?-res:res);
}
const int maxn=2e5+5;
int dta[maxn... | #ifdef LOCAL
#pragma warning(disable:4996)
#pragma warning(disable:4244)
#pragma warning(disable:4554)
#define gets gets_s
#endif
#include<map>
#include<set>
#include<list>
#include<cmath>
#include<stack>
#include<queue>
#include<cmath>
#include<vector>
#include<string>
#include<cctype>
#include<cstdio>
#include<cstri... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int P = 1000000007;
#define F first
#define S second
#define pb push_back
#define mp make_pair
void solve () {
int a, b; cin >> a >> b;
int sum=0;
if (a>=b) {
for (int i=1; i<=a; ++i) {cout << i << " ";}
for (int i=1; i<b; ++i) {cout << -i << "... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
signed main()
{
vector<int>v;
int n,x;
cin>>n>>x;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
if(a[i]!=x)
v.push_back(a[i]);
}
if(v.... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
void solve(){
int n,m;cin>>n>>m;
vector<vector<int>>a;
for(int i=0;i<m;i++){
int x, y;cin>>x>>y;
a.push_back({x, y});
}
sort(a.begin(), a.end());
map<int,int>look;
look[n]++;
for(int i=0;i<m;){
int r = a[i][0];
int j = i;
map<int,... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int M=1e1+7;
ll h,w,c[M][M],ans;char mp[M][M];
inline ll read(){
ll w=0,r=1;char c=getchar();
while(!(isdigit(c)||c=='-'))c=getchar();
if(c=='-')r=-1,c=getchar();
while(isdigit(c))w=w*10+c-'0',c=getchar();
return w*r;
}
int main(){
h=read(),... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<ll> h(n);
vector<ll> w(m);
for (auto &x : h)
cin >> x;
for (auto &x : w)
cin >> x;
sort(h.begin(), h.end());
vector<ll> even(n... | #include <bits/stdc++.h>
typedef long long LL;
const int MAXN = 2e5 + 10;
int n, m, tot;
int a[MAXN], b[MAXN];
LL pre[MAXN * 2], suf[MAXN * 2];
struct Node { int val, id, type; } q[MAXN * 2];
struct cmz { int id, ans; } dsy[MAXN];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", a + i)... |
/**
* author: chowgz
* created: 22/12/2020 02:09:09
**/
#include <bits/stdc++.h>
using namespace std;
#define p 1000000007
inline static long long invmod(long long a) {
long long res = 1, b = p - 2;
while (b != 0) {
if (b & 1) {
res = res * a % p;
}
a = a * a % p;
b >>= 1;
}
return res;
}
inl... | #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 <bits/stdc++.h>
#define int long long
#define fileopen(a, b) freopen(((std::string)a + ".inp").c_str(), "r", stdin); freopen(((std::string)b + ".out").c_str(), "w", stdout);
#define fileopen1(a) freopen(((std::string)a + ".inp").c_str(), "r", stdin); freopen(((std::string)a + ".out").c_str(), "w", stdout);
... | #include<algorithm>
#include<cstdio>
#define rg register
#define ri rg int
#define defrog(A...) fprintf(stderr,A)
#define getchar() (p1==p2&&(p2=(p1=ibuf)+fread(ibuf,1,1<<15,stdin),p1==p2)?EOF:*p1++)
char ibuf[1<<15],*p1,*p2;
struct{
inline operator int(){rg char c,f=0;while((c=getchar())<48||c>57)f|=c=='-';ri unsign... |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define ll long long
#define vl vector <ll>
#define pb push_back
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define mk make_pair
#define INF 2000000000000000000
#define INF32 2000000000
#define FOR(i, a, b) for(ll i = (ll)(a); i <= (ll)(b); i++)
#defi... | /* D - Water Heater */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2e5 + 10;
int n, m, maxv; ll a[N], d[N];
string solve(void)
{
for (int k = 0; k <= maxv; ++k) a[k] = a[k - 1] + d[k];
ll x = *max_element(a, a + maxv);
return (x <= m) ? "Yes" : "No";
}
int main(int argc, cha... |
//templete
#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(){
ll N,M,T;
cin>>N>>M>>T;
vector<int>a;
vector<int>b;
ll tempa,tempb;
ll bat=N;
rep(i,M){
cin>>tempa>>tempb;
a.push_bac... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=a;i<... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
int N, Q;
cin >> N >> Q;
vector<ll> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
sort(A.begin(), A.end());
for (int z = 0; z < Q; z++) {
ll K;
cin >> K;
ll ans = K;
... | #include<bits/stdc++.h>
using namespace std;
#define INF 1e15
#define EPS 1e-9
#define MOD 1000000007
#define Pi 3.14159265358979323846264338327950288419716939937510
#define umap unordered_map
#define uset unordered_set
#define fi first
#define se second
#define l... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int n;
set<int> k;
cin>>n;
int p[n+1];
for(int i=1;i<=n;i++){
cin>>p[i];
}
for(int i=0;i<=200005;i++){
k.insert(i);
}
for(int i=1;i<=n;i++){
if(k.find(p[i])!=k.end()){
k.erase(k.find(p[i]));
}
set<int>::iterator ite... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
using pii = pair<int,int>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
int main() {
int N; cin>>N;
vi cnt(200005,0),p(N);
vi ans;... |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
#include<queue>
#include<string>
#include<stack>
#include<map>
#define pf printf
#define pfn printf("\n");
#define wsa while(~scanf("%d",&a))
#define forba for(b=0;b<a;b++)
#define st scanf("%d",&t);
#define wt while(t--)
#defi... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <sys/types.h>
#include <unistd.h>
#include <vector>
#pragma region macros
#define _overload(_1, ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using P = pair<ll, ll>;
using P3 = pair<int,P>;
using PP = pair<P, P>;
constexpr int INF32 = 1 << 30;
constexpr ll INF64 = 1LL << 60;
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;
constexpr in... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int t,count=0,i,j,sum,x,y;
cin>>t;
for(i=0;i<t;i++)
{
//sum=0;
cin>>x>>y;
sum=y*(y+1)/2-x*(x+1)/2+x;
count=count+sum;
}
cout<<count<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=5005,mod=998244353;
int n,m,ans,f[N][2],g[N][2];
inline int add(int a,int b){
a+=b;
return a<mod?a:a-mod;
}
inline int dec(int a,int b){
a-=b;
return a<0?a+mod:a;
}
inline int mul(int a,int b){
return 1LL*a*b%mod;
}
int main(){
scanf("%d%d",&n,&m);
for(int... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define speed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
#define F first
#define S second
#define um map <ll,ll>
#define rep(i,z,n) for(int i=z;i<n;i++)
#define repi(i,z,n) for(int i=z;i<=n;i++)... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define brn "\n"
#define ss second
#define mk make_pair
#define int long long
#define pb push_back
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(x) ... |
#include <iostream> // cout, endl, cin
#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> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | #include <bits/stdc++.h>
#include <iostream>
#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() {
vector<int> tileID(50 * 50);
vector<int> steped(50 * 50);
int x, y;
string ans = "";
cin >> y >> x;
rep(i,50 * 50) {
cin >> tileID... |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<random>
#include<iomanip>
#include<queue>
#include<stack>
#include<assert.h>
#include<time.h>
#define int long long
#define double long double
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
ostream& operator<<(ostream &os, vector<T> &v){
string sep = " ";
if(v.size()) os << v[0];
for(int i=1; i<v.size(); i++) os << sep << v[i];
return os;
}
template<typename T>
istream& operator>>(istream &is, vector<... |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
string calcpath(int si, int sj, int ti, int tj) {
int i = ti - si;
int j = tj - sj;
char v = 'D';
if(i < 0) {
v = 'U';
}
char h = 'R';
if(j < 0) {
h = 'L';
}
string path = "";
for(int x = 0; x < abs(i); x++) {
path +... | //#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPR(i, n) for(int i=n-1; i>=0; i--)
#define FOR(i, m, n) for(int i=m; i<n; i++)
#define ALL(v) v.begin(), v.end()
#define bit(n) (1LL<<(n))
#define FI... |
#include <iostream>
using namespace std;
int main()
{
double A, B;
cin >> A >> B;
cout << (1 - B / A) * 100.0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define LONG long int
#define ULONG unsigned long int
#define rep(r) for(int i = 0; i < r; ++i)
#define Yes "Yes"
#define No "No"
#define YES "YES"
#define NO "NO"
int main(){
double a,b;
cin >> a >> b;
cout << fixed << setprecision(16) << 100 - 100 * b / a <<... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=17,M=(1<<17)+1,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
int n,x... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co... |
#include <bits/stdc++.h>
using namespace std;
#define ms(x,a) memset(x,a,sizeof x)
typedef long long ll;
const int mod=1e9+7, seed=131, MAXN=0;
bool vis[12];
int main(){
cin.tie(0)->sync_with_stdio(0);
ll l, ans=1; cin >> l;
for (int i=l-1;i>=l-11;--i){
ans*=i;
for (int j=1;j<=11;++j){
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define ff(i,n) for(i=0;i<n;i++)
#define pb push_back
#define mp make_pair
int main() {
ll t;
t = 1;
while(t--){
ll l,i,j;
cin>>l;
ll dp[201][12];
for(i=0;i<200;i++)
dp[i][0] = ... |
// -----------------------------------
// author : MatsuTaku
// country : Japan
// created : 11/01/20 20:25:34
// -----------------------------------
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr); ios::sync_with_stdio(false);
int n; cin>>n;
ll ans = 0;
... | //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
#include<cstdio>
#include<cstring>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
const double pi = 2.0 * asin(1.0);
ll dx[4] = {1, 0, -1, 0};
ll dy[4]... | #include <bits/stdc++.h>
using namespace std;
int A,B;
long long K, dp[61][31];
int main() {
scanf("%d %d %lld", &A, &B, &K);
memset(dp,0,sizeof(dp));
for (int i = 0; i <= A+B; ++i) for (int j = 0; j <= A && j <= i; ++j) {
if (j == 0) dp[i][j] = 1;
else dp[i][j] = dp[i-1][j] + dp[i-1][j-1]... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int X;
cin>>X;
if(X<0){
cout<<0<<endl;
}else{
cout<<X<<endl;
}
}
| #define rep(i, n) for(int i = 0; i < (int)(n); i++)
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
int c;
cin >> c;
cout << max(0,c) << endl;
} |
#include <cassert>
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <string>
#include <cstdlib>
#include <memory.h>
#include <ctime>
#include <bitset>
#include <fstream>
#include <queue>
#include <st... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t T, count;
cin >> T;
vector<int64_t> c(T);
for (int i = 0; i < T; i++) {
cin >> c.at(i);
count = 0;
while (c.at(i) > 0) {
if (c.at(i) % 2 > 0) {
break;
}
c.at(i) = c.at(i) / 2;
count++;
}
if (c... |
// Coder: @SumitRaut
#include <bits/stdc++.h>
#define speedup ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
using namespace std;
#define debug1(x) cout<<#x<<' '<<x<<'\n'
#define debug2(x,y) cout<<#x<<' '<<x<<' '<<#y<<' '<<y<<'\n'
#define debug3(x,y,z) cout<<#x<<' '<<x<<' '<<#y<<' '<<y<<' '<<#z<<' '<<z... | #include <bits/stdc++.h>
#include <cmath>
#define ll long long
#define m 1000000007
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int x,y;
x = (a+b)/2;
y = a-x;
cout<<x<<" "<<y;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define run ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0);
#define mod 1000000007
#define decimal(n,k) cout<<f... | #include <math.h>
#include <assert.h>
#include <vector>
#include <numeric>
#include <iostream>
#include <algorithm>
#include <functional>
template <typename T1, typename T2>
std::istream& operator>>(std::istream& is, std::pair<T1, T2>& v) {
return is >> v.first >> v.second;
}
template <typename T>
std::istream& ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H,W;
cin >> H >> W;
char a[H][W];
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin >> a[i][j];
}
}
int ans = 0;
for(int i=0; i<H; i++){
for(int j=1;j<W; j++){
if(a[i][j-1] == '.' && a[i][j] == '.'){
ans++;
... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define Rrep(i,n) for(int i=((int)n-1); i>=0; i--)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define INF 2e15
#define MOD 10e9+7
typedef vector<int> vint;
typedef long long ll;
int main()
... |
#include<cstdio>
#include<algorithm>
#define int long long
const int Q=100005;
const int INF=(1ll<<57);
using namespace std;
typedef long long ll;
#define rg register int
char buf[1<<21],*p1=buf,*p2=buf;
#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
inline bool ig(char c){return c>=48&&... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1... |
#include <bits/stdc++.h>
#include <numeric>
using namespace std ;
#define ll long long int
#define ull unsigned long long int
#define s(a) scanf("%lld",&a)
#define S(a) scanf("%ull",&a)
#define For(i,n) for(i=0;i<n;i++)
#define FOR(i,n) for(i=1;i<=n;i++)
#define pie acos(-1.0)
//#define cin std::cin
//#define cout std... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
// 深さ優先探索
vector<bool> seen;
void dfs(const Graph &G, int v) {
seen[v] = true; // v を訪問済にする
// v から行ける各頂点 next_v について
for (auto n... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define ffor(i,a,b) for(int i=a;i<b;i++)
#define bfor(i,a,b) for(int i=a-1;i>=b;i--)
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define mem(x,y) memset(x,y,sizeof(x))
#define all(x) x.begin(),x.e... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define endl '\n'
#define Endl '\n'
#define fi first
#define ii pair<int,int>
#define iil pair<ll,ll>
#define se second
#define ld long double
#define mod 0
#define popcount __builtin_popcountll
#define x0 zxcxzcsacasd
#define x1 ghfghujfgfg
#define... |
#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = a; i < b; i++)
#define rrep(i,a,b) for (int i = a - 1; i >= b; i--)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define pvec(a) for (int i = 0; i < a.size();... |
/* {{{ */
#include <bits/stdc++.h>
using namespace std;
#ifdef __LOCAL
#include <prettyprint.hpp>
#define debug(a) cerr << "[\033[33mDEBUG\033[m] " << (#a) << ": " << (a) << endl
#else
#define debug(s) cerr << "[\033[33mDEBUG\033[m] local only" << endl
#endif
using ll = long long;
template <class T> using vec = vector... |
/*input
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#inclu... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) v.begin(), v.end()
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)... |
// Cookie197
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<string>
#include<iomanip>
#include<math.h>
using namespace std;
#define no_tle ios::sync_with_stdio(false); cin.tie(0)
#define ll long long
#define pii pair<ll,ll>
#define mp make_pa... |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
#include <iomanip>
#include <math.h>
using namespace std;
typedef long long ll;
ll pow(ll a)
{
ll ans = 1;
while (a--)
{
ans *= 2;
}
return ans;
}
int main()
{
... |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... |
#include <bits/stdc++.h>
#define F(i, l, r) for(int i = (l), _end_ = (int)(r); i <= _end_; ++i)
#define f(i, r, l) for(int i = (r), _end_ = (int)(l); i >= _end_; --i)
#define Set(a, v) memset(a, v, sizeof(a))
#define File(a) freopen(a".in","r",stdin);freopen(a".out","w",stdout)
using namespace std;
bool chkmin(int &a, ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
int N;
vector<int> ColorMin;
vector<int> ColorMax;
cin >> N;
ColorMin.assign(N, 0);
ColorMax.assign(N, 0);
for(int i=0; i<N; i++){
int Xbuf, Cbuf;
cin >> Xbuf >> Cbuf;
Cbu... |
#include <bits/stdc++.h>
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(nullptr);
string s;
cin>>s;
char first, second, third;
first = s[0];
second = ... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
for(int i = 0; i < s.length(); i++){
if(i % 2 == 0){
if(isupper(s[i])){
cout << "No" << endl;
return 0;
}
}
if(i % 2 == 1){
if(islower(s[i])){
cout << "No" << endl;
return 0;
}
}
}
printf("Yes\n");
... |
#include <bits/stdc++.h>
#define ll long long
#define sf scanf
#define pf printf
#define nl printf("\n")
#define pb push_back
#define TEST int Test;cin>>Test;for(int _t=1;_t<=Test;_t++)
using namespace std;
int main()
{
int a,b,c,d;
sf("%d %d %d... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
const int N = 1e7+10;
int p[N];
const ll MOD=(ll)(1e9)+(ll)(7); //is prime
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int a,b,c,d;
cin >> a >> b >> c >> d;
cout << b-c;
}
|
#include<bits/stdc++.h>
typedef unsigned long long ull;
typedef long long ll;
typedef double db;
typedef long double ldb;
#define pii pair<int,int>
#define pll pair<long long,long long>
#define usi unordered_set<int,custom_hash>
#define usl unordered_set<long long,custom_hash>
#define uspii unordered_set<pii,custom_has... | #include<bits/stdc++.h>
#include<string>
using namespace std;
int main()
{
int n,v=0;
cin>>n;
string p=to_string(n);
int l=p.length()-1;
while(p[l]=='0'){
p.erase(l,1);
l--;
}
int y=p.length();
for(int i=0;i<y;i++)
{
if(p[i]!=p[y-i-1]) {v++; break;}
}
if(v>0) cout<<"No";
else cout<<"Yes";
}
|
#include <bits/stdc++.h>
using ll = long long;
const int N(1010);
ll n, f[N];
int pos, fl[N];
std::vector<int> ans;
int main()
{
std::scanf("%lld", &n), f[1] = 1;
for (int i = 2; i <= 90; i++) f[i] = f[i - 1] + f[i - 2];
for (int i = 90; i; i--)
if (n >= f[i]) n -= f[i], fl[i] = 1, pos = std::max(pos, i);
for (... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for(ll i = 0;i < n;i++)
//#define ll long long
#define ll int
//#define MOD 1000000007LL
//#define MOD 998244353LL
#define doublecout(a) cout<<setprecision(16)<<a<<endl;
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型... |
#include<bits/stdc++.h>
#define SORT(v) sort(v.rbegin() , v.rend())
#define si(n) scanf( "%d" , &n)
#define sii(n , m) scanf( "%d %d" , &n , &m)
#define sl(n) scanf( "%lld" , &n)
#define sll(n , m) scanf( "%lld %lld" , &n, &m)
#define ss(cad) scanf( "%s" , cad)
#define sz(x) (int)x.size()
#define PB push_back
#define f... | #pragma GCC optimize("Ofast")
#include <iostream> // cout, endl, cin
#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> // tuple, make_tuple
#include <cstdint> // ... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<utility>
#include<iomanip>
#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<cstdio>
#include<cctype>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define fixed_setprecision(n) fixed << setprecision((n))
#define pai 3.... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... |
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#define ll long long int
#define endl '\n'
#define M 998244353
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for... |
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
long long a,b,c,h=998244353;
cin>>a>>b>>c;
long long d=((a*(a+1))/2)%h;
long long e=((b*(b+1))/2)%h;
long long f=((c*(c+1))/2)%h;
long long ans=(((d*e)%h)*f)%h;
cout<<ans;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
ll n;
void solve() {
cin >> n;
set<ll> a;
for(ll i=1; i*i<=n; ++i) {
if(n%i==0)
a.insert(i), a.insert(n/i);
}
for(ll c : a)
cout << c << "\n";
}
int main() {
ios::sync_with_stdio(0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long int i=0;i<n;i++)
int main() {
long long int N;
cin >>N;
long long int a=pow(N,0.5);
int A=0;
rep(i,a)if(N%(i+1)==0){
if((i+1)*(i+1)!=N)A+=2;
else A++;
}
long long int ans[A]={};
int j = 0;
re... |
#include <bits/stdc++.h>
#define fo(i, x, y) for (int i = x; i <= (y); ++i)
#define fd(i, x, y) for (int i = x; i >= (y); --i)
using namespace std;
typedef long long ll;
const int maxn = 50 + 5;
int n;
ll X;
ll a[maxn], b[maxn], g[maxn];
ll f[maxn][2];
int getint()
{
char ch;
int res = 0, p;
while (!isdigit(ch ... | #include <iostream>
#include <iomanip>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <numeric>
#include <array>
using namespace std;
#define IOS ios_base::sync_wi... |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <algorithm>
#include <bitset>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
int main() {
ll n,k,sum=0,summ=0;
cin >> n >> k;
for(ll i=1;i<=n;i++){
for(ll j=1;j<=k;j++){
sum+=i*100;
summ+=... | #include <bits/stdc++.h>
using namespace std;
long long ll_pow(long long a, long long n){
long long ans = 1;
for(long long i=0; i< n; i++){
ans *= a;
}
return ans;
}
int main(){
int a,b;
cin >>a>>b;
if(a+b>=15&&b>=8) cout<<'1'<<endl;
else if(a+b>=10&&b>=3) cout<<'2'<<endl;
else if(a+b... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N>
int SIZE(const T (&t)[N])
{
return N;
}
template<typename T>
int SIZE(const T &t)
{
return t.siz... | #include<bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define debug(x) cerr << #x << ':' << x << endl;
#define rep(i,n) for(long long i = 0; i < n ; i++)
#define reps(i,n) for(long long i = 1; i <= n ; i++)
#define make_unique(v... |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define PRINT(a) cout << (a) << endl
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ... | #include <bits/stdc++.h>
#define SIZE 1005
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int main()
{
int n;
scanf("%d",&n);
int t=1;
while(t<n) t<<=1;
for(int i=0;i<n;i++)
{
int a=i*2;
int b=i*2+1;
for(int j=11;j>=0;j--)
{
if(a>=n&&(a>>j&1)) a^=1<<j;
if(b>=n&&(b>>j&1)) b... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mx=2000;
const int mod= 1e9+7;
const ll inf=1e12+4;
int arr[6]={4,8,15,16,23,42};
int cnt[100];
int a[mx];int b[mx];int aa[mx];int bb[mx];
int k;int n,m;
int ok[mx];
int ans=0;
void solve(int i){
if(i==k){
int l=0;
for(int j=0;j<m... | #include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <map>
#include <cmath>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
#define rep(i, o) for (ll i = 0; i < (o); ++i)
#define REP(i,a,b)for(ll i=(ll)(a);(i)<(ll)(b);i++)
#define NUM 1e5
typedef long long ll;
typedef ... |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 +13;
long long A[N], L[N], R[N];
int n;
double x;
int main(){
cin >> n;
A[0] = 0; A[n+1] = 0;
for (int i = 1; i<= n; i++){
cin >> A[i];
}
R[1] = 0;
for (int i = 2; i<= n; i++){
if (A[i-1] == ... | #include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main(void){
long long int n=0,x=0,man=0,che=0;
long double euc=0.0;
cin >> n;
for (int i=0;i<n;i++){
cin >> x;
if(x<0)
x *= -1;
man += x;
euc += x*x;
if(x>che) che = x;
}
euc = sqrt(euc);
cout << man << ... |
#include <iostream>
#include <algorithm>
using namespace std;
#define UpdMin(x, y) x = min(x, y)
const int MAX_N = 200010;
bool Flag[MAX_N];
int N;
int main()
{
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin >> N;
int ans = 0;
for (int i = 1; i <= N; i++)
{
int x;
c... | #include <bits/stdc++.h>
template <typename T>
T next() {
T temp; std::cin >> temp;
return temp;
}
template <>
int next() {
int temp; scanf("%d", &temp);
return temp;
}
template <>
long long next() {
long long temp; scanf("%lld", &temp);
return temp;
}
template <>
double next() {
double te... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long ll;
#define d(x) cerr << #x << " = " << x << endl
const int maxn = 25;
const ll inf = 0x3f3f3f3f;
int n;
ll x[maxn], y[maxn], z[maxn];
ll dis[maxn][maxn];
ll f[maxn][1 << 17];
ll llabs(ll x) {
if (x < 0) retur... |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 2005
ll H,W;
ll tate[SIZE][SIZE],yoko[SIZE][SIZE],naname[SIZE][SIZE],dp... | #include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...)name
#define _rep(i,n)repi(i,0,n)
#define repi(i,a,b)for(int i=int(a),i##_len=(b);i<i##_len;++i)
#define MSVC_UNKO(x)x
#define rep(...)MSVC_UNKO(_overload3(__VA_ARGS__,repi,_rep,_rep)(__VA_ARGS__))
#define all(c)c.begin(),c.end()
#define write(x)cout<<(x)<<'... |
#pragma GCC optimize("O3") //
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, b, a) for(int i = b - 1; i >= a; i--)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int... | #include <bits/stdc++.h>
template <typename T> inline void rd(T& x) {
int si = 1; char c = getchar(); x = 0;
while(!isdigit(c)) si = c == '-' ? -1 : si, c = getchar();
while(isdigit(c)) x = x * 10 + c - 48, c = getchar();
x *= si;
}
template <typename T, typename... Args>
inline void rd(T& x, Args&... args) { rd(x... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#defin... | #include<iostream>
#include<vector>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
int main(){
int n;cin>>n;
vector<ll>sum(n+1,0);
for(int i=0;i<n;i++){
ll a;cin>>a;
sum.at(i+1)=sum.at(i)+a;
}
vector<vector<int>>idx(n+1,vector<int>(n+1,-1));
vector<vector<int>>pre(n+1,vector<int... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define mset(a, b) memset(a, b, sizeof(a))
using ll = long long;
using pii = pair<int, int>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int H, W;
cin >> H >> W;
vector<string> S;
for (int i = 0; i < H; i++) {
string s;
cin >> s;
S.push_back(s);
}
int ans = 0;
for (int h = 0; h < H - 1; h++) {
for (int w = 0; w... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define gc getchar() //(p1==p2&&(p2=(p1=buf)+fread(buf,1,size,stdin),p1==p2)?EOF:*p1++)
#define mk make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define IT iterator
#define V vector
#define TP template <class o>
#define TPP... | // atcoder/arc121/B/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a=0;
int b=0;
int c=0;
int d=0;
int x=0;
int y=0;
int z=0;
int n=0;
int m=0;
int i,j,k;
int te=0;
int A[101] ={0};
int B[101] = {0};
int C[101] = {0};
int D[101] = {0};
int AA[101][101];
... | #include <bits/stdc++.h>
using namespace std;
#define r(i,a,b) for(int i=a; i<(b); i++)
using ll = long long;
#define tc(a,b) cout << a << ": " << b << endl
#define l() cout << endl
/*--------------------------------
=== 数値の絶対値最大 ===
https://docs.microsoft.com/ja-jp/cpp/c-language/cpp-integer-limits?view=msvc-160
符号な... |
#include<bits/stdc++.h>
#define MAXN 200005
#define INF 1000000000
#define MOD 1000000007
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<P,int> PP;
int n;
PP p[MAXN];
vector<pair<int,P> > v;
int calc_dist(int x,int y)
{
return max(max(p[x].F.F-p[y].... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
// template <class T = ll> using P = pair< T,T>;
template <class T = ll> using V = vector<T>;
template <class T = ll> using VV = V<V<T>>;
#define rep(i,n) for(int i=0; i<(n);++i)
#define repp(i, l, r) for(int i = (l); i < (r); ++i)
#define pb push_back
... |
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<queue>
#include<algorithm>
#include<set>
#include<map>
#include<cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
double n;
double x0[2], xh[2];
const double PI = 3.14159265358979323... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <deque>
#include <numeric>
#include <algorithm>
#include <queue>
#include <sstream>
#include <stack>
#include <variant>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (n); i... |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <map>
#include <sstream>
using namespace std;
void solve() {
int n, w;
cin >> n >> w;
set<long long> time;
map<long long, long long > add;
map<long long, long long> rem;
for(int i = 0; i < n; i++) {
int x, y, z... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> ii;
typedef vector<ii> vii;
typedef vector<vi> vvi;
#define FOR(i,a,b) for(int i=a; i <=(b); i++)
#define ROF(i,a,b) for(int i=a; i >=(b); i--)
#define loop(i,a) for(int i=0; i < (... |
#include <bits/stdc++.h>
#define union Union
#define rank rank228
#define tm tm228
#define hash hash228
#define matr vector < vector < int > >
#define int long long
#define pii pair < int, int >
#define papa pair < node*, node* >
#define all(v) v.begin(), v.end()
//#define endl "\n"
#define pb push_back
#define PI 3.1... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector... |
#include<bits/stdc++.h>
using namespace std;
#define f(t) ll t; cin>>t; while(t--)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define vec vector<ll>
#define vecpair vector<pair<ll,ll>>
using ll = long long;
using ld = long double;
const int N = 2e5 + 5;
int main(){
IOS;
int n,product=0;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pp pop_back
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define f0(i,a,n) for(i=a;i<n;i++)
#define f1(i,a,b) for(i=a;i<=b;i++)
#define all(v) sort(v.begin(),v.end());
#define stp setprecision
#define... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 //10^9+7
#define INF LONG_MAX/3
#define bit(n) (1LL<<(n))
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(... | #include <bits/stdc++.h>
using namespace std;
/*
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
*/
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define endl "\n"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-lo... |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define repit(i,C) for (auto i = (C).begin(); i != (C).end(); i++)
#define pr(a) cout << a
#define prl(a) cout << ... | #include<bits/stdc++.h> //Ithea Myse Valgulious
namespace chtholly{
typedef long long ll;
#define re0 register int
#define rel register ll
#define rec register char
#define gc getchar
//#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),p1==p2)?-1:*p1++)
#define pc putchar
#define p32 pc(' ')
#define pl puts("... |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int getint()
{
char ch;
do{ch=getchar();}while (ch!='-'&&(ch<'0'||ch>'9'));
int ans=0,f=0;if (ch=='-') f=1; else ans=ch-'0';
while (isdigit(ch=getchar())) ans=ans*10+ch-'0';
if (f) ans*=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll INF = 1e18;
#define rep(i, n) for(long long i = 0; i < n; i++)
#define rep1(i, n) for(long long i = 1; i <= n; i++)
#define rrep(i, n) for(long long i = n-1; i > 0; i—)
#define rrep1(i, n) for(long long i = n; i... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.