code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
/* BISMILLAHIR-RAHMANIR-RAHIM
____________________________________
| |
| SHANTO_SUST_SWE-19__029 |
| shanto-swe029.github.io |
|____________________________________|
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fast... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> x(n), y(n);
rep(i, n) {
cin >> x[i] >> y[i];
}
bool ok = false;
for (int i = 0; i < n-2; i++) {
... |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector <int> vi;
typedef vector <vi> vii;
typedef vector <string> vs;
typedef vector <ll> vll;
#define LSB(x) x&(-x)
#define endl "\n"
#define quick ios_base::sync_with_stdio(false);cin.t... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
typedef long long LL;
int n;
int main() {
cin >> n;
double res = 0;
for (int i = 1; i <= n-1; i++) {
res += 1.0 * n / i;
}
printf("%.10lf\n", res);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll = long long;
using P = pair<int,int>;
int n,m;
signed main(){
cin >> n >> m ;
map<int,int> cnt;
vector<P> p(m);
for(int i=0;i<m;i++){
cin >> p[i].first;
cin >> p[i].second;
cnt[p[i].first]++;
}
sort(p.begin(),p... | #pragma GCC optimize("fast-math")
// begin "cp-lib/boilerplate.hpp"
#include <bits/stdc++.h>
#define _choose(_1, _2, _3, chosen, ...) chosen
#define _rep(i, l, r) for (int i = l; i < r; ++i)
#define _rep0(i, r) _rep(i, 0, r)
#define _repr(i, r, l) for (int i = r; i >= l; --i)
#define _repr0(i, r) _re... |
#include <iostream>
#include <string>
#include <vector>
#include <numeric>
#include <utility>
#include <algorithm>
using namespace std;
using ll = long long;
bool localTest = false;
long long readLongLong()
{
long long t;
cin >> t;
return t;
}
std::vector<ll> readVector(long long size)
{
std::vector<... | #include <iostream>
#include <vector>
#include <cmath>
#include <unordered_set>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
vector<vector<char>> mat;
cin >> n >> m;
mat.resize(n + 1, vector<char>(m + 1));
for... |
#include <bits/stdc++.h>
#include <string>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mod 1000000007
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define fr(i,a,n) for(i=a;i<n;i... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<string> str(n);
vector<pair<long long, long long>> tbl;
for (int i = 0; i < n; i++) {
cin >> str[i];
}
tbl.emplac... |
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef __int128 it;
typedef long double ldb;
int main(){
ll s,p;
scanf("%lld%lld",&s,&p);
it sqt=it(s)*s-it(p<<2);
// if(p*4<(s*2-1)){
// puts("No");
// return 0;
// }
ldb tmp=sqrt(ldb(s)*s-(p<<2));
for(it i=max(t... | #include <bits/stdc++.h>
using namespace std;
/* * * * * * * * * * */
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
/* * * * * * * * * * */
/* *
*
* Too many mind, no mind.
*
* */
int main(){
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
//freopen("input.txt", "r", stdi... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define bit(k) (1LL<<(k))
#define SUM(v) accumulate(all(v), 0LL)
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
template... | #include <bits/stdc++.h>
//#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
vector<vector<int>> A(N, vector<int>(5, 0));
for(int i = 0; i < N; ++i) for(int j = 0; j < 5; ++j) cin >> A.at(i).at(j);
int ok = 0, ng = 1000000001;
while(abs(ok-ng) > 1) {
int cen = (ok +... |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#incl... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int n;cin>>n;
vector<ll>ae(n+1,0),be(n+1,0),b(n+1);
int tmp;
for(int i=0;i<n;i++){
cin>>tmp;
ae.at(tmp)++;
}
for(int i=1;i<=n;i++){
cin>>b.at(i);
be.at(b.at(i))=1;
}
ll ans=0;
for(int i=0;i<n;i++){
cin>>t... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
#include<set>
#include<complex>
#include<numeric>
#include<functional>
#include<unordered_map>
#in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
#define fi first
#define se second
#define __lcm(a, b) a * b / __gcd(a, b)
const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const int INF = 2e9;
const ll LINF = 9e18;... |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define N 100005
#define ll long long
#define ull unsigned long long
#define FOR(i, j, k) for (int i = j; i < k; i++)
#define rloop(i, j, k) for (int i = j; i >= k; i--)
#define rep(i, k) for (int i = (0); i < (k); i++)
#define forall(it, l) for (aut... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define scl(n) scanf("%lld", &n)
#define pcl(n) printf("%lld\n", n)
#define pcl1(n) printf("%lld ", n)
#define nln pr... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 //10^9+7
#define INF LONG_MAX/3
#define bit(n) (1LL<<(n))
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(... | #include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
using namespace std;
const double eps = 1e-9;
template <typename T>
struct SegmentTree
{
using F = function<T(T, T)>;
const F f;
const T e;
int n;
vector<T> seg;
SegmentTree(int nn, const F f, const T... |
#include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
using ll = long long;
ll MOD = 1e9+7;
ll g(ll x){
int ret = 1;
for(int i = 0;i<x;i++){
(ret*=2)%=MOD;
}
return ret;
}
ll f(ll x){
ll ret;
ll ret_1 = 1;
ll ret_2 = 1;
for(int i = 0;i<x-1;i++){
(ret = ret_1 + ret_2)%=MOD;
ret_2 = ret_1;
... | #include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long double db;
#define MP make_pair
#define PB push_back
#define X first
#define Y second
#define FOR(i, ... |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
string a[200100], b[200100];
int main()
{
int n;
cin >> n;
string p, t;
int numa = 0, numb = 0;
for (int i = 0; i < n; i++)
{
cin >> p;
if (p[0] == '!')
{
t = "";
... | #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... |
#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; cin >> N;
vector<ll> A(N), P(N), X(N);
REP(i, 0, N) cin >> A[i] >> P[i] >> X[i];
ll ans = 1LL << 60;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define io ios::sync_with_stdio(false); cin.tie(0)
int main()
{
io;
int n; cin >> n;
vector<int> a(n), b(n);
vector<vector<int>> c(n, vector<int>(n, 0));
rep(... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a;
cin>>a;
if (a==191){
cout<<"so-so";
}
else if (a<191){
cout<<"Yay!";
}
else {
cout<<":(";
}
} | #include <bits/stdc++.h>
using namespace std;
#define endl ('\n')
#define pi (3.141592653589)
#define mod 1e9 + 7
#define int long long
#define float double
#define test \
int t; \
cin >> t; \
while (t--)
#define init(arr, val) memset(arr, val, sizeof(arr))
#define fast ios_base::sync_with_stdio(false)... |
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define RI register int
typedef long long LL;
#define FILEIO(name) freopen(name".in", "r", stdin), freopen(name".out", "w", stdout);
using namespace std;
namespace IO {
char buf[1000000], *p1 = buf, *p2 = buf;
inline char gc() {
if (p1 ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int64_t a, b, c, d;
cin >> a >> b;
cin >> c >> d;
cout << b - c << endl;
return 0;
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int a,b;
cin >> a >> b;
int ans;
int x;
for(int i=1 ; i<=b/2 ; i++)
{
if(a%i==0)
{
x=a/i;
}
else
{
x=a/i+1;
}
if(i*(x+1)<=b... | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex... |
#include<bits/stdc++.h>
typedef long long ll;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define pb push_back
#define lsb(x) ((x) & (-x))
#define PI acos(-1)
#define line cout << endl;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define resetbit(n, i) ((n) & (~(1LL << (i))... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
template <typename T> inline void read(T &x)
{
int f = 1; x = 0; char c = getchar();
for (; !isdigit(c); c = getchar()) if (c == '-') f = -1;
for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 48);
x *= f;
}
const int N = 1e3 + 5;... |
#include <bits/stdc++.h>
using namespace std;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<ll, vector<ll>> Pd;
const ll INF = 2e18;
const ll fact_table = 1200008;
priority_queue<ll> ... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#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 ll = int64_t;
using ull = uint64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define per(i,a,b) for(int i = (a); i > (b); i--)
#define repl(i,a,b) for(ll i = (a); i < (b); i++)
#define perl(i,a,b) for(ll i = (a); i > (b); i--)
const ll MOD = 1000000007... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 5;
const int mod = 1e9 + 7;
int n, m, k, fact[N], ifact[N];
void add(int &x, int y) {
x += y;
if (x >= mod) x -= mod;
}
void sub(int &x, int y) {
x -= y;
if (x < 0) x += mod;
}
int binPow(int x, int y) {
int ans = 1;
while (... |
/*HAR HAR MAHADEV
ヽ｀、ヽ｀｀、ヽ｀ヽ｀、、ヽ ｀ヽ 、ヽ｀🌙｀ヽヽ｀ヽ、ヽ｀
ヽ｀、ヽ｀｀、ヽ 、｀｀、 ｀、ヽ｀ 、｀ ヽ｀ヽ、ヽ ｀、ヽ｀｀、
ヽ、｀｀、｀、ヽ｀｀、 、ヽヽ｀、｀、、ヽヽ、｀｀、 、 ヽ｀、
ヽ｀｀、 ヽ｀ヽ｀、、ヽ ｀ヽ 、 🚶ヽ｀｀｀｀ヽヽヽ｀、、ヽ｀、、ヽ*/
//think twice code once
//when its getting hard why you started
# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long u... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define vec vector
#define rep(i,n) for (int i=0; i<(n); i++)
#define print(a) cout << a << endl
#define fix(n) fixed << setprecision(n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Yes "Yes"
#d... |
#define _CRT_SECURE_NO_DEPRECATE
#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 std;
//using namespace __gnu_pbds;
#define int long long int
#define SYNC std::ios_base::sync_with_stdio(0);ci... | #include<iostream>
#include<math.h>
using namespace std;
int main(){
long int n, m, x, arr[1001]={0}, total=0;
cin>>n>>m;
while(n>0){
cin>>x;
arr[x-1] = 1;
total++;
n--;
}
while(m>0){
cin>>x;
if(arr[x-1] == 1){
arr[x-1] = 0;
... |
#include <bits/stdc++.h>
#include<sstream>
#include<string>
#include<vector>
#include <set>
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define ll long long
long long M=1000000007;
using namespace std;
ll fact[1000000];
ll power(ll x, unsigned ll ... | #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 ... |
#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#pragma GCC optimize "trapv"
#endif
#include <bits/stdc++.h>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout << setprecision(12) << fixed;
#define ll long long int
#define line cout << endl;
#define all(x) x.begin(), x.end()... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
int a,b;
cin>>a>>b;
int ans=1;
for(int i=2;i<=b-a;i++){
int c=ceil(a/(double) i),d=b/(double) i;
if(d... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define pi (3.141592653589)
#define pb push_back
#define mp make_pair
#define INF 1000000000
#define MOD 1000000007
#define vll vector<ll>
#define vpll vector<pair<ll,ll> >
#define pll pair<ll , ll>
#define ff first
#define ss ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n;
cin >> n;
if (n == 0) {
cout << "Yes\n";
return 0;
}
vector < int > digits;
while (n > 0) {
digits.push_back(n % 10);
n /= 10;
}
int i... |
#include <iostream>
#include <cmath>
#include <utility>
#include <vector>
using namespace std;
#define mp make_pair
#define x first
#define y second
typedef pair<int,int> pii;
typedef long long ll;
char ispis[500];
int main(){
ios::sync_with_stdio(0);
int n;
cin>>n;
cout<<(1<<n)-1<<"\n";
for(int i=1;i<(1<<n);i... | #include <bits/stdc++.h>
using namespace std;
int N;
int ans[1010][1010];
int main() {
cin >> N;
int m = 2;
ans[0][0] = 0; ans[0][1] = 1;
for(int q = 0; q < N - 1; q++) {
for(int i = 0; i < 2; i++) {
for(int j = 0; j < 2; j++) {
for(int k = 0; k < m / 2; k++) {
for(int l = 0; l < m; l++) {
ans... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define print(a) for (auto x : a) cout << x << " "; cout << endl
#define print_upto(a,n) for(ll i=1;i<=n;i++) cout<<a[i]<<" "; cout<<endl
#define take(a,n) for(ll i=1;i<=n;i++) cin>>a[i];
#define watch(x) cout << (#x) << " i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll solve(ld x, ld y, ld r) {
ll res = 0ll;
ll top = floor(y + r);
ll under = ceil(y - r);
r= nextafter(r, INFINITY);
for(ll i = top; i >= under; i--) {
ld width = sqrt(r * r - abs(i - y) * abs(i - y... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
vector<ll> aj[200005];
ll arr[200005],m,cnt2 = 0;
pair<bool, ll> f[200005];
void dfs(ll x,ll p){
ll mt = -2e9,mf = 0;
for(auto it:aj[x]){
if(it==p)continue;
dfs(it,x);
if(f[it].first)mt = max(mt,f[it].second);
else mf = max(mf,f[it].second... | #include <bits/stdc++.h>
using namespace std;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<ll, vector<ll>> Pd;
const ll INF = 2e18;
const ll fact_table = 1200008;
priority_queue<ll> ... |
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define int long long
const int maxn = 2e5+10;
int lst[300];
int Minus[300];
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
for(int i = 'a';i <= 'z';i++)lst[i] = n;
ll ans = 0;
if(... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typed... |
#include<bits/stdc++.h>
#define int long long
#define for0(i, n) for(int i = 0; i < (n); i++)
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define mp make_pair
#define all(x) x.begin(),x.end()
#define puts(x) cout << (x) << "\n"
constexpr int mod = 1000000007;
using namespace std;
int input() { int t; cin >> t; retu... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using db = double;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = vector... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ll long long
const ll mod = 1e9 + 7;
int inf = 1000000000; //10e9
ll power(int x, int n)
{
ll xn = 1;
rep(i, n)
{
xn *= x;
}
return xn;
}
int main()
{
ll n;
cin >> n;
bool... | #include <bits/stdc++.h>
#define pb push_back
#define rep(i, a, n) for(int i = a; i < n; ++i)
#define per(i, a, n) for(int i = n-1; i >= a; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
using namespace std;
ll myPow(ll x, ll p){
ll y = 1;
while(p--){
y *= ... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define vi vector<int>
#define pii pair<int,int>
#define si set<int>
#define mii map<int,int>
#define F first
#define S second
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define... | #include<bits/stdc++.h>
using namespace std;
map<string,double> dp;
double solve(int a,int b,int c) {
if(a==100 or b==100 or c==100)
return 0;
string key=to_string(a)+" "+to_string(b)+" "+to_string(c);
if(dp.find(key)!=dp.end())
return dp[key];
double p=((solve(a+1,b,c)+1)*a)/(a+b+c);
double q=((solve(a,b+1... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#define N 2005
#define mp make_pair
using namespace std;
int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
return x*f;
}
int n,m,f[N][N... | #include <bits/stdc++.h>
#define ll int
#define MAXN 2005
#define MAX 2005
using namespace std;
vector<ll> adjlist[MAX];
ll n, m;
ll bfs(ll start) {
ll mark[MAX], res = 0;
memset(mark, 0, sizeof(mark));
queue<ll> q;
q.push(start);
mark[start] = 1;
while(!q.empty()) {
ll top = q.front(... |
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/segtree>
//using namespace atcoder;
using ll = long long;
using ld = long double;
using pl = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#defin... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n; cin>>n;
vector<int> a(n);
for(int i= 0; i<n; i++) cin>>a[i];
int ans = 0;
for(int i = 0, h; i<n; i++){
h = a[i];
for(int j = i; j<n; j++){
h = min(h, a[j]);
... |
#include<bits/stdc++.h>
#define re register
#define ll long long
using namespace std;
const int lzw=2e5+3;
int n,a[lzw];
ll ans,sum[lzw],Max[lzw],maxx;
int main(){
scanf("%d",&n);
for(re int i=1;i<=n;i++) scanf("%d",&a[i]);
for(re int i=1;i<=n;i++){
sum[i]=sum[i-1]+a[i];
maxx=max(maxx,sum[i]);
Max[i]=maxx;
}
... | #include <bits/stdc++.h>
//#include <sstream>
using namespace std;
#define ll long long int
#define us unsigned
#define t() int test;cin>>test;while(test--)
#define ip(a) int a;cin>>a
#define ipll(a) ll a;cin>>a
#define iparr(a,n) int a[n];for(int i=0;i<n;i++){cin>>a[i];}
#define ipllarr(a,n... |
#include "bits/stdc++.h"
#include "random"
#include <unistd.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<long long>
#define vvi vector<vi>
#define pi pair<int,int>
#define mp make_pair
#define pb push_back
#define MOD int(1e9) + 7
#define PAI 3.1415926535
#define all(x) (x... | /********************************************************************
* *
* *
* Coded By colin! *
* ... |
#include <bits/stdc++.h>
using namespace std;
bool can_evaluate(string &X, long long B, long long M){
long long val = 0;
for(int i = 0; i < X.size(); i++){
int x = X[i] - '0';
if(val > (M-x)/B) return false;
val = val*B + x;
}
return val <= M;
}
int main(){
string X; long long M;
while(cin ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
int dx[4]={0,1,0,-1}, dy[4]={1,0,... |
#include<bits/stdc++.h>
using namespace std;
int64_t X,Y,R;
int64_t in(){
double x; cin >> x;
return round(10000*x);
}
int64_t f(){
int64_t cnt=0;
int64_t yUpper;
if(R+Y>=0){
yUpper=(R+Y)-((R+Y)%10000);
}else{
if((R+Y)%10000!=0) yUpper=(R+Y)-(10000+(R+Y)%10000);
... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define ll long long
#define min3(a,b,c) min(min((a),(b)),(c))
#define min4(a,b,c,d) min(min((a),(b)),min((c),(d)))
#define max3(a,b,c) max(max((a),(b)),(c))
#define max4(a,b,c,d) max(max((a),(b)),max((c),(d)))
#define S second
#def... |
#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 <bits/stdc++.h>
using namespace std;
// ascii value of ('0'-'9') is(48 - 57) and (a-z) is (97-122) and (A-Z) is(65-90) and 32 for space
#define int long long
#define endl "\n"
#define mem1(a) memset(a,-1,sizeof(a))
#define mem0(a) memset(a,0,sizeof(a))
#define error(args...) { string _s = #args; replace(_s... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
struct Matrix{
vector<vector<ll>> M;
Matrix(int H,int W):M(H,vector<ll>(W,0)){}
Matrix(int H,int W,ll init):M(H,vector<ll>(W,init)){}
void assign(int H,int W,ll init) { M.assign(H,vector<ll>(W,init)); }
void build_E(){
int h=M.size();
... | //#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tr... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kein Yukiyoshi
*/
// clang-format off
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
#define Endl endl
#define itn int... | #pragma GCC optimize("O3") //
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, b, a) for(int i = b - 1; i >= a; i--)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int... |
/*
This C++ Source Is
Writen By syksykCCC
(2020)
*/
#include <bits/stdc++.h>
#define rep(i, x, y) for(register int i = x; i < y; i++)
#define REP(i, x, y) for(register int i = x; i <= y; i++)
#define per(i, x, y) for(register int i = x; i > y; i--)
#define PER(i, x, y) for(register int i = x; i >= y; i--)
#define... | #include <iostream>
#include <iomanip>
#include <cstdlib>
#include <cstring>
#include <string>
#include <bitset>
#include <cmath>
#include <algorithm>
#include <climits>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
//infの設定
#define INF32 2147483647
#define INF6... |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
#define P 1000000007
#define rep(i,n) for(i=0;i<n;++i)
#define re(i,a,n) for(i=a;i<=n;++i)
#define repr(i,a,n) for(i=a;i>=n;--i)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ub(v,val)... | #include "bits/stdc++.h"
#include<sstream>
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const long long inf = 1e18;
const ll INFL = 1e18;
const ll MOD = 1e9 + 7;
int digit(ll x) {
int digits = 0;
... |
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)x.size()
#define cat(x) cerr << #x << " = " << x << endl
using ll = long long;
using namespace std;
const int MOD = 1e9 + 7;
ll bin_pow(ll a, ll b) {
ll c = 1;
while (b) {
if (b & 1) c = c * a % MOD;
a = a * a ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include<float.h>
#include<tuple>
#include<string.h>
#include<iomanip>
#include<stack>
#include<queue>
#include<map>
#include<deque>
#include<math.h>
using namespace std;
#define ll long long
... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define real long double
#define f first
#define s second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend... | #include<bits/stdc++.h>
using namespace std;
int n,a[200100],b[200100],p[200100],q[200100];
pair<int,int> pa[200100];
vector<pair<int,int> > vec;
int main(){
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i],pa[i]=make_pair(a[i],i);
for(int i=1;i<=n;i++) cin>>b[i];
f... |
#include <math.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
typedef pair<ll, ll> P_ll;
typedef pair<int, int> P;
con... | /*
* @author : ashnove
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define F first
#define S second
#define endl "\n"
#define nl cout<<endl;
#define pb push_back
#define f(i,a,b) for(ll i=a;i<b;i++)
#define Knucklehead ios_base::sync_with_stdio(false);cin.tie(NULL);
//#define mod 100000007... |
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
using namespace std;
const int N = 200000;
int aa[N << 1], bb[N], ii[N << 1];
long long dd[N << 1];
int main() {
int n; cin >> n;
long long b_; cin >> b_;
for (int i = 0; i < n; i++)
cin >> aa[i << 1 | 0] >> aa[i << 1 | 1] >> bb[i], aa[i <<... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second
using namespace std;
typedef long long ll;
int a[200005], b[200005];
pair <int, int> masA[200005], masB[200005];
int perm[200005], fen[200005];
int f(int x)
{
return (x & (-x));
}
int get_sum(int pos, int n)
{
i... |
/*** keep hungry and calm CoolGuang! ***/
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#include<stdio.h>
#include<queue>
#include<algorithm>
#include<string.h>
#include<iostream>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define d(x) printf(... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0;i < (n);i++)
template<typename T>
void chmin(T & a, const T & b) { a = min(a, b); }
vector<vector<ll>> dp;
int main() {
const int INF = 1001001001;
int n, m;
cin >> n >> m;
vec... |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, s[N], e[N], tim = 1;
vector<int> adj[N];
vector<int> lvl[N];
int cnt(int idx, int l, int r)
{
return upper_bound(lvl[idx].begin(), lvl[idx].end(), r) - lower_bound(lvl[idx].begin(), lvl[idx].end(), l);
}
void dfs(int u = 1, int l = 0)
{
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using iPair = pair<int,int>;
using lPair = pair<ll, ll>;
using ivector = vector<int>;
using lvector = vector<long>;
using ivv = vector<vector<int>>;
using lvv = vector<vector<ll>>;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
#de... |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
bool check(string iStr,string jStr){
bool retval = false;
for(int i=0;i<iStr.length();i++){
//std::cout << iStr[i] << " " << jStr[i] << endl;
if(iStr[i] != jStr[i])
retval = ! retval;... | #include <bits/stdc++.h>
#define N 2010
#define pp pair<int,int>
#define ppp pair<pp,int>
#define M 26
#define fi first
#define si second
using namespace std;
int n, m, x, y, u, v, l;
char dp[N][N];
bool vis[N][N];
queue<ppp>q;
vector<pp>g[M];
ppp tmp;
int s[4][2] = {{ -1, 0}, {1, 0}, {0, -1}, {0, 1}};
bool isValid(int... |
#define _CRT_SECURE_NO_WARNINGS
#include <initializer_list>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
#include <random>
#include <queue>
#include <deque>
#include <time.h>
#include <limits.h>
#def... | #include <iostream>
using namespace std;
int main(void){
// Your code here!
int N,M;
cin >> N >> M;
int sum = 0;
for(int i = 1; i <= N; i++){
for(int j = 1; j <= M; j++){
sum += i*100 + j;
}
}
cout << sum << endl;
}
|
/*
ID:ACwisher
LANG:C++
TASK:
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=200010;
int n,x[N],y[N],fa[N<<1],e[N<<1],sum[N<<1],sumn[N<<1];
bool vis[N<<1];
int find(int x){ return (x==fa[x])?x:fa[x]=find(fa[x]); }
void merge(int x,int y){ x=find(x); y=find(y); if(x!=y) fa[x]=y; }
int ... | #include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr)
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define mkp make_pair
#define lc(x) ((x)<<1)
#define rc(x) (((x)<<1)|1)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef doub... |
/**
* author: Anchord
* created: 11.12.2020
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
long long ans = 1;
for(long long i = 2; i <= n; ++i){
ans = (ans*i) / __gcd(ans, i);
}
ans++;
cout << ans <<... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
using ll = long long ;
#define rep(i,n) for (int i=0; i < (n); ++i)
const ll lim = 1e18 ;
ll gcd(ll x,ll y){
return y ? gcd(y,x%y) : x ;
}
ll lcm(ll x,ll y){
return x*y/gcd(x,y) ;
}
int main() {
ll n ;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
vector<vector<ll>> calc_ncr(const int n){
vector<vector<ll>> ret(n+1, vector<ll>(n+1, 0));
for(int i=0; i<=n; ++i){
ret[i][0] = 1;
for(int j=1; j<i; ++j){
ret[i][j] = ret[i-1][j] + ret[i-1]... | #include<bits/stdc++.h>
#define int long long
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define endl "\n"
using namespace std;
const int Mod = 1e9+7;
int power(int a,int b){
if(b==0) return 1;
int temp = power(a,b/2)%Mod;
if(b%2==0){
return (temp*temp)%Mod;
}else{
return (a*((... |
#include <iostream>
#include <string>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<... | // dont stop until you reach there
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define rep(i,j,k) for(int i=j;i<k;i+=1)
#define rrep(i,j,k) for(int i=n-1;i>=0;i-=1)
#define sorti(v) sort(v.begin(),v.end())
#define sortd(v) sort(v.begin(),v.end(),greater<int>())
#define mm map<... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define fastIO std::ios_base::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0)
#define Local
#ifdef Local
#define dbg(args...) do { cout << #args << " -> "; err(args); } while (0)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll,ll> P;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define EFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FORE(i,I) for(const auto &(i):(I))
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ll(x.size())
#d... |
#include <bits/stdc++.h>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ld long double
#define ll long long
using namespace std;
#define MOD 1000000007
#define INF 100000000000000000
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
bool a[n];... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 1007, inf = 1e9;
char s[sz][sz];
int main() {
int h, w;
cin >> h >> w;
int x, y;
cin >> x >> y;
x--, y--;
for(int i=0; i<h; i++) scanf("%s", s[i]);
if(s[x][y] == '#') {
puts("0");
return 0;
}
i... | #include<bits/stdc++.h>
using namespace std;
int main(){
int H,W,X,Y;
cin >>H>>W>>X>>Y;
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 ans=0;
for(int i=0;Y-1+i<W;i++){
if(data.at(X-1).at(Y-1+i)=='#') break;
... |
/*
{
######################
# Author #
# Gary #
# 2020 #
######################
*/
//#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); ++i)
const int MAX = 510000;
const long long INF = 1LL<<60;
const int MOD = 10007;
#pragma GCC target("avx2")
#pragma GCC op... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define V vector
#define debug(v) {for(auto i: v) cout << i << " "; cout << endl;}
#define vcin(v) rep(i, v.size()) cin >> v[i]
#define wcin(v, w) rep(i, v.size())... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<pair<ll, ll> > vii;
typedef pair<ll,ll> pii;
typedef multiset<pair<ll, ll> > msii;
typedef multiset<ll> msi;
typedef set<pair<ll, ll> > sii;
typedef set<ll> si;
typedef map<ll, ll> mii;
#define ... |
#include <iostream>
#include <cstdio>
#include <vector>
#define N 1000005
using namespace std;
int n, s, ans, a[N], b[N], v[N];
vector<int> num;
int f(int p) {return p > 0 ? p : -p;}
int main()
{
int i, j, k;
cin >> n;
for (i = 0, j = 1; i < n; i++, j *= 2);
for (i = 1; i <= j; i++) {
scanf ("%... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>> n;
int iter = pow(2,n) + .000001;
//cout<< iter;
vector<int>vec;
for(int i = 1; i <= iter; i++)
{
int input;
cin>> input;
vec.push_back(input);
}
if(n == 1)
{
if(vec[0] > vec[1... |
/*
Auth: Loxilante
Time: 2020/11/15
Prog: A
Lang: cpp
*/
#include <bits/extc++.h>
#define rep(i, l, r) for(int i = l; i < r; i++)
#define hrp(i, l, r) for(int i = l; i <= r; i++)
#define rev(i, r, l) for(int i = r; i >= l; i--)
#define ms(n, t) memset(n, t, sizeof(n))
#define pb push_back
#define int ll
#ifndef JOE... | /**
* author: Anchord
* created: 15.01.2021
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long N; cin >> N;
long long A[N], B[N];
for(int i = 0; i < N; ++i){
cin >> A[i];
}
for(int i = 0; i < N; ++i){
cin >> B[i];
} ... |
#include <bits/stdc++.h>
#define pb(x) push_back(x)
using namespace std;
using ll=long long;
const int N=300005;
const ll M=998244353;
int a[N],b[N],c[N];
map<int,int> g;
vector<int> f[N];
int gt=0,n;
void upd(int x){for(;x<=n;x+=x&-x)c[x]++;}
int q(int x){int res=0;for(;x;x-=x&-x)res+=c[x];return res;}
void f1(){
sca... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#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 <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
#include <functional>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int,int>... | #include <bits/stdc++.h>
const int N = 400000;
bool tag[N + 5]; int fa[N + 5], s[N + 5];
int find(int x) {return (fa[x] == x ? x : fa[x] = find(fa[x]));}
void unite(int x, int y) {
int fx = find(x), fy = find(y);
if( fx != fy ) fa[fx] = fy, tag[fy] |= tag[fx], s[fy] += s[fx];
else tag[fx] = true;
}
int main() {
... |
#include <bits/stdc++.h>
using namespace std;
using llint = long long;
#define rep(a,n) for(int i=a;i<(n);++i)
int main() {
int N;
cin >> N;
int judge = N * 1.08;
if(judge > 206){
cout << ":(" << endl;
}else if(judge == 206){
cout << "so-so" << endl;
}else{
cout << "Yay!" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define vll vector<long long>
#define ll long long
#define pii pair<int,int>
const ll mod=1e9+7;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("inputf.txt"... |
#include <bits/stdc++.h>
#define s second
#define f first
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define read(x) for(auto& qw : (x)) cin >> qw;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
const int INF = ... | //#include <atcoder/maxflow.hpp>
#include <memory>
#include <iostream>
#include <map>
#include <list>
#include <set>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#include <limits>
#include <unordered_map>
#include <u... |
#include <bits/stdc++.h>
#define PRINT(x) cerr<<#x<<'='<<x<<endl
#define NL(x) " \n"[(x)]
#define sz(x) int((x).size())
#define all(x) begin(x),end(x)
#define mid (l+r)/2
#define fi first
#define se second
#define pb push_back
#define endl '\n'
#define lld long long
#define pii pair<int,int>
#define pli pair<lld,int>
#... | #include<bits/stdc++.h>
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i, 0, n)
#define all(x) (x).begin(),(x).end()
const int INF = 1e9+1;
using namespace std;
using ll = long long;
using p = pair<int, int>;
int main() {
ll N, C;
cin >> N >> C;
vector<pair<ll, ll>> D;
REP(i, N) {
int a... |
#include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long K){
for (int i = 0; i < K; i++)
{
if (N % 200 == 0){
N = N / 200;
}else{
N = N * 1000;
N = N + 200;
}
}
cout << N << endl;
}
// Generated by 1.1.7.1 https://gith... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
r... |
#include<bits/stdc++.h>
using namespace std;
long long pow(int k){
if (k==0) return 1;
else return 2*pow(k-1);
}
int main(){
long long N;
cin >> N;
int k = 0;
priority_queue<long long , vector<long long> , greater<long long>> pq;
while(N>=pow(k)){
long long a,b;
a = N/pow(k... | #include <iostream>
#include <vector>
#include <map>
#include <string>
using namespace std;
int main() {
uint64_t N;
cin >> N;
uint64_t a, b, c;
uint64_t ans = N;
for (b = 0; b < 100; b++){
if (1LL<<b > N) break;
for (int bb = b; bb < 100; bb++){
if (1LL<<bb > N) break... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define mydeb(fmt, ...) fprintf(stderr, fmt, __VA_ARGS__)
//#define mydeb(fmt, ...)
int main()
{
int64_t... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast","unroll-loops")
#define INF 2147483647
#define ll long long
#define ft first
#define sec second
#define pb push_back
#define pi pair<ll,int>
using namespace std;
ll t,n,a,b;
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> a >> b;
int x=min(a... |
#ifdef MY_LOCAL
#define MY_NAMESPACE(ns) namespace ns {
#define MY_NAMESPACE_ }
#define MY_DEBUG(s) s
#define MY_IS_DEBUG (true)
#else
#define MY_NAMESPACE(ns)
#define MY_NAMESPACE_
#define MY_DEBUG(s)
#define MY_IS_DEBUG (false)
#endif
#include <algorithm>
#include <bitset>
#include <cmath>
#in... | #include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=2e5+10;
map<string,int>f,fff;
string x[N];
int main(){
int n; cin>>n;
for(int i=0;i<n;i++){
cin>>x[i];
if(fff[x[i]]) continue;
fff[x[i]]=1;
int len=x[i].size();
//for(int j=1;j<=len;j++){
int ff=(x[i][0]=='!');
f[x[i].sub... | #include <bits/stdc++.h>
#include <algorithm>
#include <iterator>
#include <vector>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int N;
cin >> N;
vector<string> n(N);
vector<... |
#include <bits/stdc++.h>
#define INF 1e9
#define eps 1e-6
typedef long long ll;
using namespace std;
struct S{
ll v;
int tp;
}s[200010];
map <ll, bool> m1, m2, m3;
int n, cnt1, cnt2, cnt3, ss1, ss2, ss3, L, R;
ll s1[200010], s2[200010], s3[200010], ans = 1e18, anss = 1e18, ANS = 1e18;
char c[3];
inline ll abss(ll... | #include <bits/stdc++.h>
using namespace std;
typedef pair <int, int> pii;
const int N = 4e5 + 10;
int n, ans[N], p[N];
set <int> s[2];
set <int> :: iterator it;
pii a[N];
int main() {
scanf("%d", &n), n *= 2;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i].first);
a[i].second = i;
}
sort(a + 1, a +... |
// Problem Link -
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define ll long long int
#define ld long d... | #include<bits/stdc++.h>
#define SORT(v) sort(v.rbegin() , v.rend())
#define si(n) scanf( "%d" , &n)
#define sii(n , m) scanf( "%d %d" , &n , &m)
#define sl(n) scanf( "%lld" , &n)
#define sll(n , m) scanf( "%lld %lld" , &n, &m)
#define ss(cad) scanf( "%s" , cad)
#define sz(x) (int)x.size()
#define PB push_back
#define f... |
#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <fstream>
#include <bitset>
#include <cassert>
#include <functional>
#include <cstring>
#include <ctime>
#include <cmath>
#include <set>
#include <map>
#include <algorithm>
#define sec second
#define fir first
#define pb push_back
#define... | //#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <array>
#include <cassert>
//#include <chrono>
#include <cmath>
//#include <cstring>
//#include <functional>
//#incl... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long(i)=0;(i)<(n);(i)++)
#define kiriage(a,b) ((a)+(b)-1)/(b)
#define GCD(a,b) __gcd((a),(b))
#define LCM(a,b) (a)/GCD((a),(b))*(b)
int main(){
long n,a,b,c;
cin >> n;
long ans = LONG_MAX;
rep(i,n)
{
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
#define ALL(v) v.begin(),v.end()
#define sz(v) (ll)v.size()
const ll INF = 1e18;
const ll MOD = 998244353;
int main() {
ll n;
cin >> n;
vector<ll> a(n), p(n), x(n);
for... |
//
// Created by Tetsuya Shiota on 2019-04-13.
//
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cassert>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unorde... | #include <iostream>
using namespace std;
int main() {
int N;
int A[100000], B[100000];
int i = 0;
cin >> N;
//Aの読み込み
while (i < N) {
cin >> A[i];
i++;
}
//Bの読み込み
i = 0;
while (i < N) {
cin >> B[i];
i++;
}
//内積の計算
int sum = 0;
i = 0;
while (i < N) {
sum += A[i... |
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define LOG(...) cerr << "[" << #__VA_ARGS__ << "]: " << repr(__VA_ARGS__) << endl;
#define MSG(args) cerr << args << "\n";
#define debug(x) x
#else
#define LOG(...)
#define MSG(args)
#define debug(x)
#endif
#define mp make_pair
#define pb push_back
#define ... | // Standard I/O
#include <iostream>
#include <sstream>
#include <cstdio>
// Standard Library
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
// Template Class
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
//... |
#include <iostream>
int n, k, m;
int dp[105][500005], tmp[500005];
int Add(int x, int y)
{
return x + y >= m ? x + y - m : x + y;
}
int Sub(int x, int y)
{
return x - y < 0 ? x - y + m : x - y;
}
int Mul(int x, int y)
{
return 1ll * x * y % m;
}
int main()
{
std::cin >> n >> k >> m;
dp[0][0] = 1;
for(int i =... | #pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2")
#include <stdio.h>
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, --j){ A[i] -= A[j]; if... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#define INF (1e9)
vvi A;
int N, K;
// index が条件を満たすかどうか
bool isOK(ll val) {
vvi B(N + 1, vi(N + 1, 0));
// imosu
// B[i+1][j+1] = A[0][0] ~ A[i][j]
for (int i = 0; i < N;... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (int) x.size()
#define cat(x) cerr << #x << " = " << x << endl
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (int i = j; i <= n; ++i)
#define per(i, j, n) for (int i = n; j <= i; --i)
using... |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
/*
for(int i=0;i<n;i++){
}
*/
int main(){
int n;
cin>>n;
ll ans=0;
for(int i=1;i*i<=n;i++){
/*
int ok=-1;
int ng=n+1;
while(ng-ok>1){
int mid=(ok+ng)/2;
if(mid*i>n) ng=mid;
else ok=mid;
}
*/
ans+... | #pragma region shig_templates
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pairI2;
typedef pair<LL, LL> pairLL2;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
#define shig_for(i, a, b) for(int i... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dbl;
#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 FORA(i,I) for(const auto& i:I)
#define ALL(x) x.begin... | //In the name of Allah :)
#include <bits/stdc++.h>
using namespace std;
string to_string(char c) { return string(1,c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return (string)s; }
string to_string(string s) { return s; }
template<class A> string to_string(complex<A> ... |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int A[100000];
int64_t are[100000];
int main() {
int K, N, M; cin >> K >> N >> M;
int sum = 0;
REP(i, K) {
int64_t a; cin >> a;
int64_t a2 = a * M;
A[i] = a2 / N;
are[i] = (a2 - A[i] * N) << 32 | i;
sum += A[i];
... | #include<stdio.h>
#include<iostream>
#include<string>
#include<sstream>
#include<math.h>
#include<vector>
#include<algorithm>
#include<tuple>
using namespace std;
int main(){
long long k;
long long n;
long long m;
long long a[200000];
long long sum=0;
long long kiriage=0;
vector<pair<double,... |
#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 <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <complex>
using namespace std;
/* alias */
using ll = long long;
using ull = unsigned long long;
usin... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RREP(i, n) for(int i=(n);i>=0;--i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define DUMP(x) c... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define endl '\n'
int main()
{
ll i,j,n,q;
cin >> n;
string s;
cin >> s;
cin >> q;
ll id=0;
while(q--)
{
ll t,l,r;
cin >> t >> l >> r;
if(t==2)
{
id^=1;
continue;
... |
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define all(v) v.begin(), v.end()
#define rep(i, begin, end) for(int i = begin; i < (int)(end); i++)
#define contains(v, x) (find(all(v), x) != v.end())
template<class T> bool chmin(T& a, T b){ if (a > b){ a = b;... | #include <bits/stdc++.h>
using namespace std;
template<class T, class U> T &ctmax(T &x, const U &y){ return x = max<T>(x, y); }
template<class T, class U> T &ctmin(T &x, const U &y){ return x = min<T>(x, y); }
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
temp... |
#include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main()
{
ll n;
cin>>n;
ll i,j=0;
string s,x,p,h[n+5];
map<string,ll>a,b;
for(i=0;i<n;i++){
cin>>h[i];
s=h[i];
if(s[0]!='!'){
x="!";
x+=s;
a[x]++;
}
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=200010;
char p[maxn][12];
const ll mod=1000000009651;
struct pair_hash
{
template<class T1, class T2>
std::size_t operator() (const std::pair<T1, T2>& p) const
{
auto h1 = std::hash<T1>{}(p.first);
auto h2 = std... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A, B; cin >> A >> B;
if(A+B >= 15 && B >= 8 ) cout << 1;
else if(A+B >= 10 && B >= 3) cout << 2;
else if(A + B >= 3) cout << 3;
else cout << 4;
}
| // include
#include <algorithm>
#include <complex>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
//型短縮
#define ll long long
//マクロ定義
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int A, B;
cin >> A >> B;
int nyuko = A + B;
if (nyuko >= 15 && B >= 8) {
co... |
#include <iostream>
using namespace std;
int main()
{
int x;
std::cin >> x;
if(x>=0)
cout<< x;
else
cout<< 0<<endl;
return 0;
}
| #include <stdio.h>
int main(){
int N;
scanf("%d",&N);
printf("%d",N-1);
return 0;
} |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep_S(i,r,n) for(int i = r; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())
#define Output(a) cout << a << endl
typedef long long int ... | #include<bits/stdc++.h>
using namespace std;
const int MaxN = 2e5;
const int MaxA = 1e9;
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int N, v;
while(cin >> N){
long ans = 0;
vector<int> cnt(200);
for(int i = 0; i < N; i++){
cin >> v;
v = v % 200;
ans += cnt[v];
cnt[v]... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long(i)=0;(i)<(n);(i)++)
void dfs_root(vector<vector<long long>>& Graph, vector<long long>&root, vector<bool>&seen, long long cur){
for(auto it : Graph[cur]){
if(!seen[it]){
seen[it] = true;
root[it] = cu... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<bits/stdc++.h>
#define pp pair<ll,ll>
#define ll int
#define True 1
#define gcd __gcd
#define range(i,a,b,c) for(ll i=a;i<b;i+=c)
#define int long long
#define lb lower_bound
#define ub upper_bound
#define False 0
#define maxa(p,q) *max_element(p,q)
#defi... |
#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;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define rep(i, n) for(int i = 0;i < n;i++)
#define rep1(i, n) for(int i = 1;i < n;i++)
#define repr(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define ALL(a) ... |
#include <bits/stdc++.h>
using namespace std;
int n;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
printf("%d %d\n", (i*2 + 1) % n + 1, (i*2 + 2) % n + 1);
}
return 0;
}
| #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;
//#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 ll long long
using namespace std;
int n,m;
vector<int> w;
vector<tuple<int,int>>brg; // v / l
vector <vector<int>> adjList;
vector <int> segmentTree;
void build(int l, int r,int index){
if (l==r) segmentTree[index]=get<1>(brg[l]);
else{
int mid = l+r >>1;
bu... |
#include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// @@ !! LIM()
struct MyExc : exception {};
int main(/* int argc, char *argv[] */) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(20);
... | #include <iostream>
using namespace std;
typedef long long ll;
const ll INF = 1000000000000000000;
int main()
{
int n;
ll x;
cin >> n >> x;
ll a[105];
for(int i = 0; i < n; i++) cin >> a[i];
ll ans = INF;
for(int c = 1; c <= n; c++){
ll dp[102][102];
for(int j = 0; j <= c; ... |
//#pragma GCC optimize ("O3", "unroll-loops")
//#pragma GCC target ("avx2")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define LL long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define all_of(v) (v... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define int long long
int32_t main() {
cin.tie(0); ios_base::sync_with_stdio(false);
int dp[31][31];
dp[0][0] = 1;
for (int i = 0; i <= 30; ++i) {
for (int j = 0; j <= 30; ++j) {
if (i + j == 0) ... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
if (a + b >= a + c && a + b >= b + c)
{
cout << a + b;
}
else if (a + c >= a + b && a + c >= b + c)
{
cout << a + c;
}
else
{
cout << b + c;
}
}
| #include <iostream>
#include <bits/stdc++.h>
#define inf 1000000007
#define mod 1000000007
#define ll long long
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define vll vector<ll>
using namespace std;
//fast I/O
auto optimizer = []() { // makes I/O fast
ios::sync_with_stdio(0);
ci... |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std... | #include <bits/stdc++.h>
#define N 105
using namespace std;
template <typename T>
inline void read(T &num) {
T x = 0, f = 1; char ch = getchar();
for (; ch > '9' || ch < '0'; ch = getchar()) if (ch == '-') f = -1;
for (; ch <= '9' && ch >= '0'; ch = getchar()) x = (x << 3) + (x << 1) + (ch ^ '0');
num ... |
#include <bits/stdc++.h>
using namespace::std;
int main() {
int N;
cin >> N;
int p = 0;
int i = 0;
while(p < N) {
p += i + 1;
i += 1;
}
cout << i << endl;
} |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#inclu... |
//g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#inclu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<string> vs;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vll = vector<vl>;
using vpll = vector<pll>;
struct Edge {
ll to;
ll cost;
};
using Graph = vector<vector<Edge>>;
const int MAX = 10000000;
#def... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.