code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include<bits/stdc++.h>
using namespace std;
int main(){
int s=100;vector<int>v(4);
for(int i=0;i<4;i++){
cin>>v[i];
if(s>v[i])s=v[i];
}
cout<<s<<endl;
}
| #include<bits/stdc++.h>
#define ll long long
#define eb emplace_back
using namespace std;
const int mx= 1e3 + 10;
void solve(){
int a, b , c , d;
cin >> a >> b >> c >> d;
cout << min(a, min(c , min(b,d)));
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
//cin>>t;
t=1;
... |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long double ld;
#define int long long
#define pb push_back
#define mk make_pair
#define MOD 1000000007
#define vii vector<int>
#define pii pair<int,int>
#define piii pair<int, pii>
#define yes cout<<"YES\n";
#define no cout<<"NO\n... | ///* ***Bismillahir Rahmanir Rahim*** */
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dl;
typedef unsigned long long ull;
#define pb push_back
#define PB pop_back
#define nn "\n"
#define O_O \
ios_base::sync_with_stdio(false); \
cin.tie(... |
#include <bits/stdc++.h>
using namespace std;
using lli = long long int;
using ii = pair<int, int>;
const int MAXN = 500;
int r, c;
int a[MAXN+1][MAXN];
int b[MAXN][MAXN+1];
int cost[MAXN+1][MAXN+1];
int dijkstra() {
memset(cost, -1, sizeof(cost));
priority_queue<pair<int, ii>, vector<pair<int, ii>>, great... | //#pragma GCC optimize("O3")
//#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_... |
#include<bits/stdc++.h>
#include<string>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
//auto test
int main(){
ll N;
cin>>N;
for(ll i=1;;i++){
if(stoll(to_string(i)+to_string(i))>N){
cout<<i-1<<endl;
return 0;
}
}
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll ,ll> pll;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(X) (X).begin(), (X).end()
#define REP(i,x,y) for(ll i = x;i <= y;++i)
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie... |
#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... | ///Bismillahir Rahmanir Rahim
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;cin>>s;s+="################";
int ans=0;
for(int i=0;s[i]!='#';i++)ans+=s.substr(i,4)=="ZONe";
cout<<ans<<endl;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0;i<(int)(n);i++)
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
int main(){
int R,C;
cin >> R >> C;
vector<vector<char>> table(R, vector<char>(C));
vector<vector<int>> dist(R, vector<int>(C));
int sy, sx,... | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
int tesuu[2006][2006];
int used[1000];
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
string karifie[2006];
char fie[2006][2006];
int main(){
for(int i=0;i<2006;i++){
for(int j=0;j<2006;j++){
... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define mp make_pair
#define fr first
#define sc second
int main(){
ld x,y,rr;
cin>>x>>y>>rr;
x+=200100.;
y+=200100.;
ll X=10000*x+0.5;
ll Y=10000*y+0.5;
ll R=10000*rr+0.5;
ll ret... |
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define phi 3.1415926535
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
const ll mod = 1000000007;
ll tc, cnt = 0, number, many, t... | #include <bits/stdc++.h>
#define N 10005
const int mmax = 1e9;
using namespace std;
int a, b;
void process()
{
cin >> a >> b;
int x = (a-b)/2;
int y = (a+b)/2;
if (x-y == b) cout << x <<" "<<y;
else cout << y <<" "<< x;
}
int main()
{
//freopen("test.INP", "r", stdin);
process();
return ... |
#include <bits/stdc++.h>
using namespace std;
void center(vector<pair<int, int>>& points) {
int n = points.size();
pair<int, int> center(0, 0);
for (int i = 0; i < n; ++i) {
center.first += points[i].first;
center.second += points[i].second;
points[i].first *= n;
points[i].second *= n;
}
for... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> a(m), b(m);
for(int i = 0; i < m; i++) cin >> a[i] >> b[i];
int k, ans = 0;
cin >> k;
vector<int> c(k), d(k);
for(int i = 0; i < k; i++) cin >> c[i] >> d[i];
int k2 = 1 << k;
... |
#pragma region Region_1
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
using ll = long long;
using ... |
// Problem : D - Snuke Prime
// Contest : AtCoder - AtCoder Beginner Contest 188
// URL : https://atcoder.jp/contests/abc188/tasks/abc188_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
/*ヽ｀、ヽ｀｀、ヽ｀ヽ｀、、ヽ ｀ヽ 、ヽ｀🌙｀ヽヽ｀ヽ、ヽ｀
ヽ｀、ヽ｀｀、ヽ 、｀｀、 ｀、ヽ｀ 、｀ ヽ｀ヽ、ヽ ｀、... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a ,b, c;
cin >> a >> b >> c;
if(a%6==1){
a = 6;
}else if(a%6==2){
a = 5;
}else if(a%6==3){
a = 4;
}else if(a%6==4){
a = 3;
}else if(a%6==5){
a = 2;
}else if(a%6==0){
a = 1;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
int main(void)
{
ll a,b,c;
cin >> a >> b >>c;
cout << 7-a+7-b+7-c << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1LL << 60;
const int MOD = (int)1e9 + 7;
int main()
{
int n;
... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#ifdef ENABLE_DEBUG
#include <debug.h>
#else
#define DEBUG(...) do {} while (0)
#endif
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
... |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
#define debug(x) cout << #x << " is " << x << endl
#define inc(i, a, b) for (int i = a; i <= b; ++i)
typedef long long ll;
const int INF = 0x3f3f3f3f, N = 2005;
const int MOD = 1e9 + 7;
int n, m;
ll qp... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define x first
#define y second
#define FOR(i, m, n) for (ll i(m); i < n; i++)
#define DWN(i, m, n) for (ll i(m); i >= n; i--)
#define REP(i, n) FOR(i, 0, n)
#define DW(i, n) DWN(i, n, 0)
#define F(n) REP(i, n)
#define FF(n) REP... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) st... | #include<bits/stdc++.h>
#define pb emplace_back
#define AI(i) begin(i), end(i)
using namespace std;
using ll = long long;
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() {cerr << endl;}
template<class T1, class ...T2>
void kout (T1 v, T2 ...e) { cerr << v << ' ', kout(e...); }
temp... |
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << ... | #include <bits/stdc++.h>
#define For(i,l,r) for (register int i=l; i<=r; i++)
using namespace std;
typedef unsigned long long LL;
typedef signed long long ll;
template <typename T>
inline void read(T &x) {
char c = getchar(); int w = 1; x = 0;
while (!isdigit(c))
(c == '-') && (w = -w), c = getchar();
while (isdig... |
//Keep calm and carry on..
/* Problem :
URL :
Memory Limit: 1024 MB
Time Limit: 2000 ms
Powered by CP Editor (https://github.com/cpeditor/cpeditor)
*/
#include<bits/stdc++.h>
//#include <boost/math/common_factor.hpp>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typede... | #include<iostream>
#include<bits/stdc++.h>
#include<string>
#include<vector>
using namespace std;
using ll= long long;
int main()
{
string t;
cin>>t;
int count=0;
int n=t.length();
int k=stoi(t);
int flag=1;
for(int i=0;i<n;i++)
{
if(k%10==0)
{
count++;
... |
#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 <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
//#define ACL
#ifdef ACL
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#if __has_include("acl-all.h")
#include "acl-all.h" //on Wandbox
using namespace atcoder;
#endif
#endif //#ifdef ACL
typedef long... |
#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
#define int long long
#define endl "\n"
constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007;
struct fast_io {
fast_io(){
... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <random>
#include <bitset>
#include <numeric>
#include <cassert>
using namespace s... |
#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>
int main() {
std::string S, Y;
std::cin >> S >> Y;
if (S == "Y") {
Y[0] = std::toupper(Y[0]);
}
std::cout << Y << std::endl;
} |
#include <bits/stdc++.h>
const int N = 400010;
int n, C[3][3];
char str[N];
int Lucas(int n, int m) {
if (!n || !m) return 1;
return 1ll * Lucas(n / 3, m / 3) * C[n % 3][m % 3] % 3;
}
int main() {
scanf("%d", &n);
scanf("%s", str);
C[0][0] = 1;
C[1][0] = C[1][1] = 1;
C[2][0] = 1; C[2][1] = 2; C[2][2] = 1;
in... | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#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 fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).begin(), (x).end()
#define coy cout<<"Ye... |
#include <iostream>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
#include <unordered_map>
#include <numeric>
#define fore(i, l, r) for(int i = int(l); i < int(r); i++) //Python style baby
#define sz(a) int((a).size())
#define mp make_pair
#define pb push_back
#define vi vector<int>
#defi... | # include <bits/stdc++.h>
# pragma GCC optimize("Ofast")
# pragma GCC target("avx,avx2,fma")
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
int n;
int q;
cin >> n;
cin >> s;
cin >> q;
int t, a, b;
int start = 0;
while(q--){
... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
namespace IO{
inline char ch(){
static char s[1<<16],*S,*T;
return (S == T)&&(T = (S = s)+
fread(s,1,1<<16,stdin),S == T)?EOF:*S++;
}
template<typename T> void read(T &x){
x = 0; int f(1); char c = ch();
for(;!isdigit(c);c = ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... |
#include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define sz(a) a.size()
#define all(v) (v.begin(),v.end());
#define pb push_back
#define int long long
void solve() {
int n;
cin >> n;
vi v(n);
map<int, int> m;
rep(i, 0, n) {
cin >> v[i];
m[v[i]]++;
}
... | #include <bits/stdc++.h>
#include <bits/extc++.h>
#define sz(v) int (v.size())
#define ff first
#define ss second
#define pb push_back
#define int long long
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef long double ld;
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
templat... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll=long long;
using ld=long double;
using pll=pair<ll, ll>;
//using mint = modint1000000007;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo 2e18
template<typenam... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
const int M=1e5+5,P=1e9+7,base=269;
const long double e=1e-10;
inline int rd(){
int x=0;char c=getchar();
while(!isdigit(c))c=getchar();
while(isdigit(c))x=(x<<1)+(x<<3)+(c^48),c=getchar();
return x;
}
int K,n,m,p[M],ans[M];
long double A[M],B[M],C[... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
namespace math{
const int MOD = 1e9+7;
const int MN = 10'100;
int fact[MN], inv_fact[MN];
int power(int a, int n) {
int res = 1;
for (;n; n >>= 1, a = (a * a) % MOD) if (n & 1) res = (res * a) % MOD;
return res;
... | #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 <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <cmath>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using P = pair<int,int>... | /**
* \author KienNguyen246
* \date 01/06/2021
*/
///😭😢😞☹🙁😐🙂☺😊😁😀😆😂🤣
///----------------🤔🤔🤔 -----------------///
/**< 🤣🤣🤣 */
#include <bits/stdc++.h>
///TLE (in case of emergency)
#define TLE 0
#if TLE
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma ... |
/*
Saturday 29 May 2021 05:32:07 PM IST
@uthor::astrainL3gi0N
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef std::vector<int> vi;
typedef std::pair<int,int> ii;
typedef std::vector<ii> vii;
typedef std::vector<ll> vl;
#define pb push_back
#define mp make_pair
#define debg(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n, m) for (ll i = (n); i < (ll)(m); i++)
template <typename T>
vector<vector<T> > binomial_table(int N) {
vector<vector<T> > mat(N + 1, vector<T>(N + 1));
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= i; j++) {
if (... |
#include <bits/stdc++.h>
#define int long long
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint1000000007;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
constexpr int MOD = 998244353;
constexpr int INF = numeric_limits<int>::max() / 2;
typedef pair<int,int> P;
usi... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
#define F(type, i, a, b, incr) for (type i = a; i <= (type)(b); i += (type)(incr))
#define pb push_back
#define ppb pop_back
#define ff first
#define ss second
#define iter(it, s) for (auto it = s.begin(); it != s.end(); it++)
... |
#include <ctime>
#include <cmath>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#define inf 100010
#define INF 0x7fffffff
#define ll long long
template <class I>
inline void read(I &num){
num = 0; char c = getch... | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n, x;
cin>>n>>x;
x *= 100;
int res = 0;
int count = 1;
int ans = -1;
bool ok = false;
while(n--){
int a, b;
cin>>a>>b;
res += a * b;
if(res > x and !ok)ok = true, ans = count;
count++;
}
cout... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
if (a == b) {
for (int i=0; i<a; i++) {
int e_i = i+1;
cout << e_i << " " << -1*e_i ;
if (i != a-1) cout << " ";
}
} else {
int s = a > b ? 1 : -1;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, suma = 0;
cin >> a >> b;
for (int i = 0; i < a; i++)
{
cout << 1000000 - i << " ";
suma += 1000000 - i;
}
for (int i = 1; i < b; i++)
{
cout << -i << " ";
suma -= i;
}
cout << -sum... |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, init, end) ... | //*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<"... |
// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template<typename... T> void rd(T&... args) {((cin>>args), ...... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define endl '\n'
using namespace std;
const int mod = 998244353;
int add(int a, int b)
{
a += b;
if (a >= mod)
a -= mod;
return a;
}
int fast_pow(int x, int deg)
{
int ans = 1, y = x;
while (deg)
{
if (deg & 1)
... |
#include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
cout << (n + 99) / 100 << endl;
return 0;
} | #include<bits/stdc++.h>
#define pl(a) " [" << #a << ": " << (a) << "] "
#define pts(a) " [" << #a << ": { first: " << (a.first) << ", second: " << (a.second) << "}] "
#define all(vi) vi.begin(), vi.end()
#define endl "\n"
#define ll long long
using namespace std;
pair<int, int> n4[4] { {1, 0}, {-1, 0}, {0, 1}, {0, ... |
#include <bits/stdc++.h>
// #include <atcoder/all>
#define int long long
struct edge {
int to;
int cost;
};
using namespace std;
// using namespace atcoder;
using vi = vector<int>;
using vii = vector<vector<int>>;
using vb = vector<bool>;
using qi = queue<int>;
using P = pair<int, int>;
using graph = vector<... | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int main()
{
string s;
cin >> s;
for(int i = 0; i < s.size(); i++){
if(s[i] ==... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
puts(n == 191 ? "so-so" : (n < 191 ? "Yay!" : ":("));
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
ll n;
cin >> n;
vector<ll> ans;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (i * i == n) ans.push_back(i);
else {
ans.push_back(i);
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bou... | #pragma GCC optimize("Ofast")
#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)
#define pb push_back
bool solve()
{
int n;
cin >> n;
vi x(n);
vi y(n);
rep(i,n){
cin >> x[i] >> y[i];
}
int ans = ... |
#include <bits/stdc++.h>
using namespace std;
int T , n , a[550] , pl[550] , minn[2] , noww , it , flag , ans[300000] , tot , p[550];
void build( int l )
{
for(int i = 1 ; i <= n ; i++ ) pl[a[i]] = i;
minn[1] = minn[0] = 1e9;
for(int i = l ; i <= n ; i++ ) minn[i & 1] = min(minn[i & 1] , a[i]);
// for(int i = l ; i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... |
#include <bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define pre(i,a,b) for(int i=(b);i>=(a);i--)
#define ios ios::sync_with_stdio(false),cin.tie(0);
#define pb push_back
#define ps push
#define fi first
#define se second
#define ps push
#define Inf 0x3f3f3f3f3f3f3f3f
#define eps ... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define f(i,a,n) for(int i=a ; i<n ; i++)
#define rf(i,n,a) for(int i=n ; i>=a ; i--)
#define F first
#define S second
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
#define fast ios::sync_with_stdio(0); cin.ti... |
#include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#inclu... | /**
* In The Name Of God
* author : Behradm
* Idvwhu wkdq idvw, Txlfnhu wkdq txlfn, L dp Oljkwqlqj, Vshhg, L dp Vshhg :D :D
**/
#include "bits/stdc++.h"
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
int Q; cin >> Q;
... |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
const int max_n = 50;
ll a[50],n,t;
void Solve(int l,int r,vector<ll>& v,ll tmp){
if (l>r||tmp>t)return;
if (l==r){
v.push_back(a[l]+tmp);
v.push_back(tmp);
return;
}
Solve(l+1,r,v,tmp);Solve(l+1,r,v,tmp+a[l]);
... | #include <bits/stdc++.h>
using namespace std;
const int N = 200000 + 10;
int n, m, a[N];
vector <int> G[N];
int in[N], dp[N];
int main() {
memset(dp, -1, sizeof(dp));
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", a + i);
for (int i = 1; i <= m; i++) {
int u, v; scanf(... |
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, const T b) {a = min(a, b); return (a == b);}
template <typename T> inline bool chmax(T& a, const T b) {a = max(a, b); return (a == b);}
inline void cls() {}
... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(), (x).end()
#define uniq(v) (v).erase(unique(all(v)), (v).end())
#define sz(x) (int)((x).size())
#define fr first
#define sc second
#define ... |
#include <bits/stdc++.h>
using namespace std;
int f[1010][1010], a[1010], b[1010], n, m;
int main() {
cin >> n >> m;
for(register int i = 1; i <= n; i++) {
cin >> a[i];
}
for(register int j = 1; j <= m; j++) {
cin >> b[j];
}
for(register int i = 1; i <= m; i++) f[0][i] = i;
for(register int i = 1; i <= n;... | /* AUTHOR: julianferres */
#include <bits/stdc++.h>
using namespace std;
// neal Debugger
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_cont... |
// choker
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
using ul = unsigned long long;
const int maxN = 1e6 + 1;
const int mod = 1e9 + 7;
const int BLOCK_SIZE = 400;
const int LIM = 1e4;
//const int ep = 100;
const lli infty = 1e18;
const lli base = 37;
const int ep = 'a' - 1;
void FastInput()
{... | #include <iostream>
#include <string>
#include <stdio.h>
#include <math.h>
#include <queue>
#include <algorithm>
#include <utility>
#include <vector>
#include <tuple>
#include <numeric>
#include <climits>
using namespace std;
int main(int argc, char* argv[]){
long long n,q;
cin>>n>>q;
vector<long long>a(n);
vecto... |
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define... | #include <bits/stdc++.h>
using namespace std;
const int N = 100+19;
int g[N][N],vis[N],val[N],n;
void dfs(int u) {
++val[u];
vis[u] = 1;
for(int i = 1 ; i <= n ; ++i)
if(g[u][i] && !vis[i])
dfs(i);
}
void solve() {
cin >> n;
for(int i = 1 ; i <= n ; ++i) {
string s;
cin >> s;
for(int... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n;
cin>>n;
vector<int> a(2*n);
for(int i=0;i<2*n;++i) cin>>a[i];
ll ans=0;
priority_queue<int,vector<int>,greater<int>> q;
for(int i=n-1;i>=0;--i) {
... | #include<bits/stdc++.h>
#define FORz(i,t,n) for(int i=t;i<=n;i++)
#define FORf(i,n,t) for(int i=n;i>=t;i--)
#define SCC(x) scanf("%d",&x)
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef long long ll;
using namespace std;
const int N=1e5+5;
const ll MOD=1e9+7;
// inline int read(){int x=0,f=1;char... |
#include<iostream>
#include<vector>
#include<cstdlib>
#include<algorithm>
#include<climits>
#include<queue>
#include<stack>
#include<cmath>
#include<iterator>
#include<set>
typedef long long ll;
using namespace std;
#define rep(x, y) for (ll i = x; i < y; i ++)
#define repi(x, y) for (ll i = x; i > y; i --)
#define ... |
#include <algorithm>
#include <vector>
#include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
int main(){
//int a, b, c;
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
vector<int> c(n);
int t;
for(int i=0;i<n;i++){
cin >> t;
a[... |
// C - Large RPS Tournament
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
map<char,char> win{{'R','P'}, {'P','S'}, {'S','R'}}; // [lose]=win
int main(){
int N, K; string S; cin>>N>>K>>S;
while(K--){
string t = S + S;
rep(i, N){
char a = t[i*2], b = t[i*2+1];
S[i] = wi... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,c,d;cin>>a>>b>>c>>d;
cout<<min(a,min(b,min(c,d)))<<"\n";
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int h, w, a, b, ans = 0;
void dfs(int i, int bit, int a, int b) {
if (i == h*w) {
ans++;
return;
}
if (bit & 1 << i) {
dfs(i+1, bit, a, b);
return;
}
... | #include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include ... |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int, int>
#define pll pair<long long,long long>
#define vl vector<long long>
#define vll vector<pll>
#define vi vector<int>
#define vii vector<pii>
#define... | #include<bits/stdc++.h>
using namespace std;
#define ll unsigned long long
struct num{
ll a;
int b;
bool operator<(const num& k)const
{
return a<k.a;
}
}nzk[200500];
int main()
{
int n,flag=0;
ll k;
cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>nzk[i].a>>nzk[i].b;
}
nzk[0].a=0,nzk[0].b=0;
sort(nzk+1,nzk+n+1)... |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,l,r,mid;
scanf("%lld",&n),l=1,r=n;
while(l<r){
mid=(l+r+1)>>1;
if(mid+1<=((n+1)<<1)/mid)l=mid;
else r=mid-1;
}printf("%lld\n",n+1-r);
return 0;
} | // Problem: B - log
// Contest: AtCoder - AtCoder Regular Contest 109
// URL: https://atcoder.jp/contests/arc109/tasks/arc109_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespac... |
#include <bits/stdc++.h>
// clang-format off
using namespace std; using ll = int64_t; using ull = uint64_t; using pll = pair<ll,ll>; const ll INF = 4e18;
void print0() {}
template<typename Head,typename... Tail> void print0(Head head,Tail... tail){cout<<fixed<<setprecision(15)<<head;print0(tail...);}
void print() { pri... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for (int i = (m); i < (int)(n); i++)
using ll = long long;
using vl = vector<ll>;
using P = pair<ll, int>;
ll solve(vl& A, map<P, ll>& m, ll x, int i) {
if (i == int(A.size()) - 1) return 1;
... |
#include <bits/stdc++.h>
#define NIL (-1)
#define ll long long
using namespace std;
const double PI = acos(-1.0);
int main() {
int A, B , C;
cin >> A >> B >> C;
char ans;
if (A >= 0 && B >= 0) {
if (A == B) ans = '=';
else if (A < B) ans = '<';
else ans = '>';
}
else if (A < 0 && B < 0) {
if (C & 1) {
... | #include <iostream>
using namespace std;
int main(){
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int r = r2 - r1, c = c2 - c1;
int ans = 3;
if(!r && !c) ans = 0;
else if(r == c || r == -c || abs(r) + abs(c) <= 3) ans = 1;
else if((r ^ c ^ 1) & 1 || abs(r + c) <= 3 || abs(r - c) <= 3 || ... |
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <iostream>
#include <limits.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <chrono... | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,true:false;}
template <typena... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if (a+b >= 15 && b >=8){
cout << 1 << endl;
}
else if (a+b >=10 && b>=3){
cout << 2 << endl;
}
else if (a+b>=3){
cout << 3 << endl;
}
else{
cout << 4 << endl;
}
} | #define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <que... |
#include<bits/stdc++.h>
int main(){
using namespace std;
unsigned long N, K;
cin >> N >> K;
vector<pair<unsigned long, unsigned long>> fr(N);
for(auto&& [a, b] : fr)cin >> a >> b;
sort(begin(fr), end(fr));
unsigned long now{K};
for(const auto& [a, b] : fr)if(now < a)return 0 & printf("%... | #include<bits/stdc++.h>
using namespace std;
int main(void) {
int n;
long long k;
long long x, y;
vector<pair<long long, long long> >a;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x >> y;
a.push_back({ x,y }); //a[i].first=A_i, a[i].second=B_i
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++)... |
#include <bits/stdc++.h>
using namespace std;
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
#define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i)
#define rep2(i, m, n) for(ll i = (ll)(n)-1; i >= (ll)(m); --i)
#define REP(i, n) rep(i, 0, n)
#d... | #include<cstdio>
int n,u;
int main()
{
scanf("%d",&n);
if(n==1)
{
puts("1 1");
return 0;
}
for(u=1;u<n;u*=2);
for(int i=0,x;i<n;++i)
{
x=i<<1&u-1;
if(x<n)
printf("%d ",(x)+1);
else
printf("%d ",(x^u>>1)+1);
if(x+1<n)
printf("%d\n",(x+1)+1);
else
printf("%d\n",(x+1^u>>1)+1);
}
return 0... |
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int mx=200100;
double ans[101][101][101];
bool vis[101][101][101];
double dfs(int i,int j,int k){
if(vis[i][j][k]) return ans[i][j][k];
vis[i][j][k]=1;
if(!i||!j||!k) return ans[i][j][k]=0.0;
double fm=300-(i+k+j);
ans[i][j][k]+=1.0*(100-i)/f... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) ... | #include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define pb push_back
#define vli vector<long long int>
#define mp make_pair
#define pii pair<ll, ll>
typedef long long ll;
#define mii map<int, int>
#define mod 1000000007
#define vstr vector<string>
#define setval(a, v) memset(a, v, sizeof(a))
#def... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
signed ... | #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
cout << (A-B)*100./A << endl;
return 0;
}
|
/* CREATED BY
STREAM_CIPHER
nov-2020
*/
#include<bits/stdc++.h>
using namespace std;
void __print(long long x) {cerr << x;}void __print(unsigned long long x) {cerr << x;}void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}void __print(const char *x) {cerr << '\"' << x << '... | #include<iostream>
#include<cstdio>
using namespace std;
int a[5]={0};
int main()
{
char ch;
int mid=0;
while(scanf("%c",&ch)!=EOF)
{
if(ch>'9'||ch<='0')
break;
a[(ch-'0')%3]++;
mid+=(ch-'0')%3;
}
mid%=3;
if(!mid)
{
cout<<0;
return 0;
}
if(a[mid]>1||(a[mid]==1&&a[0]+a[3-mid]))
{
cout<<1;
re... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<int>bit(200001);
void update(int x, int val){
for(int a = x; a<=200000; a+=a&-a){
bit[a]+=val;
}
}
int query(int x){
int sum = 0;
for(int a = x; a>0; a-=a&-a){
sum+=bit[a];
}
return sum;
}
signed main(){
cin.tie(nullptr)->sync_with_st... | /* author : sgupta_2001 */
#include<bits/stdc++.h>
using namespace std;
using db = double;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
//containers
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <map>
#define amax(a, b) a = max(a, b)
#define amin(a, b) a = min(a, b)
using ll = long long;
using P = std::pair<ll, int>;
#define fi first
#define se second
int main() {
int n;
std::cin >> n;
std::ma... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mx INT_MAX
#define mi INT_MIN
#define pb push_back
#define mp make_pair
#define YES cout<<"YES\n";
#define Yes cout<<"Yes\n";
#define NO cout<<"NO\n";
#define No cout<<"No\n";
#define all(v) (v).begin(),(v).end()
#define ff first
#define ss ... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using pii = pair<int, int>;
#define rep(i, s, n) for (int i = (int)s; i <... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int N;
vector<ll> X1;
vector<ll> Y1;
vector<ll> X2;
vector<ll> Y2;
ll d(ll x1, ll y1, ll x2, ll y2){
ll dx = x1 - x2;
ll... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
int a,b,x,y;
int solve()
{
if(a==b) return x;
int dis=abs(a-b);
dis--;
int ans=x;
if(a>b) ans+=dis*min(y,2*x);
if(a<b) ans+=(dis+1)*min(y,2*x);
return ans;
}
int main()
{
//freopen("1.txt","r"... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d=0;
cin>>a>>b>>c;
if(a==1) d=d+6;
else if(a==2) d=d+5;
else if(a==3) d=d+4;
else if(a==4) d=d+3;
else if(a==5) d=d+2;
else if(a==6) d=d+1;
if(b==1) d=d+6;
else if(b==2) d=d+5;
else if(b==3) d=d+4;
else if(b==4) d=d+3;
else if(b==5) d=d+2;... |
#include <bits/stdc++.h>
using namespace std;
int n;
int main()
{
cin >> n;
for (int i=1; i<=n; i++) {
cout << (2*i-2)%n+1 << " " << (2*i-1)%n+1 << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(), x.end()
int main(){
ios::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
vector<int> a(n);
for(auto &v: a) cin >> v, v %= 200;
n = min(8, n);
vector<vector<int>> dp(200);
for(int mask = 1; mask < (1 << n); ++mask){
... | #include <bits/stdc++.h>
using namespace std;
int dp[210][210];
int mod(int x) {
return (x + 200 * 10) % 200;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] %= 200;
}
for (int i = 0; i < n; i++) {
for (int sum = ... |
#include<bits/stdc++.h>
using namespace std;
int mx=200005;
bool prime[200005];
vector <int> vec;
void normal_sieve(int n)
{
int i, N=sqrt(n), p;
memset(prime, 1, sizeof(prime));
for(p=3; p<=N; p+=2)
{
if(prime[p]==1)
{
for(i=p*p; i<=n; i+=p)
{
... | #include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <iomanip>
#include <cmath>
#include <set>
#include <unordered_set>
#include <functional>
#include <map>
#include <unordered_map>
#include <string>
#include <tuple>
using namespace std;
using ll = long... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define reps(i, s, n) for(int i = (s); i < (n); i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, s, n) for(int i = (n) - 1; i >= (s); i--)
#define INF ~(1 << 31)
#define INFL ~(1LL... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
vector<int64_t> x(N);
for (int i = 0; i < N; i++) {
cin >> x[i];
}
int64_t man = 0;
for (int i = 0; i < N; i++) {
man += abs(x[i]);
}
cout << man... |
#include <bits/stdc++.h>
int nextInt() {
int temp; scanf("%d", &temp);
return temp;
}
long long nextLL() {
long long temp; scanf("%lld", &temp);
return temp;
}
void print(int x, char endc = '\n') {
printf("%d%c", x, endc);
return;
}
void print(long long x, char endc = '\n') {
printf("%lld%... | #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...)... |
// In god we trust
#include <bits/stdc++.h>
#include <chrono>
#include <algorithm>
#include <signal.h>
#include <thread>
#include <pthread.h>
#include <omp.h>
#define pb push_back
#define fi first
#define se second
#define Vi vector<int>
#define Vb vector<bool>
#define Pi pair<int, int>
#define Si set<int>
#defin... | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
ll k,a[800][800],b[801][801],key,st=-1,go=1000000000,mid;
set<ll> se,se1,se2;
vector<P> v;
map<ll,vector<ll>> vv;
ld n,ans;
ld f(ld x){
return x*(pow(2,x)-2)/pow(3,x);
}
int main(voi... |
#include<bits/stdc++.h>
using namespace std;
int main(){
map<int,int> mp;
int n;
cin>>n;
long long ans=0;
for(int i=0;i<n;++i){
int x;
cin>>x;
int len=i-mp[x];
ans+=len;
mp[x]++;
}
cout<<ans;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a.begin(), a.end());
long long sum = 0;
int cnt... |
#include <bits/stdc++.h>
using namespace std;
//全探索
int main() {
int N;
cin >> N;
vector<vector<int>> C(N, vector<int> (N));
for (int i = 0; i < N; i++) for (int j = 0; j < N; j++){
cin >> C.at(i).at(j);
}
int min = C.at(0).at(0);
for (int j = 0; j < N; j++){
if(min > C.at(0)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define F first
#define S second
#define ALL(a) a.begin(),a.end()
#define mp make_pair
#define pb push_back
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define FORN(i,a,b) for(int i=a;i<=b;i++)
#de... |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define watch(x) cout << (#x) << " is " << (x) << endl
#define MOD 1000000007
int gcd(int a,int b){
if(a==0 || b==0){
return (a+b);
}
return gcd(b,a%b);
}
vector<int> sieve(int n){
vector<int> v(n+2,0);
n++;
v[0]=1;
for(int i=2;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
const ll MOD=20000000000000000;
const long double PI=3.14159265358979;
const ll MAX=100000;
int main() {
ll N,M;
cin>>N>>M;
ll a[M+2];
rep(i,M){
cin>>a[i+1];
}
a[0]=0;a[M+1]=N+1;
sort(a,a+M+2);
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i= 0;i<(n);++i)
#define sz(s) (int)(s.size())
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using vi = vector<int> ;
using vll = vector<ll>;
using vvi = vector<vi> ;
using vvll = vector<vll>;
using vs = vector<string>;
#defin... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 59;
int w[N];
int v[N];
int x[N];
int main() {
#ifndef LOCAL
cin.tie(0);
#endif
ios::sync_with_stdio(false);
int n, m, qq;
cin >> n >> m >> qq;
for (int i = 0; i < n; ++i) {
cin >> w[i] >> v[i];
}
for (in... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void){
int n,m;
cin >> n >> m;
int a[n];
rep(i,n) cin >> a[i];
set<int> b;
map<int,int> c;
rep(i,1.5*1e6+1){
b.insert(i);
c[i]++;
}
rep(i,m){
c[a[i]]-... | #include <bits/stdc++.h>
using namespace std;
vector<string> vec_splitter(string s) {
s += ',';
vector<string> res;
while(!s.empty()) {
res.push_back(s.substr(0, s.find(',')));
s = s.substr(s.find(',') + 1);
}
return res;
}
void debug_out(
vector<string> __attribute__ ((unused)) args,
__attribute__ ((unused)... |
#include <bits/stdc++.h>
#define For(i, l, r) for (register int i = l, _r = r; i <= _r; ++i)
#define Ford(i, l, r) for (register int i = r, _l = l; i >= _l; --i)
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define mk make_pair
const int N = 1e5 + 20;
const int mod = 1e9 + 7;
int T, n, a[N];
ll... | #define _DEBUG
#include "bits/stdc++.h"
//#include <atcoder/all>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,a5,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "... |
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define arep(a,i,n) for(ll i=(a);i<(n);i++)
#define rep(i,n) for(ll i=0;i<(n);i++)
#define cinf(x,n) for(ll i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(ll i=0;i<(n);i++)cout<<x[i]<<endl;
typedef long long ll;
typedef unsigned long long ull;
typedef long doubl... | //#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define LD long double
#define ST string
#define BS bitset
#define PA pair<LL... |
#include <iostream>
using namespace std;
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main()
{
long long aa,b,c;
cin>>aa>>b>>c;
int a = aa... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vii vector<vector<int>>
#define pb push_back
#define f1(i,l,r) for(i=l;i<=r;i++)
#define f2(a,b) for(auto a:b)
#define all(v) v.begin(),v.end()
#define mp make_pair
#define pi pair<int,int>
int main()
{
float V,T,S,D;
cin>>V>>T>>S... |
#include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(ll i=0; i<n; ++i)
#define FOR(i, s, e) for(ll i=s; i<e; ++i)
#define MOD 1000000007
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if(a>b) {a=b; return true;} return false;}
temp... | #include "bits/stdc++.h"
using namespace std;
using LLI = long long;
#define INF 999999999
#define MOD 1000000007
#define FOR(i, s, e) for(LLI i = s, i##_lim = (e); i < i##_lim; i++)
#define FORR(i, s, e) for(LLI i = s-1, i##_lim = (e); i##_lim<=i; i--)
#define REP(i, n) FOR(i,0,n)
#define REPR(i, n) FORR(i,n,0)
#defin... |
// C++ (GCC9.2.1) AtCoder
/*
Ctrl+Option+N で 実行
*/
#include <bits/stdc++.h>
#define INF 100000000000
#define MOD 1000000007
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define print(x) cout << (x) << endl;
typedef long long ll;
using namespace std;
int main() {
ios... | #include <bits/stdc++.h>
using namespace std;
long long A[200005];
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL), cout.tie(NULL);
int n;
cin >> n;
long long maxx = 0, sum = 0, pre = 0;
for (int i=1; i<=n; i++)
{
cin >> A[i];
maxx = max(maxx, A[... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define int ll
#define ld long double
#define reps(i,s,n) for(int i=(s);i<(int)(n);i++)
#define rep(i,n) reps(i,0,n)
#define rreps(i,s,n) for(int i=(int)(s-1);i>=n;i--)
#define rrep(i,n) rreps(i,n,0)
#defin... | #include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
string s; cin >> s;
int onum =0, qnum = 0;
int i;
for(i = 0;i<10;i++){
if(s[i] == 'o'){
onum++;
}else if(s[i] == '?'){
qnum++;
}
}
if(onum > 4){
cout << 0 << endl;
}else if(onum == 4... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<ll>a(n);
for (auto& x : a) cin >> x;
vector<ll> pr(n+1);
for (int i = 1; i <= n; i++)
pr[i] = pr[i-1]+a[i-1];
ll m... | #include<bits/stdc++.h>
#define mx 100005
#define lli long long int
#define ulli unsigned long long int
#define mset(a,b) memset(a, b, sizeof(a))
#define infile freopen("in.txt", "r", stdin);
#define outfile ... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define LETS_GET_SCHWIFTY ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ff first
#de... | #include <vector>
#include <iostream>
#include <algorithm>
#define R 998244353
using namespace std;
typedef long long ll;
vector<int> myNum;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int N;
cin >> N;
while (N--)
{
int num;
cin >> num;
myNum.push_back(num);
}
sort(myNum.begin(), myNu... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
const ll INF = 1e17;
int main(){
int n;
cin >> n;
ll a[n][5];
rep(i,n) rep(j,5) cin >> a[i][j];
ll l = 0, r = INF;
while(r-l > 1) {
ll m = (l + r) / 2;
vector<vector<int>> bit(n);
... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <stdlib.h>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <climits>
#include <iomanip>
#include <deque>
#include <limits>
#include <map>
#include <set>
#include <functional>
using name... |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <stack>
#include <cassert>
#include <map>
#include <numeric>
#include <cstring>
#include <set>
#include <ctime>
#include <queue>
#include <cmath>
#include <iomanip>
#include <iterator>
using namespace std;
clock_t timeStart, timeFi... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
// #include <atcoder/all>
// #include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <rand... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define FORR(i,m,n) for(int i = m - 1; i >= n; i--)
#define ALL(v) v.begin(), v.end()
#define itn int
#define Yes() cout << "Yes" ... | #include <iostream>
#include <cmath>
#include <stdio.h>
#include <string.h>
#include <bits/stdc++.h>
#include <vector>
#include <array>
#include <tuple>
using namespace std;
int main(){
long long C[61][61];
for (int i=0; i<=60; i++){
for (int j=0; j<=60; j++){
C[i][j]=0;
}
}
C[0][0]=1;
for (... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef long double ld;
/*
#include <chrono>
using namespace std::chrono;
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using nam... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
// using T = tuple<int,int,int>;
using P = pair<int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
void ... |
#include <iostream>
#include <vector>
#include <string>
#include <deque>
#include <list>
#include <tuple>
#include <algorithm>
#include <set>
#include <queue>
#include <functional>
#include <map>
#include <set>
#include <unordered_map>
#include <cmath>
#include <iomanip>
using namespace std;
uint64_t MAX_NUM = 10000... | #include<bits/stdc++.h>
using namespace std;
struct zz{
int a[15];
}t[200005];
int Max[15]={};
int n;
int dp[5][(1<<5)+5];
int dp2[5][(1<<5)+5];
int main(){
cin>>n;
for(int i=1;i<=n;i++)
for(int j=0;j<5;j++)
scanf("%d",&t[i].a[j]);
dp[0][0]=1e9;
for(int i=1;i<=n;i++){
for(int j=0;j<3;j++)
for(int k... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
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 0; }
#define rep(i,cc,n) for(int i=cc... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve(int L, int R){
vector<ll> memo(1<<21, -1);
auto f = [&](auto self, int L, int R) -> ll {
// L < x <= R であって、gcd(x,y) == 1 となるものを数える
auto key = L + R;
if(memo[key] != -1) return memo[key];
ll res = ll(R - L) * (R - L)... |
#include<bits/stdc++.h>
#define int long long int
using namespace std;
int32_t main()
{
int a,b,c;
cin>>a>>b>>c;
int array[]={a,b,c};
int sum=0;
for(int i=0;i<3;i++)
{
sum=sum+(7-array[i]);
}
cout<<sum;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+10;
const int mod=1e9+7;
int main()
{
double x1,x2,y1,y2;
cin>>x1>>y1>>x2>>y2;
y2=-y2;
double k=(y1-y2)/(x1-x2);
double b=y1-k*x1;
printf("%.10f",-b/k);
}
|
#include "bits/stdc++.h"
using namespace std;
#define ll long long
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<b-c<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#include <unordered_map>
using namespace std;
#define MAXN 1000001
#define MAXN1 101
#define MAXN2 1001
#define mod 1000000007
#define CONSTANT 1e8
#define ll long long // pair<int,int>
ll res = 0;
int BS(vector<int> arr, int... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll ans = 0;
const ll mo = 1000000007;
auto mod = [](ll modx) {modx%=mo;modx+=mo;modx%=mo;return modx; };
int main()
{
ll h , w ;
cin >> h >> w ;
vector<vector<ll>> v(h, vector<ll>(w,0) );
vector<vecto... | //This Code was made by Chinese_zjc_.
#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include... |
#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
int main()
{
int K, N, M;
std::cin >> K >> N >> M;
std::vector<long long> as(K);
for (auto& a : as) { std::cin >> a; }
std::vector<long long> bs(K);
for (int i = 0; i < K; i++)
{
bs[i] = (as[i] * M) / N;
}
int remain ... | #include <iostream>
#include <algorithm>
#include <vector>
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int k;
ll n,m,a[100001],b[100001],cnt,s;
vector< pair<ll, int> > r(100001);
int main(){
cin >> k >> n>> m;
rep(i,k)cin>>a[i];
rep(i,k){
cnt = a[i]*m;
... |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#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 ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... | #include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll i, j, k, n, t, p, q;
bool f;
scanf("%lld", &t);
for(k = 0; k < t; ++k) {
scanf("%lld", &n);
ll a[n];
vector<ll> vec;
for(i = 0; i < n; ++i) scanf("%lld", &a[i]);
f = true;
for(i = n - 1; ... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int k = 0;
while (n % 2 == 0) {
k++;
... | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define umap unordered_map
#define mod 998244353ll
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MN(a,b,c) min(a,min(b,c))
#define MX(a,b,c) max(a,max(b,c))
#define pr1 ... |
#include<bits/stdc++.h>
using namespace std;
long long ans=0,num=0,a[200002];
int n;
int main(){
scanf("%d",&n);
for(int i=0;i<n;++i)scanf("%lld",&a[i]);
sort(a,a+n);
for(int i=n-2;i>=0;--i){
num=(num+a[i+1])%998244353;
ans=(ans+a[i]*num%998244353)%998244353;
num=num*2%998244353;
}
for(int i=0;i<n;++i)ans=(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define mp(x, y) make_pair(x, y)
#define sz(li) (int) (li).size()
#define sum(a) (accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
vector<vector<int>> g;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
int ma = 1000000001, MA = -1;
rep(i, n) {
cin >> a[i];
if (ma > a[i]) ma = a[i];
... | #include <bits/stdc++.h>
/* #include <atcoder/all> */
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
/* using namespace atcoder; */
using ll = long long;
usin... |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <map>
#include <queue>
#include <climits>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
long long MAX = 100005;
long long N, M, Y, K;
string ... | // L:27
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000000
#define LINF 1000000000000000000
#define rep(i,n) for(int i=0;i<n;i++)
#define ALL(a) a.begin(),a.end()
#define PB(a) push_back(a)
using namespace std;
using ll=long long;
using P=pair<int,int>;
const int dx[]={0,-1,1,0},dy[]={-1,0,0,1};
//c... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int re(){
int i=0,f=1;
char c=getchar();
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(;isdigit(c);c=getchar()) i=(i<<3)+(i<<1)+c-'0';
return i*f;
}
void solve(){
int n;
cin>>n;
int haha=((int)(sqrt(8.0*n+17))-3)/2;
while(haha*haha+3*haha>... | #include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 998244353;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ? ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.