code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
typedef pair<int, pi> pii;
int x2,y2;
int test(int x1,int y1, int grad1, int grad2) {
if (x1 - y1 == grad1 or x1+y1 == grad2) {
retur... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000000000000000
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int tt=1;
//cin >> tt;
while(tt--)
{
int a,b,c,d;
cin >> a >> b >> c >> d;
if(a==c&&b==d)
{
cout << 0 << endl;
}
el... |
#include <bits/stdc++.h>
using namespace std;
int a[25];
int main(){
int n;
scanf("%d", &n);
for(int i=0;i<n;i++){
scanf("%d", &a[i]);
}
int ans = 2e9;
for(int i=0;i<(1<<n);i++){
int sum = 0, res = 0;
for(int j=0;j<n;j++){
sum |= a[j];
if(j == n-1... | #include <bits/stdc++.h>
using namespace std;
#define BUFF ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define DEBUG(var) cout << #var << "=" << var << '\n'
#define WARN puts("warning!")
#define REP(i, a, n) for (int i = a; i <= n; ++i)
#define PER(i, n, a) for (int i = n; i >= a; --i)
#define LL int64_t
templ... |
#include "bits/stdc++.h"
using namespace std;
#define int long long
int extgcd(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
int g = extgcd(b, a % b, x, y);
int t = x;
x = y;
y = t - a / b * y;
return g;
}
signed main() {
ios::sync_with_stdio(... | #include <bits/stdc++.h>
using namespace std;
tuple<long long, long long, long long> extgcd(long long a, long long b) {
if (b == 0) return {a, 1, 0};
auto [d, x, y] = extgcd(b, a % b);
return {d, y, x - a / b * y};
}
// ax ≡ b (mod n) を満たす最小の非負整数 x を返す
// ただし、解が存在しない場合は -1 を返す
long long mod_linear_equatio... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
string s[n];
set<string> val;
for(int i=0;i<n;i++)
{cin>>s[i];val.insert(s[i]);}
for(int i=0;i<n;i++)
{
//if(s[i][0]!='!') continue;
if(val.count('!'+s[i]))
{
cout<<s[i];
exit(0);
}
}
cout<<"satisfiable";
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define pai arccos(-1);
#define keta(n) cout << fixed << setprecision((n));
using ll = long long;
#include <iostream>
#include <algorithm>
#include <cmath>
#inclu... | /* Up : 1 2 0 5 - 201 */
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <time.h>
#define file freopen("input.txt","r",stdin)
#define ll long long int
#define space printf("... |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ll n,sum1=0,sum2=0;
cin>>n;
for(ll i=0;i<n;i++)
{
ll k;
cin>>k;
sum1+=k;
sum2+=k*k;
}
cout<<sum2*n-sum1*sum1<<'\n';
return 0;
} | #include<bits/stdc++.h>
using namespace std;
long long a[401],b[300005];
int main(){
long long n,c,ans=0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>b[i];
a[b[i]+200]++;
}
for(int i=0;i<=399;i++){
for(int j=i+1;j<=400;j++){
ans+=a[i]*a[j]*(i-j)*(i-j);
}
}
cout<<ans;
return 0;
}
|
#include "bits/stdc++.h"
#define rep(var,init,max) for(int (var)=(init); (var) < (max); ++(var))
#define SORT(v) sort((v).begin(),(v).end())
#define RSORT(v) sort((v).begin(),(v).end()),reverse((v).begin(),(v).end())
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int mod107 = 1e9 + 7... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; i++)
{
int a;
cin >> a;
if (a <= 10)
{
continue;
}
else
{
count += a - 10;
}
}
cout << cou... |
#include <bits/stdc++.h>
using namespace std;
int sizeRes=0;
vector<pair<int,int> > res;
bool mergeSort(vector<int> &v, int from, int to, bool rev) {
if(from==to) return true;
if(rev) {
for(int c=from;c<to;c++) {
if(v[c+1]<=c && v[c] >= c+1) {
res[sizeRes++]=(make_pair(c,c+... | #pragma warning(disable:4996)
#include <stdio.h>
#include <set>
using namespace std;
set<int> a;
int main()
{
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
{
int c;
scanf("%d", &c);
a.insert(c);
}
while (*a.begin() != *(--a.end()))
{
int mn = *a.begin();
int mx = *(--a.end());
a.erase(mx);
a... |
/*
15
63 25 66 36 39 29 93 3 188 128 191 82 179 178 168
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define endl '\... | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0);cin.tie(0)
#define fp(i,a,b) for(int i=a ; i<b ; i++)
#define fn(i,a,b) for(int i=a ; i>=b ; i--)
#define fit(i,x) for(auto i=x.begin() ; i != x.end() ; i++)
#define pb push_back
#define ff first
#define ss second
#define all(x) ... |
#include <iostream>
#include <string>
#include <vector>
using ll=long long;
using namespace std;
// auto mod int
//const int mod = 1000000007;
//const int mod = 998244353;
int mod;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& op... | #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()
void c... |
#include <cstring>
#include <cstdlib>
#include <map>
#include <unordered_map>
#include <string>
#include <list>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <stack>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <set>
#include <unordered_set>
using namespace std;
... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define repit(i,C) for (auto i = (C).begin(); i != (C).end(); i++)
#define pr(a) cout << a
#define prl(a) cout << ... |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
const int mod = 1e9 + 7;
int n, m, l[N][N], r[N][N], u[N][N], d[N][N], two[N*N];
char s[N][N];
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
two[0] = 1;
for(int i=1; i<=n*m; i++) two[i] = 2ll*two[i-1]%mod;
for(int i=... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DU... |
#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 int long long
#define ff first
#define ss second
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ti tuple<int, int, int>
#define vi vector<int>
#define vl vector<ll>
#define vii vecto... |
#include <bits/stdc++.h>
using namespace std;
int main() {
double A, B;
cin >> A >> B;
double ans = 0;
ans = A * B / 100;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define fo(a,b,c) for(int a=b;a<=c;a++)
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int c=n,d=k;
int a=0,b=0;;
while(n){
a+=n;
n--;
}
while(k){
b+=k;
k--;
}
b*=c;
a*=d;
cout<<a*100+b;
... |
#include<bits/stdc++.h>
using namespace std;
#define maxn 100005
#define int long long
unsigned long long n;
int a,b;
int C[100][100];
signed main()
{
cin>>a>>b>>n;
C[1][0]=1,C[1][1]=1;
for(int i=2;i<=60;i++)
{
for(int j=0;j<=i;j++)
{
C[i][j]=C[i-1][j]+C[i-1][j-1];
}
}
while(a>=1&&b>=1)
{
if(n>C[a-1+b... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<60
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
template <class T>
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=(a); i<(n); i++)
#define rep2(i,a,n) for (int i=(a); i<=(n); i++)
using ll = long long;
using ld = long double;
using P = pair<int,int>;
int main() {
string s; cin >> s;
deque<char> d;
bool rev = false;
rep(i,0,s.size()) {
char c = ... | #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 H,typename... T> void print0(H h,T... t){cout<<fixed<<setprecision(15)<<h;print0(t...);}
void print() { print0("\n"); }
templat... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define mset(a, b) memset(a, b, sizeof(a))
using ll = long long;
using pii = pair<int, int>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
int main(){
int a,b,c,d;
std::cin >> a >>b>>c>>d;
std::cout << a*d-b*c << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define przxct ""
#define fto(i,j,h) for (int i=j; i<=h; ++i)
#define maxn
#define ll long long
#define pi 3.141592653589
using namespace std;
string x;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> x;
string rs = "";
fto(i,0,x... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for(long long i = 0; i < (long long)(n); i++)
#define rep1(i, n) for(long long i = 1; i <= (long long)(n); i++)
#define INF 1000000000000 //10^12:∞
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } re... |
#include <iostream>
int main() {
int x, y;
std::cin >> x >> y;
for (int i = y; i >= 1; i--) {
if ((x + i - 1) / i * i <= y && (x + i - 1) / i * i + i <= y) {
std::cout << i;
break;
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define FOR(i,a,b) for (int i = a; i < b; ++i)
#define FORR(i,a,b) for (int i = b - 1; i >= a; --i)
#define REP(i,n) FOR(i,0,n)
#define REP... |
#include <bits/stdc++.h>
using namespace std;
#define FIN ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int main() {FIN
int n, k, m, i, s = 0, e, res;
cin >> n >> k >> m;
for (i = 0; i < n - 1; i++) {
cin >> e;
s += e;
}
res = -1;
for (i = 0; i <= k; i++) {
if ((s + i) / n >= m) {
... | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)
inline bool EQ(double a, double b) { return fabs(a-b) < 1e-9; ... |
/*
Author : MatsuTaku
Date : 04/24/21
Certificate:
ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAAAgQDF9T447OEo8XSQ6O1AznN5tKC8mzvYc4Zs3+oOKfMqgLXfOwQnpfcoxKs4MAP1eICBD13PkcIezJ9IlV6nKQZKs1BQmvjSXJ+zKK8YCKvAueNPuNO0Bim43IBaNHNFWcMvcmUvHgRb6hUSO0V8I7OsjiFo20KDBj3gAznu9tir0Q== CompetitiveProgrammingCertification:tk... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=a;i>=n;i--)
#define pb push_back
#define mp make_pair
#define mem(a,b) memset(a,b,sizeof(a))
ll gcd(ll a,ll b){if(b==0)return a;else return gcd(b,a%b);}
ll lcm(ll a,ll b){return a... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs prior... |
#include<iostream>
using namespace std;
using ll = long long;
ll sum_comb(ll n) {
if (n <= 2) return 0;
return (n - 1) * (n - 2) / 2;
}
ll sum_comb2(ll n, ll N) {
return (sum_comb(n) - sum_comb(n - 3 * N)) - 3 * (sum_comb(n - N) - sum_comb(n - 2 * N));
}
int main() {
int N; ll K;
cin >> N >> K;
ll cnt = ... | #include<bits/stdc++.h>
#define int long long
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#define ri register signed
#define rd(x) x=read()
#define fi first
#define se second
#define mp make_pair
using namespace std;
const int N=3e6+5;
const int M=31;
const int mod=1e9+7;
inlin... |
#include<bits/stdc++.h>
#define pi 3.141592653589793238
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define MOD 1000000007
#define INF 999999999999999999
#define pb push_back
#define ff first
#define ss second
#define mt make_tuple
#define ll long long
#defin... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
//#define MOD 998244353
#define EPS 0.000000001
using namespace std;
ll extgcd(ll a,ll b,ll &x,ll &y){
ll d = a;
if(b != 0){
d... |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
using namespace std;
int maxof(int x, int y)
{
if (x > y)
return x;
else
return y;
}
int main()
{
int n;
int a[1000], b[1000];
int ans;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >>... | #include<map>
#include<set>
#include<list>
#include<ctime>
#include<cmath>
#include<deque>
#include<queue>
#include<stack>
#include<string>
#include<vector>
#include<bitset>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<complex>
#include<iostream>
#include<algorithm>
#define rep(i,s,t) for(int i=s;i<=t;... |
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " = " << x << endl
#define int long long
using namespace std;
typedef long long LL;
const int MAXN = 2E5 + 5;
const int MOD = 1E9 + 7;
int n, m, a[MAXN];
vector<int> delta;
template <class T>
void read(T& x) {
x = 0;
T f = 1;
char ch = getchar();
... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323846264338327950L
string randStr(){
string ret;
int rnd=rand()%9;
if(rnd==8){
ret='.';
}else{
ret = rnd+'A';
}
return ret;
}
int main(void){
int N,M;
cin>>N>>M;
vector<string> S(M);
... |
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#define N 111
#define NN 131000
template <typename T> inline void read(T &x) {
x = 0; char c = getchar(); bool flag = false;
while (!isdigit(c)) { if (c == '-') flag = true; c = getchar(); }
while (isdigit(c)) { x = (x << 1) + (x << 3) + (... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define Endl endl
#... | #include <algorithm>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <vector>
#define TRACE(x) std::cout << #x << " = " << x << "\n"
#define _ << " _ " <<
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
int N;
cin >> N;
vector<vector<int>> r(N, ... |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
int len(const T& a) {
return a.size();
}
using ll = long long;
int main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int n, k;
cin >> n >> k;
long long ans = 0;
for (int i = -400000; i <= 400000; ++i) {
if (abs(k - i) > n - 1 || ab... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define cs const
#define fr first
#define se second
#define ls (now<<1)
#define rs (now<<1|1)
#define mid ((l+r)>>1)
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define low(i) (i&(-i))
#define par pair<int,int>
... |
#include<iostream>
#include<cstdio>
using namespace std;
const int N=200005;
int n,m,Q;
int a[N],b[N];
struct Segment_Tree
{
struct Node
{
int ls,rs;
int cnt;
long long sum;
}tree[N*20];
int rt,tot;
void modifycnt(int &i,int l,int r,int pos,int val)
{
if(!i) i=++tot;
if(l==r)
{
tree[i].cnt+=val;
... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <tuple>
template <class E> struct FenwickTree {
int _n;
std::vector<E> data;
FenwickTree(int n) : _n(n), data(n) { }
void add(int p, E x) {
++p;
while (p <= _n) {
data[p - 1] += x;
p +... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long X;
cin>>X;
if(X/10000000000000>=1){
if(X/10000000000000>10){
cout<<10000000000000/10000001<<endl;
}
else{
cout<<X/10000001<<endl;
}
cout<<X/10000001<<endl;
}//33333333333333
//1000000000000
else if(X/10000... | #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>;
ll func(ll i) {
ll refact;
string i_st = to_string(i);
i_st += i_st;
refact = stoll(i_st);
return refact;
}
int main() {
ll N;
cin >> N;
int i = 1;... |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll n, f[1005];
int flg[1005];
vector<int> vec;
#define pb push_back
template < typename T >
inline T read()
{
T x = 0, w = 1; char c = getchar();
while(c < '0' || c > '9') { if(c == '-') w = -1; c = getchar(); }
while(c >= '0' && c <= '9') x = x ... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
const int MAXN = 100005;
const ll MOD = 1e9+7;
ll fib[MAXN];
int cnt[MAXN];
inline void solve()
{
ll n; cin >> n;
fib[1] = 1;
int tk = 0;
for (int i=2;;i++)
{
fib[i] = fib[i-1] + fib[i-2];
if (fib[i] > n)
{
t... |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const... | #pragma GCC optimize ("-O3")
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define forn(i,x,n) for(ll i=x;i<n;i++)
#define pb push_back
#define int long long
#define mp make_pair
#define debug(x) cout<<x<<"\n";
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#defi... |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin>>n;
long long x=sqrt(n+1);
long long total=(x*(x+1))/2;
x++;
while(total<=n+1){
total+=x;
x++;
}
total-=x;
x-=2;
cout<<1+(n-x)<<endl;
}
| #include <iostream>
using namespace std;
int main()
{
long long k;
cin>>k;
long long i,j;
long long b,c;
long long cnt=0;
for(i=1;i<=k;i++){
b=k/i;
if(b<i) break;
for(j=i;j<=k;j++){
c=k/(i*j);
if(c<j) break;
if(i==j){
... |
/*@author Vipen Loka*/
#include <bits/stdc++.h>
#define endl '\n'
#define ff first
#define ss second
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#defi... | #include<bits/stdc++.h>
using namespace std;
int n,m;
const int Maxn=2010;
const int INF=0x3f3f3f3f;
const int dx[4]={1,-1,0,0};
const int dy[4]={0,0,1,-1};
typedef pair<int,int> pii;
vector<int>from[Maxn*Maxn];
char s[Maxn][Maxn];
int dist[Maxn*Maxn];
int st,ed;
void dij(){
memset(dist,INF,sizeof(dist));
priority_q... |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
vector<ll> a, b;
bool solve()
{
cin >> n;
vector<vector<ll>> c(n, vector<ll>(n));
a.resize(n), b.resize(n);
ll sum = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
{
cin >> c[i][j];
... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<iomanip>
#include<algorithm>
using namespace std;
using ll = long long;
using veci = vector<int>;
using vecd = vector<double>;
using vecl = vector<long long>;
bool check_slope(int x1,int y1,int x2,int y2){
int bigx,smallx,bigy,smally;
... | #include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define FI first
#define SE second
#define pb push_back
#define eb emplace_back
#define mod 1000000007
#define all(c) (c).begin(),(c).end()
#defi... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
long long x;
cin >> n >> x;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long> b(n);
for (int i = n - 1; i >= 0; i--) {
b[i] = x / a[i];
x %= a[... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<long long> vll;
#define endl '\n'
#define pb push_back
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
void solve(){
double a,b,c,d; cin>>a>>b>>c>>d;
double ans = a/(c*d - b);
if(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define sc(x) scanf("%lld",&(x));
#define fi first
#define se second
#define endl '\n'
int n;
int a,b,c,d;
int ans;
signed main(){
sc(a)sc(b)sc(c)sc(d)
if(b > d*c){
cout << -1 << '\n';
}else if(b == d*c){
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll ans = 0;
set<ll> s;
for (ll i = 2; i * i <= N; i++)
{
ll x = i * i;
while (x <= N)
{
s.insert(x);
x *= i;
}
}
cout << N - s.size() ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// 約数列挙
vector<long long> calc_divisor(long long n) {
vector<long long> res;
for (long long i = 1LL; i * i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
long long j = n / i;
if (j != i) res.push_b... |
#include <cstdio>
const int md = 1000000007;
inline int add(int a, int b)
{
a += b;
if (a >= md) a -= md;
return a;
}
inline int sub(int a, int b)
{
a -= b;
if (a < 0) a += md;
return a;
}
inline int mul(int a, int b)
{
return (long long)a * b % md;
}
inline int po(int a, int b)
{
int r = 1;
while (b) {
... | #include <bits/stdc++.h>
using namespace std;
/* * * * * * * * * * */
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
/* * * * * * * * * * */
/* *
*
* Too many mind, no mind.
*
* */
const int mod = 3;
int add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; }
int sub(int a... |
#include "bits/stdc++.h"
#define pb push_back
using namespace std;
using ll = long long;
const ll N = 2e3 + 5;
vector<ll>g[N];
bool vis[N];
void dfs(ll v){
vis[v] = true;
for(ll u : g[v]){
if(!vis[u]){
dfs(u);
}
}
}
signed main(){
ll n,m;
cin >> n >> m;
for(ll i=... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#define file(x) freopen(#x".in", "r", stdin), freopen(#x".out", "w", stdout)
inline int read()
{
int data = 0, w = 1; char ch = getchar();
while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
if (ch == '-') w = -1, ch = getchar();
w... |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <utility>
#include <vector>
#include <limits>
#include <cmath>
#include <queue>
#include <unordered_map>
typedef long long ll;
const auto llMax = std::numeric... | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef u... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RREP(i, n) for(int i=(n);i>=0;--i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define DUMP(x) c... | #include<bits/stdc++.h>
using namespace std;
#define LL long long int
#define MOD 1000000007
#define MAXN 200000
int ft[MAXN + 3];
void update(int idx, int val) {
while (idx <= MAXN) {
ft[idx] += val;
idx += (idx & -idx);
}
}
int query(int idx) {
int result = 0;
while (idx > 0) {
... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define pii pair<int, int>
#define sz(x) (int)x.size()
#define fr first
#define sc second
#define all(a) a.begin(), a.end()
#define rep(i, a, b) for(int i = a; i < b; i++)
#define int long long
const int N = 1e5 + 20;
const int K ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n... |
#include<bits/stdc++.h>
#define maxn 100010
using namespace std;
typedef long long LL;
int read()
{
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
return s*w;
}
int n;
double f[maxn];
signed main()
{
n=read();
fo... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(){
int n;cin>>n;
double res = 0;
for(int i=1;i<n;++i){
double tmp = 1.0 * n / i;
res += tmp;
}
cout<<setprecision(10)<<res<<endl;
} |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include<bits/stdc++.h>
using namespace std;
vector<int> c[100005];
int n,p,s[100005];
bool cmp(pair<int,int> a,pair<int,int> b)
{
if(a.first!=b.first) return a.first>b.first;
return a.second>b.second;
}
void dfs1(int x)
{
s[x]=1;
for(int i=0;i<c[x].size();++i)
{
int y=c[x][i];
dfs1(y);
s[x]+=s[y];
}
}
int ... |
#define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pl;
typedef vector<pl> vp;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
const ll D4[] = {0, 1, 0, -1, 0};
const ll D8[] = {0, 1, 1, 0, -1, -1, ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
vi A(3);
for(int i = 0; i < 3; ++i) cin >> A[i];
sort(A.begin(), A.end());
if(A[1]-A[0] == A[2]-A[1]) cout << "Yes\n";
else ... |
#include <iostream>
using namespace std;
#define flash ios::sync_with_stdio(0);cin.tie(0);
int main(){
flash;
int x,u;
cin >> x >> u;
if(u % x == 0){
cout << "Yes";
}
else{
cout << "No";
}
} | #pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <string>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#define mem(a,x) memset(a,x,sizeof(a))
#define gi(x) scanf... |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
const double PI = acos(-1.0);
const long mod = 1000000007;
const long INF = 1e9 + 1;
int main() {
int t;
cin >> t;
for(int i = 0; ... | // ###### ### ####### ####### ## # ##### ### ##### //
// # # # # # # # # # # # # # ### //
// # # # # # # # # # # # # # ### //
// ###### ######### # # # # ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define reps(i, c, n) for(int i = c; i < n; i++)
#define inv(n, a) for(int i = 0; i < n; i++) cin >> a[i]
#define MOD 1000000007
#define INF 1e7
#define LINF 1e15
typedef long long ll;
typedef long double ld;
using Graph = vect... | #include<bits/stdc++.h>
#define f(i,a,b) for(int i=a;i<=b;++i)
#define ff(i,a,b) for( int i=a;i>=b;--i)
#define debug(x) cerr << #x << " : " << x << " " << endl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<string, string> pss... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
int s=0,p3=0,r3=1;
for(int i=0;i<n;i++){
char c;
cin>>c;
int x=0;
if(c=='B')x=1;
else if(c=='R')x=2;
if(p3==0)s=(s+x*r3)%3;
if(i==n-1)break;
int m=n-1-i;
whi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = double;
const int mxn = 4e5+10;
const int mod = 3;
int powmod(int a, int b) {
int ret = 1;
while(b) {
if(b&1) ret*=a, ret%=mod;
a*=a; a%=mod;
b>>=1;
}
return ret;
}
int c[3][3];
void pre() {
for(int i=0; i<3; i++) for(int j=0;j... |
#include<bits/stdc++.h>
using namespace std;
/*#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
*/typedef long long ll;
typedef unsigned long long... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n);i++)
using ll = long long;
const ll INF = 9e18;
const ll mod=1000000007;
int main(){
int n, m, l, x;
cin >> n;
vector<int> a(n);
int amax = 0;
rep(i,n){
cin >> a[i];
amax = max(a[i], amax);
}
i... |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#def... | #include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define all(v) v.begin(),v.end()
#pragma gcc optimize("O3")
#pragma gcc optimize("Ofast")
#pragma gcc optimize("unroll-loops")
using namespace std;
const int INF = 1e9;
const long long llINF = 5e18;
long long mod;
typedef long long ll;
type... |
#include <iostream>
#include <vector>
#include <set>
#include <map>
template <class E> struct FenwickTree {
int _n;
std::vector<E> data;
FenwickTree(int n) : _n(n), data(n) { }
void add(int p, E x) {
++p;
while (p <= _n) {
data[p - 1] += x;
p += p & -p;
... | #include<cstdio>
#include<iostream>
using namespace std;
int n,k;
long long MO,dp[110][180000];
int main()
{
scanf("%d%d%lld",&n,&k,&MO);
long long sum;
dp[0][0]=1;
for(int i=1;i<=n;i++)
{
sum=((1+min(i,n-i-1))*min(i,n-i-1)/2)*k;
for(int kk=0;kk<=k;kk++)
for(int j=kk*i;j<=sum;j++)
(dp[i][j]+=dp[i-1][j-k... |
#include <bits/stdc++.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<string.h>
using namespace std;
#define pb push_back
#define all(v) v. begin(),v. end()
#define rep(i,n,v) for(i=n;i<v;i++)
#define per(i,n,v) for(i=n;i>v;i--)
#define ff first
#define ss second
#define pp pair<l... | #include "bits/stdc++.h"
using namespace std;
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
#define endl '\n'
// if two adjacent nodes have same reachability, then they are in SCC
// no... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int T;
... | #include <bits/stdc++.h>
using namespace std;
#define maxn 200010
#define md 998244353
#define ll long long
int dp[maxn][30];
constexpr int top = 300000;
vector<int> fac(top + 1), ifac(top + 1);
inline int add(int a, int b) {
a += b;
if (a >= md) a -= md;
return a;
}
inline int sub(int a, int b) {
a -=... |
#include<bits/stdc++.h>
const int N=200010,mod=1e9+7;
char s[N];
int c[N],fac[N],f[17][N],n,KK,a[17],cnt,g[N][17],C[17][17];
int qp(int x,int y)
{
int ans=1;
for(;y;y >>=1,x=1ll*x*x%mod)
if(y&1)ans=1ll*ans*x%mod;
return ans;
}
void ins(int x)
{
if(!a[x]++)cnt++;
}
void eras(int x)
{
if(!--a[x])
cnt--;
}
int m... | #include <bits/stdc++.h>
#define DEBUG if(0)
typedef long long ll;
using namespace std;
const int maxSz = 2e5, maxCnt = 16;
const ll mod = 1e9 + 7;
ll dp[maxSz][maxCnt + 1][2][2];
char s[maxSz + 1];
int a[maxSz];
int sz, k;
ll solve(int mask, int pos, bool lmt, bool started) {
int cnt = __builtin_popcount(mask);... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define inf 2000000000
#define infLL 2000000000000000000
#define MAX5 100005
#define MAX6 1000006
#define MAX7 10000007
#define sf(a) scanf("%d", &a)
#define sfl(a) scanf("%lld", &a)
#define sfs(a) sc... | //https://atcoder.jp/contests/abc191/tasks/abc191_c
#include<iostream>
#include<iomanip>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <string>
#include <cstring>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
using namespace std;
#define ll long long... |
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb push_back
#define N 100012
#define ll long long
#d... | #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;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <cstring>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <random>
const int32_t MOD = 998244353;
int32_t dfs(int32_t x, std::vector<... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define ins insert
#define pb push_back
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
#define fk(x, a, b) for (int x = (a); x < (b); ++x)
#define fb(x, a, b) for (int x = (a); x <= (b); ++x)
#define fan(x, a, b) for (int x = (a); x >= (b); --... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main(){
long X, Y;
cin >> X >> Y;
unordered_map<long, long> dp;
function<long(long)> solve = [&](long y){
if(dp[y]) return dp[y];
if(y == 1) return dp[y] = abs(X - y);
if(y & 1) ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int ignore;
string inp;
cin >> ignore >> inp;
string stac;
for (const auto& x : inp)
{
stac.push_back(x);
while (stac.length() >= 3 && stac[stac.length() - 1] == 'x' &&\
stac... | #include<iostream>
using namespace std;
int main() {
int N,i;
string s,t="";
cin>>N>>s;
for (i=0;i<N;i++) {
t += s[i];
if (t.size() >= 3 && t.substr(t.size()-3) == "fox") t = t.substr(0, t.size()-3);
}
cout<<t.size()<<endl;
return 0;
}
|
//GIVE ME AC!!!
#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>;
#define _GLIBCXX_DEBUG
int a,b,c,i,j,k,l,m,n,ans,tmp,hoge,fuga,piyo,count,N,M;
int x[10010],y[10010],d[110][110];
void solve(){
for(k=0;k<n;k++){
for(i=0;i... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define all(v) v.begin(),v.end()
const int mod = 1e9 + 7;
int main (){
fast_io;
ll a, b;
cin >> a >> b;
bool flag = false;
if (a < b) {
swap... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
long long w;
cin >> w;
const int maxa = 2e5 + 1;
vector<long long> c (maxa, 0);
while (n--) {
long long s, t, p;
cin >> s >> t >> p;
c[s] += p;
c[t] -= p;
}
long long sum = 0;
for... | // //
// author : S4M4R //
// 14:51:47 | 13-10-2020 //
// //
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
void IN()
{
// cin.tie(nullptr)->sync_with_stdio(false);
#ifndef ONLINE_JUDGE
f... |
// Created at 2021/01/23 20:56
// {TODO}WA, {TODO}min, {TODO}diff
#include <bits/stdc++.h>
//#include <atcoder/all>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (lint i = 0, i##_len = n; i < i##_len; i++)
#define rep2(i, n) for (lint i = 1, i##_len = n... | #include <bits/stdc++.h>
using namespace std;
#define let const auto
#define var auto
#define ref var &
#define cref let &
typedef uint32_t uint;
typedef int64_t int64;
typedef uint64_t uint64;
template<class T>
T read() {
T x;
cin >> x;
return x;
}
let MULTIPLE_TEST_CASES = false;
void solve() {
let n = read... |
/*
********************
** MEET SHAH **
** DA-IICT **
** decoder_0712 **
********************
*/
#include <bits/stdc++.h>
using namespace std;
//#include <time.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//#de... | #include<bits/stdc++.h>
using namespace std;
#define res register int
#define ll long long
//#define cccgift
#define lowbit(x) ((x)&-(x))
#define rep(i,l,r) for(res i=l,_r=r;i<=_r;++i)
#define per(i,r,l) for(res i=r,_l=l;i>=_l;--i)
#define mkp make_pair
#define pb push_back
#define mem0(a) memset(a,0,sizeof(a))
#define... |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
template <class T>
using... | //include <atcoder>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <tuple>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#define flush fflush(stdout)
#define endl '\n'
#define all... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" <<... | #include <bits/stdc++.h>
#define LL long long
#define ull unsigned long long
#define F(i, j, k) for (int i = j; i <= k; ++i)
#define DF(i, j, k) for (int i = j; i >= k; --i)
using namespace std;
template <typename T> inline void read(T &n) {
T w = 1;
n = 0;
char ch = getchar();
while (!isdigit(ch) && ch != EO... |
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <iostream>
#include <vector>
#include <queue>
#include <unordered_map>
#include <random>
#include <stack>
#include <set>
#include <unordered_set>
#define bug(x) cout<<"zdongdebug1: "<<x<<endl;
#define bug2(x, y) cout<<"z... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
/* // Ordered Set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T>
typedef tree<T, null_typ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b); i-- > (a); )
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
#define lb(x...)... | #include <bits/stdc++.h>
using namespace std;
template<class C>constexpr int sz(const C&c){return int(c.size());}
using ll=long long;using ld=long double;constexpr const char nl='\n',sp=' ';
vector<int> solve(vector<int> P) {
int N = P.size();
vector<int> ind(N);
vector<bool> done(N - 1, false);
for (int i = 0... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stdlib.h>
#include <map>
#include <cmath>
#define MOD_P 1000000007
#define MOD_Q 998244353
#define PI 3.14159265358979
#define ll long long
using namespace std;
bool rec(int i, int w, vector<vector<int>> dp, vector... | #include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <que... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define all(v) v.begin(),v.end()
vector<vector<ll>> memo;
vector<vector<ll>> g;
ll N,M;
vector<ll> ind;
bool p;
bool dp(ll i,ll j) {
if(memo[i][j]>=0) {
if(memo[i][j]==0) {
return false;
}
else {
return true;
}
}
boo... | #include<iostream>
#include <string>
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#define ll long long int
#define ld long double
#define pb push_back
#define endl "\n"
#define mp make_pair
#define sz(v) (int)(v.size())
#define len(s)... |
#include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define reads(s) string s; cin >> s;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) i... | #include <bits/stdc++.h>
using namespace std;
template <typename T>
int len(const T& a) {
return a.size();
}
using ll = long long;
const int MOD = 998244353;
void Ok(int& a) {
if (a >= MOD)
a -= MOD;
}
const int N = 3010;
int n, k;
int dp[N][N << 1];
int main() {
ios_base::sync_with_stdio(false), cin.tie(nul... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
ios::sync_with_stdio(0),cin.tie(0);
int n,m;
cin >> n >> m;
vector <pair <int,int> > cond[n];
for(int i=0;i<m;i++){
int x,y,z;
cin >> x >> y >> z;
--y;
cond[x-1].push_back({y,z});
}
int d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b); i-- > (a); )
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) int((x).size())
#define lb(x...)... |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+5;
int n;
int g[N], v[N<<1], nxt[N<<1], tot;
int fa[N], son[N];
int dfn[N], sec;
inline void add(int x, int y) {
v[++tot] = y, nxt[tot] = g[x], g[x] = tot;
}
void dfs0(int x, int f, int dis, int &t, int &mn) {
fa[x] = f;
if (dis > mn) t = x, mn = d... | #include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=1000000007;
constexpr ll INF=2e18;
int main(){
ll k, n, m; cin >> k >> n >> m;
... | #include<cstdio>
typedef __int128 ll;
inline ll in();
inline void wr(ll);
inline ll quick_mod(ll,ll);
int main(int argc,char**argv){
register ll n=in();
register bool tp=1;
for(register ll i=1;i<=100&&tp;++i)
for(register ll j=1;j<=100&&tp;++j)
if(quick_mod(3,i)+quick_mod(5,j)==n&&quick_mod(3,i)>0&&quick_mod(5,... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int MOD;
class mint{
int x;
public:
mint():x(0){}
mint(long long y){ x=y%MOD; if(x<0) x+=MOD; }
mint& operator+=(const mint& m){ x+=m.x; if(x>=MOD) x-=MOD; return *this; }
mint& operator-=(const mint& m){ x-=m.x; if(x< 0) x... | /// kazuki08
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/... |
constexpr bool isDebugMode = false;
int testcase = 1;
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const ... | #include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define ull uint64_t
#define vi vector<int>
#define vll vector<ll>
#define vull vector<ull>
#define vvi vector<vector<int>>
#define FOR(i, n) for (int i = 0; i < n; i++)
#define CONCAT_INNER(a, b) a ## b
#define CONCAT(a, b) CONCAT_INNER(a, b)
#define ... |
#include<bits/stdc++.h>
#define rep(i,n) for ( int i=0; i< (n); ++i )
#define mod(x,m) ( (x%m+m)%m )
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int h,w;
cin >> h >> w;
vector<string> s(h);
rep(i,h) cin >> s[i];
int count = 0;
rep(i,h){
int len = 0;
... | #include<bits/stdc++.h>
using namespace std;
long long a[2000005],sum=0,mx=105;
int main(){
long long n,m;
cin>>n>>m;
for(int i=0;i<n*m;i++){
cin>>a[i];
if(a[i]<mx){
mx=a[i];
}
}
for(int i=0;i<m*n;i++){
sum=sum+a[i]-mx;
}
cout<<sum;
}
|
#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>
#define maxn 300010
#define ll long long
using namespace std;
ll n,m,now,ans,sum;
ll a[maxn],nm[maxn];
struct nod{
ll pos,num;
};
bool operator < (nod aa,nod bb){
return aa.num==bb.num?aa.pos> bb.pos:aa.num>bb.num;
}
priority_queue <nod> q;
int main(){
scanf("%lld%lld",&n,&m);
for(ll i=1;i<... |
#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
using namespace std;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//uniform_int_distribution<int>(1000,10000)(rng)
ll binpow(ll a, ll b)
{
ll res = 1;
while (b > 0)
{
if (b & 1)
res = r... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n; cin >> n;
vector<long long> vec;
for(int i=1; i <= sqrt(n); i++){
if(n % i == 0){
if(n /i == i){
vec.push_back(i);
}
else{
vec.push_back(i);
vec.push_back(n/i);
}
}
}
sort(vec.begin(), vec.end());
for(auto x... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0)->sync_with_stdio(0);
int n, m;
cin >> n >> m;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first;
a[i].second = i;
}
sort(begin(a), end(a));
map<int, int> mp;
for (const auto& [v, i] : a) ... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) co... |
/*
author : seryu
title : ABC180B_"Various distances"
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,n) for(int i = 1; i <= n; i++)
#define rrep(i,n) for(int i = n-1; i >= 0; i--)
#define rreps(i,n) for(int i = n; i >= 1; i--)
#define mrep(i,j,n) for(int i = ... | #include <cstdio>
#include <algorithm>
const int N = 2e5 + 5;
int a[N];
int b[N];
int ans[N];
int main() {
//#ifndef ONLINE_JUDGE
//freopen("in", "r", stdin);
//#endif
int n;
while (~scanf("%d", &n)) {
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
b[a[i]] = i;
}
int cnt = 0;
for (int i = n; i >... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
#define rep(i, n) for(long long i = 0; i < (long long)(n); i++)
#define rrep(i, n) for(long long i = (long long)(n - 1); i >= 0; i--)
#define all(x) (x).... | #define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printA... |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define SZ(x) (int)x.size()
#define F first
#define S second
#define ALL(x) x.begin(), x.end()
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define FOR... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0,endrep=(n); i<endrep; ++i)
#define rep1(i,n) for(ll i=1,endrep=(n); i<=endrep; ++i)
#define revrep(i,n) for(ll i=(n)-1; i>=0; --i)
inline constexpr ll Inf = (1ULL << 60) -1;
#define fastio cin.tie(nullptr); ios_base::sync_wi... |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define U 998244353
#define N 1000005
#define int long long
#define sz(c) (int)c.size()
#define fr first
#define ll long long
#define sc second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main(void){
int n;
cin >> n;
vector<ll> cnt_dummy(401);
decltype(cnt_dummy)::iterator cnt = cnt_dummy.begin() + 200;
rep (i, n) {
int a;
cin >> a;
cnt[a]++... |
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;
constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();
templ... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double db;
#define pll pair<ll,ll>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ub(v,val) upper_bound(v.begin(),v.end(),val)
#define np(str) next_permutation(str.begin(),str.end())
#de... |
#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<bits//stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <= n; i++)
#define rrep(i,n) for(ll i = n-1;i >= 0;i--)
#define ALL(obj) begin(obj), end(obj)
#define RALL(a) rbegin(a),rend(a)
typedef long long int ll;
typedef lon... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define pbp(f, s) pb(mp(f,... |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <string>
using namespace std;
using VL = vector<long long>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
VL calc(bool is_front, const VL &a) {
int n = a.size();
int n2 = n / 2;
VL b;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pb push_back
#define f(i,n) for(int i=0; i<n; ++i)
#define fi(i,st,n) for(int i=st; i<=n; ++i)
#define veci vector<int>
#define vecp vector<pair<int,int> >
#define vecl vector<ll>
int prime[100000+10];
ll lcm(ll ... |
#include <iostream>
using namespace std;
int main() {
int a, b; cin >> a >> b;
int sum =0;
int sum1 =0;
for( int i=0;i<3; i++){
sum += ( a%10) ;
sum1 += ( b%10) ;
a/=10 ;
b/=10 ;
}
cout<< max( sum1 , sum) ;
return 0;}
|
// Problem: A - Large Digits
// Contest: AtCoder - AtCoder Beginner Contest 187
// URL: https://atcoder.jp/contests/abc187/tasks/abc187_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#d... |
#include<bits/stdc++.h>
#include<cmath>
#define pb push_back
#define ld long double
#define mp make_pair
#define vl vector<ll>
#define vd vector<double>
#define vld vector<long double>
#define ll long long int
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define forr(i, n) for(ll i=0; i<n; i++)
#define f... | // Qg3
// //g++ -std=c++17 -O2 -Wall a.cpp -o test
// _()_
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vll vector<ll>
#define vi vector<int>
#define vb vector<bool>
#define pi pair<int,int>
#define pll pair<ll,ll>
#define vp vector<pi>
#define vpll vector<pll>
#defin... |
#include<bits/stdc++.h>
#define fasterthanlight ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define endl "\n"
#define int long long
#define vi vector<int>
#define pb push_back
#define mod 1000000007
#define MAX 1e9
#define MIN -1e9
#define hi "visited\n" //sasta debugging
using namespace std;
//aut... | #include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define swap(a,b) (a^=b^=a^=b)
#define ll long long int
#define ull unsigned long long int
#define uint unsigned int
#define format(a) memset(a,0,sizeof(a))
#define rep(x,y,z) for(int x=y;x<=z;x++)
#define dec(x,y,z) for(int x=y;x>=z;x--)
#define mst(x... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define P pair<int,int>
int main(){
ll B,C;
cin >> B >> C;
ll Al,Ar,Bl,Br;
ll ans;
Al = B - C/2;
Ar = max(B,B + (C-2)/2);
Bl = (-1)*B-(C-1)/2;
Br = (-1)*B+(C-1)/2;
if(B>0... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
constexpr int INF = 100000001... |
#include <iostream>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #pragma GCC optimize("O3")
//#pragma GCC target("avx")
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
... |
//#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
constexpr lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountll((lint)(n))
#define fcout cout << fixed << setprecision(15)
//#define highest(x) (63 - __builtin_clzl(x))
#define rep... | //In The Name Of Allah
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define F first
#define S second
//#pragma GCC optimize("Ofast")
const int maxn = 2e5 + 5, md = 998244353;
int vis[maxn], n, f[maxn], cnt;
bool c[maxn];
vector<int> cycle, adjr[maxn];
ll ans = 1;
int dfs3(... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define out(x) cout << x << '\n'
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,e;
cin>>a>>b>>c>>d;
e=(a*d)-(b*c);
cout<<e<<endl;
return 0;
}
|
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define double long double
#define all(x) begin(x), end(x)
#define Done(x) cout<<x<<endl; return;
#define endl '\n'
void solve(){
int n; cin>>n;
int m; cin>>m;
map<int,int>occur;
for(int i=0;i<n;i++){
int a; ci... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
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 ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.