code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
// E - Rush Hour 2
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define vec vector
using vl = vec<ll>;
#define rep(i,e) for(int i=0;i<(e);++i)
using PR = pair<ll,int>;
// 本問用に修正
// dijkstra O(|E|log|V|)
int V;
vec<tuple<int,int,int,int>> E;
vec<vec<int>> G;
ll INF = 1e18;
vl dijkstra(int s){
vl ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pb push_back
#define ff first
#define ss second
// #define endl '\n'
#define mod 1000000007
int bin(int x, int n){
int res=1; x%=mod;
while(n){
if(n... |
#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>
using namespace std;
typedef long long lli;
int MOD = 998244353;
inline int add(const int a, const int b, const int mod = MOD) { return (a + b >= mod) ? (a + b - mod) : (a + b); }
inline void _add(int &a, const int b, const int mod = MOD) { a = add(a, b, mod); }
inline int sub(const int a, con... |
#include<bits/stdc++.h>
#include<bits/extc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using namespace __gnu_pbds;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t){
while(*sdbg != ',') { ce... | #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1000000000000000000;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
signed main(){
string S;
cin >> S;
int M;
cin >> M;
if( S ==... |
#include <bits/stdc++.h>
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define ALL(v) (v).begin(), (v).end()
#define LLA(v) (v).rbegin(), (v).rend()
#define SZ(v) (v).size()
#define INT(...) \
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using P = pair<int,int>;
const long long MO... |
#include <iostream>
using namespace std;
#define MAX_N 1000010
#define int long long
int a[MAX_N],b[MAX_N],c[MAX_N],n;
int a2[MAX_N],b2[MAX_N],c2[MAX_N];
signed main(){
cin >> n;
for(int i = 1;i <= n;i++){
cin >> a[i];
a2[a[i]]++;
}
for(int i = 1;i <= n;i++){
cin >> b[i];
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void)
{
int64_t N; cin >> N;
vector<int64_t> A(N);
rep(i, N) cin >> A.at(i);
vector<int64_t> B(N);
rep(i, N) cin >> B.at(i);
vector<int64_t> C(N);
rep(i, N) {
cin >> C.at(i);
... |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <stdio.h>
constexpr int buffer_size = 1 << 18;
int offset = buffer_size;
char buffer[1 << 18];
inline void buffer_in(void){ fread(buffer, 1, offset, stdin); }
inline void buffer_out(void){ fwrite(buffer, 1, offset, st... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define int long long int
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
#define setbits(x) __builtin_popcountll(x)
#define md (ll)1e9 + 7
#define inf ... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(lint i = 0; i < n; i++)
#define Rep(i,n) for(lint i = 1; i <= n; i++)
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define debug(a) { cerr << #a << ':' << a << endl; }
#define endl '\n'
#define fi fir... | #include<bits/stdc++.h>
using namespace std;
int numofbits5(long bits)
{
bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
return ... |
#include <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define eb emplace_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)
#defin... | #include <stdio.h>
#include <vector>
#include <queue>
int dist[500010];
int check[500010][20];
int x[20],y[20][20];
int c;
int func(int bit, int k)
{
if(bit==(1<<c)-1) return 0;
if(check[bit][k]) return check[bit][k];
int ans = 1234567890;
for(int i=1;i<=c;i++)
{
if((bit&(1<<(i-1)))==0)
{
int t = func(bi... |
#include<bits/stdc++.h>
using namespace std;
long long n,ans,a,b;
int main(){
// freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
scanf("%lld",&n);
while(n--){
scanf("%lld%lld",&a,&b);
ans+=(a+b)*(b-a+1)/2ll;
}
printf("%lld",ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define int long long
#define inf ((ll)1e18)
#define mod 1000000007
#define double long double
#define ull unsigned long long
#define vi vector<ll>
#define ppi ... |
#include<bits/stdc++.h>
using namespace std;
#define debug printf("%d %s\n",__LINE__,__FUNCTION__);fflush(stdout)
using ll=long long;using i64=long long;using db=double;
using u32=unsigned int;using u64=unsigned long long;using db=double;
using pii=pair<int,int>;using vi=vector<int>;
using qi=queue<int>;using pqi=prior... | #include <iostream>
#include <unordered_set>
#include <unordered_map>
#include <vector>
using namespace std;
int cnt = 0;
unordered_set<char> C;
string S1, S2, S3;
int main(void) {
int X, Y, Z;
cin >> X >> Y >> Z;
int P = 0;
while (X * P < Z * Y) {
P++;
}
P--;
cout << P;
cou... |
#include <iostream>
using namespace std;
int main(){
int A, B, W;
cin >> A >> B >> W;
W *= 1000;
int min = 0;
int max = 0;
int count = 0;
int a = A;
int b = B;
while(a <= W){
count++;
if(min == 0 && a <= W && W <= b){
min = count;
}
... | #include<iostream>
#include<bits/stdc++.h>
#define int long long int
using namespace std;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int a,b,c,d;cin>>a>>b>>c>>d;
c... |
#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define F first
#define S second
#define pss pair<string,string>
#define pcc pair<char,char>
#define pll pair<ll,ll>
#define pii pair<int,int>
#define piii pair<int,pii>
#define vi vector<int>
#define vii vector<pii>
#define pb push_back
#defin... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
/*-----for personal-----*/
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define repn(i,n) rep(i,0,n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a >... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, s, n) for(int i = (int)(s); i < (int)(... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <climits>
#include <queue>
#include <map>
using std::cout;
using std::cin;
using std::string;
using std::vector;
using std::endl;
void loadData(vector<long long>& data, int n) {
for (int i = 0; i < n; i++) {
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;i++)
const int max_n = 2e5+5;
int n, q, c[max_n], par[max_n], num[max_n];
map<int, int> mp[max_n];
void init() {
rep(i,1,n){
par[i] = i;
mp[i].insert({c[i], 1});
}
}
int ufind(int x){
if(par[x] == x) return x;
else {
int ... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#define INF 1010101010
#define INFLL 1010101010101010101
using namespace std;
int mod = 1000000007;
class Unio... |
#include<iostream>
#include<vector>
using i64 = int64_t;
template<i64 MOD>
struct modint{
i64 val;
modint():val(0){}
modint(i64 v):val(v<0?(-v)%MOD:v%MOD){}
operator i64(){return val;}
constexpr modint &operator += (modint other){this->val+=other.val;if(this->val>=MOD)this->val-=MOD;return *this;}
constexp... | //Relive your past life.
//Face your demons.
//The past is never dead,it is not even past.
//The memories are not only the key to the past but...also to the future.
//coded in Rusty Lake
#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<c... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define POPCOUNT(x) __builtin_popcount(x)
template <typename T> void chmin(T &a, const T &b) { a = min(... | /* Author: Tarun Kumar
E-mail: tarunkumar281200@gmail.com
" A code is like love,
it has created with clear intentions at the beginning,
but it can get complicated:) "
*/#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define test ll t;ci... |
#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>
using Int = long long; // clang-format off
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define RREP_(i, a_, b_, a, b, ...) for (Int i = Int(b) - 1, low##i = (a); i >= low##i; i--)
#def... |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll l;
int main()
{
cin >> l;
ll ans = 1;
int j = 1;
for(int i = l - 11; i <= l - 1; i ++)
{
ans *= i;
ans /= j++;
}
cout << ans << endl;
return 0;
//39916800
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ff first
#define VI vector <int>
#define ss second
#define pii pair<int, int>
#define pci pair<char, int>
#define mii map<int, int>
#define mci map<char, int>
#define setbits(n) __builtin_popcount(n)
#define fill(a,b) memse... |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; ++i)
using namespace std;
using LLONG = long long;
LLONG K, N, M;
vector<LLONG> As, Bs;
bool CanDo(const LLONG x)
{
vector<LLONG> Ls(K), Rs(K);
REP(i, K)
{
LLONG Ai = As[i];
Ls[i] = (M * Ai - x + N - 1) / N;
Rs[i] = (M * Ai + x) / N;
}
LLONG s... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define LETS_GET_SCHWIFTY ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ff first
#de... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define intarr(arr, n) ll arr[n]; for (ll i = 0; i < n; i++) cin >> arr[i]
#define inpvec(v,n) for(ll i=0;i<n... | #include<bits/stdc++.h>
using namespace std;
int main(){
double v,t,s,d;
cin>>v>>t>>s>>d;
if(d/v<t || d/v>s)
cout<<"Yes";
else
cout<<"No";
} |
#include <bits/stdc++.h>
//#include <atcoder/all>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bo... | #include<bits/stdc++.h>
using namespace std;
namespace Ruri{
#define ms(a,b) memset(a,b,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#... |
#ifdef _LOCAL
#include "local_include.hpp"
#else
#include <bits/stdc++.h>
using namespace std;
#endif
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define fto(i, s, e) for (int i = (s); i <= (e); ++i)
#define fto1(i, s, e) for (int i = (s); i < (e); ++i)
#define fdto(i, s, e) for (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
cin >> x >> y >> z;
if(y*z%x==0){
cout << (y*z)/x-1 << endl;
}else{
cout << (y*z)/x << endl;
}
}
|
#include<bits/stdc++.h>
#include<cmath>
#define tr(v,it) for(typeof(v.begin()) it = v.begin() ;it!=v.end();it++)
#define in(x) lli x; cin>>x
#define all(v) v.begin(),v.end()
#define for0(n) for(lli i=0;i<n;i++)
#define for1(n) for(lli i=1;i<=n;i++)
#define mod 1000000007
#define asc_ord_set tree< lli , null_type,less<l... | #include<bits/stdc++.h>
#include <algorithm>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define db double
#define ld long double
#define MOD 1000000007
#define inf (1LL << 62)
#define pi acos(-1.0)
#define si(a) scanf("%lld",&a)
#define sd(n) scanf("%lf", &n)
#define for1(i, stop)... |
#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int a, b, x, y;
cin >> a >> b >> x >> y;
if (a == b) cout << x << endl;
else if (a < b) {
if (2*x < y) cout << (b - a) * 2*x + x << endl;
else co... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
const ll inf = 1e18;
/*-------ここから--------*/
using _ll = long long;
using _pl = pair<_ll, _ll>;
void dijkstra(vector<vector<_pl>> &G, vector<_ll> &dist, _ll initial_pos) {
... |
#include <iostream>
#include <string>
#include <string.h>
#include <cstring>
#include <math.h>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cctype>
#include <utility>
#include <set>
#include <map>
#include <sstream>
#include <iterator>
#include <limits>
#includ... | #include <iostream>
#include <vector>
#include <deque>
#include <cstring>
#include <map>
#include <algorithm>
#include <stdlib.h>
#include <set>
#include <climits>
#include <string.h>
#include <unordered_map>
#include <queue>
#include <list>
#define int long long int
#define fastio ios_base::sync_with_stdio(false); cin... |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Pair vector<pair<ll,ll>>
#define vec vector <ll>
#define all(a) a.begin(),a.end()
#define mo 100000000... | #include<bits/stdc++.h>
#define N 200010
using namespace std;
namespace modular
{
const int mod=998244353;
inline int add(int x,int y){return x+y>=mod?x+y-mod:x+y;}
inline int dec(int x,int y){return x-y<0?x-y+mod:x-y;}
inline int mul(int x,int y){return 1ll*x*y%mod;}
}using namespace modular;
inline int read()... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define VEC(TYP... | #include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#... |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e18;
int n;
struct edge{ int to; long long int cost; };
vector<vector<edge>> graph;
vector<long long int> Dijkstra(int s){
priority_queue<pair<long long int, int>,
vector<pair<long long int, int>>,
greater<pair<long long int, int>>> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y)... |
#include<bits/stdc++.h>
using namespace std;
int read()
{
int i=0;char ch;
while(!isdigit(ch)) ch=getchar();
while(isdigit(ch)) {i=i*10+ch-'0';ch=getchar();}
return i;
}
int gcd(int x, int y) { return (y == 0 ? x : gcd(y, x % y)); }
int n, a[22222], b[1111], Ans = 0;
int main()
{
int n;
cin >> n;
for(int i = 1... | // Submitted by Sir GaLaHaD
#include <bits/stdc++.h>
#include <chrono>
/*--------------*/
#define test(t) for(cin>>t;t;--t)
#define rep(i,n) for(ll i=0;i<n;i++)
#define repr(i,k,n) for(ll i=k;i<n;i++)
#define repr_r(i,n) for(ll i= n-1;i>=0;i--)
/*--------------*/
#define fall(it,a) for(auto it =a.begin();it!=a.end();it... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h,w,x,y;
cin >> h >> w >> x >> y;
vector<vector<char>>grid(h,vector<char>(w));
for(int i = 0; i < h; ++i){
for(int j = 0; j < w; ++j){
cin >> grid[i][j];
}
}
x--;y--;
int j = x;
int ans = 0;
whil... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
/*bool ispalindrome(string s)
{
for(int i=0;i<s.length()/2;i++)
{
if(s[i]!=s[s.length()-i-1])
return false;
}
return true;
}//program to get nth ugly no.(having prime factores only 2 3 5)(O(n) time and O(n) sp... |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
... | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define SZ(x) ((int)x.size())
#define lowbit(x) x&-x
#define pb push_back
#define ALL(x) (x).begin(),(x).end()
#define UNI(x) sort(ALL(x)),x.resize(unique(ALL(x))-x.begin())
#define GETPOS(c,x) (lower_bound(ALL(c),x)-c.begin())
#define LEN(... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll x,y,a,b;
cin >> x >> y >> a >> b;
ll ans = 0;
y--;
for(ll i = 0; ; ++i){
ll c = i+(y-x)/b;
ans = max(ans,c);
if(x <= y/a)
x*=a;
else
break;
}
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i,l,r) for(int i = (l); i <= (r); ++i)
typedef long long ll;
void fast() {
ios::sync_with_stdio (0);
cin.tie (0); cout.tie (0);
}
const int N=600010;
int n, m,A[N<<1],c[N];
void upd(int u,int v){
for(; u<N;u+=u&-u) c[u]+=v;
}
int qry(in... | /*
start of cp 3.0BETA
https://codeforces.com/problemset/page/1?tags=1800-1800
extending-Beta-test-with-DS&ALGO:https://codeforces.com/problemset/page/1?tags=combine-tags-by-or%2Cdfs+and+similar%2Cdp%2Cshortest+paths%2C2000-2000
Math-Problem-Practice:https://codeforces.com/problemset?tags=math,1400-1500
DEAD PERSON COD... |
#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 h,w;
cin >> h >> w;
vector<string> s(110);
rep(i,h) cin >> s[i];
int cnt=0;
rep(i,h)rep(j,w){
if(s[i][j]=='.'&&s[i][j+1]=='.') cnt++;
if(s[i][j]==... | //#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#include <bits/stdc++.h>
#include<set>
using namespace std;
#define ll long long
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
#define si(x) int(x.size())
#define sum_all(a) ( accumulate ((a).begin(), (a).end(), 0ll))
#d... |
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define tr(it, a) for(auto it=a.begin();it!=a.end();it++)
#define dbg(x,y) cout<<(x)<<" --> "<<(y)<<endl
#define all(a) (a).begin(), (a).end()
#define rep(i,a,b) for(int i=a;i<b;i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
long long int n;
cin >>n;
unordered_set<long long int> s;
for(long long int i=2;i*i <= n;i++){
long long x = i * i;
while (x <= n){
s.insert(x);
x *= i;... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
int n;
int st[maxn], ed[maxn];
vector<int> vc[maxn];
bool check (int s, int t, int L)
{
if (s + L * 2 - 1 > 2 * n) return false;
for (int u = s; u < t; u++)
{
int v = u + L;
if (st[v] || ed[u]) return false;
if (... | #include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
# define rep(i,a,b) for(int i=(a); i<=(b); ++i)
inline int readint(){
int a = 0; char c = getchar(), f = 1;
for(; c<'0'||c>'9'; c=getchar())
if(c == '-') f = -f;
for(; '0'<=c&&c<='9'; c=getchar())
a = (a<<3)+(a<<1)... |
#include<iostream>
#include<algorithm>
using namespace std;
int N_MAX = 100000;
typedef long long ll;
typedef pair<ll,ll> P;
int main()
{
ll k,n,m,i,a,s=0;
ll b[N_MAX];
P r[N_MAX];
cin >> k >> n >> m;
for(i=0;i<k;i++){
cin >> a;
b[i]=a*m/n;
s+=b[i];
r[i].first=(a*m)%n;
r[i].second=i;
}
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define iter(v, i) for (__typeof__((v).begin()) i = (v).begin(); i != (v).end(); i++)
#define fast_io_without_cstdio ios_base::sync_with_stdio(false), cin.tie(NULL)
#define ... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
int N , M;
map<int,vector<pair<int,int>>> MAP;
int dp[1 << 18];
bool issafe(int mask){
int count = __builtin_popcount(mask);
for(auto itr: MAP[count]){
int cnt = 0;
for(int k = 0 ; k < N ; k ++){
if(mask&(1 << k) && (k... | #include <bits/stdc++.h>
using namespace std;
//#define MULTITEST
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define sqr(a) ((a) * (a))
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define fore(i, l, r) for(int i ... |
#include <bits/stdc++.h>
using namespace std;
/*
#include <atcoder/all>
using namespace atcoder;
*/
#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).... | #include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 100;
typedef long long LL;
#define debug(x) cout << "debug : " << x << endl;
#define int long long
#define u first
#define v second
struct NODE {
int x, y, id;
}a[N], b[N];
set<int>st;
bool cmp1(NODE& a, NODE& b) {
return a.x < b.x;
}
bool cmp2(... |
#include<bits/stdc++.h>
using namespace std;
#define ints(...) int __VA_ARGS__; vin(__VA_ARGS__)
#define dbls(...) double __VA_ARGS__; vin(__VA_ARGS__)
#define ulls(...) unsigned long long __VA_ARGS__; vin(__VA_ARGS__)
#define strs(...) string __VA_ARGS__; vin(__VA_ARGS__)
#define vifin(x, y) vi x(y); fin(x... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <map>
#include <sstream>
using namespace std;
void solve() {
long long n;
cin >> n;
int ans = 2;
for(int i = 2; i < n; i++) {
long long chk = ((i) * ((i) + 1LL)) / 2;
if(chk > n) break;
long long add = ((i - ... |
#include<bits/stdc++.h>
#define pb push_back
#define x first
#define y second
#define pdd pair<double,double>
#define pii pair<int,int>
#define pll pair<LL,LL>
#define mp make_pair
#define LL long long
#define ULL unsigned long long
#define sqr(x) ((x)*(x))
#define pi acosl(-1)
#define MEM(x) memset(x,0,sizeof(x))
#def... | #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;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#de... |
#include<bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')';}
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_... | #include<cstdio>
#include<cstdlib>
#include<vector>
#include<queue>
using namespace std;
#define inf 200005
#define INF 0x3f3f3f3f
int n;
int color[inf][2];
long long int dp[inf][2]; //dp[i][0] is the minimum steps after we get every i-color ball from the left, dp[i][1] is the minimum steps after we get every i-color ... |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#define int long long
#define mid (l+r>>1)
using namespace std;
int read(){
int x = 1,a = 0;char ch = getchar();
while (ch < '0'||ch > '9'){if (ch == '-') x = -1;ch = getchar();}
while (ch >= '0'&&ch <= '9'){a = a*10+ch-'0';ch = getchar();... | #include <iostream>
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
string p[520];
signed main(){
int mx = 0;
int h,w;
cin >> h >> w;
int ans = 1;
for(int i = 0;i < h;i++){
cin >> p[i];
}
bool able = true;
for(int i = 0;i < w;i++){
int sti = i;
int stj = 0;
bool... |
#include <iostream>
#include <vector>
#include <utility>
#include <tuple>
#include <algorithm>
#include <queue>
#include <cmath>
using namespace std;
using pii = pair<int,int>;
pii make_area(vector<vector<bool> >& map,pii cur,int req_area){
pii next = cur;
int x = cur.first; int y = cur.second;
int tmpx = ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define chmin(x,y) x = min((x),(y));
#define chmax(x,y) x = max((x),(y));
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
const int INF = 1e9;
const long long LINF = 1e17;
const int MOD = 1... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N, M;
cin >> N >> M;
vector<ll> L(N), R(N);
if ( N == 1 ) {
if ( M != 0 ) return -1;
cout << 1 << " " << 2 << "\n";
return 0;
}
if ( M > N-2 ) return -1;
if ( M < 0 ) return -1;
f... | #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;
#define int long long
#define S second
#define F first
#define pb push_back
#define all(c) (c).begin(),(c).end(... |
// 2021
#include <bits/stdc++.h>
#define rep(i, x, y) for(register int i = x; i < y; i++)
#define REP(i, x, y) for(register int i = x; i <= y; i++)
#define per(i, x, y) for(register int i = x; i > y; i--)
#define PER(i, x, y) for(register int i = x; i >= y; i--)
#define repl(i, x, y) for(register long long i = x; i < y... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vc = vector<T>;
template<class T> using vvc = vc<vc<T>>;
template<class T> using vvvc = vc<vvc<T>>;
template<class T> using vvvvc = vvc<vvc<T>>;
template<class T> using PQ = priority_queue<T>;
template<class T> using invPQ = pri... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
const int N = 2e5 + 5;
const int INF = 2e9;
const ll LINF = 9e18;
struct query {
int T, X, Y;
};
int n, m, q;
int a[N], b[N];
ll tree[4][N << 2];
// 0 = Sum_A, 1 = Sum_B, 2 = Freq_A, 3 = Freq_B
void update(int... | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<t... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int Q;
cin>>Q;
string ans="atcoder";
while(Q--){
string S;
cin>>S;
string T=S;
int N=S.size();
int mn=N*N;
sort(T.rbegin(),T.rend());
if(T<=ans){
puts("-1");
goto home;
}
if(S>ans){
... |
// Problem : B - Permutation Check
// Contest : AtCoder - AtCoder Beginner Contest 205
// URL : https://atcoder.jp/contests/abc205/tasks/abc205_b
// 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... |
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
using namespace std;
#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 prl(a) cout << (a) << endl
#define allrange(a) a.begin(),a.end()
bool solve_translated(vector<pair<i... | #include <bits/stdc++.h>
using namespace std;
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
typedef long long ll;
typedef unsigned long long ull;
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define forr(i, a, b) for(ll i = (a); i < (ll) (b); i++)
#define forn(i, n) forr(i, 0, ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define all(c) ((c).begin()), ((c).end())
#define sz(x) ((int)(x).size())
#ifdef LOCAL
#include <print.h>
#else
#define trace(...)
#endif
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); // Remove in interact... | #include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
using namespace std;
int main(void){
long long n,i;
cin >> n;
vector<long long> a;
a.resize(n+1);
a.assign(n+1,-1);
a[1] = 1;
for(i=2;i<=n;i++) {
if(a[i] == -1) {
long long j;
for(j=i*2;j<=n;j+=i) a... |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <unordered_map>... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include<bits/stdc++.h>
using namespace std;
#define rep(i,s,t) for(ll i = (ll)(s); i < (ll)(t); i++)
#define rrep(i,s,t) for(ll i = (ll)(s-1);(ll)(t) <= i; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> Pll;
typede... |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
int main(void)
{
int N = 0;
int x[100000];
unsigned long int M = 0;
double E = 0;
double u = 0;
unsigned long int C = 0;
int i;
scanf("%d", &N);
for (i = 0; i < N; i++)
{
scanf("%d", x + i);
}
... | #include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
using namespace std;
int main()
{
long long n, man = 0, yuk = 0, tye = 0; cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
int b = 0;
cin>>b;
if(b<=0) b = -b;
a.at(i) = b;
}
for(lo... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,n) for (int i=a;i<n;i++)
const int MOD = 1e9+7;
void solve() {
int n; cin >> n;
vector<int> v(n);
rep(i,0,n) {
cin >> v[i];
}
sort(v.begin(),v.end());
if(n%2==1) {
cout << "Second" << endl;
}
else {
bool b = true;
f... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <string>
#include <sstream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <stack>
#include <cstdio>
#includ... |
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, m;
cin >> ... | #include<bits/stdc++.h>
using namespace std ;
# define all(v) (v).begin() , (v).end()
# define allrev(v) (v).rbegin() , (v).rend()
# define allcomp(v) (v).begin() , (v).end() , comp
# define ll long long
# define line cout << "\n" ;
# define fast ios_base :: sync_with_stdio ( false ) ; cin.tie ( 0 ) ;
# define pii ... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
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) {
... |
//Hello,I'm Mitsubachi.
//This is a test. This code is made by my friend's macbook.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
int main(){
int n;
cin>>n;
ll a[n],b[n];
ll ans=0;
for(int i=0;i<n;i++){
cin>>a[i];
ans+=a[i];
}
for(int i=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... |
#include<set>
#include<map>
#include<stack>
#include<ctime>
#include<cmath>
#include<queue>
#include<cstdio>
#include<vector>
#include<climits>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define LL long long
using namespace std;
int read(){
bool f=0;int x=0;char c=getchar();
while(c<'0... | #include <bits/stdc++.h>
using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, k;
std::cin >> n >> k;
std::vector<std::vector<int>> e(n);
for (int i = 0; i < n - 1; i++) {
int u, v;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
float a,b;
float c;
cin >> a >> b;
c=(b/100)*a;
cout << c << endl;
} | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto e : v) os << e << ' '; return os; }
template <typename T> ostream &operator<<(ostream &os, co... |
#include <bits/stdc++.h>
using namespace std;
long long next(long long x)
{
string s1 = to_string(x);
sort(s1.begin(), s1.end());
string s2 = s1;
reverse(s2.begin(), s2.end());
return stoll(s2) - stoll(s1);
}
long long rec(long long n, int i, int k)
{
if (i == k)
{
return n;
}
return rec(next(n)... | #include<iostream>
#include<sstream>
using namespace std;
int main() {
long long n,k;
cin >> n >> k;
while(k--){
if(n % 200 == 0){
n/=200;
}else{
string str = "";
stringstream ss;
ss << n;
ss >> str;
str += "200";
stringstream ss1;
ss1 << str;
ss1 >> n;
}
}
cout << n;
return 0;
... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
#define V vector
#de... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define mp make_pair
#define ld long double
typedef pair<int, int> pii;
typedef priority_queue<int, vector<int>, greater<int> > small_heap;
typedef priority_queue<int> big_heap;
const int N = 1e6 + 10... |
#include <bits/stdc++.h>
using namespace std;
#define rep(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 all(v) v.begin(), v.end()
typedef long long ll;
template <class T> using V = vector<T>;
template <class T> using VV = vector... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define Sort(a) sort(a.begin(),s.end())
int main(){
int n;
int m=5;
cin >> n;
vector<vector<int>> s(n,vector<int>(m));
rep(i,n)rep(j,m) cin >> s[i][j];
int l=0; int r=10010010... |
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using... |
/**
*
* created: 16.01.2021 21:01:06
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i<n;i++)
typedef pair<int,int> P;
int main() {
ll n,t=0,ma;
cin >> n;
vector <unsigned long long>a(n),b(n),c(n);
rep(i,n){
cin >> a.at(i);
}
rep(i,n){
c... |
/*
／＞ フ
| _ _|
／`ミ _x 彡
/ |
/ ヽ ?
／￣| | | |
| (￣ヽ＿_ヽ_)_)
＼二つ
*/
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pf push_front
#define F first
#define S s... | #include <bits/stdc++.h>
using namespace std;
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(NULL);}
#define f first
#define s second
#define getunique(v) {sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());}
typedef long long ll;
typedef long double lld;
typedef unsigned l... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b ,c;
cin >> a >> b >> c;
cout << 7-a+7-b+7-c << endl;
return 0;
} | #include <bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ll long long
#define endl "\n"
#define Sara ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const long long mod=1e6+3;
const double PI=acos(-1);
int main()
{
Sara
//freopen("input.txt","r",stdin);
//freopen("output.... |
#include<bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
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';
if(... | #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>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll H[200005];
ll W[200005];
ll SUM[200005];
int main() {
ll N, M;
cin >> N >> ... |
#include <iostream>
#define rep(i,n) for(int i=0;i<n;i++)
#define N 400000
using namespace std;
int a[400001], n, f[N+1], g[N+1], res;
char c;
int main(){
cin >> n;
rep(i,n){
cin>> c;
if(c=='W')a[i] = 0;
else if(c=='B')a[i]=1;
else a[i] = 2;
}
f[0] = 0;
g[0] = 1;... | #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 = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<int> x(n), y(n);
rep(i, n) cin >... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 20010;
ll n, m, k;
int a[N];
vector<int> path;
vector<int> res1, res2;
vector<int> keep[N];
bool success=0;
void dfs(int u,int sum)
{
sum %= 200;
if(success) return ;
if(u == n + 1)
{
if(keep[sum].size() && pat... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define ... |
# include<bits/stdc++.h>
using namespace std;
# define l long long
# define db double
# define rep(i,a,b) for(l i=a;i<b;i++)
# define vi vector<l>
# define vvi vector<vi>
# define vsi vector<set<l> >
# define pb push_back
# define mp make_pair
# define ss second
# define ff first
# define pii pair<l,l>
# define trvi(... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n,ju=10000000000;string t;
cin>>n>>t;
if(n==1&&t[0]=='1'){
cout<<2*ju<<endl;return 0;
}
if(n==1&&t[0]=='0'){
cout<<ju<<endl;return 0;
}
if(n==2){
if((t[0]=='1'&&t[1]=='1')||(t[0]=='1'&&t[1]=='0')){
cout<<ju<<endl;return... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
template<class T> bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, T b) { if (a > b... | //
// Created by ideal on 2021/03/06.
//
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> A(n);
for(auto && i:A) cin >> i;
ll aa=0, sa=0;
for(ll a:A){
aa += a*a;
sa += a;
}
cout << n*aa-sa*sa << endl;
} |
//I'll always miss you like a darling.
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LD long double
#define ull unsigned long long
#define x first
#define y second
#define pb push_back
#define pf push_front
#define mp make_pair
#define Pair pair<int,int>
#define pLL pair<LL,LL>
#define pii... | #include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define FF first.first
#define FS first.second
#define pb push_back
using namespace std;
ll l, r, ans, dp[(1<<20)], a[73], A[]={2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71};
int main(){
cin>>l>>r;
... |
#include <iostream>
using namespace std;
int main() {
//入力
int n;
cin>>n;
int s[1000][2]={};
for(int i=0;i<n;i++){
for(int j=0;j<2;j++){
cin>>s[i][j];
}
}
//判定
long long a=10*10*10*10*10,b=0,c=10*10*10*10*10,d=0;
for(int i=0;i<n;i++){
for(int j=0;j<2;j++){
if(j==0){
if(s[i][0]<=a){
a=s[i][... | #pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << ... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
if(n % 2 == 0) cout<<"White"<<endl;
else cout<<"Black"<<endl;
} | //Codeforcesで128bit整数を使いたいとき
//→__int128_tを使う&GNU C++17 (64)で提出する
//インクルードなど
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//イテレーション
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using ll = long long;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF (int)1e9
#define LLINF (long long)1e12
#define MOD (int... | #include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <stack>
#include <queue>
#include <cassert>
#include <iomanip>
using namespace std;
typedef long long ll;
#d... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 60
#define INF 1000000005
#define INFLL (ll)1000000000000000005
#define PI 3.1415926535897
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define IN(a) cin>>(a)
#define OUT(a) cout<<(a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn(i,x,n) for(int i = x;i <= n;++i)
#define forr(i,x,n) for(int i = n;i >= x;--i)
#define Angel_Dust ios::sync_with_stdio(0);cin.tie(0)
const int N = 455;
int ans[N],top;
bool st[N];
int main()
{
int n,k;scanf("%d%d",&n,&k);
forn(i,1,100 ... |
/*Jai Shree Ram*/
// Never Give Up
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi ... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define int long long
const int Mod = 1e9 + 7;
const int N = 1005;
char c[5];
int power[N+5],f[N+5],n;
signed main () {
cin>>n>>c[1]>>c[2]>>c[3]>>c[4];
f[0] = 1,f[1] = 1;
for(int i = 2;i <= 1005;i++) {
f[i] = (f[i-1] + f[i-2])%Mod;
}
... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(nullptr);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define AT... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <map>
using namespace std;
#define debug(x) cerr << #x << '=' << x << '\n'
#define rep(i, b, n) for (int i = b; i <= n; i++)
const int N = 512345;
int mp[2123][2123], h, w, n, m;
pair<int, int> bb[N], blk[N];
bool... |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n, x;
vector<int> ans;
cin >> n >> x;
for(int i = 0; i < n; i++){
int a;
cin >> a;
if(a != x){
ans.push_back(a);
}
}
if(ans.empty()){
cout << "\n";
return 0;
... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set... |
#include <bits/stdc++.h>
using namespace std;
template<typename T, typename U>
using vp = vector<pair<T,U>>;
template<typename T>
using pque = priority_queue<T>;
template<typename T>
using lpque = priority_queue<T,vector<T>,greater<T>>;
using ll = long long;
using pint = pair<int,int>;
using pll = pair<ll,ll>;
using ... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define ll long long
#define pb push_back
#define mem(x, y) memset(& x, y, sizeof(x))
const int n0 = 5e5 + 123;
int n;
ll p[n0];
string s, t;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n >>... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,dp[100][100];
double cnt,ans;
string s[100],t;
int main(void){
cin>>n;
for(int i=0;i<n;i++){
cin>>s[i];
for(int j=0;j<n;j++){
if(i==j)dp[i][j]=0;
else if(s[i][j]=='0')dp[i][j]=1e9;
else d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define pp pair<ll,ll>
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
constexpr int inf=1000001000;
constexpr ll INF=2e18;
constexpr ll mod=1000000007;
// ll MOD=998244353;
... |
//GIVE ME AC!!!!!!!!!!!!!!!!!
//#pragma GCC target("avx")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define floatset() fixed<<setprecision(15)
#define all(n) n.begin(),n.end()
#define rall(n) n.rbegin(),n.rend()
#define rep(i,... | #pragma region
#ifdef LOCAL
#include "pch.h"
#else
#include <bits/stdc++.h>
#endif
// debug
template<typename ... Types>
void __read(Types& ... args) {
((std::cin >> args), ...);
}
#define read(type, ...) type __VA_ARGS__; __read(__VA_ARGS__)
template <typename T>
std::istream &operator>>(std::istream &in, std::ve... |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define square(x) pow(x,2.0)
#define sqrt(x) pow(x,0.5)
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
#define max_queue(x) priority_queue... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n) ;i++)
using namespace std;
using p=pair<int,int>;
typedef long long ll;
int main() {
int t;
cin >> t;
ll ans =0;
rep(i,t){
ll l,r;
cin >> l >> r;
ll sub = r-l;
if(sub < l){
cout << 0 << endl;
}
else{
ll numbe... |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define _GLIBCXX_DEBUG
#define reps(i, a, n) for (lint i = a; i < (lint)(n); i++)
#define rep(i, n) reps(i, 0, n)
#define repd(i, n) for (lint i = n - 1; i >= 0; i--)
#define INF (int)1e9
#define LINF (lint)1e12
#define pb push_back
#define mp make_p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve()
{
int c;
cin >> c;
cout << c - 1 << "\n";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int t = 1;
//cin >> t;
while (t--)
{
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
// #define int long long
#define mod 1000000007
#define all(x) x.begin() , x.end()
#define ld long double
const long long inf = 1e18 + 1LL;
void solve();
int32_t main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int t = 1;
//c... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define all(x) begin(x), end(x)
#define sz(x) (int) x.size()
const int PRIME = 1e9 + 7;
ll powerMod(ll a, ll b, int mod){
ll result = 1;
a %= mod;
while(b){
if(b & 1){
result = result * a % mod;
... |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
ll mod = 1000000007;
const double PI = 3.141592653589793238460;
const int INF = 1e9+5;
const ll lINF = 1e16+1;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<ll> isprime = {2,3,5,7,... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
}
ll mdc(ll a, ll b) {
return (a * b) / gcd(a, b);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n; cin >> n;
ll ans = 2;
for(int i = 2; i <= n;... |
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
template<class T> using indexed_set=tree<T,null_type,less<T>,rb_tree_tag,... | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
#include<bits/stdc++.h>
//#include <unordered_set>
//#include <unordered_map>
using namespace std;
const double pi = 3.141592653689793238460;
const long long inf = 0x3f3f3f3f;
const int N = 2e5 + 5;
const int pr = 31;
#define ll long l... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18;
#define D long double
#define NeedForSpeed ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
const int MOD = 1000000007;
#define fi first
#define se second
#define endl '\n'
// random_device... | #define MOD_TYPE 1
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#if 0
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
#endif
#if 0
#pragma GCC target(... |
#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;
typedef long long ll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef map<int,int> mi... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
int answer;
if (x == y) answer = x;
else if (x == 0 && y == 1) answer = 2;
else if (x == 1 && y == 0) answer = 2;
else if (x == 1 && y == 2) answer = 0;
else if (x == 2 && y == 1) answer = 0;
else if (x == 0 && y == 2... |
#include<bits/stdc++.h>
#define int long long
#define N 300005
using namespace std;
int n,ans,a[N],b[N],tot;
signed main(){
cin>>n,ans=n*(n-1)/2;
for(int i=1;i<=n;i++)cin>>a[i];
sort(a+1,a+1+n);
for(int i=1;i<=n;i++){
if(a[i]==a[i-1])b[tot]++;
else b[++tot]=1;
}
for(int i=1;i<=tot;i++)ans-=b[i]*(b[i]-1)/2;
c... | //Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for (int i = 0; i < (int)(n) ; i++)
#define rep2(i,a,b) for (int i = (a); i < (int)(b); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define ENDL '\n'
#define pb push_back
#define SIZE(a) (int)(a... | #include <bits/stdc++.h>
using namespace std;
int main()
{
size_t N;
cin >> N;
vector<long long> X(N);
vector<size_t> C(N);
vector<vector<long long>> ball(N + 1);
for (size_t i = 0; i < N; i++)
{
cin >> X[i] >> C[i];
ball[C[i]].push_back(X[i]);
}
// dp[i] := (the m... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
for (int i=0;i<n;i++){
printf("%d %d\n",(i*2)%n+1,(i*2+1)%n+1);
}
return 0;
} | #include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#include<ctime>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<bitset>
#define sqr(x) ((x)*(x))
#define fz1(i,n) for ((i)=1;(i)<=(n);(i)++)
#define fd1(i... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (... | #include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#... |
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define MAXK 100010
long long k;
char s[6], t[6];
long long qt[10];
long long pow10[6];
void create_pow10() {
long long i;
pow10[0]=1;
for (i=1; i<=5; i++) {
pow10[i]=pow10[i-1]*10;
}
}
bool go() {
long long aux[10];... | #include <bits/stdc++.h>
#include <cstring>
using namespace std;
typedef long long ll;
#define F0R(i, x, y) for (int i = x; i < y; i++)
#define FOR(i, n) F0R(i, 0, n)
#define F0RD(i, x, y) for (int i = y - 1; i >= x; i--)
#define FORD(i, n) F0RD(i, 0, n)
#define F first
#define S second
int mp(int x, int c) {
... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define lui long unsigned int
const int N =3e5+5;
const int MOD = 1e9+7;
const ll M = 1e18;
ll qpow(ll a, ll b... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define MOD 1000000007
#define... | // solution for agc048b
// author : lynmisakura
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
//cout << fixed << setprecision(20);
int n;cin >> n;
vector<long long> a(n),b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
... |
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("avx2")
// 293206GT
#include <array>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <climits>
#include <limits>
#include <set>
#include <map>
#include <queue>
//#include <unordered_map>
//#include... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mod 1000000007
//#define lld long double
#define mii map<int, int>
#define mci map<char, int>
#define msi map<string, int>
#de... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t,n;
int main(){
cin>>t>>n;
ll ans=(n*100+t-1)/t+n-1;
cout<<ans;
} | //----------BHAVIK DIWANI(PICT_COMP)---------------
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define test ll t; cin>>t; while(t--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct node {
int v, p;
} a[1003];
int main() {
int n, x;
cin >> n >> x;
for (int i = 0; i < n; i++) cin >> a[i].v >> a[i].p;
int intake = 0;
for (int i = 0; i < n; i++) {
intake = intake + a[i].v * a[i].p;
if (intake > x * 100) {
... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... |
#include <iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<utility>
#include<cstdio>
#include<cstring>
#include<stack>
#include<queue>
#include<map>
#include<iomanip>
#define vii vector< pair<int,int> >
#define vi vector<int>
#define INF 10... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define PI 3.141592653589
#define setbits(n) __builtin_popcountll(n)
#define mkunique(a) a.resiz... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N, W;
cin >> N >> W;
vector<ll> C(200000);
ll total = 0;
int flag = 0;
for(ll i = 0; i < 200000; i++){
C.at(i) = 0;
}
ll S, T, P;
for(ll i = 0; i < N; i++){
cin >> S >> T >> P;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (ll i = init; i < (n); i++)
#define repd(i, n, init) for (ll i = (n); i >= init; i--)
#define repm(i, m) for (auto i = m.begin(); i != m.end(); ... |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
co... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long n;
cin >> n;
long long ans = 0;
for(long long i = 1; i * i < n*2+1; i++){
if (n % i == 0){
if (i % 2 == 1) ans++;
}
if (2 * n % i == 0)
if (n % i != 0)
ans++;
}... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.