code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
int t;
cin>>t;
ll sum3 = 0;
while(t--)
{
ll a,b;
cin>>a>>b;
a--;
ll sum1 = (a*(a+1))/2;
ll sum2 = (b*(b+1))/2;
sum3 += sum2-sum1;
}
cout<<sum3<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
cout.tie(0);
int n,i,s=0;
cin>>n;
int A[n];
for(i=0;i<n;i++)
{
cin>>A[i];
if(A[i]<=10)
{
A[i]=0;
}
else
{
A[i]=A[i]-10;
}
s+=A[i];
... |
/*
Author:Frozencode
*/
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
typedef pair<ll,ll> pii;
const ll maxn = 100010;
const ll INF = 2147483647;
ll n, c[maxn], cnt, res[maxn], x, y;
bool vis[maxn];
ll col[maxn];
vector ... | #include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
double a,b;
cin >> a >> b;
cout << b / 100 * a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define for_(i, a, b) for(int i = (a);i < (b);++i)
#define ford_(i, a, b) for(int i = (b)-1;i >= (a);--i)
#define rep(i, n) for_(i, 0, n)
#define repd(i, n) rfor_(i, 0, n)
int main(){
int a,b;
cin >> a >> b;
if(a == b) cout << a << endl;
el... |
#include <bits/stdc++.h>
#include <bits/extc++.h>
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_b... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int l;
#define M 1000000007
#define loop(i,n) for(int i=0;i<n;i++)
const l inf = 9e17;
struct triplet
{
l src;
l dest;
l weigh;
};
l sum;
l pa(int n)
{
l cnt=0;
for(int i=1;i*i<=n;i++)
{
if(i*i=... |
#include<bits/stdc++.h>
using namespace std;
int main() {
mt19937 rng(48);
cout.tie(nullptr)->sync_with_stdio(false);
int N, M; cin >> N >> M;
array<array<bool, 20>, 20> graph{};
for (int i = 0; i < M; ++i) {
int a, b; cin >> a >> b;
--a, --b;
graph[a][b] = graph[b][a] ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define u... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define range(a) a.begin(), a.end()
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
#define MP make_pair
con... | #include <bits/stdc++.h>
#define REP(i, nn ) for(int i = 0 ; i < (int) nn; i++)
#define REPS(i, ss, nn ) for(int i = ss ; i < (int) nn; i++)
#define REV(i, ss, nn ) for(int i = ss ; i >= nn; i--)
#define deb(x) std::cout << #x << " " << x << endl;
#define debl(x) std::cout << #x << " " << x << " ";
using namespace std;... |
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
//typedef tree <int,null_type,less <int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// #include <ext/rope>
// using namespace __gnu_cxx;
typedef long long int ll;
typedef long double... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N; string S; cin >> N >> S;
vector<int> F(N + 1, 0), G(N + 1, 1);
REP(i, 1, N + 1) {
int cnt = 0, tm... |
//g++ -std=c++14 test.cpp -o test.out
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <utility>
#include ... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9 + 7;
const int64_t MOD2 = 998244353;
const int INF = 2e9;
const long long inf = 1LL<<62;
template<int MOD> struct ModInt {
static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig ... |
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
cout<<n-1;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
int main(){
ll n,ans=0;
cin >> n;
if(n>999){
ans+=n-999;
}if(n>999999){
ans+=n-999999;
}if(n>999999999){
ans+=n-999999999;
}if(n>999999999999){
ans+... |
//12252024832524
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
const int MAXN = 100005;
const int MOD = 1e9 + 7;
int n;
int Read()
{
int x = 0,f = 1;char c = getchar();
while(c > '9' || c < '0'){if(c == '-')f = -1;c = getchar();}
while(c >= '0' && c <= '9'){x... | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <set>
//#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define all(v) v.begin(), v.end()
#define front(v) *v.begin()
#define back(v) *(--v.end())
#define len(v) v.size()
#define int long long
using lo... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef ve... | #include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#include <cctype>
#include <list>
#include <cassert>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) ... |
#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string a,b;
cin >> a >> b;
ll as = 0;
ll bs = 0;
for(int i = 0;i < (int)a.size();i++)as += a[i] - '0';
for(int i =0;i < (int)b.size();i++)bs += b[i] - '0';
cout << max(as,bs) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
int n;
vector<ll> with[3];
int cnt[3];
int getID(char c) {
switch (c) {
case 'R': return 0;
case 'G': return 1;
case 'B': return 2;
}
return -1;
}
signed main() {
cin >> n;
for (int i = 0; i < n * 2; i++) {... |
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
/*#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")*/
/*#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma")*/
using namespace std;
usin... | /*Be patient && calm!
All our dreams can come true, if we have the courage to pursue them.
I fear not the man who has practiced 10,000 kicks once, but I fear the man who has practiced one kick 10,000 times.
Do not pray for an easy life, pray for the strength to endure a difficult one.
When something is important enough... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define rep(i,n) for(int i=0; i<(n);++i)
int main()
{
ll n;
cin >> n;
vector<ll> x(n);
rep(i,n) cin >> x[i];
vector<ll> ps = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
ll ans = LONG_LONG_MAX... | # include <bits/stdc++.h>
# define sz(x) (int)x.size()
# define f first
# define s second
using namespace std;
using ll = long long;
int cnt[55], a[55], n;
ll ans;
set<int> f[55];
void calc(int in) {
int x = a[in];
for (int i = 2; i <= x; ++i) {
while (x % i == 0) {
x /= i;
//cout << "HERE";
... |
//#define _GLIBCXX_DEBUG
//#include <atcoder/all>
#include <bits/stdc++.h>
#include <chrono>
#include <random>
using namespace std;
//using namespace atcoder;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
//const ll MOD=1000000007;
const ll MOD=998244353;
//using mint = modint998244353;
//u... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T,class U>
inline bool chmax(T &a,U b){
if(a<b){
a=b;
return true;
}
return false;
}... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int,int>;
// __int128の入出力
using LL = __int128;
istream& operator>>(istream& is, LL& v)
{
string s;
is >> s;
v = 0;
for (int i = 0; i < (int)s.size(); i++) {
if (isdigit(s[i])) { v = v * 10 + s[i] - '0'; }
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int A,count=0,B,C,D,E;
long long int ans[1000]={0};
cin >> A;
B=A;
C=1;
while(1){
D=A/C;
E=A%C;
ans[count]=count+D+E;
if(B<2)break;
B=B/2;
C=C*2;
count++;
}
long long int min=ans[0];
for(int i=1;i<count;i... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, k;
int dp [105][105]; // pos, 2^x players
int win [105];
int pows [105];
int winz (int a, int b){
if (a==b) return a;
if (a>b) swap(a, b);
if(a==0 && b==1) return 1;
if(a==0 && b==2) return 0;
if(a==1 && b==2) retu... | #include <bits/stdc++.h>
//#include <atcoder/all>
#define int long long
#define rep(i,a) for (int i = 0; i < (a); i++ )
#define Rep(i,start,a) for (int i = start; i < (a); i++ )
#define ALL(vec) (vec).begin(), (vec).end()
#define Sort(vec) sort((vec).begin(), (vec).end()) // 小さい順
#define SORT(vec) sort((vec).begin(), (... |
//ver 8.1
#include <bits/stdc++.h>
using namespace std;
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define F(i,a,b) for(int i=(int)(a);i<=(int)(b);i++)
#define R(i,b,a) for(int i=(int)(b);i>=(int)(a);i--)
#define endl "\n"
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pii pair<int,int>
#define pb push_back
#define all(v) v.begin... |
#include<iostream>
#include <stdio.h>
#include<cmath>
#include <bits/stdc++.h>
using namespace std;
int check(int d,int h,int d0,int h0){
int a,b;
if(d%2==1){
a=d/2+1;
}
else{
a=d/2;
}
if(h%2==1){
b=h/2+1;
}
else{
b=h/2;
}
if(d0>a || h0<b){
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace std;
template<clas... |
//khodaya khodet komak kon
# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <pii, int> ppi... | #include<bits/stdc++.h>
template <typename _Tp>void read(_Tp &x){
char ch(getchar());bool f(false);while(!isdigit(ch))f|=ch==45,ch=getchar();
x=ch&15,ch=getchar();while(isdigit(ch))x=x*10+(ch&15),ch=getchar();
if(f)x=-x;
}
template <typename _Tp,typename... Args>void read(_Tp &t,Args &...args){read(t);read(args...);... |
#include <bits/stdc++.h>
#define X first
#define Y second
using namespace std;
typedef long long llint;
const int maxn = 2e5+10;
const int base = 31337;
const int mod = 1e9+7;
const llint inf = (1LL << 60);
const int logo = 18;
const int off = 1 << logo;
const int treesiz = off << 1;
int n, m;
llint niz[maxn];
llint... | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; retu... |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <bitset>
#include <vector>
using namespace std;
const int N = 1e5;
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif
int t;
cin >> t;
string atcoder = "atcoder";
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
string s;
cin >> s;
string at = "atcoder";
int ans = 1e9;
int acc = 0;
for (int i = 0; i < at.size(); ++i) {
int posx = -1, posy = -1;
for (int j... |
#include <bits/stdc++.h>
using namespace std;
int main() {
/*very unique*/
int A,B;
cin>>A>>B;
cout<<max(A/100+(A%100)/10+A%10,B/100+(B%100)/10+B%10)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int a, b;
//string s;
//vector<int> a;
//vector<int> b;
int main(){
cin >> a >> b;
if(a == b) cout << a << endl;
else if((a == 0 && b == 1) || (a == 1 && b == 0)) cout << 2 << endl;
else if((a == 1 && b == 2) || (a == 2 && b == 1)) cout << 0 << endl;
e... |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int lo = 1000000000, hi = 1;
vector<vector<int>> a(n, vector<int>(5));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 5; j++) {
cin >> a[i][j];
lo = min(lo, a[i][j]);
hi = max(hi, a[i][j]);
... | /*
* @Author: AsilenceBTF
* @LastEditTime: 2020-11-02 19:30:56
*/
#include<bits/stdc++.h>
#define sz(x) int(x.size())
#define ALL(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
const int N = 105;
const double eps = 1e-8;
int x[N], y[N];
int sgn(double x){
if(fabs(x) < eps) return 0;
if(x < ... |
#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>;
// BFS
int main(void){
int n, m;
cin >> n >> m;
vector<vector<int>> to(n);
rep(i,m) {
int a, b;
cin >> a >> b;
--a; --b;
to[a].pu... | #include<bits/stdc++.h>
using namespace std;
vector<int>graph[3000];
bool visited[3000];
long long int dfs(int index){
visited[index] = true;
int cnt = 1;
for (auto i:graph[index])
if (!visited[i])
cnt+=dfs(i);
return cnt;
}
int main(){
int n,m;
cin>>n>>m;
for (int i... |
////////////////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
namespace my {
/*汎用*/
template <typename T>
void input_vec(vector<T> &a, ll n) {
assert(a.empty());
for (ll i = 0; i < n; i++) {
T tmp;
cin >> tmp;
a.push_back(tm... | #include<bits/stdc++.h>
#include <iostream>
using namespace std;
int main()
{
#ifdef LOCAL_EXEC
#else
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#endif // LOCAL_EXEC
long long int n,i,j,k,x=0,y,z,sum=0;
cin>>n>>k;
long long int cnt[n+1]={0};
for(i=1;i<=n;i++){
cin>>x;... |
#include <bits/stdc++.h>
#define int long long
#define double long double
#define ff first
#define ss second
#define endl '\n'
#define ii pair<int, int>
#define mp make_pair
#define mt make_tuple
#define DESYNC \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.ti... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,m;
int vdnsddglkdk;
cin>>n>>m;
vector<pair<int,int>>a(m);
for(int i=0;i<m;i++)
{
cin>>a[i].first>>a[i].second;
}
int k;
cin>>k;
vector<pair<int,int>>b(k);
for(int j=0;j<k;j++)
{
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
return (ull)rng() % B;
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<vector<int>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template<class T> bool chmin(T& a,T b){if(a>b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b){if(a<b) {a = b; return true;} return fa... |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<queue>
#include<cstring>
#include<map>
#include<cmath>
#include<iomanip>
#include<set>
#include<stack>
#include<fstream>
#define inf 2147483647
constexpr int Mod = 998244353;
using namespace std;
long long A, B, C;
int main() {
cin >> A >> ... | #define DEBUG 0
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define eb emplace_back
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i, begin, end) for(int i = int(begin); i < int(end); i++)
#define UNIQUE(x) sort(all(x)), x.e... |
#include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
template <class T>
inline void chmin(T &a, const T &b) { a = min(a, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
bool comp(string a, string b)
{
string l = a+b;
string m = b+a;
if(l>m)
{
return true;
}
else
return false;
}
int main()
{
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
int cnt[... |
#include<bits/stdc++.h>
using namespace std;
int n,k;
char s[500];
inline char check(char a,char b){
if(a=='R'&&b=='S')
return a;
if(a=='P'&&b=='R')
return a;
if(a=='S'&&b=='P')
return a;
return b;
}
int main(){
scanf("%d%d",&n,&k);
scanf("%s",s+1);
for(int i=1;i<=k;++i){
for(int j=1;j<=n;++j)
s[j+n]... | #include<bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=1;i<=n;i++)
typedef int t;
int d[100010];
int main(){
int a,b,c;
cin>>a>>b>>c;
if(c%2==0){
a=abs(a);
b=abs(b);
}
cout<<(a<b? '<':a>b? '>':'=');
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define fi first
#define se second
#define ll long long
#define tp top()
#define fr front()
#define vi vect... | #include <cstdio>
#include <cstring>
typedef long long ll;
const int N=300005;
int n,a[N];
ll res;
struct BIT
{
int tr[N],r;
void add(int x){for(++x;x<=n;x+=x&-x)tr[x]++;}
int ask(int x){r=0;for(++x;x;x&=x-1)r+=tr[x];return r;}
}fw;
int main()
{
scanf("%d",&n);
for(int i=0;i<n;i++)
{
... |
// Author : Sarthak Kapoor
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int ll
#define rep(i,n) for(int i=0;i<n;++i)
#define repa(i,a,n) for(int i=a;i<n;++i)
#define repr(i,n) for(int i=n-1;i>=0;--i)
#define ll long long
#define pi pair<int,in... | #include <cstdio>
#define DIV 10000LL
using namespace std;
typedef long long LL;
LL x, y, R;
inline LL read()
{
// Returns: input * 10000.
LL res = 0LL;
int num = 0;
bool flag = false, negative = false;
for(char c=getchar(); c != ' ' && c != '\n'; c=getchar())
{
if(c == '-') negative = true;
else if(c == '... |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace __gnu_pbds;
using namespace std;
using ld = long double;
using ll = long long;
int n, m, q, x[200001], y[200001];
pair<int, int> op[200... | #include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
#define rep(i,m,n) for(int (i)=(m);(i)<(n);++(i))
#define rrep(i,m,n) for(int (i)=(n)-1;(i)>=(m);--(i))
#define all(x) (x).begin(),(x).end()
... |
#include<bits/stdc++.h>
#define pb push_back
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long
#define LL long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define f first
#define s second
#define int long long
#define sz(x) (ll)(x.size())
using namespace std;
const... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... |
/*
JAI JAGANNATH!
*/
//@Author : zanj0
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ff first
#define ss second
#define pb push_back
#define MOD 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(... | #include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007LL
#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 SHIFT(n) (1LL<<((ll)n))
#define ALL(a) (a).begin(),(a).end()
#define Max(a) (*max_eleme... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,m,n) for (int i = (m); i < (n); ++i)
#define rrep(i,n) for (int i = (n)-1; i >= 0; --i)
#define RREP(i,m,n) for (int i = (n)-1; i >= (m); ++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespac... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define mem(x,y) meset(x,y,sizeof(x))
ll len = 1e10;
string pat = "110";
int main()
{
ll i,j,k,s,d,r,m,n,l;
cin>>n;
string line;
cin>>line;
if(n==1)
{
if(line=... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(lli i = a; i < b; i++)
#define lli long long int
#define ld long double
#define all(v) v.begin(), v.end()
#define hell 1000000000000000
#define pb push_back
#define pf push_front
#define vi vector<lli>
#define vip vector<pair<lli, lli>>
#define F fi... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(M);
for (int i = 0; i < N; i++) cin >> A.at(i);
for (int i = 0; i < M; i++) cin >> B.at(i);
vector<vector<int>> DP(N + 1, vector<int>(M + 1));
for (int i = 0; i <= N; i++) {
for (int j = 0; j <=... | #include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
#define lli long long int
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define pll pair<lli,lli>
#define ve vector<lli>
#define ve... |
//#define _GLIBCXX_DEBUG
//#include "atcoder/all"
//using namespace atcoder;
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define Dump(x) \
if (dbg) { \
cerr << #x << " = " <<... | // Problem: F - Range Xor Query
// Contest: AtCoder - AtCoder Beginner Contest 185
// URL: https://atcoder.jp/contests/abc185/tasks/abc185_f
// Memory Limit: 1024 MB
// Time Limit: 3000 ms
//
// Author: masked_huh
// Created: 13/12/2020 18:24
/*Success isn't permanent, failure isn't fatal,
it's the courage to continu... |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int MOD = (int)1e9 + 7;
const int NS = (int)104;
int N, k;
char s[NS];
char dlr[NS][NS];
char dp[NS][NS][NS];
int tpow[NS];
char get(char A, char B){
if(A == B){
return A;
}
if(A == 'R' && B == 'S') return A;
if(A == 'P... | /*
@author : ashnove
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define lld long double
#define F first
#define S second
#define Th third
#define endl "\n"
#define nl cout<<endl;
#define pb push_back
#define f(i,a,b) for(ll i=a;i<b;i++)
#define what_is(x) cerr << #x << " is " << x <... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_bac... |
#include <bits/stdc++.h>
#define DAU ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC exit(0);
using namespace std;
const int dx[] {1, -1, 0, 0};
const int dy[] {0, 0, 1, -1};
char mat[2002][2002];
int dp[2002][2002], n, m, x, y, xv, yv;
pair<int, int> stop, curr;
vector<pair<int, int>> telep[3... |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
//const int MAX=INT_MAX;
const ll MAX=100000000000;
const int mod = 1000000007;
//const int mod = 998244353;
int main(){
int N;
cin>>N;
ll T;
cin>>T;
vector<ll> A(N);
for(int i=0;i<N;i++){
cin>>A[i];
}
i... | #include <algorithm>
#include <iostream>
int n, t, ans, a[45];
long long suf[45];
void dfs(int k, long long sum) {
if(k > n) return;
if(t - sum > ans)
ans = t - sum;
else if(t - sum + suf[k + 1] <= ans)
return;
if(!sum) {
printf("%lld", t);
exit(0);
}
if(sum - a[k + 1] >= 0) dfs(k + 1, sum - a[k + 1]);
d... |
#include <bits/stdc++.h>
const long long base = 2000000000ll;
const long long ten[6] = {1ll, 10ll, 100ll, 1000ll, 10000ll, 100000ll};
using namespace std;
long long str2ll(string str) {
long long ret = 0;
bool fp = false;
int f = 0;
for (int i = 0; i < (int)str.size(); i++) {
if (str[i] == '-') contin... | #include <bits/stdc++.h>
#define fr first
#define sc second
#define mk make_pair
#define pb push_back
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
const int inf = 1e9 + 7;
const int N = 1e6 + 5;
void solve() {
ll b, c, ans = 1;
cin... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N = 0;
long long cnt = 0;
long long cmb = 0;
cin >> N;
vector<long long> A(N);
vector<long long> B(N);
for(int i=0; i<N; i++){
cin >> A.at(i);
B.at(i) = A.at(i) % 200;
}
for(int j=0; j<200; j++){
cmb = 0;
for(int i... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author NikuKyabe
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define asort(a,n) sort(a,a+n)
#define vsort(v) sort(v.begin(),v.end())
#define all(v) v.begin(),v.end()
#define run ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0);
#define mod 10000000... | #include<iostream>
#include<utility>
#include<vector>
#include<climits>
#include<set>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
char ch1,ch2,ch3;
cin>>ch1>>ch2>>ch3;
if(ch1==ch2 && ch1==ch3) cout<<"Won\n";
else cout<<"Lost\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
void solve(long long N){
cout << ((N - 1) / 100) + 1 << endl;
}
int main(){
long long N;
scanf("%lld",&N);
solve(N);
return 0;
}
| #include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pb push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
const int MOD = 1000000007;
#define PI = acos(-1)
using namespace std ;
int main(){
fastio ;
int n ;
cin >> n ;
int ans = n/100;
if(n % 100... |
#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;
using TLT = tuple<long long, long long, long long>;
//{a, b} -> {g, x, y} : ax+by=g=gcd(a,b)
TLT extgcd(const long long a, const long long b) {
if (b == 0) return make_tuple(a, 1, 0);
else {
TLT ret = extgcd(b, a%b);
return make_tuple(get<0>(ret), ... |
#include<bits/stdc++.h>
using namespace std;
vector<int> a(10,0),b(10.0),c(10,0);
int f(int i){
int S=0;
for(int j=1;j<=9;j++){
if(j!=i) S+=j*(int)pow(10,b.at(j));
else S+=j*(int)pow(10,b.at(j)+1);
}
return S;
}
int g(int i){
int S=0;
for(int j=1;j<=9;j++){
if(j!=i) S... | #include <iostream>
#include <vector>
#include <numeric>
using namespace std;
using ll = int64_t;
ll score(string S){
vector<ll> cnt(10);
iota(cnt.begin(), cnt.end(), 0);
for(char c : S) cnt[c - '0'] *= 10;
return accumulate(cnt.begin(), cnt.end(), 0);
}
int main(){
ll K;
string S, T;
cin >... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define x first
#define y second
#define bg begin()
#define ed end()
#define pb push_back
#define mp make_pair
#define sz(a) int((a).size())
#define R(i,n) for(int i(0);i<(n);++i)
#define L(i,n) for(int i((n)-1);i>=0;--i)
const int i... | #include<bits/stdc++.h>
#define pb push_back
#define pf push_front
#define in insert
#define ff first
#define ss second
#define int long long
#define rep(i,x,m) for(int i=x;i<m;i++)
#define MOD 1000000007
#define endl "\n"
#define all(v) ... |
#include<bits/stdc++.h>
#define print(x) cout << (#x) << ": " << (x) << endl
#define p1d(x) cout << (#x) << ": ["; for(auto& zz: x) cout << zz << " "; cout << "]\n"
#define p2d(x) cout << (#x) << ": \n["; for(auto& vec: x) {for(auto& v: vec) cout << v << " "; cout << ",\n";}
#define p2s(x) cout << (#x) << ": ["; for(au... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define endl "\n"
int main()
{
fastio;
int n,a;
cin>> n;
vector <int> v;
list <int> lst;
while(n!=0)
{
cin>> a;
v.push_back(a);
lst.push_back(a)... |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, N) for(int i = 0; i < N; ++i)
void solve(std::string S){
reverse(S.begin(), S.end());
rep(i, S.size()){
char w = S[i];
if(w == '0' or w == '1' or w == '8'){
cout << w;
continue;
}
if(w == '9'){
... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
S = regex_replace(S, regex("6"), "5");
S = regex_replace(S, regex("9"), "6");
S = regex_replace(S, regex("5"), "9");
string S_reversed (S.rbegin(), S.rend());
cout << S_reversed << endl;
} |
#include<iostream>
#include<algorithm>
using namespace std;
long long n,a[200010],b[200010],p[200010],k,ans,m;
long long f[200010];
int main(){
cin >> n;
for(int i=1;i<=n;i++)
{
cin >>a[i];
p[i]=max(a[i],p[i-1]);}
f[1]=2*a[1];b[1]=f[1];
for(int i=2;i<=n;i++)
{
f[i]=a[i]+i*(p[i]-p[i-1])+b[i-1]+f[i-1];
b[i]... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repa(i,a,n) for (long long i = (a); i < (long long)(n); i++)
#define Rrep(i,n) for (long long i = (long long)(n)-1; i >= 0; i--)
#define Rrepa(i,a,n) for (long long i = (long l... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (long long i = 0; i < (n); i++)
using ll = long long;
using P = pair<ll, ll>;
template<class T>
bool chmax(T &a, T b) {if (a < b) {a = b;return true;}else return false;}
template<class T>
bool chmin(T &a, T b) {if (a > b) {a = b;return true;}else retu... | #include <bits/stdc++.h>//For vectors,pairs
using namespace std;
#define ll long long
#define rep(i,j,n) for(int i=j;i<n;i++)
#define _rep(i,n) for(int i=n;i>=0;i--)
void solve();
void cp(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("error.txt", "w", stderr);
freopen("output.txt... |
// 2020-11-28 21:00:40
// clang-format off
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i =... | // Template
#include "bits/stdc++.h"
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (int i = (int)(n) - 1; i >= 0... |
//*******Abhijit Burman***********//
//Jalpaiguri Government Engineering College//
// Taken From Striver_79
// Never open a ranklist untill and unless you are done with solving problems, wastes 3/4 minuts
// Donot treat CP as a placement thing, love it and enjoy it, you will succeed for sure.
#include<bits/stdc++.... | #include<bits/stdc++.h>
using namespace std;
long long n,ans=1;
int main() {
scanf("%lld",&n);
for (int i=1;i<=n;++i) {
char str[11];
scanf("%s",&str);
if (str[0]=='O') ans+=1LL<<i;
}
printf("%lld",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y)... | #include <bits/stdc++.h>
#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>
//#include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//namespace mp = boost::multiprecision;
//using Bll = mp::cpp_int;
using namespace std;
#define ll long long
#define rep(i, m, n) for (ll i = m; i < n; i++)
#d... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
long long a,b,c,d;
long long ans=0;
cin >> a >> b >> c >> d;
ans=(a*d)-(b*c);
cout << ans << endl;
return 0;
} |
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2")
#include <iostream>
#include <iomanip>
constexpr int HeighestDim = 505000;
int n, m, k;
long long int res[101];
int dim_a = 0, dim_b = 0;
int A[HeighestDim + 1], B[HeighestDim];
void mult_a(int v){
for(int i = dim_a, j = i - v; j >= 0; --i, --... | # include <bits/stdc++.h>
#define rep(i,l,r)for(int i=(l);i<(r);i++)
# define rrep(i,r,l) for(int i=(r); i>=l; --i)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define optimize_cin() cin.tie(0); ios::sync_with_stdio(false)
using namespace std;
typedef long long lint;
t... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
if(n <= 6){
cout << n << endl;
return 0;
}
int sum = 0;
for(int i = 7; i <= n; i++){
int x = i;
int dif = 0;
do{
if(x % 10 ... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define x first
#define y second
#define pb push_back
#define mp make_pair
#defi... |
#include<stdio.h>
int main(){
int t;
scanf("%d",&t);
long long l[20000];
long long r[20000];
for(int i=0;i<t;i++){
scanf("%ld%ld",&l[i],&r[i]);
}
for(int i=0;i<t;i++){
long long ll=l[i];
long long rr=r[i];
if(!(rr-ll>=ll&&rr-ll<=rr))printf("0\n");
else if(ll!=rr)printf("%ld\n",(rr-ll*... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vect... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#pragma region DEBUG
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef
tree<
pair<int,int>,
null_type,
less<pair<int,int>>,
rb_tree_tag,
tree_order_statistics_node_update>
o... |
/*Remember me,
shall you deny,
death will reply*/
#include <iostream>
#include<vector>
#define pb push_back
#define f first
#define s second
using namespace std;
typedef long long int ll;
ll ncr(ll n,ll r)
{
ll num=1;
for(ll i=2;i<=n;i++)
num*=i;
ll den1=1,den2=1;
for(ll i=2;i<=r;i++)
... | // give up
#include <bitset>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <valarray>
// alias, using declaration
using llint = long long; using ldouble = long double;
template <class T = llint> using ... |
#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>>;
using graph = vector<VI>;
template<class T = ll> using w_graph = vector<vector<pair... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 998244353;
typedef long lon... |
#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 = 1; i <= (n); i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define vi vector<int>
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T>... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll n,m,t;
cin>>n>>m>>t;
ll batt=n;
ll a[1001]={0},b[1001]={0};
for(int i=1;i<=m;i++)
{
cin>>a[i]>>b[i];
}
a[0]=0;
b[0]=0;
batt-=(a[1]);
if(batt<=0)
{
cout<<"No"<<endl;
return 0;
}
for(int i=1;i<m;i++)
{
batt+=(b[i... |
#include <bits/stdc++.h>
#define pb push_back
#define sz size()
#define all(c) (c).begin(), (c).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MOD = 1e9 + 7;
const int maxn = 5e5 + 7;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
v... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<cmath>
#include<iomanip>
#define pi 3.14159265358979323846
#define mod 1000000007
#define int long long
#define elif else if
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
signed main(){... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int i,j,k,m,t,n,a[10],b[10],p10[10]={1,10,100,1000,10000,100000,1000000,10000000};
double p,res,r[15];
string sb;
void chk(int x,int y){
int tmp1=0,tmp2=0,i,j,k,c[15]={0},d[15]={0};
for(i=1;i<=5;i++){
c[a[i]]++;
d[b[i]]++;
}
for(i=1;i<=9;i++)... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (... |
#include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define SIZE(x) ((ll)(x).size())
#define ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define T third
#define endl '\n'
#define f0(i,n) for(int i=0;i<n;i++)
#define f1(i,n) for(int i=1;i<=n;i++)
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<char>... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
using namespace std;
using vi = vector<int>;
vi pf(int x) {
vi r;
for (int i = 2; i * i <= x; i++) {
if (x % i == 0) {
r.push_back(i);
while (x % i == 0) {
x /= i;
}
... | #include <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
#define V vector
#de... |
#include "bits/stdc++.h"
using namespace std;
// 定義
typedef long long ll;
typedef pair<ll, ll> P;
#define ALL(x) (x).begin(),(x).end()
#define REP(i, n) for(ll i = 0 ; i < (ll)n ; ++i)
#define REPN(i, m, n) for(ll i = m ; i < (ll)n ; ++i)
#define VL vector<ll>
#define... | #include<bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define MP make_pair
#define PB emplace_back
using namespace std;
const int MAX_N = 100001;
int C[MAX_N], D[MAX_N];
vector<pair<int, int>> e[MAX_N];
long long dis[MAX_N];
long long f(long long v, int eid) {
int sq = sqrt(D[eid]+(long double)0.1);
while(sq ... |
#include<bits/stdc++.h>
using namespace std;
int adj[30][30];
int main() {
cout.tie(nullptr)->sync_with_stdio(false);
int N; cin >> N;
vector<tuple<int, int, int>> points(N);
for (int i = 0; i < N; ++i) {
int a, b, c; cin >> a >> b >> c;
--a, --b, --c;
points[i] = make_tuple(a,... | //@formatter:off
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define rrep(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep2(i,s,n) for (int i = int(s); i < int(n); ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#de... |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#include <cassert>
#include <random>
#include ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fs first
#define sc second
#define ll long long
// svarið er bara hversu mörg mismunandi gcd getum við búið til sem eru minni en
// eða jöfn minnstu tölunni í upprunalega listanum.
// generally hversu mörg mismunandi g... |
#include"bits/stdc++.h"
using namespace std;
using ll=long long;
template<class T=ll>inline T in(istream&is=cin){T ret;is>>ret;return ret;}
template<class T,class Size=typename vector<T>::size_type>inline auto vector_2d(Size h,Size w,T v){return vector<vector<T>>(h,vector<T>(w,v));}
template<class P>struct comp_pair_by... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 2100005
ll fact[SIZE],inv_fact[SIZE];
ll mod_pow(ll x,ll count, ll mo... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI acos(-1)
#define vi vector<int>
const int kMod = 1e9 + 7;
const int kInf = (~(1 << 31)) / 2 - 500;
const ll kInfL = (~(1LL << 63)) / 2 - 2000;
int main() {
vector<int> A(3);
for (int i = 0; i < 3; ++i) {
cin >> A[i];
}
sort(A.beg... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#ifdef TRACE
#include "../trace.h"
#else
#define trace(args...)
#endif
typedef long long ll;
typedef long double ld;
typedef vector<ll> vl; typedef vector<int> vi;
typedef vector<vl> vvl; typed... |
/* Author : Rohan Tirkey */
/* IIITA */
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fl(i,l,r) for(int i=l ; i<=r ; i++)
#define flr(i,r,l) for(int i=r;i>=l;i--)
#define pb push_back
#define mp make_pair
#define F ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<long double> vd;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<pair<ll,ll>> vp;
#define int ll
#define PB push_back
#define pb pop_back
#define in insert
#define endl "\n"
#define MP make_p... |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using ll = long long;
using vl = vector<long long>;
using vi = vector<int>;
int main(){
ll n; cin >> n;
ll ans = 0;
if(n > 999) ans += (n-999);
if(n > 999999) ans += (n-999999);
if(n > 999999999) ans += (n-999999999);
if(n > ... | #include<bits/stdc++.h>
#define fio ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
int main()
{
fio;
long long n;
cin>>n;
long long sum=0;
long long i=0;
while(sum<n)
{
i++;
sum=sum+i;
}
cout<<i;
} |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <queue>
#define LL long long
#define PII pair<int,int>
#define x first
#define y second
using namespace std;
constexp... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 100005
struct Info{
Info(){
len = value = 0;
}
Info(ll arg_len,ll ... |
#include<bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
using namespace std;
inline int read(){
int res=0;
bool zf=0;
char c;
while(((c=getchar())<'0'||c>'9')&&c!='-');
if(c=='-')zf=1;
else res=c-'0';
while((c=getchar())>='0'&&c<='9')res=(res<<3)+(res<<1)+c-'0';
if(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
int main() {
int x, y, z; cin >> x >> y;
if(x == 0) {
if(y == 0) z = 0;
if(y == 1) z = 2;
if(y == 2) z = 1;
}
if(x == 1) {
if(y == 0) z = 2;
... |
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
cout<<N-1;
} | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all> // g++ main.cpp -std=c++17 -I .
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(), (v).end()
template<class T,class U> inline bool chmin(T&x,U y){if(x>y){x=y;return... |
#include<bits/stdc++.h>
const int maxn=65536+5;
using namespace std;
int p[maxn];
int al(int n){
int ans=1;
while(n--){
ans=ans*2;
}
return ans;
}
int main(){
int n;
cin>>n;
int nn=al(n);
int a,aa=0,b,bb=0;
for(int i=1;i<=nn/2;i++){
cin>>p[i];
if(p[i]>aa){
a=i;
aa=p[i];
}
}
for(int i=nn/2+1... | #include <bits/stdc++.h>
using namespace std;
int FindIndex(vector<int> v, int val)
{
int index = 0;
int i = 0;
bool found = false;
while(!found && i < v.size())
{
if (v[i] == val)
{
index = i;
found = true;
}
i++;
}
return index + ... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int n;
cin >> n;
string s;
cin >> s;
int q;
cin >> q;
vector<vect... | #include <bits/stdc++.h>
using namespace std;
//#define kk
#define int long long
#define mat vector<vector<int>>
#define vi vector<int>
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define pi pair<int, int>
#define inf 1000000000
#define mod 998244353
#define endl "\n"
const ll INF=1e... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int L;
cin >> L;
unordered_map<int, int> mp;
for (int i = 0; i < 11; i++) {
int n = L - 12 + 11 - i;
for (int k = 2; k * k <= n; k++) {
while (n % k == 0) {
mp[k]++;
n /= k;
... | #include <iostream>
using namespace std;
const int N = 300, R = 20;
long long com[N][R];
long long combi(int n, int r) {
if(com[n][r]!=0) return com[n][r];
if(n==r) return com[n][r] = 1;
if(r==0) return com[n][r] = 1;
return com[n][r] = combi(n-1,r) + combi(n-1,r-1);
}
int main() {
int l;
cin... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define sz(x) ((int)(x.size()))
#define all(x) (x).begin(), (x).end()
#define rep(i, l, r) for(int i = (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kein Yukiyoshi
*/
// clang-format off
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#define int long long
using namespace std;
#define stoi stoll
#define fi first
#define se secon... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define Rep(i,j,n) for(int i = j; i < (int)(n); i++)
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main(){
ll a,b,c;
cin >> a >> b >>... |
#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 (a > b) { a = b; return 1; } return ... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> par;
vector<int> siz;
UnionFind(int N) : par(N),siz(N) {
for (int i=0; i<N; i++) {
par[i]=i,siz[i]=1;
}
}
int root(int x) {
if (par[x]==x) return x;
return par[x]=root(par[x]);
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H;
int W;
cin >> H >> W;
vector<vector<char>> data(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> data.at(i).at(j);
}
}
int a = 0;
int b = 0;
for (int i = 0; i < H-1; i++) {
for (int... | #include<bits/stdc++.h>
using namespace std;
long long int n,k,cnt=0;
struct name
{
long long int bianhao;
long long int x;
}num[200005];
bool cmp(name a,name b)
{
return a.bianhao<b.bianhao;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
cin>>n>>k;
for(int i=0;i<n;i++)... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s, t;
cin >> s >> t;
if(s == "Y") transform(t.begin(), t.end(), t.begin(), ::toupper);
cout << t << "\n";
retu... | #include<iostream>
#include<vector>
#include<chrono>
#include<iomanip>
#include<set>
#include<algorithm>
#include<bitset>
#define int long long
#define fi first
#define se second
using namespace std;
const int MAXN = 205;
const int MOD = 1e9 + 7;
//const int INF = 1e18;
struct custom_hash {
static uint64_t spli... |
#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... | #include<stdio.h>
int main(){
long int n, q, a[100005], k[100005];
scanf("%ld %ld", &n, &q);
for(int i = 0; i < n; i++){
scanf("%ld", &a[i]);
a[i] -= i;
}
for(int i = 0; i < q; i++){
scanf("%ld", &k[i]);
}
long int mid, left, right;
for(int i = 0; i < q; i++){
left = -1;
ri... |
#include<bits/stdc++.h>
using namespace std;
vector<vector<int>> tree, depths;
vector<pair<int,int>> times;
int t = 0;
void dfs(int root, int depth) {
times[root].first = t;
depths[depth].push_back(t++);
for (auto v: tree[root]) {
dfs(v, depth + 1);
}
times[root].second = t++;
}
int main() {... | #include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define vll vector<int>
#define pii pair<int,int>
#define pb push_back
#define sz(v) (int)(v).size()
#define inf 1e18
#define md 1000000007
#define all(v) (v).begin(),(v).end()
#define rep(i,a,b) for(int i=a;i<b;++i)
using namespace std;
c... |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cstring>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
const int INF=0x7fffffff;
const int eps=1e-7;
const long long mod=1e9+7;
const int maxn=210000;
int n,m,x[max... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#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(x... |
//#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <string>
#include <string.h>
#include <assert.h>
#include <math.h>
#include <numeric>
#include <cmath>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <lim... | #pragma region Macros
#include <bits/stdc++.h>
#if defined(LOCAL) || defined(ONLINE_JUDGE) || defined(_DEBUG)
#include <atcoder/all>
#endif
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i=(n); i>=0; --i)
#define FOR(i, n, m) for(int i=(m), i##_len=(n); i<i##... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define db double
#define pb push_back
#define all(x) begin(x), end(x)
#define SZ(x) (int)(x).size()
#define cps(x) sort(all(x)), (x).erase(unique(all(x)), end(x))
#define cps2(x, y) sort(all(x), y), (x).erase(unique(all(x)), end(... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <unordered_map>
#include <vector>
#include <queue>
#include<deque>
using namespace std;
const int mod = 1e9 + 7;
typedef long long LL;
int ans[110] = {1,2,3,3,1,3,2,2,1,2,1,1,1,3,1,1};
int f[1010];
int b[1010];
int n;
void solve()
... |
#include<bits/stdc++.h>
using namespace std;
int p[20]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47},cnt=15;
int n,pos[50],a;
long long ans=2e18;
int main()
{
scanf("%d",&n);
for(int t=1;t<=n;++t) {
scanf("%d",&a);
for(int i=0;i<cnt;++i) if(a%p[i]==0) pos[t]|=(1<<i);
}
for(int i=0;i<(1<<c... | #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... |
#include<bits/stdc++.h>
using namespace std;
int ans = 0;
int H,W;
char field[100][100];
void cal(int x, int y){
//上
if(x >= 0 && y-1>=0 && x<W && y-1<H){
if(field[y-1][x] == '.'){
ans++;
}
}
//右
if(x+1 >= 0 && y>=0 && x+1<W && y<H){
if(field[y][x+1] == '.'){... | #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#define ordered_set tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
//#define int long long int
#define pb push_ba... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> v,T a){return lower_bound(v.begin(),v.end(),a)-v.b... | #include <bits/stdc++.h>
using namespace std;
typedef signed char i8;
typedef signed short i16;
typedef signed int i32;
typedef signed long long i64;
typedef unsigned char u8;
typedef unsigned short u16;
typedef unsigned int u32;
typedef unsigned long long u64;
typedef float f32;
typedef double f64;
u32 XOR(u32 a,u3... |
#include<cstdio>
#include<cstring>
#define N 300001
#define mod 1000000007
using namespace std;
char ch1[N],ch[N];
int k,cnt[N],lim[N];
long long pre[N],answer[N],qz[17][N],c[17][17];
bool bo[N];
long long C(int n,int m)
{
return c[n][m];
}
int main()
{
scanf("%s",ch1+1);
scanf("%d",&k);
int p=strlen(ch1+1);
c[0][... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Pint pair<int,int>
#define Pll pair<ll,ll>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
... |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
int main... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++);
using i64=int64_t ;
int main() {
i64 b, c;
cin >> b >> c;
i64 ans;
if(c==0) {
ans=1;
}
if(c!=0 && b==0) {
ans=c;
}
if(0<c && c<=2 && b!=0) {
ans=c+1;
}
if(3<=c && b!=0 ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using lp = pair<ll, ll>;
using lmap = map<int, int>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
#define debug(x) cerr << #x << ": " << x << '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define sf(x) scanf("%d",&x)
#define sfl(x) scanf("%lld",&x)
#define pf(x) printf("%d\n",x)
#define pfl(x) printf("%lld\n",x)
#define endl '\n'
#defin... |
#include <bits/stdc++.h>
using namespace std;
#define M1 1000000007
#define M2 998244353
#define INF 1e18
#define ll long long
#define pll pair<ll,ll>
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define REPR(i,a,b) for(ll i=b-1;i>=a;i--)
#define forr(i,n) for(ll i=0;i<n;i++)
#define F first
#define S second
#define pb pus... | #include"bits/stdc++.h"
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr)
#define i64 int64_t
#define deb(x) cout<<"["<<#x<<"="<<x<<"]"<<"\n"
#define pb push_back
int main()
{
fast;
i64 a,b;
cin>>a>>b;
for(i64 i = 1;i<=(sqrt(b));++i)
{
// deb(i)// deb(j);
i64 j = (b/i);
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.