code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define mp make_pair
// #define mod 1000000007
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define all(x) x.begin(),x.end()
#define F first
#define S second
#define fo(i,n) for(int i... | //Bismillahir Rahmanir Raheem
#ifdef ONLINE_JUDGE
#include<bits/stdc++.h>
#endif
#include<iostream>
#include<numeric>
#include<tuple>
#include<iomanip>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<map>
#include<unordered_map>
#include<math.h>
#include<vector>
#include<climits>
#include<algorithm>
#in... |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
using namespace std;
using ll=long long;
using ld=long double;
ld judge(string s){
ll res=0;
vector<ll> v(9);
for(ll i=0;i<s.length();i++){
v[s[i]-48-1]++;
}
for(ll i=1;i<=9;i++){
res+=(i*pow(10,v[i-1]));
}
... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, b) for (ll i = a; i < b; ++i)
#define rep_down(i, a, b) for (ll i = a; i > b; --i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi f... |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 200; // n の最大値
vector<vector<long long>> com; // 前計算の結果を保存
void init() {
com.assign(MAX_N, vector<long long>(MAX_N));
com[0][0] = 1;
for (int i = 1; i < MAX_N; ++i) {
com[i][0] = 1;
for (int j = 1; j < MAX_N; j++) {
... | #include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>
using namespace std;
#define lp(i,n) for(int i=0; i<n; i++)
#define cc cout
#define ll long long
// ll fact(ll n)
// {
// ll res = 1;
// for (ll i = 2; i <= n; i++)
// res = res * i;
// return res;
// }
/... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
/* #define MULTI 1 */
void pre()
{
}
void solve()
{
double a, b; cin >> a >> b;
cout << (a - b) / a * 100 << endl;
}
int main()
{
pre();
#ifdef MULTI
int T;
cin >> T;
for (int ... | #include<bits/stdc++.h>
#include<iostream>
using namespace std;
using LL = long long;
using P = pair<int,int>;
constexpr long long LINF = 1001001001001001001;
#define all(x) (x).begin(), (x).end()
#define rep(i,n) for(int i = 0; i < (n); ++i)
//using Graph = vector<vector<int>>;
int main(){
double A, B;
cin >> A >> ... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MOD 998244353
using Graph=vector<vector<int>>;
vector<int> parent;
int find(int x){
int y=parent[x];
while(y!=parent[y]){
y=find(y);
}
return parent[x]=y;
}
void unite(int a,int b){
int x=find(a);
int y=find(b);
if(x!=y){
p... | #include <iostream>
#include <vector>
#define rep(i, n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
const int MOD = 998244353;
vector<vector<int>> adj;
vector<bool> visited;
ll fact(ll x) {
if (x == 0) return 1;
return x * fact(x-1) % MOD;
}
int dfs(int i) {
visited[i] = true;
... |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
vector<string> v{
"8",
"16",
"61",
"24",
"42",
"32",
"23",
"48",
"84",
"56",
"65",
"64",
"46",
"72",
"27",
"88",
"96",
"69"
};
bool Solve(string s)
{
if (find(v.begin(), v.end(), s) != v.end(... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int m = 1000000007;
bool check(int n){
while(n!=0){
int t = n%10;
if(t==0){
return false;
}
n = n/10;
}
return true;
}
bool check_2(int val, vector<int> arr){
while(val!=0){
int t = val%10;
if(arr[t]>0){
arr[t]--;
}
else{... |
//================code===================//
//#define TLE
#ifdef TLE
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <ctime>
#define ci(t) cin>>t
#define co(t) ... | #include<ctime>
#include<cstdio>
#include<cctype>
#define ll long long
using namespace std;
const ll N=2e5+10;
const char s[]="110";
ll read() {
char c;
ll x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while (isdigit(c)){
x=x*10+(c-48)*f;
c=getchar();
}
return x;
}
ll n;
char str[N];
ll solve(){
ll ... |
#include <iostream>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <array>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#in... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define vi vector<int>
#define mk make_pair
#define vll vector<long long >
#define loop(i,a,b) for(int i=a;i<=b;i++)
#define loopr(i,a,b) for(int i=b;i>=a;i--)
#define vii ve... |
//デバッグ用オプション：-fsanitize=undefined,address
//コンパイラ最適化
#pragma GCC optimize("Ofast")
//インクルードなど
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
//forループ
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
//FORAは範囲for文(使いにくかったら消す)
#define re... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
#define ll long long
int main(){
double a,b;cin >> a >> b;
cout << setprecision(20) << a*b/100.0 << endl;
} |
#include <algorithm>
#include <bitset>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#inclu... | #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 pb push_back
#define ll long long
#define ld long double
#define sz(x) (ll)x.size()
#... |
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main(){
long n;
cin >> n;
vector<vector<int>> vviNum(1, vector<int>(2));
vviNum[0][0] = 0;
vviNum[0][1] = 1;
long iTmp = 4;
for(... | #include <bits/stdc++.h>
using namespace std;
#define PB push_back
constexpr int kN = int(1E3 + 10);
int n, tot, cnt[kN][kN];
vector<string> v;
bool check() {
for (string i : v) {
for (int j = 0; j < tot; j++) for (int k = j + 1; k < tot; k++) if (i[j] != i[k]) cnt[j][k]++;
}
for (int i = 0; i < tot; i++) for (... |
#undef _GLIBCXX_DEBUG
// Problem: F - Rook on Grid
// Contest: AtCoder - Panasonic Programming Contest (AtCoder Beginner Contest 186)
// URL: https://atcoder.jp/contests/abc186/tasks/abc186_f
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
ll X, N = 0;
cin >> N >> X;
vector<ll> A(N,0);
for(ll i = 0; i < N; i++) {
cin >> A.at(i);
}
vector<ll> M(N, 0);
for(ll i = 1; i < N; i++) {
M.at(i - 1) = A.at(i)/A.at(... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin>>n;
int k=(1<<n)-1;
cout<<k<<endl;
for(int i=1; i<=k; i++){
string s="";
rep(i, (1<<n)) s+='A';
for(int j=0; j<n; j++) if(i>>j&1){
rep(l, (1... | #include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef unsigned long long ull;
typedef vector<in... |
#include <iostream>
using namespace std;
int main()
{
int h, w, a[101][101], minn=1000000, s=0;
cin>>h>>w;
for(int i=1; i<=h; i++){
for( int j=1; j<=w; j++){
cin>>a[i][j];
if(a[i][j]<minn){
minn=a[i][j];
}
}
}
for(int i=1; i<=h; i+... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int s=0;
for(int i=1;i<=a;i++){
for(int j=1;j<=b;j++){
s+=i*100+j;
}
}
cout<<s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
array<int, 2> c = {0};
long long ans = 0;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
int now = count(s.begin(), s.end(), '1') % 2;
c[now] += 1;
ans += c[1 - now]... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
long long odd=0,even=0;
while(n--){
string s;
cin>>s;
int ones=0;
for(char c:s){
if(c=='1') ones++;
}
if(ones%2) odd++;
else even++;
}
cout<<(long long)odd*even<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
long long qzh[200005],mx[200005],a[200005];
int main(int argc, char** argv) {
int n;
cin >> n;
long long ans=0,s=0;
for(int i=1;i<=n;i++)
{
cin >> a[i];
qzh[i]=qzh[i-1]+a[i];
mx[i]=max(mx[i-1],qzh[i]);
ans=max(ans,s+mx[i]);
s+=qzh[i];
}
cout << ans;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ll long long
#define quickie ios_base::sync_with_stdio(false); cin.tie(NULL);
#define rep(i, a, b) for(int i=a; i<b; i++)
#define rep1(i, a, b) for(int i=a; i<=b; i++)
#define repp(i, a, b) for(int i=b-1; i>=a; i--)
#define pb push_back
#de... |
#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>... | #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(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool ch... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct Node{
int to;
int d;
};
using graph = vector<vector<Node>>;
int main()
{
int n, m;
cin >> n >> m;
graph g(n);
for(int i=0; i<m; ++i){
int a, b, c;
cin >> a >> b >> c;
g[a-1].push_back({b-1, c});
... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long LINF = 1LL << 60;
using Graph = vector<vector<pair<int, long long>>>;
int N, M;
vector<long long> dijkstra(const Gr... |
#include <bits/stdc++.h>
#define file(x) freopen(#x".in", "r", stdin), freopen(#x".out", "w", stdout)
inline int read()
{
int data = 0, w = 1; char ch = getchar();
while (ch != '-' && !std::isdigit(ch)) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
while (std::isdigit(ch)) data = data * 10 + (ch ^ 48), ch... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
int main() {
ll N,K;cin>>N>>K;
for(ll i=0;i<K;i++) {
if(N%200==0) N/=200;
else {
N=N*1000+200;
}
}
cout<<N<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
size_t N;
cin >> N;
size_t ans = (1 << (N)) - 1;
cout << ans << endl;
for (size_t i = 1; i <= ans; i++)
{
for (size_t j = 0; j < ((size_t)1 << N); j++)
{
if (bitset<32>(i & j).count() % 2 == 0)
... | #include<bits/stdc++.h>
using namespace std;
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
int64_t N;
cin>>N;
for (int64_t a=3;a<=N;a*=3){
int64_t b=5;
while (b<=N-a){
if (a+b==N){
int cnt1=0,cnt2=0;
int64_t tmp1=1,tmp2=1;
while (tmp1!=a) {
tmp1*=3;
cnt1++;
}
while (tmp2!=... |
#include<bits/stdc++.h>
using namespace std;
int main() {
int a, b, x, y;
scanf("%d%d%d%d", &a, &b, &x, &y);
if(a == b)
printf("%d", x);
else if(b > a) {
int diff = b - a;
printf("%d", min(x + diff* y, x + 2 * x * diff));
}
else {
int diff = a - b - 1;
printf("%d", min(x + diff * y, x + 2 * x * diff));... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
int32_t main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int a, b, x, y; cin >> a >> b >> x >> y;
int ans = 0;
int dp[105][2];
memset(dp, -1, sizeof dp);
function<int(int, int)> solve = [&] (int pos, int cur) {... |
// ¯\_(ツ)_/¯
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(),(x).end()
#define X first
#define Y second
#define sep ' '
#define endl ... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6;
int cnt[MAX+4];
bool isSqr[MAX+4];
using pii = pair<int,int>;
long long coprimes(int l, int r){
//[l,r]에서 x<y인 서로소 쌍의 수
//전체에서 k로 동시에 나눠떨어지는걸로 포함배제하면 된다
long long result = 1LL * (r-l+1) * (r-l) / 2;
for(int i=2;i<=r;i++)if(!isSqr[i])... |
#include<bits/stdc++.h>
using namespace std;
#define fastt ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define pb push_back
#define inf 1000000000000000000
#define mp make_pair
#define sz(a) a.size()
#define clr(x) x.clear()
#define ff ... | #include <array>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <functional>
#include <iomanip>
#include <numeric>
#include <cstring>
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#in... |
#include <iostream>
#include<algorithm>
using namespace std;
int main(int argc, const char * argv[]) {
int N=0,i=0;
double D=0,H=0,d=0,h=0,m=0,ans=0,minmin=0;
cin>>N>>D>>H;
for(;i<N;i++){
cin>>d>>h;
m=(H-h)/(D-d);
m*=d;
ans=h-m;
if(ans>minmin) minmin=ans;
}
... | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define PI 3.14159265358979323
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef long double ld;
ll gcd(ll a, ll b) {
if(a % b == 0) {
return b;
}
else {
... |
#ifdef _LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
static const ll MOD = 998244353ll;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define per(i,n) for (int i=n-1; i>=0; i--)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
string s, x;
cin>>n>>s>>x;
vector<bool> dp(7, false), ndp(7);
dp[0]=true;
per(i, n){
if(x[i]=='A'){
rep(... |
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pi 3.141592653589
#define pb push_back
#define nl cout<<"\n"
#define db(x) cout<<x<<" "
#define fi(a,b) for(int i=a;i<b;i++)
#define fj(a,b... | #include<stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#define MAXN 200005
#define max_num 1000000
#define MOD 998244353
#define LL long long
using namespace std;
LL sum[MAXN];
LL a[MAXN], p[MAXN];
LL C[MAXN][305];
int n, k;
LL pow(LL x, LL nn)
{
LL res = 1LL;
while(nn)
{... |
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#... | //............Created by:- Arth Raj...........................//
#include <string.h>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <bitset>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#inclu... |
#include<bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl "\n"
#define pb push_back
#define ppb pop_back
#define ff first
#define ss second
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typede... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int64_t i = 0; i < n; i++)
#define REPR(i, n) for(int64_t i = n; i >= 0; i--)
#define FOR(i, m, n) for(int64_t i = m; i < n; i++)
#define FORR(i, m, n) for(int64_t i = m; i >= n; i--)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
template<ty... |
#include<iostream>
#include<map>
#include<vector>
#include<set>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...... | // Problem: C - Tricolor Pyramid
// Contest: AtCoder - AtCoder Regular Contest 117
// URL: https://atcoder.jp/contests/arc117/tasks/arc117_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
#define pb push_back
#define sz(a) int(a.size())
using... |
#include <bits/stdc++.h>
#define st string
#define ll long long
#define ld long double
#define ull unsigned long long
using namespace std;
void solve() {
int n;
cin >> n;
int z = 1, e;
vector <int> ss;
for (int i = 0; i < n; i++) {
cin >> e;
ss.push_back(e);
}
sort(ss.begin(), ss.end());
for (auto i : ss) ... | #include<bits/stdc++.h>
using namespace std;
#define max(a, b) (a < b ? b : a)
#define min(a, b) ((a > b) ? b : a)
#define io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define SCD(t) scanf("%d",&t)
#define SCLD(t) scanf("%ld",&t)
#define SCLLD(t) scanf("%lld",&t)
#define SCC(t) scanf("%c",&t)
#define SCS(t)... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
long long a;
long long s[n+1];
long long d;
int i;
s[0]=1;
s[1]=1;
for(i=2;i<=n;i++){
s[i]=(s[i-2]+s[i-1])%1000000007;
}
cin >> a;
long long sum=(s[n]*a)%1000000007;
for(i=1;i<n;i++){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
templa... |
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <algorithm>
#include <bitset>
#include <math.h>
#include <utility>
typedef long long ll;
typedef unsigned long long ull;
#define vi std::vector<int>
#define vl std::vector<ll>
#defi... | #include <iostream>
using namespace std;
int main()
{
long long A, B, C;
cin >> A >> B >> C;
if ( C % 2 == 0 )
{
A = A>0?A:-A;
B = B>0?B:-B;
}
if ( A > B ) cout << ">";
else if ( A < B ) cout << "<";
else cout << "=";
} |
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... | #include <bits/stdc++.h>
#define pb(x) push_back(x)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define F(w,x,y) for(ll w=x; w<y; w++)
#define endl "\n"
#define mod 1000000007
typedef long long ll;
typedef long double ld;
using namespace std;
void play()
{
ll n;
cin>>n;
v... |
///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define u64 uint64_t
#define ll long long
#define endl "\n"
#define PI acos(-1)
#define fi first
#define si second
#define mkp mak... | #include<bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
return b==0?a:gcd(b,a%b);
}
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
ans = gcd(ans, a);
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
char s,t;
cin >> s >> t;
if(s=='Y'){
t=std::toupper(t);
}
cout << t << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
int n, m, ans, MOD;
int mul(int B, int K) {
int base = B, h = K, res = 1;
while (h) {
if (h & 1) res = (res * base) % MOD;
base = (base * base) % MOD, h >>= 1;
}
return res;
}
signed main() {
// freopen(".in", "r", stdin);
// freopen(".out... |
#include <bits/stdc++.h>
#define rep( i, a, b ) for( i = a; i < b; i ++ )
using namespace std;
template< class T >
using vv = vector< vector< T > >;
int solve( vv< int > *dvv, vector< int > rv, int ind, int a, int d ) {
int p = rv.at( ind );
rv.erase( rv.begin() + ind );
if( rv.empty() ) {
int b ... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <limits>
#include <numeric>
#include <vector>
using namespace std;
// static constexpr long long INF = numeric_limits<long long>::max() / 2;
// vector<long long> travel(int S, int v, int N, int K, int counter, vector<long long>& T, vector<long long... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
ll l;
cin >> l;
ll ans = 1;
for (int i = 1; i <= 11; i++) {
ans *= l - i;
ans /= i;
}
cout << ans << endl;
}
|
//#include<math.h>
#include<algorithm>
#include<stdlib.h>
#include<time.h>
#include<stdio.h>
#include<string.h>
#define un unsigned
#define srd srand(time(0))
#define ll long long
#define con continue
#define gtc getchar()
#define ptc putchar
#define dou double
#define eps 0.00000000001
#define opr operator
#define cl(... | //W4P3R
#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define mp make_pair
#define pb push_back
#define re register int
#define fr first
#define sd second
#define pa pair<int,int>
#define FOR(i,a,b) for(re i=a;i<=b;i++)
#define REP(i,a,b) for(re i=a;i>=b;i--)
#define MEM(a) memset(a,0,sizeof(a))
#define N 20... |
/**
* author: shu8Cream
* created: 16.04.2021 21:45:44
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<ll,ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
int main() {
cin.tie(nullptr)... | /* C++ */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> pint;
const ll MAX = 510000;
const ll MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end... |
#include<bits/stdc++.h>
using namespace std;
int gcd(int a, int b)
{
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
int lcm(int a, int b)
{
return a * b / gcd(a, b);
}
int main(){
long long n,k;
cin>>n>>k;
long long a[n];
long long count[n+1]={0};
for(... | ///****In the name of ALLAH, most Gracious, most Compassionate****//
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
#define ALL(a) a.begin(), a.end()
#define FastIO... |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
string s;
string search = "ZONe";
cin >> s;
int count = 0;
for (int i = 0; i < 9; i++)
{
//cout << s.substr(i, 4) << endl;
if (s.substr(i, 4) == se... | #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps... |
#include <bits/stdc++.h>
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define clr(x) memset(x,0,sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int ans = 0;
for (int i = 0; i < n; ++i) {
int c1 = 0, c2 = 0;
for (int j = i; j < n; ++j) {
if (s[j] == 'A') c1++;
else if (s[j] == 'T') c1--;
else if (s[j] == 'C') c2++;
else c2--;
if (c1 == 0 && c2 ... |
//g++ -std=c++14 test.cpp -o test.out
//問題URL
//https://atcoder.jp/contests/arc110/tasks/arc110_d
//参考：
//https://drken1215.hatenablog.com/entry/2020/12/06/070100
// ポイント：二項係数を扱う方法論として、経路数へと帰着する方法がある
// 積=かつ、和=行き先増やす
// 使った使わないを論じるといいかも
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < b; ++i)
int debug = 0;
const int N = 3e5, mod = 998244353;
int n, cnt = 0, clr = 1, ans, f[N], was[N];
vector <int> inv[N];
void dfs(int v) {
if (was[v] == clr) return;
was[v] = clr;
dfs(f[v]);
for (int i : inv[v])... |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (... | // execute g++ main.cpp -std=c++14 -I C:\Users\naoya\Desktop\code\Atcoder
#include<bits/stdc++.h>
//#include<atcoder/all>
typedef long long ll;
typedef long double ld;
using namespace std;
//using namespace atcoder;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
//ordered_set 重複不可
#include <ext/pb_ds/assoc_con... |
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
int main(){
string s;
cin>>s;
cout<<s[1]<<s[2]<<s[0];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
char w;
cin >> s;
w = s.at(0);
for (int i = 0; i < s.size() - 1; i++) {
s.at(i) = s.at(i + 1);
}
s.at(2) = w;
cout << s;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define rrep(i, n) for(ll i=n-1;i>=0;--i)
#define rep1(i, n) for(ll i=1; i<=n; ++i)
#define repitr(itr,mp) for(auto itr=mp.begin();itr!=mp.end();++itr)
#define ALL(a) (a).begin(),(a).end()
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
#define int long long
int d[200];
signed main(){
int n;
cin>>n;
int a[n];
rep(i,n){
cin>>a[i];
d[a[i]%200]++;
}
int ans=0;
rep(i,200){
if(d[i]>1){
ans+=(d[i]*(d[i]-1)/2);
}
}
... |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
LL A,B,W;
int main()
{
// freopen("1.in","r",stdin);
cin>>A>>B>>W;
W*=1000;
LL ans=W/B;
while(ans*B<W) ans++;
if(A*ans>W) puts("UNSATISFIABLE");
else {
printf("... | #include <stack>
#include <queue>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <set>
#include <tuple>
#include <cmath>
#include <random>
#include <algorithm>
#include <vector>
#include <iostream>
#include <fstream>
#include <chrono>
#include <numeric>
#define fio ios_base... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int ans = 0;
int max;
string s10, s8;
cin >> max;
for (long long i = 1; i <= max; i++)
{
stringstream ss1, ss2;
ss1 << dec << i;
s10 = ss1.str();
ss2 << oct << i;
s8 = ss2.str();
long unsigned int s10pos7 = s10.find('7');
... | #include <bits/stdc++.h>
#define ms(a,b) memset(a, b, sizeof(a))
#define rep(a,b,c) for(int a = (int)(b); a < (int)(c); a++)
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define m_p(a,b) make_pair(a, b)
#define lson l,mid,o << 1
#define rson mid + 1,r,o << 1 | 1
#define ls o << 1
#defi... |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#include <cassert>
#include <random>
#include ... | #include <cstring>
#include <cstdlib>
#include <map>
#include <unordered_map>
#include <string>
#include <list>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdio>
#include <iostream>
#include <set>
#include <unordered_set>
using namespace std;
#define ABS(a) ((a)<0?(-(a)):(a))
#... |
#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<ll, ll> P;
typedef vector<string> vs;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vp> vvp;
const ... | #include <stdio.h>
long long p = 1000000007;
long long n, m, s;
long long x, y, z;
long long a[2000];
long long inv[5000000];
void makeinv(void) {
long long arraynumber = sizeof inv / sizeof inv[0];
inv[1] = 1;
for (int invcount = 2; invcount < arraynumber; invcount++) {
inv[invcount] = p - inv[p % invcount] * (p ... |
/*jai_ganeshdeva*/
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pu push // adds the value to the last of the queue
#define lld long long int
#define ldo long double
#define ins insert /// used in set to insert the values
#define adv advance /// used to increment the iterator
#define m... | #include <iostream>
#include <vector>
#include <set>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
if (a == b) {
cout << c << endl;
}
else if (b == c) {
cout << a << endl;
}
else if (a == c) {
cout << b << endl;
}
else {
cout... |
#include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fm, to) for (int i = fm; i <= to; ++i)
#define foreach(i, dat) for (__typeof(... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
#define int long long
int n;
vector<int> edges[100001];
int fh[100001], sh[100001];
bool change[100001];
bool cmp(int p, int q){
int s1,s2;
if(change[p])s1 = fh[p]-sh[p];
else if(fh[p]-sh[p] >= 0)s1 = 1e18;
else s1 = -1e18;
... |
#include<iostream>
using namespace std;
char a[400][400];
int n,m,x,y;
int main()
{
// string s;
cin>>n>>m;
cin>>x>>y;
// getchar();
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
cin>>a[i][j];
// for(int i=1;i<)
// cout<<a[1][1]<<" "<<a[1][4]<<endl;
int ans=1;
for(int i=x+1;i<=n;i++)
{
if(i>n || a[i][y]=='... | /*
Code by: tush_chen
*/
#include <bits/stdc++.h>
using namespace std;
string to_string(string s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
template <typename A, typename B>
string to_string(p... |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0);
int T = 1;
ll N, A, B;
for (cin >> T; T--;) {
cin >> N >> A >> B;
ll C = N - A + 1, D = N - B + 1, E = N - A - B;
ll f = ... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
typedef long long ll;
const int N=55;
int n,a[N],b[15]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
ll ans=2e18;
ll gcd(ll a,ll b){
if(!b){
return a;
}
return gcd(b,a%b);
}
bool check(ll x){
for(int i=1;i<=n;i++){
if(gcd(x,a[i])==1){
... |
//ΔAGC053A
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 444;
int n,a[N],k;
char s[N];... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<a<<endl
#define dumparr(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a)
#define dumparr(a,n)
#endif
#... |
#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 3005
ll N;
ll A[SIZE],rui[SIZE];
ll dp[SIZE][SIZE],memo[SIZE][SIZE];
i... | #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 ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
void co... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 20, MAXM = 5e3 + 10, MOD = 1e9 + 7;
void solve() {
int n;
cin >> n;
vector <long long> a(n), ps(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i)
ps[i] = ps[i - 1] + a[i];
else
ps[i] = a[i];
}
long long pos = 0;
long long ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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 all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000 //10^14
template <typename T>
bool chmax(T &a, const T& b) ... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
const ll INF_L = 1LL << 60;
const int INF_I = 1 << 30;
const int MOD = (int)1e9 + 7;
c... | //伟大的导师，伟大的领袖，伟大的统帅，伟大的舵手
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll;
char __buf[1<<20],*__p1,*__p2;
//#define getchar() (__p1==__p2?... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1e9
#define linf 1e18
#define BASE 1000000
#define EPS 1e-10
#define PI acos(-1)
#define pii pair<int,int>
#define piii pair<int, pair<int,int>>
#define pli pair<long long, int>
#define pll pair<long long, long long>
#define pdi pair<doubl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
// Merge Sort Tree
struct mstree
{
int len;
vector<vector<int>> t;
mstree(int l)
{
len = l;
t.resize(4 * len);
}
vector<int> merge(int l, int r)
{
int sz1 = t[l].size(), sz2 = ... |
/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed i... | #include"bits/stdc++.h"
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(x) x.begin(),x.end()
#define MOD 1000000007
#define INF INT_MAX
#define FLOAT_ANS setprecision(10)
using namespace std;
typedef long long ll;
//最大公約数
template<typename T>
T gcd(T a, T b) {
if (a % b == 0) {
return(b);
}
else {
return(gcd(... |
#include <iostream>
using namespace std;
using ll = long long;
ll number_ab(ll a, ll n);
bool fakeprime(ll n);
int main()
{
ll n, ans;
cin >> n;
ans = n;
for (ll i = 0; i*i <= n; i++) {
if (fakeprime(i)) {
ans -= number_ab(i, n);
}
}
cout << ans << endl;
return 0;... | #include <iostream>
#include <stdio.h>
#include <sstream>
#include <string>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <random>
#include <numeric>
#include <cmath>
#include <complex>
#include <stack>
#include <memory>
#include <cstdi... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
const ll MAX = 50000000000000;
ll MOD = 1000000007;
ll X,Y;
map<ll,ll> memo;
ll T(ll a){
if(memo[a] != 0) return memo[a] - 100;
ll b;
if(a == 1) b = abs(X - 1);
else if(a % 2 == 0) b = min(abs(a - X),1 + T(a /... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VP... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define x first
#define y second
#define bg begin()
#define ed end()
#define pb push_back
#define mp make_pair
#define sz(a) int((a).size())
#define R(i,n) for(int i(0);i<(n);++i)
#define L(i,n) for(int i((n)-1);~i;--i)
const int iin... |
/*
／＞ フ
| _ _|
／`ミ _x 彡
/ |
/ ヽ ?
／￣| | | |
| (￣ヽ＿_ヽ_)_)
＼二つ
*/
#include <queue>
#include <vector>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define MP make_pair
#define ll long long
#define fi first
#define se second
using namespace std;
... |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define isNum(a) (a >= '0' && a <= '9')
#define SP ... | typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
long long extGcd(long long a, long long b, long long &p, long long &q) {
if (b == 0) {
p = 1, q = 0;
return a;
}
long long d = extGcd(b, a % b, q, p);
q -= a / b * p;
return d;
}
pair<long... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define all(a) (a).begin(), (a).end()
using pint = pair<ll, ll>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 2e5+8, inf = 1e18+9, mod = 998244353;
int n, m, a[maxn], sum[maxn];
void solve() {
int i, j, mx;
cin >> n;
for (i = 1; i <= n; i++) cin >> a[i], sum[i] = a[i];
for (i = 1; i <= n; i++) sum[i] += sum[i - 1];
for... |
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
typedef long long ll;
void Main() {
int N, t[2000];
double l[2000], r[2000];
cin >> N ;
for (int i = 0; i < N; ++i) {
cin >> t[i] >> l[i] >> r[i] ;
if (t[i] == 2 || t[i] == 4) { // 右が開なら少し狭く
r[i] -= 0.... | #include<bits/stdc++.h>
using namespace std;
#define m7 1000000007
#define m9 1000000009
#define ll long long
#define boost ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define F first
#define S second
#define pb push_back
#define f1(i,n) ... |
/******************************
AUTHOR KRISH MURARKA
*******************************/
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define modulo 998244353
#define popcount __builtin_popcount //used to count nu... | #include <bits/stdc++.h>
#include <string>
#include <map>
#include <set>
#include <sstream>
#include <queue>
#include <stack>
#include <deque>
#include <vector>
#define loop(i,a,b) for (int i = (a); i <= (b); i++)
#define loopr(i, a, b) for(int i = (a); i >= (b); i--)
#define ff first
#define ss ... |
//ABC 200 E - Patisserie ABC 2
//https://atcoder.jp/contests/abc200/tasks/abc200_e
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long k;
cin >> n >> k;
//已选了几个数，其数字和是多少
long long dp[4][3000005] = {};
dp[0][0] = 1;
for(int i = 0; i < 3; i++) { // 推送给、贡献给父问题
for(int j = 0; j <=... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
template<class T>
bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
template<class T>
bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
using ll = long long;
usi... |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | #include<iostream>
#include<map>
#include<vector>
#include<set>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
int main() {
int n, w;
cin >> n >> w;
cout << n/w << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int h,m;
int main()
{
scanf("%d %d",&m,&h);
if(h%m==0) printf("Yes");
else printf("No");
} |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
template<typename T>void ckmn(T&a,T b){a=min(a,b);}
template<typename T>void ckmx(T&a,T b)... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int A, B, C, D;
cin >>A >> B >>C >> D;
string ans ="No";
for (int a=0; a<2; a++){
for (int b =0; b<2; b++){
for (int c =0; c<2; c++){
for(int d =0; d<2; d++){
if(2*(A*a+B*b+C*c+D*d) == A + B + C+ D){
... |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
in... | /* made by amunduzbaev */
#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 ff first
#define vv vector
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb... |
#include <bits/stdc++.h>
#define pb push_back
#define SZ(x) ((int)(x.size()))
#define FOR(i,s,n) for (ll i = (s); (i) < (n); ++i)
#define FORD(i,s,l) for (ll i = (s); (i) >= l; --i)
#define F first
#define S second
#define TC int __tc; cin >> __tc; FOR(case_num,1,__tc+1)
#define TEST(x,i) ((x)&(1ll<<(i)))
#define SET(x... | #include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define X first
#define Y second
#define nl '\n'
#define AC return 0
#define pb(a) push_back(a)
#define mst(a,b) memset(a, b, sizeof a)
#define rep(i,n) for(int i = 0; (i)<(n); i++)
#define rep1(i,n) for(int i = 1; (i)<=(n); i++)
#de... |
#include <bits/stdc++.h>
#define ll long long
#define V vector<long long>
#define VV vector<vector<long long>>
#define VVV vector<vector<vector<long long>>>
#define P pair<ll,ll>
#define rep(i,n) for(ll (i)=0;(i)<(n);++(i))
#define all(x) (x).begin(),(x).end()
using namespace std;
ll in(){
double a;
cin>>a;
... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/priority_queue.hpp>
//#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii... |
#include <bits/stdc++.h>
using namespace std;
#define fo(i, n) for(int i=0; i<n; i++)
#define Fo(i, k, n) for(int i=k; i<n; i++)
#define endl "\n"
#define ll long long
#define vi vector<int>
void A() {
int a, b, c;
cin >> a >> b >> c;
cout << (a - b + c);
}
void B() {
int n;
cin >> n;
long long m = 0, e = 0, c... | #include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
using namespace std;
int main(){
int N;
cin >> N;
vector<long> A(N);
long msum = 0;
double usum = 0;
long csum = 0;
for(int i=0; i < N; i++){
cin >> A[i];
msum += abs(A[i]);
... |
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
constexpr static int MAXK = 130;
void solve() {
int64_t n;
cin >> n;
... | #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>
#include <chrono>
... |
#include <bits/stdc++.h>
using namespace std;
int h,w;
string s[1003];
int f[2003];
int F(int x){
return f[x]==x?x:f[x]=F(f[x]);
}
int main(){
cin>>h>>w;
for(int i=0;i<h;i++)cin>>s[i];
s[0][0]=s[0][w-1]=s[h-1][0]=s[h-1][w-1]='#';
for(int i=0;i<h+w;i++)f[i]=i;
for(int i=0;i<h;i++)for(int j=0;j<w;j++)
if(s[i][j]=... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define x first
#define y second
typedef pair<int,int> pii;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x,T y){x<y?x=y:T();}
template <typename T> void chkmin(T &x,T y){x>y?x=y:T();}
te... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int a, b;
cin >> a >> b;
cout << max(0, 2 * a + 100 - b) << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define rep(i,a,b) for(auto i = a;i<b;i++)
#define ll long long
void solve(){
int a,b;
cin>>a>>b;
cout<<abs((2*a+100)-b)<<endl;
}
int main()
{
int T = 1;
// cin>>T;
// int i = 1;
while(T--){
// cout<<"Case #"<<i<<": ";
solve();
}
return 0;
} |
//ABC 188 A
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int a,b;
cin >> a >> b;
if(a > b){
if(b+3>a){
cout << "Yes";
}else{
cout << "No";
}
}else{
if(a+3>b){
co... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const string YES = "Yes";
const string NO = "No";
void solve(long long X, long long Y){
if (std::abs(X - Y) < 3) {
std::cout << YES << "\n";
} else {
std::cout << NO << "\n";
}
}
// Generated by 1.1.7.1 https://github.com... |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
#include<functional>
using namespace std;
#define rep(i,a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i,k,n) for(int i = k;i < (n);i++)
const int INF = 1e9;
template <class T> inline bool chmin(T &a, T b) {if (a > b) {a = b; return true;} return false;}
int main(void){
int n,sum = 0,ans = INF;
cin >> n;
... |
// #include<bits/stdc++.h>
// #include <array>
// #include <vector>
// #include <list>
// #include <forward_list>
// #include <deque>
// #include <queue>
// #include <stack>
// #include <bitset>
// #include <unordered_map>
// #include <map>
// #include <unordered_set>
// #include <set>
#include <algorithm>
// #incl... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n;
cin>>n;
ll x = 1;
ll mn = (1LL<<60);
ll i=0;
while(x<=n)
{
ll q = n/x;
ll rem=n%x;
mn=min(mn,q+rem+i);
i++;
x=x*2;
}
cout<<mn;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0,endrep=(n); i<endrep; ++i)
#define rep1(i,n) for(ll i=1,endrep=(n); i<=endrep; ++i)
#define revrep(i,n) for(ll i=(n)-1; i>=0; --i)
inline constexpr ll Inf = (1ULL << 60) -123456789;
#define fastio cin.tie(nullptr); ios_base:... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<set>
#include<vector>
#include<random>
#include<ctime>
#include<cstring>
#include<map>
#include<queue>
#define mp make_pair
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
using namespace std;
inline int read(){
int x=0,... |
#include <iostream>
#include <map>
constexpr int N = 300005;
int n;
std::map<long long, int> cnt;
int main() {
std::ios::sync_with_stdio(false), std::cin.tie(nullptr);
std::cin >> n;
long long now = 0;
++cnt[0];
for (int i = 1, x; i <= n; ++i) {
std::cin >> x;
if (i & 1) now += x;... | #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 <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <map>
#include <stdio.h>
#include <math.h>
#include <iomanip>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
#define rep(i,n) for(int i = 0; i < (n); i++)
#d... | //#pragma GCC optimize(2)
#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
#define DEBUG
#define INF 0x3f3f3f3f3f3f3f3f
#define mod 1000000007
#define PI 3.14159265358979323846
#define Base 23333333
//#define set unordered_set
//#define map unordered_map
#define int long long
#define LL long long... |
#include <bits/stdc++.h>
#define endl '\n'
#define fr first
#define sc second
#define all(v) v.begin(),v.end()
#define bout(x) cout << bitset<sizeof(x)*8>(x) << endl;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int dx[4] = {0, 1, 0, -1},... | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
int n;
cin >> n;
int a;
int ans = 0;
for(int i = 0;i < n;i++){
cin >> a;
if( a > 10){
ans = ans + a - 10;
}
}
cout << ans;
return 0;
}
|
/* بِسْمِ اللَّـهِ الرَّحْمَـٰنِ الرَّحِيمِ
( إِنِ الْحُكْمُ إِلَّا لِلَّهِ )
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const long double pi=acos(-1);
#define x fir... | #include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using ll = long long;
struct Edge
{
ll to;
ll cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
#define mp make_pair
#define REP(i, n) for (int i = 0; i < (n);... |
#pragma GCC optimize("Ofast")
#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 main(){
cin.tie(nullptr);
ios::sync_with_stdio(false)... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std... |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr);
string X; cin >> X;
long long M; cin >> M;
int length = X.length();
if (length == 1) {
cout << (X[0] - 48 <= M);
exit(0);
}
long long n = pow(M / (X[0] - 48), 1. / (length - 1)) - 1;
long long d = ... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = "... |
#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 per(i, n) for (int i = n - 1; i >= 0; i--)
#define pers(i, n, s) for (int i = n - 1; i >= s; i--)
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define pb push_back
#de... | /*Be patient && calm!
All our dreams can come true, if we have the courage to pursue them.
I fear not the man who has practiced 10,000 kicks once, but I fear the man who has practiced one kick 10,000 times.
Do not pray for an easy life, pray for the strength to endure a difficult one.
When something is important enough... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int sln = 0;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (i*j > n)
{
break;
}
for (int k = 1; k <=n;... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#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<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
template<class T>bool umax(T &a, const T &b) {if(a<b){a=b;return... |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define fio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define ull unsigned ll
#define ld long double
#define pb push_back
#define pf push_front
#define dll deque<ll>
#defin... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <utility>
#include <tuple>
#include <cmath>
#include <numeric>
#include <set>
#include <map>
#include <array>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
using ll = long long;
using std:... |
#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;
template <typename T> using orderedd_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// // find_by_order(k) returns iterato... | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define sz(x) ((int)x.size())
#define ln(x) ((int)x.length())
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define dbg(x) cou... |
#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_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define int long long int
#define endl "\n"
#define ... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<set>
//#include<bits/stdc++.h>
#define int long long
constexpr long long mod = 1000000007;
#define for0(i, n) for(int i = 0; i < (n); i++)
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define mp make_pair
#define all(x)... |
#pragma region
#include <bits/stdc++.h>
#define endl '\n'
#define fastIO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define prec fixed<<setprecision(9)
#define all(x) x.begin(),x.end()
using ll = long long;
using namespace std;
int mod = 998244353;
string to_string(string& s) {return '"'+s+... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#define rep(i,a,b) for(int i=(int)(a); i<(int)(b); ++i)
#define repeq(i,a,b) for(int i=(int)(a); i<=(int)(b); ++i)
#define rrep(i,a,b) for(int i=(int)(b)-1; i>=(int)(a); --i)
#define rrepeq(i,a,b) for(int i=(int)(b); i>... |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include <bits/stdc++.h>
using namespace std;
long long r1,c1,r2,c2;
int main() {
cin>>r1>>c1>>r2>>c2;
if (r1==r2&&c1==c2)
cout<<0;
else if (r1+c1==r2+c2||
r1-c1==r2-c2||
abs(r1-r2)+abs(c1-c2)<=3) {
cout<<1;
}
else if ((r1+c1)%2==(r2+c2)%2)
cout<<2;
else {
int r=r1,c=c1;
for (r1=r-3; r1<=r+3; ++r1)
... |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
t... | // Author: Pawan Raj
// Problem: E - Filters
// Contest: AtCoder - AtCoder Beginner Contest 196
// URL: https://atcoder.jp/contests/abc196/tasks/abc196_e
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define int long long
#define F(i, n) for (int i = 0; i < n; i++)
#define all(x)(x).... |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
#include <bitset>
#include <functional>
#include <cassert>
using namesp... |
// Problem: C - Compass Walking
// Contest: AtCoder - AtCoder Beginner Contest 198
// URL: https://atcoder.jp/contests/abc198/tasks/abc198_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
#define int long lon... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(a) (a).begin(), (a).end()
#define uniq(a) (a).erase(unique(all(a)), (a).end())
#define bit(n) (1LL << (n))
#define dump(a) cerr <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll ans = 0;
for (int i=0; i<n; i++) {
int x, y;
cin >> x >> y;
ans += (ll)(x+y) * (y-x+1) / 2;
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#define ll long long int
#define pll pair<ll,ll>
#define vpll vector< pll >
#define mpll map<ll,ll>
#define MOD 1000000007
#define all(v) v.begin(),v.end()
#define s(v) v.size()
#define test ll t;cin>>t;while(t--)
#define vec vector<ll>
#define read0(v,n) for(int i=0;i<n;i++)cin>>v[i];
#define r... | #include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main(){
double N,x[100010],a,U;
long long M;
int i;
cin >> N;
a=0;
M=0;
U=0;
for(i=1;i<=N;i++){
cin >> x[i];
if(x[i]<0){x[i]=-1*x[i];}
if(x[i]>a){a=x[i];}
}
for(i=1;i<=N;i++){M=M+x[i];
U=U+x[i]*x[i];}
cout << M << endl;
cout << setprecisio... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(int i=a;i<=b;i++)
inline ll r() {
ll x=0,f=1;
char c=getchar();
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return x*f;
}
#define d r()
ll n,m,k,ans,mod=1000000007;
ll qp(ll a,ll b,... | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int bp = b - a;
int p = bp;
int d = a % p ? p - a % p : 0;
while (d + p > bp) {
p--;
d = a % p ? p - a % p : 0;
}
cout << p << endl;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.