code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
while (cin >> n) {
ll l = 2, r = 2e9;
while (l <= r) {
ll mid = l + r >> 1;
if (mid * (mid + 1) / 2 <= n + 1)
l = mid + 1;
else
r = mid - 1;... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define LL long long int
int main()
{
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
LL N;
cin >> N;
LL ans=0;
map<LL,LL> hash;
for(LL i=2 ; i... |
#include <bits/stdc++.h>
using namespace std;
#define deb(k) cerr << #k << ": " << k << "\n";
#define size(a) (int)a.size()
#define fastcin cin.tie(0)->sync_with_stdio(0);
#define st first
#define nd second
#define pb push_back
#define mk make_pair
#define int long long
typedef long double ldbl;
typedef double dbl;
typ... | //...Bismillahir Rahmanir Rahim. . .
#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;
// typedefs...
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vect... |
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
//union-find
struct uni
{
vector<int>par,siz;
int g_;
uni(int n):par(n),siz(n,1LL),g_(n)
{
for(int i=0;i<n;i++)par[i]=i;
}
void init(int n)
{
par.resize(n);
siz.assign(n,1LL);
for(int i=0;i<n;i++)par[i]=i;
}
void merge(int x,int ... | #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 (c... |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define getchar_unlocked getchar
int A[100005];
int B[100005];
int offset[100005];
int minLevel1[100005];
int minLevel2[100005];
int N, L;
inline int nextInt(){
... | #include<bits/stdc++.h>
using namespace std;
template <typename T>
void print(const vector<T>& a, const string& name = "") {
if (!name.empty()) cout << name << ": ";
for (const auto& item : a) {
cout << item << " ";
}
cout << endl;
}
template <typename T1, typename T2>
void print(const pair<T1, T2>& p, const st... |
#include<iostream>
using namespace std;
int main()
{
int x;
cin>>x;
cout<<100-x%100;
return 0;
} | #include<bits/stdc++.h>
#define LL long long
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
const double eps=1e-7,PI=3.1415926;
const int N=1e6+10;
using namespace std;
int n,q,m,k,x,y,a[N],mx=-1,mn=1e9,sum;
string s,s1,s2;
map < int , int > mp;
vector < int > vec;
set < int ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define scan(any) for(auto &i:any) cin>>i;
#define print(any) for(auto i:any) cout<<i<<" ";
#define endl '\n'
#define pb push_back
#define vll vector<ll>
#define f(i,x,y) for(i=x;... | #include <bits/stdc++.h>
typedef long long ll;
#define ALL(l) (l).begin(),(l).end()
#define rep(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
using namespace std;
//const ll mod = 998244353;
//const ll maxn = 1000000000;
//-------------------------------------------------... |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define ll long long
using namespace std;
ll int mod=998244353;//1e9+7;
struct HASH{
size_t operator()(const pair<int,int>&x)const{
return hash<int>()(((int)x.first)^(((int)x.second)));
}
};
struct HASH1{
... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("unroll-loops, no-stack-protector")
#pragma GCC target ("avx")
#pragma GCC target ("avx2")
#pragma GCC target ("fma")
#define fastio ios_bas... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... |
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#include <arr... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
long double ans = 0;
for (int i = n - 1; i >= 1; i--) {
ans += 1 / (long double) i;
}
ans *= n;
cout << fixed << setprecision(17) << ans << '\n';
return 0;
}
/* stuff you shoul... |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int getRand(int l, int r)
{
uniform_int_distribution<int> uid(l, r);
return uid(rng);... |
#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define F first
#define S second
#define MP make_pair
#define LL long long
#define ULL unsigned long long
#define LB lower_bound
#define MOD1 1000000007
#define MOD2 1000000009
#define int LL
#define pii pair<int, int>
#define all(a) a.begin(), a.end(... |
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<t... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxN = 4e5 + 10;
ll N[2], Q, a[2][maxN];
ll tot, T[maxN], x[maxN], y[maxN], c[maxN], sum[2][maxN], d[2][maxN];
int read(); void write(ll);
int lowbit(int x){return x & -x;};
void update1(int x, int v, int t){
for(; x <= tot; x += lowbit(x)) ... |
#include <bits/stdc++.h>
#define pb(x) push_back(x)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define F(w,x,y) for(ll w=x; w<y; w++)
#define endl "\n"
#define mod 1000000007
#define INF 1000000000
typedef long long ll;
typedef long double ld;
using namespace std;
void play()
{
... | #include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define ll long long
#define mod 1000000007
#define mod2 998244353
void fast(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
}
long long binpow(long long a, long long b) {
if (b == 0)
re... |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <stack>
#include <queue>
#include <bitset> //UWAGA - w czasie kompilacji ... | #include<bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define Local
#ifdef Local
#define dbg(args...) do { cout << #args << " -> "; err(args); } while (0)
void err() { std::cout << std::endl; }
t... |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<ctime>
#include<map>
#define ll long long
#define MAXN 200005
#define uns unsigned
#define INF 0x3f3f3f3f
#define lowbit(x) ((x)&(-(x)))
#define MOD 998244353ll
using name... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define BIG 200005
struct Data{
double x;
double y;
bool operator<(const Data& right) const{
return x < right.x;
}
};
struct Dis{
double dis;
int i;
int j;
bool operator<(const Dis& ri... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define absdiff(a,b) (a>b)?a-b:b-a
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define fast ios_base::sync_with_stdio(false);cin.tie(0);
#define MOD 1000000007
#define ll_MAX 19223372036859
#define endl "\n"
ll f... | #include <iostream>
using namespace std;
/*
4 6
1 3 2 4
1 5 2 6 4 3
*/
int n,m;
int a[1005], b[1005];
int dp[1005][1005];
int main(){
scanf("%d%d", &n,&m);
for(int i=1; i<=n; i++) scanf("%d", a+i);
for(int i=1; i<=m; i++) scanf("%d", b+i);
for(int i=0; i<=m; i++) dp[0][i] = i;
for(int i=0; i<=n; i++) dp[i][0] =... |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int MAX32 = 2147483647;
const long long MAX64 = 9223372036854775807;
const double PI = 3.14159265358979323846;
long long a[200], n, flag = -1, zeroflag;
string b[200], c;
void dfs(long long num, string s, long long sum) {
if (num >= n... | #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;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if ... | #include<iostream>
#include<math.h>
using namespace std;
int main()
{
long long ans=0;
long double x,y,r;
cin >> x >> y >> r;
r+=1e-14;
long long a = (long long)ceil(x-r);
for(int i=a;i<=x+r;i++){
ans += floor(y+sqrt(r*r-(x-i)*(x-i)))-ceil(y-sqrt(r*r-(x-i)*(x-i)))+1;
}
cout << ans << en... |
#include<cstdio>
const int mod=998244353;
long long cqpow(long long bas,int fur)
{
long long res=1;
while(fur)
{
if(fur&1) res=res*bas%mod;
bas=bas*bas%mod;
fur>>=1;
}
return res;
}
int n,m,k;
long long ans;
int main()
{
scanf("%d %d %d",&n,&m,&k);
if(n==1) ans=cqpow(k,m);
else if(m==1) ans=cqpow(k,n);
e... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define For(i,a,b,c) for(ll i=a;i<b;i+=c)
#define For2(i,a,b,c) for(ll i=a;i>=b;i-=c)
#define vec_ll vector<vector<ll>>
#define vec_pr vector<pair<ll,ll>>
#define p_ll pair<ll,ll>
#define pbk push_back
#define mkpr make_pair
#define fst first
#define snd... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod=1e9+7;
ll x,y,a,b,res;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>x>>y>>a>>b;
ll cnt=0;
while((double)a*x<=2e18 && x*a<=x+b && x*a<y)
{
x=x*a;
cnt++;
}
res=((y-x-1)/b);
res=res+cnt;
cout<<res<<e... | #include <iostream>
#include <algorithm>
#include <vector>
#define int long long
using namespace std;
int32_t main() {
ios::sync_with_stdio(false);
int a[4];
cin >> a[1] >> a[2] >> a[3];
sort(a + 1, a + 1 + 3);
if(a[1] == a[2] && a[1] != a[3]) cout << a[3];
else if(a[2] == a[1] && a[2] == a[3]) cout << a[3];
... |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define test() int t;cin>>t;for(int test=1;test<=t;test++)
#define pb push_back
#define nl cout<<"\n"
#define all(x) x.begin(... | // C++ (GCC 9.2.1)
// 解き直し.
// https://atcoder.jp/contests/arc116/editorial/892
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b;... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n), p(n), x(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i) >> p.at(i) >> x.at(i);
}
bool check = false;
long long ans;
for (int i = 0; i < n; i++) {
if (a.at(i) < x.at(i)) {
check = true;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define scan(any) for(auto &i:any) cin>>i;
#define print(any) for(auto i:any) cout<<i<<" ";
#define endl '\n'
#define pb push_back
#define vll vector<ll>
#define f(i,x,y) for(i=x;... |
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using ld = long double;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_nod... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if ... |
#include<bits/stdc++.h>
#define REP(i,b,e) for(int i=(b);i<(e);i++)
#define RREP(i,b,e) for(int i=(e)-1;i>=(b);i--)
using T = std::tuple<int,int,int,int>;
int n, X[200], Y[200], R[200];
int put[10000][10000], scores[4], maxid;
int ltx[200], lty[200], rbx[200], rby[200];
bool row_has[10000], row_has_lazy[10000];
int w... | #include <bits/stdc++.h>
using namespace std;
const int SIZE = 10000;
template <class T> void chmin(T& a, T b) {
if (a > b) {
a = b;
}
}
template <class T> void chmax(T& a, T b) {
if (a < b) {
a = b;
}
}
struct Rect {
int x1, y1, x2, y2;
};
struct S {
int x;
int y;
int r;
Rect rect;
};
in... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector <long long> snuke;
int main() {
long long n;
cin >> n;
for(long long i = 1;i * i <= n;i++){
if(n % i == 0 && i * i != n){
snuke.push_back(i);
snuke.push_back(n / i);
}else if(i * i == n){
snuke.pus... | #include<bits/stdc++.h>
#define pb push_back
#define pl pair<ll,ll>
#define pll pair<ll,pair<ll,ll>>
#define ll long long
#define vl vector<ll>
#define fastio ios_base::sync_with_stdio(false); ... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define FILL0(x) memset(x,0,sizeof(x))
#define FILL1(x) memset(x,-1,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<... | /*Bismillahir Rahmanir Rahim*/
#include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define PI acos(-1.0)
using namespace std;
int main()
{
ios_base :: sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n,m,x,y,p,q;
cin>>n>>m>>x>>y;
char a[109][109];
ll i,j... |
#pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
int N, M;
std::vector<int> H;
std::vector<int> W;
void input(void){
std::cin >> N >> M;
H.resize(N);
for (int& hi : H)
std::cin >> hi;
W.resize(M);
for (int& wi : W)
std::cin >> wi;
... | #include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using Graph = vector<vector<int>>;
const int INF = 1001001001;
void printVec(vector<int> &vec) {
for (auto itr = vec.begin(); i... |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vecto... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i=a; i<=b; i++)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int) x.size()
#define pb push_back
#define f first
#define s second
#define nl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef vec... |
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
typedef long long int64;
typedef vector<int> vec;
typedef vector<int64> vec64;
#define ss cout << " ";
#define nn cout << "\n";
#define ct(x) cout << x;
#define cts(x) cout << x << " ";
#define ctn(x) cout << x << "\n";
#define db(x) cout << "> " << #x <<... | #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <list>
#include <string>
using namespace std;
#define rep(i,n) for (ll i=0;i<(n);i++)
typedef long long ll;
bool aaa[11111111];
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
ll gcd(ll a, ll b) {
if(a < b) return gcd(b, a);
unsigned... |
#include <cstdio>
#include <cmath>
#include <stack>
#include <queue>
#include <string>
#include <iostream>
#include <sstream>
#include <ostream>
#include <cstring>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <map>
#include <iomanip>
#include <set>
#include <bitset>
//#include<unordered_map>
#defi... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>
//#include<at... |
#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> A(N);
rep(i, N) cin >> A.at(i);
P p;
p = {0,0};
int cnt;
for(int i=2; i<=1000; ++i){
cnt=0;
rep(j,N){
if... | ////////////////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
namespace my {
/*汎用*/
template <typename T>
void input_vec(vector<T> &a, ll n) {
assert(a.empty());
for (ll i = 0; i < n; i++) {
T tmp;
cin >> tmp;
a.push_back(tm... |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N; string S, X; cin >> N >> S >> X;
vector<int> dp(7, 0);
dp[0] = 1;
for (int i = N - 1; i >= 0; i-... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld =... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll int t;
cin>>t;
while(t--)
{
ll int n;
cin>>n;
ll int m=(n-2)%4;
if(m==0){cout<<"Same"<<endl;}
else if(m==1||m==3||n==1){cout<<"Odd"<<endl;}
else{cout<<"Even"<<endl;}
}
... | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで str[0]=toupper(str[0]);
// g++ hoge.cpp -std=c++17 -I . でコンパイルできる
// -fsanitize=undefinedでオーバーフロー検出
#include <bits/stdc++.h>
//#include <atcoder/all>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define endl '\n'
#define ln cout<<endl
... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define reg register
#define x1 x11
#define x2 x22
#define y1 y11
#define y2 y22
#define z1 z11
#define z2 z22
const int mod=998244353;
const int maxn=6e5+5;
const int INF=2e18;
const double Pi=acos(-1.0);
const double Exp=1e-6;
inline int read()
{
int... | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using ld = long double;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_nod... |
#include <bits/stdc++.h>
/*#include <iostream>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <sstream>*/
#define ll long long
#define fop(i,m,n) for(int i=m; i<n; i++)
#define fastIO ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define X first... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define mp(a,b) make_pair(a,b)
#define vi vector<int>
#define mii map<int,int>
#define mpi map<pair<int,int>,int>
#define vp vector<pair<int,int> >
#define pb(a) push_back(a)
#define fr(i,n) for(i=0;i<n;i++)
#define rep(i,a,n) for(i=a;i<n;i++)
#defi... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
double n,d,h;
cin>>n>>d>>h;
vector<pair<double,double>> v;
for(int i = 0;i<n;i++)
{
ll dt,ht;
cin>>dt>>ht;
v.push_back({dt,ht});
}
double ans = INT_MAX;
for(int i = 0;i<n;i++)
{
ll check = 0;
double dt = v[i].first,ht... | #include<bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <chrono>
#include <complex>
using namespace std;
#define ll long long
#define ld long double
#define ui unsigned int
#define ull unsigned ll
#define mp make_pair
#define eb emplac... |
#include <algorithm>
#include <iostream>
using ll = long long;
using namespace std;
int main() {
int a[4];
for (int i = 0; i < 4; i++) cin >> a[i];
sort(a, a + 4);
if (a[0] + a[3] == a[1] + a[2] || a[0] + a[1] + a[2] == a[3])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define f(i,a,n) for(ll i=a;i<n;i++)
#define w(x) ll _t;cin>>_t;f(x,1,_t+1)
#define br cout<<"\n"
#define N 400001
ll md=1e9+7;
bool fun(ll a[],ll i,ll small,ll sm){
if(i==4){
return (small-sm)==sm;
}
return fun(a,i+1,small,sm+a[... |
/*
#pragma GCC optimize("O2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma")
//*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int ,int > pii;
mt19937 rng(chrono::steady_clock::now().time_sinc... | #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... |
#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>
using namespace std;
#define ll long long int
#define N 100005
#define MOD 1000000007
#define dd double
#define vi vector<int>
#define vll vector<ll>
#define forr(i,n) for(ll i=0;i<n;i++)
#define revf(i,n) for(ll i=n-1;i>=0;i--)
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define rep1(i,b) for(ll i=... |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
using namespace std;
using P = pair<int, int>;
using ll = long long;
const int mod = 1e9+7;
struct mint{
ll x;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() co... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,C;
cin >> A >> B >> C;
if(A>B){
cout << "Takahashi" << endl;
}else if(A<B){
cout << "Aoki" << endl;
}else{
if(C==0) cout << "Aoki" << endl;
else cout << "Takahashi" << endl;
}
} | #include <bits/stdc++.h>
using namespace std ;
int a , b , c , d ;
int main (){
cin >> a >> b >> c>> d ;
if(a*b<=d && d <=a*c){
cout << "No";
}
else{
cout << "Yes";
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18;
ll dp[55][2];
int main(){
int n; cin >> n;
ll X; cin >> X;
vector<ll> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
vector<ll> x(n);
for(int i = n-1; i>=0; i--){
x[i] = X / a[i];
X %= a[i];
}
dp[0][0] = 1... | #include<iostream>
#include<vector>
using namespace std;
int main() {
long long N,x;
cin >> N >> x;
vector<long long> A(N);
int i;
for(i=0;i<N;i++)cin >> A[i];
for(i=N-1;i>0;i--)A[i] /= A[i-1];
vector<long long> X(N,0);
X[0] = x;
for(i=1;i<N;i++) {
X[i] = X[i-1]/A[i];
X[i-1] %= A[i];
}
lon... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main(){
int n,k;
cin >> n >> k;
int x = (1 + k) * k / 2 * n;
int y = (1 + n) * n / 2 * 100 * k;
cout << x + y << endl;
}
| // AtCoder_Biginner_Contest_203.cpp : このファイルには 'main' 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pa... |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll INFLL = 2e18 + 5;
ll good(string x, ll n){
ll ans = 0;
for(char c: x){
if(ans > INFLL / n) return INFLL;
ans *= n;
ans += int(c - '0');
}
return ans;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t =... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
constexpr long long INF = 1000000000 + 100;
constexpr long long LINF = 1000000000000000000 + 100;
#define all(v) v.begin(), v.end()
#define rep(i, ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define benq queue
#define pbenq priority_queue
#define all(x) x.begin(), x.end()
#define sz(x) (ll)x.size()
#define m1(x) memset(x, 1, sizeof(x))
#define m0(x) memset(x, 0, sizeof(x))
#define inf(x) memset(x, 0x3f, sizeof(... |
// Problem : B - Quadruple
// Contest : AtCoder - AtCoder Regular Contest 107
// URL : https://atcoder.jp/contests/arc107/tasks/arc107_b
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
in... |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
char colorOnTop(char c0, char c1) {
if (c0 == c1) return c0;
if (c0 == 'W' && c1 == 'B') return 'R';
if (c0 == 'W' && c1 == 'R') return 'B';
if (c0 == 'B' && c1 == 'W') return 'R';
if (c0 == 'B' && c1 == 'R') return 'W';
if (c0 == 'R'... | #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;
typedef long long ll;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_cloc... |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define all(x) x.begin(),x.end()
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize... | #include<bits/stdc++.h>
using namespace std;
string s;
int main()
{
cin>>s;
for (int i=0;i<s.size();i++)
{
if (s[i]!='.') cout<<s[i];
else break;
}
return 0;
} |
// Problem: A - ABC Preparation
// Contest: AtCoder - AtCoder Beginner Contest 185
// URL: https://atcoder.jp/contests/abc185/tasks/abc185_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include<bits/stdc++.h>
using namespace std;
#define int l... | #include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<cmath>
#include<deque>
#include<vector>
#include<queue>
#include<string>
#include<cstring>
#include<map>
#include<stack>
#include<set>
#include<iomanip>
#include<ctime>
#define maxn 1000005
#define inf 0x7fffffffffff
#define mod 10000000... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <iomanip>
using namespace std;
typedef long long ll;
int main()
{
ll n, k;
cin >> n >> k;
for (ll q = 0; q < k; q++) {
if (n % 200 == 0) {
n /= 200;
}
else {
if (k - q == 1) {
cou... | //**He who has a why can survive almost any how***
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i,n) for... |
// #include<bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <algorithm>
#include <ctime>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <cassert>
#include <bitset>
using namespace std;
... | #include<iostream>
using namespace std;
int main()
{
int a[5],i,min=0;
for(i=0;i<4;i++)
{
cin>>a[i];
}
min=a[0];
for(i=1;i<4;i++)
{
if(min>a[i])
min=a[i];
}
cout <<min<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
using pss = pair<string, string>;
using pll = pair<ll, ll>;
using pls = pair<ll,string>;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, t... | //ayame保佑，夸哥保佑，狗妈保佑，MDR保佑，锉刀怪保佑，M99保佑，克爹保佑
#include<bits/stdc++.h>
using namespace std;
int P1=1000000,P2=0;
char buf[1000005],wb[1000005];
int gc() {
if(P1>=1000000)fread(buf,1,1000000,stdin),P1=0;
return buf[P1++];
}
#define gc getchar
#define Loli true
long long getint() {
long long ret=0,flag=1;
char c=gc();
w... |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
using namespace std;
long power_mod(long a, long b, long m)
{
int k = 0;
long c = b;
long n = 1L;
while (c >= 1)
{
c >>= 1;
++k;
}
for (int i = k; i >= 0; --i)
{
n = ((b >... | #include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define SZ(a) int((a).size())
#define _REP(_1,_2,_3,_4,name,...) name
#define _REP4(i,b,e,s) for(decltype(e) _b=(b),_e=(e),i=_b+(0<(s)?0:(s));(0<(s)?i<_e:_e<=i);i+=(s))
#define _REP3(i,b,e) for(decltype(e) _b=(b),_e=(e),i=(_b<_e?_b:... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mkp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define M1 1000000007
#define M2 998244353
#define fl(i,a,b) for(ll i=a;i<b;i++)
#define bfl(i,a,b) for(ll i=b-1;i>=a;i-... | #pragma GCC optimize("Ofast,inline,unroll-loops,fast-math")
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define mod 1000000007
#define mod1 998244353
#define INF LLONG_MAX
#define NINF LLONG_MIN
#define inf 1e18
#define all(v) v.begin(),v.end()
#define T ll test;cin>>test; while(test--)
#define rep(i,a,n) for(ll... |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define INF (int)2e9
#define mod 1000000007
#define PI 3.141592653589793238
#define all(a) (a).begin(),(a).end()
#define rep(i,a,b) for(int i=a; i<b; ++i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
const long double pi = acos(-1);
// g++ -std=c++17 -Wshadow -Wall -g -fsanitize=address -fsanitize=undefined -D_GLIBCXX_DEBUG -o
const int nax=205;
int dp[nax][nax][nax];
int n;
vector<int>a;
const int mod=200;
string ans1,ans... |
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
int main(){
ll N;
cin >> N;
vector<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0,endrep=(n); i<endrep; ++i)
#define rep1(i,n) for(ll i=1,endrep=(n); i<=endrep; ++i)
#define revrep(i,n) for(ll i=(n)-1; i>=0; --i)
inline constexpr ll Inf = (1ULL << 62) -1;
#define fastio cin.tie(nullptr); ios_base::sync_wi... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define repr(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define rep3r(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) std::begin(x), std:... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
set<string> Set;
LL getMin(string s){
sort(s.begin(), s.end());
LL ans = 0;
for(int i = 0;i<s.size();++i)
{
ans = ans *10+s[i]-'0';
}
return ans;
}
LL getMax(string s){
sort(s.begin(), s.end(), greater<LL>());
LL... |
#include <bits/stdc++.h>
using namespace std;
#define all(c) c.begin(),c.end()
#define sz(x) int(x.size())
#define ar array
typedef long long ll ;
typedef vector<int> vi;
#define mod 1000000007
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll exp(ll x,ll y){
x%=mod;
ll res=1;
while(y){... | #include<bits/stdc++.h>
#define ll long long
#define re register
#define INF 2147483647
using namespace std;
inline int read()
{
int f=1,x=0;char s=getchar();
while(s<'0'||s>'9')
{
if(s=='-') f=-1;
s=getchar();
}
while(s>='0'&&s<='9')
{
x=x*10+s-48;
s=getchar();
}
return f*x;
}
const int p=1e9+7;
cons... |
#include<bits/stdc++.h>
using namespace std;
#define _rep(i, x, y) for(int i = (int)x; i < (int)y; ++i)
#define _dep(i,x,y) for(int i = (int)x; i > (int)y; i--)
#define PII pair<int,int>
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define PQ priority_queue
#define lb lower_bound
#def... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
long t[n][n]; //t[0]= city1
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
cin >> t[i][j];
}
}
int p[n]; //p[0] = city 1
for(int i=0; i<n; i++){
p[i]=i;
}
long... |
#include<bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
const ll mod = 1e9+7;
const int maxn = 2005;
char s[2005][2005];
ll qpow(ll a,ll b){
ll res=1ll;
while(b){
if(b&1)res=res*a%mod;
a=a*a%mod;
b>>=1;
}
return res;
}
int n,m;
ll c[maxn],l[maxn],nn[maxn][maxn];
int main() {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define F first
#define S second
int d[200005];
int sz[200005];
int fi(int x) {
if (d[x] == x) {
return x;
}
else {
return d[x] = fi(d[x]);
}
//return d[x] == x ? x : d[x] = fi(d[x]);
}
int main... |
//#include "bits/stdc++.h"
#include <iostream>
#include <vector>
// #include <map>
// #include <string>
#include <algorithm>
// #include <numeric>
// #include <limits>
using namespace std;
int main() {
int n;
long k = 1;
long res = 1000000000 + 7;
cin >> n;
vector<int> a(n);
for (int i = 0; i... | #include <bits/stdc++.h>
#define task "B"
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i < (r); ++i)
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FORD(i, r, l) for (int i = (r); i >= (l); --i)
#define DB(X) { cerr << #X << " = " << (X) << '\n'; }
#define DB1(A, _) { cer... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T &a,T b){if(a>b)a=b;}
... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char* argv[]) {
int N;
cin >> N;
int count=0;
std::string s, ds;
bool found;
for(int i=1; i<=N; i++) {
std::stringstream ss, dss;
found = false;
ss << std::oct << i;
s = ss.str();
dss <... |
#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;
#define ll long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define MOD 1000000007
#define MOD2 1000000009
#define MOD3 998244353... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define mem1(a) memset (a,-1,sizeof(a))
#define mem0(a) memset (a,0,sizeof(a))
#... |
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
const int kMaxN = 2e5 + 1;
struct E {
int x, y, v;
bool operator<(const E &_e) const {
return x < _e.x;
}
} e[kMaxN];
map<int, int> v;
int n, m, ans;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> e[i].... | #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<math.h>
#include<time.h>
#include<deque>
#include<cstring>
#define ll long long
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
#define F first
#define S second
#define mp make_pair
#... |
#include<cmath>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<cstring>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<deque>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<string>
#include<sstream>
#i... | #include <bits/stdc++.h>
using namespace std;
//-(smallstar))---- :]
#define int long long
#define ll long long
#define ld long double
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define fr(i, n) for (int i = 0, _##i = (n); ... |
#ifdef DBG_MACRO_NO_WARNING
#include <dbg.h>
#endif
#include <bits/stdc++.h>
#define all(c) begin(c), end(c)
#define isz(c) (int)(c).size()
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
template <typename InputIterator,
typename T = typename iterator_traits<In... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int Mx=1e6+11;
const double pi = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
... |
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
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<pii>;
using vpll =... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int... |
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = m... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = s; i < (ll)(n); i++)
struct BIT {
private:
int N;
public:
vector<ll> bit;
BIT(ll size) {
N = size;
bit.resize(N);
}
void add(ll a, ll w) {
for (ll x = a; x <= N; x += x & -x)
bit[x] += w;
... |
#include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
int main(){
int64_t L,ansue=1,anssita=1,ans;
cin>>L;
for(int i=0;i<11;i++){
ansue*=L-1-i;
anssita*=i+1;
if(ansue%2==0&&anssita%2==0){
ansue/=2;
anssita/=2;
}
if(ansue%3==0&&anssita%3==0){
ansue/=3;
... |
// Problem: A - Rotate
// Contest: AtCoder - AtCoder Beginner Contest 197（Sponsored by Panasonic）
// URL: https://atcoder.jp/contests/abc197/tasks/abc197_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include<bits/stdc++.h>
using namespace std;
#defi... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mp make_pair
#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) (ll)((x).size(... | /**
Lost Arrow (Aryan V S)
Saturday 2021-03-13
**/
#ifdef LOST_IN_SPACE
# if __cplusplus > 201703LL
# include "lost_pch1.h" // C++20
# elif __cplusplus > 201402LL
# include "lost_pch2.h" // C++17
# else
# include "lost_pch3.h" // C++14
# endif
#else
# include <bits/stdc++.h>
#endif
constexpr b... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"
#define all(v) begin(v),end(v)
#define pb push_back
#define fr first
#define sc second
#define si(s) (int)s.size()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define dig(a) fixed<<setprecision(a)
#define fast ios_base::sync_with_stdio(fa... | #include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using ll = long long;
using ld = long double;
using namespace std;
const ll inf = 2e18;
const ll mod = 1e9 + 7;
const ll N = 2e5 + 5;
int a, b, c;
void code() {
cin >> a >> b >> c;
vector<int> v{a, b, c};
sort(all(v));
if (v[2] - v[1] == ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MAX_N = 200'000;
ll N, P, Q, U, D;
vector<ll> G[MAX_N];
ll in[MAX_N], out[MAX_N];
vector<vector<ll>> mat;
ll cnt = 0;
void dfs(ll u, ll d) {
in[u] = cnt++;
mat[d].push_back(in[u]);
for (auto v : G[u]) {
dfs(v, d + 1);
}
out[u... | #include <iostream>
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
class BIT {
public:
int size_ = 1;
vector<long long> dat;
void init(int sz) {
size_ = sz + 2;
dat.resize(size_ + 2, 0);
}
voi... |
/* Author: rrrr_wys
**/
#include <bits/stdc++.h>
#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 pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
typedef double db;
typedef long long ll;
using namespace... | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cerr<<#x<<": "<<(x)<<endl
using namespace std;
using llong = long long;
using vi = vector<int>;
using vvi = vector<vi >;
using vvvi = vector<vvi >;
using pii = pair<int,int>;
constexpr i... |
#include<bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <chrono>
#include <complex>
using namespace std;
#define ll long long
#define ld long double
#define ui unsigned int
#define ull unsigned ll
#define mp make_pair
#define eb emplac... |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class c, class cmp = less<c> > using ordered_set = tree<c, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NU... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,ans;
int main(){
cin>>n;
for(ll i=1000;i<1000000000000000000;i*=1000){
if(i>n) break;
ans+=n-(i-1);
}
cout<<ans<<endl;
return 0;
} | #include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <utility>
#include <map>
#include <list>
#include <climits>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#i... |
//dragon->emperor
#include <bits/stdc++.h>
using namespace std;
/**********************************************************************************/
#define mod 1000000007
#define mod2 998244353
const double pi = acos(-1);
#define inf 1e18+5
#define iinf 1e9+5
#define ll long long
#define ld long double
#define fl... | #include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <bitset>
#include <string>
#include <cstdio>
#include <cmath>
#include <climits>
using namespace std;
const long long INF = 1000000007;
typedef pair<int, int> P;
template<class T>
T gcd(T a, T b)
{
... |
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
void aa(int a,int b)
{
if(a>b)
cout<<">";
else if(a<b)
cout<<"<";
else
cout<<"=";
}
int main()
{
int a,b,c;
cin>>a>>b>>c;
if(c==0)
co... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long N,mod=7;
string S1,S2;
cin >> N >> S1 >> S2;
vector<long long> V(N);
vector<bool> W(N);
long long pow10 = 1;
for(int i=N-1;i>=0;i--){
V[i] = (S1[i]-'0') * pow10;
V[i] %= mod;
pow10 *= 10;
pow10 %= mod;
}
for(int i=0;i... |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string S;
cin >> S;
for (auto &ch : S)
if (ch == '6')
ch = '9';
else if (ch == '9')
ch = '6';
for (int i = S.length() - 1; i >= 0; i -= 1)
cout << S[i];
} | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <numeric>
#include <iomanip>
#include <algorithm>
using namespace std;
int main(void) {
int n;
cin >> n;
cout << n / 100 +(n % 100 == 0 ? 0 : 1) << endl;
} |
#include <bits/stdc++.h>
#define rep(i, N) for(int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> vi;
const int INF = (1 << 30); // > 10^9, int 2*INF
int main() {
int a, b, ans = 0, flag = 0;
cin >> a >> b;
//vi a(n); rep(i, n) scanf("%d", &... | #include<bits/stdc++.h>
using namespace std;
#define FastIO ios_base :: sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define read(in) freopen("Input.txt","r",stdin)
#define write(out) freopen("Ouput.txt","w",stdout)
#define pf printf
#define sf scanf
#define fr0(i,n) for(int i=0 ; i<n ; i++)
#define fr1(i,n) for(i... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int INF = (int)1e9;
constexpr long long LINF = (long long)1e18;
constexpr long long MOD = 1e9 + 7;
//constexpr long long MOD = 998244353;
constexpr double pi = 3.141592653589793238;
int main() {
string s;
cin >> s;
string t1,... | #include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
cin >> s;
vector<string> subs;
string tmp = "";
for(int i = 0; i < s.size() ; ++i){
if(s[i] != 'R'){
tmp += s[i];
}
else{
subs.push_back(tmp);
tmp = "";
}
if(i == s.size()-1){
subs.push_back(tm... |
#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;
//#include<atcoder/all>
//using namespace atcoder;
#define REP(i,n) for (int i=0; i<(n); ++i)
#define ALL(x) begin(x),end(x)
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
struct fast_ios {
fast_ios() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
... |
#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define debugg(x) cout<<#x<<'='<<x<<endl;
#define debug1(x,y,z) cout<<#x<<' '<<x<<' '<<#y<<' '<<y<<' '<<#z<<' '<<z<<endl;
#define debug cout<<endl<<"********"<<endl;
#define ll long long
#define u... | #include <iostream>
#include <cstring>
#include <cstdio>
#define LL long long
#define mod 1000000007
using namespace std;
int T;
LL n,a,b;
inline LL cal(LL n,LL a)
{
return (n-a+1)*(n-a+1)%mod;
}
LL pow_mod(LL a,LL b)
{
LL ret=1;
while (b)
{
if (b&1) ret=ret*a%mod;
b>>=1;
a=a... |
#line 2 "header.hpp"
//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H
// template version 2.0
#include <bits/stdc++.h>
using namespace std;
// varibable settings
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;
#define _overload3(_1, _2, _3, name, ...) name
#define ... | #include <bits/stdc++.h>
#define endl "\n"
#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 e_b emplace_back
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ipair;
typedef pair... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //required
#include <ext/pb_ds/tree_policy.hpp> //required
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_update>;
// find_by_order(k) r... | // atcoder/arc107/D/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << ... |
//
//AtCoder Beginner Contest 182
//D
//
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
#include <bitset>
#include <numeric>
using namespace std;
#... | #include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int N = 2e5+10;
struct Node
{
int l,r;
bool operator<(const Node& a )const
{
return l<a.l;
}
}line[N];
int a[N],m;
long long tr[N];
int lowbit(int x)
{
return x&(-x);
}
void add(int x,int d)
{
for(;x<=m+m;x... |
#include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
#define sz(v) (int)(v.size())
#define prin(a) cout << #a << " = " << a << endl
#define prinv(v) cout << #v << " = "; for(auto it : v) cout << it << ", "; cout << endl
#define all(v) (v).begin(),(v).end()
typedef long long ll;
#def... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Q;
string S, S1, S2;
cin>>N>>S>>Q;
vector <int> T (Q+1);
vector <int> A (Q);
vector <int> B (Q);
for (int i=0; i<Q; i++)
cin>>T.at(i)>>A.at(i)>>B.at(i);
T.at(Q)=1;
for (int i=0; i<Q; i++){
if (T.at(i)==1)
s... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define puts(x) cout<<x<<endl
#define inf 100000000000
#define minf -LLONG_MAX
#define all(v) (v).begin(),(v).end()
#define odd(x) x%2==1
#define YES cout<<"YES\n"
#define NO cout<<"NO\n"
#define Yes cout<<"Yes\n"
#define No cout<<"No\n"
#define prese... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl '\n'
//#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++... |
#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;
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>
#include <unordered_set>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repm(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define repm2(i, s, n) for (int i = (int)(n - 1); i >= (s); i--)
#define all(v... | #include <algorithm>
#include <cstdint>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <cfloat>
... |
#include<bits/stdc++.h>
using namespace std;
#define INIT ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#... | #include<cstdio>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
#define fi first
#define se second
#define rep(i, l, r) for(int i=(l), i##_end_=(r); i<=i##_end_; ++i)
#define fep(i, l, r) for(int i=(l), i##_end_=(r); i>=i##_end_; --i)
typedef long long ll;
template<class T>inline T fab(T ... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define forn_1(i,a,b) for(int i=a;i<b;i++)
#define forn(i,a,b) for(int i=a;i<=b;i++)
void solve()
{
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string str;
cin>>str;
int n=str.size();
reverse(str.begin(... | #include <bits/stdc++.h>
#define ull unsigned long long
#define ll long long
using namespace std;
#define rep(i, x) for (int i = 0; i < x; i++)
// const int INF = 998244353;
const int MOD = 998244353;
int main() {
int n;
cin >> n;
cout << n-1;
} |
#include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> ... | // #pragma GCC optimize("unroll-loops", "omit-frame-pointer", "inline")
// #pragma GCC option("arch=native", "tune=native", "no-zero-upper")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("tree-vectorize","openmp","predic... |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s,t="";
cin >> s;
int n=s.size();
int i=0;
while(i < n && s.at(i)!='.'){
t+=s.at(i);
i++;
}
cout << t << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fst ios_base::sync_with_stdio(false);cin.tie(0), cout.tie(0);
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define debug(a...) cout<<#a<<": ";for(auto it:a)cerr<<it<<" ";cout<<endl;
typedef long long ll;
vector<int>a;
voi... |
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN=1e5+4;
int fir[MAXN],nex[MAXN],to[MAXN],f[MAXN],sz[MAXN],tot;
struct node{
int x,id;
bool operator<(const node &i) const{
return x>i.x;
}
}st[MAXN];
void add(int u,int v) {
nex[++tot]=fir[u];
fir[u]=tot;
to[to... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1... |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define pii pair<int,int>
#define pll pair<long long, long long>
using namespace std;
const int mod = 1e9+7;
#define INF INT_MAX
int sum(int x, int y)
{
return (x+y)%mod;
}
int mult(int x, int y)
{
return (1ll * x * y)% mod;
}... | #include <bits/stdc++.h>
using namespace std;
//0-indexed
template<typename T>
struct BIT {
using F = function<T(T,T)>;
private:
const int n;
vector<T> dat;
const F operation;
public:
BIT (const int n_, const F operation_) : n(n_+1), dat(n_+1, 0), operation(operation_) {}
BIT (const ... |
#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<ll>;
using istack = stack<int>;
using iqueue = queue<int>;
using ivv = vector<vector<int>>;
using lvv = vector<vector<ll>>;
const int INF =... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <vector>
#include <map>
#include <memory>
#include <list>
#include <deque>
#include <queue>
#include <iomanip>
#include <set>
#include <stack>
#include <numeric>
#include <unordered_set>
#include <unordered_map>
#inc... |
/**
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⡖⠁⠀⠀⠀⠀⠀⠀⠈⢲⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣼⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣧⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣸⣿⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣿⣇⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣿⣿⡇⠀⢀⣀⣤⣤⣤⣤⣀⡀⠀⢸⣿⣿⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢻⣿⣿⣔⢿⡿⠟⠛⠛⠻⢿⡿⣢⣿⣿⡟⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣀⣤⣶⣾⣿⣿⣿⣷⣤⣀⡀⢀⣀⣤⣾⣿⣿⣿⣷⣶⣤⡀⠀⠀⠀⠀
⠀⠀⢠⣾⣿⡿⠿⠿⠿⣿⣿⣿⣿⡿⠏⠻⢿⣿⣿⣿⣿⠿⠿⠿⢿⣿⣷⡀⠀⠀
⠀⢠⡿⠋⠁⠀⠀⢸⣿⡇⠉⠻⣿⠇⠀⠀⠸⣿⡿⠋⢰⣿⡇⠀⠀⠈⠙⢿⡄⠀
⠀⡿⠁⠀⠀⠀⠀⠘⣿⣷⡀⠀⠰⣿⣶⣶⣿⡎⠀⢀⣾⣿⠇⠀⠀⠀⠀⠈⢿⠀
⠀⡇⠀⠀⠀⠀... | #include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define MOD 1000000007
#define MOD1 998244353
#define vin(v,k) fo(i,k)cin>>a,v.pb(a);
#define INF 1e18
#define nline "\n"
#define pb push_back
#define ppb pop_back
#define makep make_pair
#define f... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 400005;
const long long int MOD = 998244353;
long long int fact[MAXN], inv_fact[MAXN], ways[MAXN];
int pfact[MAXN];
long long int power(long long int a, int b)
{
if (b == 0)
{
return 1;
}
long long int ans = power(a, b/2);
ans = (ans * ans) % MOD;
i... | /* Jai Shree Ram 🚩🚩🚩 */
#include "bits/stdc++.h"
#define ll long long int
#define oo 1000000000000000000
#define forr(i,n) for(int i=0;i<n;i++)
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define all(x) x.begin(),x.end()
#define unique(v) sort(all(v)); v.resize(distance(v.begin(),unique(a... |
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
struct info
{
ll bit;
int place;
};
long long MOD = 1000000007;
ll... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ll long long
#define pb push_back
#define Mid ((L+R)/2)
#define pi pair<int,int>
#define pii pair<pi,int>
#define deb(x) cout<<#x<<"="<<x<<endl
#define go ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
int n;
ll dp[17][1<<18],a[2... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> a(n, 0);
vector<long long> b(n+1, 0);
vector<long long> c(n+1, 0);
for(int i = 0; i < n; ++i){
cin >> a[i];
}
long long ans = 0;
for(int i = 0; i < n; ++i){
b[i+1] = b[i] + a[i];
// cout << b[i+1] << " ";
}
// ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)((n)-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se seco... |
/**
* author: Ujjwal Tripathi
* created: 29.05.2021 16:07:47
**/
#include<bits/stdc++.h>
using namespace std;
#define ar array<ll, 2>
#define ll long long
#define in insert
#define pb push_back
#define pii pair<ll,ll>
#define vt vector
#define P_Q(x) priority_queue<x>
#define p_q(x) priority_queue<x, ve... | #include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i=0; i<(n); i++)
#define ALL(n) n.begin(), n.end()
int main(){
int n; cin >> n;
double x0, y0, xn, yn;
cin >> x0 >> y0;
cin >> xn >> yn;
double cx=(x0+xn)/2, cy=(y0+yn)/2;
double move_x=x0-cx, move_y... |
#include <iostream>
using namespace std;
int main()
{
char x ,y,z;
cin>>x>>y>>z;
if(x>=65&&x<=90)
{
if(y>=65&&y<=90)
{
if(z>=65&&z<=90)
{
if(x==y && y==z)
cout<<"Won\n";
else
cout<<"Lost\n";
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
char c1, c2, c3;
cin >> c1 >> c2 >> c3;
string ans = "Lost";
if (c1 == c2) {
if (c2 == c3) {
ans = "Won";
}
}
cout << ans << endl;
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.