code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int i,n,ed=0,md=0;
long double dd;
cin>>n;
long long int a[n];
for(i=0;i<n;i++){
cin>>a[i];
if(a[i]<0) a[i]=-a[i];
md+=a[i];
ed+=a[i]*a[i];
}
sort(a,a+n);
cout<<md<<endl;
dd=sqrt(ed);
cout<<fixed<<setprecision(15);
cout<<dd... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
ll sum(const vector<ll>& vec) {
ll ans = 0;
for (ll v: vec) ans += v;
return ans;
}
void solve(long long N, std::vector<long long> x){
vect... |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<LL, LL> II;
typedef pair<LL, II> III;
s... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include <functional>
#include <iomanip>
#include<cmath>
#include<deque>
#include <math.h>
#include <queue>
#include <sstream>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
using namespac... |
//Starting in the name of Lord
#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define Yes cout<<"Yes"<<endl
#define yes cout<<"yes"<<endl
#define No cout<<"No"<<endl
#define NO cout<<"NO"<<endl
#define no cout<<"no"<<endl
#define YES cout<<"YES"<<endl
#define asort(x) sort((x).begin(),(x).e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int M, H;
cin >> M >> H;
cout << ((H % M == 0) ? "Yes" : "No") << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> Pair;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c... | #include<iostream>
using namespace std;
int main(){
int x,n,i;
char v;
cin >> n >> x;
for(i=1;i<=n;i++){
cin >> v;
if(v=='x'&&x>0)
x--;
else if(v=='o')
x++;
}
cout << x;
}
|
#include<cmath>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<cstring>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<deque>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<string>
#include<sstream>
#i... | #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 v[50];
//int w[50];
int x[50];
int y[50];//クエリ作業用
int main(){
int n,m,q;
cin>>n>>m>>q;
vector<P>vec;
rep(i,n){
int w,v;
cin>>w>>v;
vec.push_back({v,w});
}
sort... |
/// BISMILLA HIRRAHMANIR RAHIM
/// ALLAH IS ALMIGHTY
/// ALLAH IS MUCH MORE CREATIVE
#include<bits/stdc++.h>
#define faster ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define ff first... | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// @@ !! LIM()
int main(/* int argc, char *argv[] */) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(20);
ll N; cin >> N;
vector<ll> A... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
struct UnionFind {
vector<int> par, siz;
UnionFind(int n) ... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
struct Edge {
int to, nxt;
} E[N << 1];
int n, m, cnt, head[N], a[N], b[N];
long long sum;
bool vis[N];
void addedg(int u, int v) {
E[++cnt] = (Edge){v, head[u]};
head[u] = cnt;
}
void dfs(int u) {
vis[u] = true;
sum += a[u] - b[u];
for (int i =... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... | ///Bismillahir Rahmanir Rahim
/*
Author: Tanzin Ahammad
*/
#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
#... |
//{{{
#include<algorithm>
#include<cmath>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<random>
#include<set>
#include<sstream>
#include<sys/time.h>
#include<unordered_map>
#include<unordered_set>
#include<vector>
using ll = long long;
en... | //#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
typedef long long ll; typedef vector<int> V... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f;
const double pi=3.1415926535897932384626;
inline ll read(){
ll x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<... | #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 ll long long
#define ff first
#define ss second
#define INF 1000000000000000000
#define pb push_back
#define vl vector<ll>
#define pll pair<ll,ll>
#define vll v... |
#include <iostream>
#define MOD 1000000007
int main()
{
int n = 0;
long long t = 0, a = 0, b = 0;
std::cin >> n;
for(int i = 0; i < n; ++i)
{
long long result = 0, x1 = 0, x2 = 0, x3 = 0, x4 = 0;
long long tmp1 = 0, tmp2 = 0;
std::cin >> t >> a >> b;
if((t - a - b) >= 0)
{
x4 = ((t... | /*ॐ नमो भगवते वासुदेवाय नमः*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9 + 7;
const double pi = 3.14159265359;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int m;
cin>>m;
vector<int> arr(20,0);
for(int i=0;i<n;i++){
string s;
cin>>s;
int size=0;
for(int j=0;j<m;j++){
if(s[j]=='1'){
size++;
}
}
arr[size... | #include <iostream>
using namespace std;
typedef long long ll;
int main()
{
int n, m;
cin >> n >> m;
string s[100005];
for(int i = 0; i < n; i++) cin >> s[i];
ll c[2]{0};
for(int i = 0; i < n; i++){
int d = 0;
for(int j = 0; j < m; j++) d += s[i][j] - '0';
c[d % 2]++;
... |
#include <iostream>
#include <vector>
#include <stdexcept>
#include <string>
#include <strstream>
#include <sstream>
int main(){
int N;
scanf("%d\n",&N);
int num=0;
for (int i=1; i<=N; i++) {
std::string S;
std::string V;
S = std::to_string(i);
std::stringstream ss;
... |
//#include <atcoder/maxflow.hpp>
#include <memory>
#include <iostream>
#include <map>
#include <list>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <... |
/*
** author : Dhiraj Govindvira
** date : 19 June 2021 ~ Saturday
** time : 05:32:38 PM
*/
#include <bits/stdc++.h>
using namespace std;
#ifdef DHIRAJ
#include "D:/dhiraj/Programming/debug.h"
#else
#define dbg(...) 1
#define cerr if(0) cerr
#endif
using ll = long long int;
#define endl '\n'... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5+10;
int a[N];
void solve()
{
int n;
cin>>n;
int ans = 0 ;
for(int i=1;i<=N;i++)
{
a[i] =i;
a[i]+=a[i-1];
if(a[i]>=n)
{
cout<<i<<endl;
return ;
}
}
}
int main()
{
ios::s... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define bs binary_search
#define fi first
#define se second
using pii = pair<int,int>;
using ll = long long;
const int maxn = 4e5;
const int inf = 1e9;
const int mod = 1e9+7;
void open_io() { freopen("in","... | #pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using Prior = std::priority_queue<T>;
template<typename T>
using prior = std::priority_queue<T, vector<T>, greater<T>>;
#define ... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int 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... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) <<... |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<N;i++)
#define rep2(i,N) for(int i=1;i<=N;i++)
using namespace std;
long long INF=1e18;
long long mod=1e9+7;
#define debug 0
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long int b,c;
cin>>b>>c;
if(c==1 && b!=0)
cout<<"2\n";
else if(c<=2*b)
cout<<2*c-1<<"\n";
else
{
if(b>0)
cout<<c+2*b-1<<"\n";
else
cout<<c+abs(b)*2<<"\n";
}
}
|
#include<bits/stdc++.h>
#define FULL(x,y) memset(x,y,sizeof(x))
#define ll long long
#define SZ(x) (int)x.size()
#define pb push_back
using namespace std;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (... | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int ... |
#define _GLIBCXX_DEBUG
#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(V) V.begin(),V.end()
#define pi 3.1415926535897932384626
#define fi fixed<<setprecision(10)
#define MOD 1000000007
#define ll long long
using namespace st... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2 * 100010;
int a[N];
int presum[N];
bool cmp(int &a,int &b){
return a > b;
}
signed main(){
#ifndef ONLINE_JUDGE
freopen("sumofdiff.txt","r",stdin);
#endif
ios::sync_with_stdio(false);
int n;cin >> n;
for(int i = 1 ; i <= n ; ... |
//2021-04-18 12:10:11
/*折半枚舉*/
#include <bits/stdc++.h>
using namespace std;
int n,a[100],id[2];
long long t;
vector<long long>re[2];//re[0]是小的那部分枚舉出來的東東，re[1]是大的那部分枚舉出來的東東
bool d[100]={0};
int target,from;//紀錄正在枚舉的頭和尾
bool big=false;//現在是否在枚舉大的
void f(int id){
if(id==target){
long long ans=0;
f... | #include<cstdio>
#include<algorithm>
#define Q 200005
using namespace std;
#define gc() getchar()
inline bool ig(char c){return c>='0'&&c<='9';}
inline void read(int &oi){char c;int f=1,res=0;while(c=gc(),(!ig(c))&&c^'-');c^'-'?res=(c^48):f=-1;while(c=gc(),ig(c))res=res*10+(c^48);oi=f*res;}
inline void print(int oi){if... |
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define ff first
#define ss second
#define mkpr make_pair
#define ins insert
#define sb substr
#define con continue
#define ub upper_bo... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a,long long b){
if(a<b)swap(a,b);
if(b==0)return a;
return gcd(b,a%b);
}
int main(){
int n;
scanf("%d",&n);
long long arr[n];
for(int i=0;i<n;i++)scanf("%lld",&arr[i]);
long long p[]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
long long an... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long double X, Y, R;
cin >> X >> Y >> R;
X = abs(X) + abs(ceil(R));
Y = abs(Y) + abs(ceil(R));
long long answer = 0;
for(long long x = ceil(X - R); x <= X + R; ++x){
long double dx = abs(X - x);
long double dy = sqrt(R ... | #include<bits/stdc++.h>
#define For(a,b,c) for(int a=b;a<=c;++a)
#define Dor(a,b,c) for(int a=b;a>=c;--a)
#define CC(_...) fprintf(stderr,_)
using namespace std;
typedef long long LL;
enum{N=200007};
int n,A[N],C[N];
map<int,vector<int> > G;
void upd(int u,int k=-1) {
for(;u<=n;u+=u&-u) C[u]+=k;
}
int sum(int u) {
in... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0; i<n; ++i)
#define rep1(i,n) for(ll i=1; i<=n; ++i)
#define revrep(i,n) for(ll i=n-1; i>=0; --i)
inline constexpr ll Inf = (1ULL << 62) -1;
#define fastio cin.tie(nullptr); ios_base::sync_with_stdio(false);
#define endl '\n'... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define vll vector<long long>
#define sync ios_base::sync_with_stdio(false); cin.tie(NULL);
int lcm(int a, int b) { return (a / __gcd(a, b)) * b; }
ll bigMod(ll b, ll e, ll mod) {
if (e == 0) return 1 % mod;
if (e % 2... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool ch... | // give up
#include <bitset>
#include <cassert>
#include <iostream>
#include <iomanip>
#include <list>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
// alias, using declaration
using llint = long long; using ldouble = long double;
template <class T = llint> u... |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define sz size()
#define mp make_pair
#define pb push_back
#define rep(p, a, b) for (ll p = a; p < b; p++)
#define F first
#define S second
using namespace std;
typedef vector<ll> vll;
typedef vector<ld> vld;
typede... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
int N,K,M; cin >> N >> K >> M;
vector<int> v(N-1);
int A = 0;
for(int i = 0; i< N-1; i++){
cin >> v.at(i);
A += v.at(i);
}
if(K >= N * M - A){
cout << max(0,N * M - A) << endl;
}else{
cout << "-1" << e... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef long int li;
typedef long long ll;
typedef long double ld;
typedef vector<lli> vlli;
typedef vector<li> vli;
typedef vector<int> vi;
typedef vector<ld> vld;
#define all(x) (x).begin(),(x).end()
lli MOD=1e9+7;
/*vlli fun(lli q)
{
vlli r... | #include<bits/stdc++.h>
using namespace std;
int ans[3000];
int a,b;
void work(){
int tot=0;
if(a==b){
for(int i=1;i<=a;i++)ans[++tot]=i,ans[++tot]=-1*i;
return ;
}
if(a>b){
int fro=1001,sum=0;
while(a>b){
ans[++tot]=fro++;
sum+=ans[tot];
a--;
}
ans[++tot]=fro++;
sum+=ans[tot];
a--;
ans[... |
#include<iostream>
#include<math.h>
using namespace std;
int main() {
long s, p;
cin >> s >> p;
long limit = sqrt(p);
for(long n = 1; n <= limit; ++n) {
if(p % n == 0 && n + (p / n) == s) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| ///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
ll gcd(int a,int b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
long long binpow(long long base,long long power)
{
long long result=1;
while... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if(x == 0 && y == 1) {
cout << '2';
} else if(x == 1 && y == 0) {
cout << '2';
} else if(x == 1 && y == 2) {
cout << '0';
} else if(x == 0 && y == 2) {
cout << '1';
} else if(x... | #include<bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
using namespace std;
int main () {
FASTIO;
int n,m;
cin>>n>>m;
int ans=0;
if(n==m) {
cout<<m;
}
else {
cout<<3-n-m;
}
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a * a + b * b < c * c) cout << "Yes";
else cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
te... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// THINGS TO REMEMBER
// ENDL is slow, '\n' is fast
// Clear everything (including graphs) between test cases
// use anti-anti-hash: https://codeforces.com/blog/entry/62393
// pb-ds: https://codeforces.com/blog/entry/11080
// check when to use LLONG_M... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <sstream>
#define fileio \
freopen("C:\\Us... |
#include<bits/stdc++.h>
using namespace std;
const int N=(1<<20)+10;
int primes[20]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71};
long long f[N];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
long long a,b;
cin>>a>>b;
f[0]=1;
for(long long i=a;i<=b;++i){
int res=0;
for(int j=... | #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>
#define IOS {ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);}
#define endl "\n"
#define float long double
#define int long long int
#define f(i, a, b) for(int i=a; i<b; i++)
#define fb(i, a, b) for(int i=a; i>=b; i--)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define fi first... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
template <class T = ll> using V = vector<T>;
#define loop(n) while(n--)
#define rep(i,n) for(int i=0; i<(n);++i)
#define repp(i, l, r) for(int i = (l); i < (r); ++i)
#define all(v) (v).begin(), (v).end()
#define LL(n) int n;cin >> n
int main()
{
LL... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
int N; cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
sort(A.begin(), A.end());
vector<ll> S(N+1);
for (int i = 0; i < N; i++) S[i+1] = S[i] + A[i];
ll ans... | // Sky's the limit :)
#include <bits/stdc++.h>
using namespace std;
#define int long long
/*
*/
void run_case() {
int n;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
int res = 0;
for (int i = 0... |
#include <bits/stdc++.h>
#include <random>
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(b... | #include <bits/stdc++.h>
#define reg register
#define ll long long
#define ull unsigned long long
#define debug(typ...) fprintf(stderr, typ)
using namespace std;
int fastin() {
reg int x = 0, ch = getchar(), f = 0;
while(!isdigit(ch)) (ch == '-') && (f = 1), ch = getchar();
while(isdigit(ch)) x = (x << 1) + (x <<... |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma optimize("JARU SOSISONI")
using namespace std;
#define int long long
#define fast cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
#define geometry cout.setf(ios::fixed); cout.precision(15);
#define all(x) (x).begin(), (x).... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
vector <int> dy = {0, 1, 0, -1};
vector <int> dx = {1, 0, -1, 0};
const int INF = 1000000000;
const ll INFLL = 100000000000000000;
int main(){
int n; cin >> n;
int m; cin... |
#include <iostream>
#include <vector>
#include <cstring>
#define int long long
using namespace std;
const int maxn = 2e5 + 1;
const int mod = 1e9 + 7;
int N;
struct edge{
int to, w;
};
vector<edge > G[maxn];
int dis[maxn];
void dfs(int u, int f) {
for(auto& e :G[u]) {
if(e.to == f) continue;
d... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
ll n,q;
vector<int> g[200010];
int a[200010],b[200010];
vector <int> depth;
void dfs(int a,int d){
depth[a]=d;
for(int i :g[a]){
if(depth[i]==-1)dfs(i,d+1)... |
#include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define... | #include<cstdio>
#include<algorithm>
#include<ctype.h>
#define int long long
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
const int Mod=1e9+7,N=3005;
int n,dp[N][N],sum[N... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using P=... | /*
Author : Ritesh Singh
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
#define lct long long int t;cin>>t;while(t--)
#define ld long double
#define pb push_back
#define ff first
#de... |
#include<bits/stdc++.h>
using namespace std;
int N;
long long a;
int t;
int Q;
long long x;
long long mi=0x3f3f3f3f3f3f3f3f;
long long ma=0xcfcfcfcfcfcfcfcf;
long long add;
int main()
{
scanf("%d",&N);
while(N--)
{
scanf("%lld %d",&a,&t);
if(t==2)
{
ma=max(ma,a);
... | #include <bits/stdc++.h>
using namespace std;
//.define
// #define FILE_IN_OUT
#define RET(_x) cout << (_x) << '\n'; return;
#define all(_obj) (_obj).begin(), (_obj).end()
#define loop(_n) for (int i = 0; i < (_n); ++i)
#define sz(_obj) static_cast<int>((_obj).size())
#ifdef SHJ_LOCAL
#define debug(_x) std::cerr << (#... |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main(){
int n, m;
cin >> n >> m;
int num = 0;
int ans = 0;
int hanko = INF;
vector<int> an(m);
for(int i=0; i<m; ++i) cin >> an[i];
sort(an.begin(),an.end());
for(int i=0; i<=m; ++i){
int ai;
if(i != m) ai = an[i];
... | #include<bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define ll long long
#define ss second
#define ff first
#define mod 1000000007
#define w(x) ll x; cin>>x; while(x--)
#define ps(x,y) fixed<<setprecision(y)<<x;
#define fo(i, j, k, in) for (ll i=j ; i<k ; i+=in)
#define re(i, j) fo(i, 0, j, 1)
#define pi ... |
#include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL<<((ll)n))
#define SUBS(s,f,t) ((s).substr((f),(t)-(f)))
#define ALL(a) (a)... | #include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<deque>
#include<map>
#include<bitset>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0;i < (n);i++)
#define repr(i, n) for(int i = (n);i >= 0;i--)
#define repf(i, m, n) for(int i... |
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define SZ(a) (int)((a).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef double db;
typedef pair <int, int> Pii;
typedef pair <ll, int> Pli;
typedef unsigned long long u... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll count=0;
ll cyan=a;
ll red=0;
while(cyan>red)
{
if(count>100000)
{
cout<<-1<<endl;
return 0;
}
cyan+=b;
red+=c;
... |
#include<bits/stdc++.h>
#define EB emplace_back
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
const int N = 2e5 + 10;
map < int, int > mp[N];
struct ufds{
vector < int > p... | #include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
const int maxn=4e5+10;
int n,m,cnt;
int used[maxn];
struct sb{
int now,pre,to,va;
}e[maxn*3];
inline void add(int a,int b,int c){e[++cnt].pre=e[a].now;e[cnt].va=c;e[cnt].to=b;e[a].now=cnt;}
void dfs(int u){
for(int i=e[u].now;i;... |
#include <bits/stdc++.h>
using namespace std;
#define Laylo cin.tie(0), cout.tie(0), cin.sync_with_stdio(0), cout.sync_with_stdio(0);
#define lli long long int
#define ll long long
int main() {
Laylo
int x;
cin >> x;
cout << ((x < 0) ? 0 : x) << endl;
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
int s;
cin>>s;
if(s%100==0)
{
if(s<=10) cout<<0;
else if(s<=100) cout<<s/10;
else if(s<=3000) cout<<s/100;
}
else
{
if(s<=10) cout<<1;
else if(s<=100) cout<<s/10+1;
else if(s<=3000) cout<<s/100+1;
}
return 0;
} |
#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>
#include <chrono>
#include <vala... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> Point;
typedef pair<Point, Point> Path;
map<Path, double> cost;
Point get_next(Point cur, Point goal) {
double min_cost = 1e14;
Point next = make_pair(-1, -1);
if (cur.first < goal.first) {
next = make_pair(cur.first + 1, cur.second);
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int T;
cin >> T;
while(T--){
long long N;
cin >> N;
int cnt = 0;
while(N % 2 == 0){
N /= 2;
cnt++;
}
if(cnt == 0) cout << "Odd" << endl;
else if(cnt == 1) cout << "Same" ... | #include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
#define repr(i,n) for (int i = (n)-1; i >= 0; --i)
#define rep1r(i,n) for (int i = (n); i > 0; --i)
#define bit(n,k) ((n>>k)&1... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int M,sum=0;
cin>>M;
int ar[M];
for(int i=0;i<M;i++){
cin>>ar[i];
if(ar[i]>=10){
sum+=(ar[i]-10);
}
}
cout<<sum<<endl;
return 0;
} | #include<bits/stdc++.h>
#include<iostream>
using namespace std;
#define in(i,a,n) for(i=a;i<n;i++)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define ll long long
#define mod 1000000007
#define all(x) x.begin(),x.end()
#define F first
#defi... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
double ans = N;
double tmp = 0.0;
for (int i=1;i<=N;i++) {
tmp += 1.0/i;
}
ans *= tmp;
ans -= 1;
cout << fixed << setprecision(15) << ans << "\n";
return 0;
} | #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 <iostream>
using namespace std;
int main()
{
int N;
cin>>N;
int result=N*1.08;
if(result<206)
cout << "Yay!"<<endl;
else if(result==206)
cout << "so-so"<<endl;
else if(result>206)
cout << ":("<<endl;
} | #include <iostream>
#include <vector>
#include <cmath>
#include <ostream>
#include <list>
#include <map>
#include <algorithm>
#include <climits>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <bitset>
#include <cstring>
#include <deque>
#include <set>
#include <stack>
#include <queue>
#include <chrono... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
long sum = 0;
for (int i = 0; i < N; i ++)
{
int A;
cin >> A;
if (A > 10) sum += A - 10;
}
cout << sum << endl;
return 0;
} | //#include <tourist>
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<ll, ll> p;
const int INF = 1e9;
const double eps = 1e-7;
const ll LINF = ll(1e18);... |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz(a) ... | #pragma GCC optimize("O2")
#pragma GCC target("avx")
#include <cstdio>
#include <functional>
#include <queue>
#include <tuple>
using namespace std;
inline int_fast32_t get_digit() {
int_fast32_t x = 0, f = 1;
char c = getchar();
while(c > '9' || c < '0') {
if(c == '-') f = -1;
c = getchar()... |
#include <bits/stdc++.h>
using namespace std;
#define rep(ver,n) rep2(ver,0,n)
#define rep2(ver,m,n) for(int ver=m;ver<(n);ver++)
#define loop while(true)
#define dup(x,y) (((x)+(y)-1)/(y))
#define all(v) (v).begin(), (v).end()
#define debug(x) std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) std::cerr<<#x<<": "<<x<<"... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
cout << n - 1 << endl;
} |
#include <bits/stdc++.h>
#include <stdlib.h>
#define sz(x) (int)(x).size()
using namespace std;
int64_t strtoll(string &s) {
int64_t res = 0;
for (int i = 0; i < sz(s); i++) {
res *= 10;
res += s[i] - '0';
}
return res;
}
vector<int64_t> convertToInts(vector<string> &arr, vector<int> ... | //
#include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define f first
#define s second
#define what_is(x) cerr << #x << " is " << x << endl;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int INF = 1000000007;
const ll MOD = 1000000007;
void solve_test()
{
int... |
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <math.h>
#include <cmath>
#include <string>
#include <string.h>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
#include <cstdint>
#include <functional>
#include <time.h>
using namespace std;
using... | #include<ctime>
#include<cstdio>
#include<cctype>
#include<algorithm>
#define ll long long
using namespace std;
const ll N=1e5+7;
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;
}
struct node{
ll i,k;
node(ll i=0,ll ... |
#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1e9 + 7;
constexpr ll inf =... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb p... |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
... | #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 <cstdio>
int main() {
int N, X, i;
int V[1000] = {};
int P[1000] = {};
scanf("%d %d", &N, &X);
X *= 100;
for (i = 0; i < N; i++) scanf("%d %d", V + i, P + i);
int s = 0;
for (i = 0; i < N; i++) {
s += V[i] * P[i];
if (s > X) break;
}
if (i == N) printf("... | #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>;
int main() {
int n,k;
cin>>n>>k;
int z=0;
int x=0;
rep(i,n+1) z+=i;
rep(i,k+1) x+=i;
ll ans =z*k*100+x*n;
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD (ll)1000000007
#define pii pair<int,int>
#define pll pair<ll,ll>
#define UNIQUE(v) sort(v.begin(),v.end()),v.erase(unique(v.begin(),v.end()),v.end());
ll GCD(ll a,ll b){return b?GCD(b,a%b):a;}
ll power(ll a,ll b){ll ret=1;while(b){if(b%2)ret... | #include <bits/stdc++.h>
int main() {
const long long int MOD = 998244353;
long long int A, B, C;
std::cin >> A >> B >> C;
long long int sum_a = (A + 1) * A / 2 % MOD;
long long int sum_b = (B + 1) * B / 2 % MOD;
long long int sum_c = (C + 1) * C / 2 % MOD;
std::cout << ((sum_a * sum_b) %... |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << min({a, b, c, d}) << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define vt vector
#define f(i,n) for((i)=0;(i)<(n);(i)++)
#define fd(i,n) for((i)=n-1;(i)>=0;(i)--)
#define pb push_back
using namespace std;
int main(){
ll t=1;
//cin>>t;
while(t--){
ll a,b,c,x,y,z;
cin>>a>>b>>c;
if (a==1)
x=6... |
// Code Written by Pinaki Bhattacharjee (pinakipb2)
#include<bits/stdc++.h>
using namespace std;
// typedef
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
// #define
#define LOCAL
#define endl "\n"
#define PI 2*acos(0.0)
#define ff first
#define ss second
#def... | # include <bits/stdc++.h>
# ifndef ngng628_library
# define ngng628_library
# define int long long
# define float long double
# define fi first
# define se second
# define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i,n) for(int i=((int)... |
/* _
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
... | // RedStone
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define endl '\n'
#define D(x) cerr << #x << " = " << (x) << '\n'
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
const int N = 1e5 + ... |
#include <bits/stdc++.h>
#include <vector>
#include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
// #define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9+5;
const int m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int64_t solve(int64_t N, string S, string T) {
// TODO: edit here
ll count(0);
for (size_t i = 0; i < N; ++i) {
if (S[i] == '1') ++count;
if (T[i] == '1') --count;
}
if (count != 0) return -1;
for (size_t i = 0... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
struct edge {
int to;
long long c;
long long d;
};
ll get_cost(ll c, ll d, ll t_now) {
ll t = sqrt(d);
ll dt = max(0LL, t - t_now);
ll res = c + (d / (t_n... | #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>;
const int mod = 1'000'000'007;
int main() {
int r1, c1, r2, c2, ans;
cin >> r1 >> c1 >> r2 >> c2;
int r_diff = r1 - r2, c_diff = c1 - c2;
if (r1==r2 && c1==c2) a... |
#include<bits/stdc++.h>
using namespace std;
/*long long gcd(long long a,long long b){
if(b==0){
return a;
}
return(gcd(b,a%b));
}
bool prime(long long n){
if(n<2){
return false;
}else{
for(int i=2;i*i<=n;i++){
if(n%i==0){
return false;
}
}
}
return true;
}*/
/* PRIME FACTOR ARRAY
vector<int... | #include <bits/stdc++.h>
#define int long long int
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
using namespace std;
signed main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n;
cin >> n;
int ans = 0;
for(int i = 1;i <= n;i++){
int temp = i;
bool flag... |
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define ll long long
#define dl long double
#define all(arr) arr.begin(), arr.end()
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#de... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
int64_t bound = 2*(n+1);
int64_t m = sqrt(n);
while((m+1)*(m+2)<=bound){ //次のやつが上界を超えない
m++;
}
cout << n+1-m;
} |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int n, m;
vector<ll> a, b;
vector<vector<int>> g;
vector<bool> check;
ll dfs(int v) {
check[v] = true;
ll ret = b[v] - a[v];
for (auto nv : g[v]) {
if (check[nv]) contin... | #define ll long long
#define mod 1000000007
#include<bits/stdc++.h>
using namespace std;
const int maxn = 200000;
ll n, m;
ll a[maxn], b[maxn];
ll ss, st; // ssはグラフの実際の合計, stはグラフの理想の合計(ss=stなら"Yes")
ll mark[maxn]; // すでに見た点か判断する
vector<int> adj[maxn]; // グラフ
// 深さ優先探索
void dfs(int v) {
ss += a[v];
st += b[v... |
#include <bits/stdc++.h>
using namespace std;
bool checkValidStr(int N, string T) {
string startsWith = T.substr(0, 3);
if(startsWith == "110") {
for(int i = 0; i < N; i++) {
char c = T.at(i);
int rest = i % 3;
if(rest == 0 || rest == 1) {
if(c != '1') {
return false;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define mod 998244353
#define all(a) a.begin(),a.end()
#define dbg(n) cout<<#n<<' '<<n<<endl;
#define dbg_v(v) cout<<#v<<":";for(auto x:v) cout<<" "<<x; cout<<endl;
ll power(l... |
#include "bits/stdc++.h"
#include <chrono>
#include <random>
#define INF 1000000007
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for (int i = a; i < b; i++)
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<int, int>;
int main(){
int n; cin>>n;
vector<P> a(n),b(n);
rep(i,n) {
int x,y; cin>>x>>y;
a[i] = {x,i};
b[i] = {y,i};
}
sort(a.begin(), a.... |
/*
Bismillahir Rahmanir Rahim
Read in the name of Allah, who created you!
Al Mashruf Tonoy
Department of CSE, Daffodil Internatinal University.
*/
/*
Bismillahir Rahmanir Rahim
Read in the name of Allah, who created you!
Al Mashruf Tono... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int arr[7] = {0,6,5,4,3,2,1};
int a ,b,c;
cin >> a >> b >> c;
cout << (arr[a]+arr[b]+arr[c]) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define debug(x) cerr << "L" << __LINE__ << ": " << #x << " = " << (x) << endl
#define debugvec(v) rep(i, v.size()) cerr << "L" << __LINE__ << ": " << #v << "[" << i << "] = " << v[i] << endl;
#define debugvec2(v) ce... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
const int maxn=1e6+5;
int main(){
char s[5];
cin>>s+1;
if(s[1]==s[2]&&s[3]==s[2]){
cout<<"Won"<<endl;
}
else{
cout<<"Lost"<<endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define forn(i,a,b) for(int i =a;i<b;i++)
#define fi first
#define se second
#define fast ios_base::sync_with_stdio(false);
using namespace std;
//for debugging
/*
g++ -D_GLIBCXX_ASSERTIONS -DDEBUG -ggdb3 -std=c++14
*/
int recur_depth = 0;
#ifdef DEBU... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx")
#include <bits/stdc++.h>
#define ll long long
#define all(x) x.begin(),x.end() //vector
#define rep(i,n) for(ll i=0; i<n; ++i)
#define REP(i,n) for(ll i=1; i<=n; ++i)
#define Rep(i,s,n) for(ll i=s; i<n; ++i)
using namespace std;
//最大公約数
ll gcd (ll a, ll b){
... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
#define pb push_back
int a[300005];
signed main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
int cur=0;
int ans=0;
for(int i=0;i<n;i++)
{
if(!i||a[i]==a... | /**
* author: Ayush
* From: Earth
**/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define dbg(x) cerr << #x << ": "<< x <<endl
#define dbg2(x,y) cerr<< #x <<": "<< x <<" || "<< #y << ": " << y << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >>... |
#include<bits/stdc++.h>
using namespace std;
int K;
char S[233],T[233];
int a[233],b[233];
double Ans = 0.0;
int Ten[10] = {1,10,100,1000,10000,100000};
int CountS(int x)
{
int Sum = 0;
a[x]++;
for(int i = 1;i<=9;i++)
Sum += Ten[a[i]]*i;
a[x] --;
return Sum;
}
int CountT(int x)
{
int Sum = 0;
b[x]++;
for(... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <set>
#include <queue>
#include <stack>
using namespace std;
typedef long long int ll;
typedef pair<int,int> Pai;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { re... |
#include<bits/stdc++.h> //Ithea Myse Valgulious
namespace chtholly{
typedef long long ll;
#define re0 register int
#define rel register ll
#define rec register char
#define gc getchar
//#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),p1==p2)?-1:*p1++)
#define pc putchar
#define p32 pc(' ')
#define pl puts("... | #include <cstdio>
int po(int a, long long b, int m)
{
int r = 1;
while (b) {
if (b & 1) r = (long long)r * a % m;
a = (long long)a * a % m;
b >>= 1;
}
return r;
}
int m;
long long n;
int main()
{
scanf("%lld%d", &n, &m);
printf("%d\n", (po(10, n, m * m) - po(10, n, m)) / m);
return 0;
}
|
/*
Written By mafailure
*/
#define ill
//In the name of God
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace std;
using namespace __gnu_pbds;
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int Szukaj(vector<ll>& a, ll x)
{
int l = 0, p = a.size() - 1, s, r = -1;
while (l <= p)
{
s = (l + p) / 2;
if (a[s] <= x)
{
r = s;
l = s + 1;
}
... |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <limits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#inclu... | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define PI acos(-1.0)
#define GCD(a,b) __gcd(a , b)
#define LCM(a,b) ((a/__gcd(a,b))*b)
#define READ(f) freopen(f,"r",stdin)
#define WRITE(f) freopen(f,"w",stdout)
#define test cou... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
using namespace std;
template <class T = int>
using V = vector<T>;
template <class T = int>
using VV = V<V<T>>;
using ll = lo... | #include<bits/stdc++.h>
#define loop(i, n) for(int i = 0; i < n; i++)
#define pb push_back
#define ll long long int
#define vi vector<int>
#define pi pair<int, int>
#define W(t) int t; cin >> t; while(t--)
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); c... |
// atcoder/hhkb2020/D/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first <... | #include <iostream>
#include <string>
#include <iomanip>
#include <sstream>
#include <istream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <climits>
using namespace std;
int max(int, int);
int min(int, int);
int positiveNum(int);
unsigned long long factorial(int);
unsigned long long combination(i... |
#include <bits/stdc++.h>
#define fir first
#define sec second
#define PB push_back
#define MP make_pair
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define foreach(itr, c) for (__typeof((c).begin()) itr = (c).begin(); itr != (c).end()... | #include<bits/stdc++.h>
#define it register int
#define ct const int
#define il inline
using namespace std;
typedef long long ll;
#define rll register ll
#define cll const ll
typedef double db;
#define rdb register db
#define cdb const db
typedef long double ldb;
typedef unsigned long long ull;
#define pb push_back
#de... |
// (n+1,r) = (n,r)+(n,r-1)
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll l;
cin >> l;
ll dp[l][12];
for(int i = 0;i <= l-1;i++){
for(int j = 0;j <= 11;j++){
if(j == 0 || i == j){
dp[i][j] = 1LL;
continue;
}
if(i < j){
dp[i][j] = 0LL;
continue;
}
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll l;
cin>>l;
__int128 a=1,b=1,c=1;
for(int i=1;i<=11;i++){
a*=(l-i);
}
for(int i=1;i<=11;i++){
b*=i;
}
c=a/b;
cout<<ll(c)<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
int N, Q;
int A[200010], T[200010];
int unit(int x)
{
rep(i, N)
{
if(T[i] == 1)x = x + A[i];
if(T[i] == 2)x = max(x, A[i]);
if(T[i] == 3)x = min(x, A[i]);
}
return x;
}
si... | // Bismillahir Rahmanir Rahim
//============================
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define infL LLONG_MAX
#define infI INT_MAX
#define pb push_back
#define fo(i,a,b) for(int i=a;i<b;i++)
#define fo2(i,a,b) for(int i... |
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <typeinfo>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, i... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
typedef long long ll;
int main() {
ll s, p;
cin >> s >> p;
for (ll i = 0; i <= sqrt(p); ++i) {
if (i * (s - i) == p) {
cout << "Yes";
return 0;
}
}
cout << "No";
} |
#include<bits/stdc++.h>
#define PB emplace_back
#define MP make_pair
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
template<typename T>
void read(T &x){
int ch = getchar(); x = 0; bool f = false;
for(;ch < '0' || ch > '9';ch = getchar());
for(;ch >= '0' && ... | #include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> solve(int n){
if(n==1){
vector<vector<int>> v;
v.resize(1);
v[0].push_back(0); v[0].push_back(1);
return v;
}
vector<vector<int>> u = solve(n - 1);
vector<vector<int>> v;
int x = (1<<n) - ... |
#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>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#incl... | #include <iostream>
#include <map>
using namespace std;
const int MAX = 1e5;
int main() {
int N; cin >> N;
map<int, long long> a, bc;
int B[MAX], C[MAX];
for (int i = 0; i < N; i++) {
int A; cin >> A;
a[A]++;
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
for (int i = 0; i < N; i++) {
... |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include <iomanip>
using namespace std;
#define intmax INT_MAX
#define lmax LON... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
typedef long long ll;
const ll INF=1e18;
const int maxn=(1e5)+10;
... |
// Problem: D - Kth Excluded
// Contest: AtCoder - AtCoder Beginner Contest 205
// URL: https://atcoder.jp/contests/abc205/tasks/abc205_d
// Memory Limit: 1024 MB
// Time Limit: 3000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll power(ll... | /*
ID: tazhiba1
TASK: test
LANG: C++
*/
// author: IskhakKutBilim
#include <bits/stdc++.h>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
long long Sumofn(long long x){
long long sum = 0;
while(x > 0){
sum+= x % 10;
x = x / 10;
}
return sum;
}
long long gcd(long long a, long lon... |
#include<bits/stdc++.h>
#define lcm(a,b) (a/__gcd(a,b))*b
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define F first
#define S second
#define mp make_pair
//salida rapida "\n"
//DECIMALES fixed<<sp(n)<... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using namespace std;
using LL = long long;
using P = pair<int,int>;
class UnionFind {
public:
vector <LL> par;
vector <LL> siz;
UnionFind(LL sz_): par(sz_), siz(sz_, 1LL) {
for (LL i = 0; i < sz_; ++i) par[i] = i;
}
v... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
int main(){
int N, K, M;
cin >> N >> K >> M;
int tmp, sum = 0;
int target = M * N;
rep(i,N-1){
cerr << "target " << target << endl;
cin >> tmp;
target -= tmp;
}
int ans;
if(target <= 0){
ans = 0;
} else if(target <= ... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N,K,M,A,sum=0;
cin>>N>>K>>M;
for(int i=0;i<N-1;i++){
cin>>A;
sum+=A;
}
if(N*M-sum<=K)cout<<max(N*M-sum,0);
else cout<<-1;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
typedef pair<int, int> P;
typedef long long ll;
int dp[300][300];
int n;
vector<int> bucket;
bool valid(vector<int> x, vector<int> y)
{
if (x.size() == 0 || y.size() == 0)
{
return fals... | #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;
... |
#include <bits/stdc++.h>
#define int long long
#define lowbit(x) x & (-x)
using namespace std;
constexpr int maxn = 1000010;
int tr[maxn];
bool vis[maxn];
struct Point {
int x, y;
bool operator < (const Point &W) const {
if (x == W.x) return y < W.y;
else return x < W.x;
}
bool operator == (const Point &W) c... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
const int N = 105;
int A[N], B[N], C[N], D[N];
int solve(int n, int m, int k){
int i,j,ans=0;
unordered_map<int, int> um;
for(i=0;i<(1 << k);i++){
um.clear();
int cnt=0;
for(j=0;j<k;j++){
... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, s, n) for (int i = (s); i < (int)(n); ++i)
#define ZERO {puts("0"); return 0;}
#define NO {puts("No"); return 0;}
#define ALL(obj) begin(obj), end(obj)
#define pb push_back
templat... | /* -*- coding: utf-8 -*-
*
* e.cc: E - Throne
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utilit... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < n; i++)
vector<vector<int>> to;
vector<int> used;
vector<int> col;
vector<int> vs;
ll now;
int n;
void dfs(int v) {
if (used[v]) return;
used[v] = 1;
vs.push_back(v);
for (int u: to[v]) dfs(u);
}
void d... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<vector<int>> adj(n, vector<int>(n));
for (int i = 0, u, v; i < m; i++) {
cin >> u >> v, --u, --v;
adj[u][v] = adj[v][u] = 1;
}
vector<int> is_independent(1 << n, 1);
... |
#include<bits/stdc++.h>
#define rep(i, n) for (int i=0;i<(n);i++)
using namespace std;
#define vecout(V) for(int i=0;i<V.size();i++) {cout<<V[i]<<endl;}
typedef long long ll;
int main(void){
int n, k, m;
cin>>n>>k>>m;
vector<int> v(n-1);
rep(i, n-1) cin>>v[i];
int sum=accumulate(v.begin(), v.end(),... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, K, M;
cin >> N >> K >> M;
vector<int> A(N);
int ans = 0, sum = 0;
for (int i = 0; i < N - 1; i++)
{
cin >> A[i];
sum += A[i];
}
ans = M * N - sum;
if (ans > K) {
cout << "-1" << endl;
}... |
#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
typedef unsigned long long ui64;
typedef vector<i64> vi;
typedef vector<vi> vvi;
typedef pair<i64, i64> pi;
#define pb push_back
#define sz(a) i64((a).size())
#define all(c) (c).begin(), (c).end()
#define REP(s, e, i) for(i=(s); i < (e); ++i)
inlin... | //a.9
#include<bits/stdc++.h>
#define ll long long
#define all(x) x.begin(),x.end()
#define CASE(t) cout<<"Case #"<<(t)<<": ";
#define endll endl
#define endl '\n'
#define mod 1000000007
#define INF 1e18
#define maxN 500005
#define ios ios_base::sync_with_stdio(false); cin.tie(NULL)
using namespace std;
ll ceill(ll a,l... |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <map> //http://vivi.dyndns.org/tech/cpp/map.html
#include <set> //http://vivi.dyndns.org/tech/cpp/set.html
#include <vector>
#include <deque>
#include <queue>
#include <numeric> //gcd,lcm c++17
#include <tuple>
#include <iomanip> //set... | #include<bits/stdc++.h>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define T int t, q=0; scanf("%d", &t); while(q++<t)
#define ll long long
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
ll x,y,z,a=0,b=0,c=0,d=0,sum,ans... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
int n = s.size();
if(n == 1){
if(s=="8") {
cout << "Yes" << endl;
return 0;
}
}
if(n == 2) {
int a = s[0] - '0', b = s[1] - '0';
if((a * 10 + b) % 8 == 0 || (b * 1... | #include <iostream>
using namespace std;
string Save[3][125];
string erase(string n,int index){
string a,b;
a=b="";
for(int i=0;i<index;i++){
a+=n[i];
}
for(int i=index+1;i<n.length();i++){
b+=n[i];
}
return a+b;
}
int main() {
int c1,c2,c3;
c1=c2=c3=0;
for(int i=8;i<1000;i+=8){
if(to_string(i).length()... |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<iomanip>
#include<map>
#include<stack>
#include<queue>
#include<set>
#include<deque>
#include<list>
using namespace std;
using P = pair<int,int>;
using ll = long long;
const long double EPS = 1e-10;
const ll MOD = 1000000... | //红太阳zhouakngyang txdy!
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
//#define int long long
inline int read()
{
int sum=0,nega=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')nega=-1;ch=getchar();}
while(ch<='9'&&ch>='0')sum=... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std;
const int SIZE = 200005;
const int BLOCK = 200005;
class SegTree{
public:
int v[SIZE*4];
SegTree(){
memset(v,0,sizeof(v));
}
int get(int node, int L, int R, int LQ, int RQ){
if(R<LQ || RQ<L) return 0;
... | #include <bits/stdc++.h>
// clang-format off
using namespace std; using ll = long long; using ull = unsigned long long; using pll = pair<ll,ll>; const ll INF = 4e18;
void print0() {}
template<typename Head,typename... Tail> void print0(Head head,Tail... tail){cout<<fixed<<setprecision(15)<<head;print0(tail...);}
void p... |
/*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map... | /*input
11
*/
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define inf 1000000007
#define fr first
#define sc second
#define eps 1e-9
#define clr(a) memset(a, 0, sizeof(a))
#define sz(x) x.size()
#define sni(x) scanf("%d",&x)
#define snl(x) scanf("%lld", &x)
#define snc(x) scanf("%c", &c);
#def... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define debug(x) cout << "(" << #x << ": " << x << ")" << endl;
void solve() {
int x,y;
cin >> x >> y;
bool flag=0;
if(x<y) {
if(x+3>y)
flag=1;
}
else {
if(y+3>x)
flag=1;
}
cout ... | #include <bits/stdc++.h>
#define loop(n) for(ll i=0;i<n;i++)
#define loopj(n) for(ll j=0;j<n;j++)
#define loopR(i,a,b,c) for(ll i=a;i>=b;i-=c)
#define rng(i,a,b,c) for(ll i = a; i<b;i+=c)
#define loop2(i,a,b) for(long long i = a; i>=b;i--)
#define loop3(j,a,b) for(int j = a; j<b;j++)
#define fast ios_base::sync_with_st... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.