code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <iostream>
using namespace std;
int main(void){
// Your code here!
int N,A,B;
cin >> N >> A >> B;
cout << N-A+B << endl;
}
| #include <bits/stdc++.h>
// 1. bs
#define int long long
#define cf(i, a, b) for(int i=a;i<=b;i++)
#define cb(i, a, b) for(int i=a;i<=b;i--)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __bui... |
// Created by Amal P Mathews
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i,n) for(ll i=0;i<n;i++)
#define tc() ll t;cin>>t;while(t--)
#define rem 1e9+7
#define pb(v,i) v.push_back(i)
#define vll vector<ll>
#define Arin(a,n) loop(i,n)cin>>a[i];
#define Arout(a,n) loop(i,n)cout<<a[... | #include <bits/stdc++.h>
using namespace std;
using comp = complex<double>;
const long double PI = acosl(-1.0);
int main(void) {
int n;
cin >> n;
double p, q, r, s;
comp a, b, c, d, ans;
cin >> p >> q;
cin >> r >> s;
a = p + q * 1i;
b = r + s * 1i;
c = (a + b) / 2.0;
double t =... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<cmath>
#include<queue>
#include<stack>
#include<deque>
#include<list>
#include<bitset>
#include<sstream>
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define REP(i, n) for(int i = 0;... |
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
long long N;
cin >> N;
int cont = 0;
int i = 1;
long long M = 11;
while(M <= N)
{
cont++;
i++;
int dig = to_string(i).length();
M = i * pow(10, dig) + i;
}
cout << cont << endl;
return 0;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define mod 998244353
#define int long long
#define INF 1e9
#define endl "\n"
#define pi 2*acos(0.0)//M_PI in cmath lib
#define sp(x) setprecision(x)
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(x) x.... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define repn(i,n) for(int i=1;i<=n;++i)
#define LL long long
#define pii pair <int,int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
int n,cnt,ans=0;
vector <int> g[400010];
bool ... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll n,m;cin>>n>>m;
vector<string> s;
ll odd=0,even=0;
for(ll i=0;i<n;i++){
string str;cin>>str;
ll ct=0;
for(ll j=0;j<m;j++){
if(str[j]=='1'){
ct++;
}
}
ct%2?odd++:even+... |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,r,l) for(int i=(r);i>=(l);--i)
#define fi first
#define se second... | #include <stdio.h>
#include <algorithm>
#include <vector>
#define MN 100000
int n;
std::vector<int> e[MN+5];
void add(int u,int v){
e[u].push_back(v);
}
struct state{
int c,f,s;
}s[MN+5];
void dfs(int u){
s[u].c = 1;
s[u].f = 1;
s[u].s = 0;
std::vector<int> ve[2];
for(auto v:e[u]){
dfs(v);
s[u].c += s[v... |
#include "bits/stdc++.h"
#define ll long long int
#define MOD 1000000007
#define oo 1000000000000000000
#define forr(i,n) for(ll 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 eb emplace_back
#define mem(a,v) memset(a,v,sizeof(a))
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long int lli;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef unsigned long long int ulli;
void fast_io(){
ios_base::sync_with_stdio(0);
cin.tie(0);
}
int main(){
fast_io();
//code starts here
double n;
cin >> ... |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
// find_by_order(k) returns the iterator to the kth largest element (start from 0)
// order_of_key(k) returns the number of elements in the set which are strictly less than the value k
using namespace std;
using namesp... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<string> VS;
typedef vector<P> VP;
typedef vector<V> VV;
typedef map<ll, ll> MP;
typedef multimap<ll, ll> MMP;
typedef set<ll> SET;
typedef multiset<ll> MSET;
#define loop(i,n) for(ll i = 0... |
#include "bits/stdc++.h"
using namespace std;
const int N = 2e5 + 5;
char s[N], x[N];
int dp[N][7];
int n;
int solve (int pos, int rem) {
if (pos == n) {
return rem == 0;
}
int &ret = dp[pos][rem];
if (ret != -1) {
return ret;
}
ret = 1;
int dig = s[pos] - '0';
int hi = solve(pos + 1, (10 *... | #include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
string s, x;
cin >> s >> x;
bool b[7]{0};
b[0] = true;
for(int i = n - 1; i > 0; i--){
bool c[7];
if(x[i] == 'T'){
for(int j = 0; j < 7; j++){
c[j] = false;
for... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n; cin >> n;
vector<vector<int>> dp(n + 1, vector<int> (13, 0));
dp[0][0] = 1;
for(int j = 1; j <= n; j ++) {
for(int i = 1; i <= 12; i ++) {
if(i > j)
continue;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define pb push_back
#define str string
#define mp make_pair
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define REP(i, n) for(int i = 0; i < (int)n; ++i)
#define all(x) (x).... |
// Problem: A - kcal
// Contest: AtCoder - AtCoder Beginner Contest 205
// URL: https://atcoder.jp/contests/abc205/tasks/abc205_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define Jai_shri_Ram ios_base::sync_with_stdi... | #include <bits/stdc++.h>
using namespace std;
int main() {
double A = 0, B = 0;
cin >> A >> B;
if (A==0 || B==0) {
cout << 0 << endl;
return 0;
}
cout << (B / 100) * A << endl;
} |
#include<bits/stdc++.h>
#define ff first
#define ss second
#define ld long double
#define ll long long int
#define mod 1000000007
#define vll vector<ll>
#define pll pair<ll, ll>
#define uom unordered_map
#define uos ... | #include "bits/stdc++.h"
using namespace std;
int main(){
cout << fixed << setprecision(15);
double a,b;cin >> a >> b;
double ans = a/100.0*b;
cout << ans << endl;
} |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#include <deque>
#include <complex>... | #include<bits/stdc++.h>
using namespace std;
#define endl "\n";
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
ll n,s=0,ma=0;
cin>>n;
double a[n],sum=0;
for(int i=0;i<n;i++){
cin>>a[i];
ll k=abs(a[i]);
ma=max(ma,k);
s+=abs(a[i]);
sum+=a[i]*a[i];
}
printf("%lld\... |
/**
* Author : Tanbin_Hasan
* Created : 15.11.2020
**/
#include <bits/stdc++.h>
using namespace std ;
typedef int_fast64_t ll ;
typedef uint_fast64_t ull ;
double pi = acos(-1.0) ;
double eps = 1e-9 ;
ll L = 31250001 ;
const ll md = 1e9 + 7 ;
#define pb push_back
#define SP(x) cout << fixed << setprecision(x)
... | /**
* author : madhav
* handle : madhav10
**/
#include <bits/stdc++.h>
using namespace std;
#define For(start,end,inc) for( int i=(start);i<(end);i+=inc)
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mp make_pair
bool isPalindrome(string s){
int n=s.length();
fo... |
#include <bits/stdc++.h>
#define int ll
#define double long double
#define rbtree __gnu_pbds::tree<int,__gnu_pbds::null_type,less<int>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);
#define pb push_back
#define ALL(X) X.begin(),X.end()
#de... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef pair<int,int> pi;
typedef pair<lld,lld> pl;
typedef pair<int,lld> pil;
typedef pair<lld,int> pli;
typedef vector<int> vit;
typedef vector<vit> vitt;
typedef vector<lld> vlt;
typedef vector<vlt> vltt;
typedef vector<pi> vpit;
typedef vector... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_
void debug_out() {cerr << endl;}
template<typename Head,typename... Tail> void debug_out(Head H,Tail... T){cerr << ' ' << H; debug_out(T...);}
#define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:",debug_out(__VA_ARGS__)
#define dump(x) cer... |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << e... | #include<iostream>
using namespace std;
using ll = long long;
int main() {
int T,i;
cin>>T;
for (i=0;i<T;i++) {
ll L,R,ans = 0;
cin>>L>>R;
if (L*2<=R) {
ans = (R-L*2+2)*(R-L*2+1)/2;
}
cout<<ans<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair <int, int>
#define vi vector<int>
#define FOR(i, a, b) for (int i=a; i<b; i++)
#define FORd(i, a, b) for (int i=a-1; i>=b; i--)
#define F0Rd(i, a) for (int i=a-1; i>=0; i--)
#define F0R(i, a)... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
co... |
#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>
using namespace std;
typedef long long ll;
typedef long double ld;
int a[3005][5];
int n;
string tostr(int x){
string str = "";
while(x){
str += x%3 + '0';
x /= 3;
}
while(str.size() <= 5) str += '0';
return str;
}
bool check(int k){
for(int j=0; j<... |
#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 drep(i,n) for(int i = (n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
template <class T> bo... | /*
*
*
* Copyright 2020 Tanishk <tanishktonk>
* ........ ;)
*
*
*/
#include <bits/stdc++.h>
#define ll long long int
#define fr(i,n) for(i=0;i<n;i++)
#define rng(i,a,b) for(i=a;i<b;i++)
#define T long long int T;cin>>T;while(T--)
#define ain(a,n) for(int zzz=0;zzz<n;zzz++){cin>>a[zzz];}
#define aout(a,n) fo... |
#include <iostream>
#include <unordered_set>
using namespace std;
using ll = int64_t;
int main(){
ll N;
cin >> N;
unordered_set<ll> s;
for(ll a = 2; a * a <= N; a++){
ll x = a * a;
while(x <= N){
s.insert(x);
x *= a;
}
}
cout << N - s.size() << en... | #include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <nume... |
#include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long LL;
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
#define sz(v) (int)(v).size()
#define rep(i, x, y) for(int i = x, i##end = y; i <= i##end; ++i)
#define per(i, x, y) for(int i = x, i##end = y; i >= i##end... | #include<iostream>
#include<list>
#include<map>
#include<vector>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof..... |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(a) a.begin(),a.end()
#define sz(a) (int)(a.size())
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#defi... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
int32_... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f1 first
#define s2 second
#define fastio ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(x) cerr << "[" << #x << "]: " << x << "\n";
using ll = long long;
using ld = long double;
using ii = pair<int, in... | #include <iostream>
#include <cstring>
#include <cstdio>
#define N 3005
#define ll long long
#define mod 1000000007
using namespace std;
ll a[N],sum[N];
int f[N],f2[N],g[N];
int main()
{
int i,k,n,ans=0;
scanf("%d",&n);
for(i=1;i<=n;++i)
scanf("%lld",&a[i]);
f[0]=1;
for(k=1;k<=n;++k)
{
memcpy(f2,f,sizeof(f2))... |
#include<iostream>
#include<string>
#include<cmath>
#include<algorithm> //max,min
#include<iomanip> //setprecision,tuple
#include<vector> //vector
#include<numeric> //iota
#include<map> //map
#include<set> //set
#include<sstream> //stringstream(hex 16,dec 10,oct 8,bilset 2)
#include<list> //list
using namespace std;
... | #include <bits/stdc++.h>
#define all(V) V.begin(),V.end()
#define pi 3.1415926535897932384626
#define fi fixed<<setprecision(13)
#define ll long long
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
#define Rep(i, n) for (ll i = 1; i <=(ll)(n); i++)
#define reps(i,k,n) for (ll i = (ll)k; i < (ll)(n); i++)
using nam... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co... | #include<bits/stdc++.h>
using namespace std;
//一の位の数の2倍と十の位以上の数の差が7の倍数であれば、その数は7で割り切れる。
//ある自然数を一の位から3ケタごとに区切り、それらを交互に加算する。そして、それらの和の差が7の倍数のとき、その自然数は7の倍数である。
int main(){
int N;
string S,T;
cin>>N;
cin>>S>>T;
vector<int> Tv;
int ten=1;
for(int i=S.size()-1;i>=0;i--){
int a=(S[i]-... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define P pair
#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... | #include<bits/stdc++.h>
#include<string>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
#define deb(x) cout<< #x << '=' << x <<endl
#define MOD 1000000007
int main() {
io... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
#define rep(i,x,y) for(ll i=(x);i<(y);i++)
#define rrep(i,x,y) for(ll i=(ll)(y)-1;i>=(x);i--)
#define all(x) (x).begin(),(x).end()
#define itrout(x) for(int i=0;i<x.size();i++) {cout << x[i] << (i==x.size()-1 ? "\n" : " ");}
#ifdef LOCAL
#define de... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pll pair <long long,long long>
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define D(x) cerr<... |
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn(i,x,n) for(int i = x;i <= n;++i)
#define Angel_Dust ios::sync_with_stdio(0);cin.tie(0)
const int N = 3e5+7;
ll sum[N],ssum[N],a[N];
int main()
{
Angel_Dust;
int n;cin >> n;
forn(i,1,n) cin >> a[i];
f... | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define lowbit(x) ((x) & -(x))
using namespace std;
using ll = long long;
using pii = pair<int, int>;
constexpr double eps = 1e-8;
constexpr int NINF = 0xc0c0c0c0;
constexpr int INF = 0x3f3f3f3f;
constexpr ll mod = 1e9 + 7;
constexpr ll... |
#include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define ii pair<int, int>
#define OK (cerr << "OK" << endl)
#define debug(x) cerr << #x " = " << (x) << endl
#define ff first
#define ss second
#define int long long
#define tt tuple<int, int, int>
#define all(x) x.begin(), x.end()
#define vi vecto... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cctype>
#include <cmath>
#include <vector>
#include <set>
#include <bitset>
#include <map>
#include <stack>
#include <queue>
#include <ctime>
#define _for(i,a,b) for(int i=(a);... | #include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define ch() getchar()
#define pc(x) putchar(x)
template<typename T>inline void read(T&x){
int f;char c;
for(f=1,c=ch();c<'0'||c>'9';c=ch())if(c=='-')f=-f;
for(x=0;c<='9'&&c>='0';c=ch())x=x*10+(c&15);x*=f;
... |
/*
口台 口台
令人咍咍。
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
int n, dep[N], is[N], son[N], res[N], tim, p, q;
int e, to[N << 1], nxt[N << 1], hd[N];
void add(int u, int v){ to[++e] = v; nxt[e] = hd[u]; hd[u] = e; }
void dfs(int u, int fa){
if(dep[u] > dep[p]) p = u;
for... | #include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); +... |
#include <stdint.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define FOR_N(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define FOR_R(i, b, e) for (int64_t i = int64_t(b); i < (int64_t)(e); i++)
int main() {
int64_t H, W;
cin >> H >> W;
int64_... | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
typedef long long ll;
#define FOR(i, a, b) for(int i=(a); i<(b);i++)
#define REP(i, n) for(int i=0; i<(n);i++)
#define ROF(i, a, b) for(int i=(b-1); i>=(a);i--)
#define PER(i, n) for(int i=n-1; i>=0;i--)
using namespace std;
... |
using namespace std;
#include<bits/stdc++.h>
#define int long long
#define all(x) x.begin(), x.end()
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
const int N = 2e5+3;
int digits(int value)
{
int cnt = 0;
while( value )
++cnt, value/=10;
return cnt;
}
int power (int base, i... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n ;
cin>>n ;
long long x[n] , y=0;
for(int i=0 ;i<n;i++)
{
cin>>x[i] ;
}
for(int i=0 ;i<n ;i++)
{
y+=abs(x[i]) ;
}
cout<<y<<endl ;
long long t=0 ;
for(int i=0;i<n;i++)
{
t+=(abs(x[i])*abs(x[i]) ) ;
}
cout<<fixed<<showpoint<<setprecision(15)<<sqr... |
#include<bits/stdc++.h>
using namespace std;
long long n,x,i,a[1000000],cnt;
int main(){
ios::sync_with_stdio(false);
cin>>n;
for(i=1;i<=sqrt(n);i++){
if(n%i==0){
cout<<i<<endl;
x=n/i;
if(i!=x)a[++cnt]=x;
}
}
for(i=cnt;i>=1;i--)cout<<a[i]<<endl;
return 0;
} | //#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define P... |
# include <bits/stdc++.h>
# ifndef ngng628_library
# define ngng628_library
# define int long long
# define float long double
# define fi first
# define se second
# define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i,n) for(int i=((int)... | #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 ... |
#include "bits/stdc++.h"
#define REP(i, n, N) for(ll i=(n); i<(N); i++)
#define RREP(i, n, N) for(ll i=(N-1); i>=(n); i--)
#define LREP(lst,itr) for(auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a, b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define MCP(a, b) memcpy(b,a,sizeof(b))
#def... | #include <bits/stdc++.h>
using namespace std;
int main (void) {
int N, A, B;
cin >> N >> A >> B;
cout << N - A + B << endl;
return 0;
}
|
#include<bits/stdc++.h>
// #define int long long
// #define maxn
// #define mod
using namespace std;
// template<class T>T ABS(T x) {return x<0?-x:x;}
//int ksm(int x,int y) {int r=1;while(y) y&1?r=1ll*r*x%mod:0,x=1ll*x*x%mod,y>>=1;return r;}
int read()
{
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9') {if(c... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <deque>
#include <string>
#include <cassert>
using namespace std;
typedef long long llint;
const int INF = ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll maxn=100005;
const ll mod=1e9+7;
const ll m2=1e9+7;
const ll INF64 = ll(1e18);
const ll max2=1e3+10;
const ll N = 1000001;
const ll MAXN=2e5+10;
const ll ALPHABET_SIZE = 2;
int main()
{
#ifndef ONLINE_JUDGE
freopen(... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n... |
#include <bits/stdc++.h>
using namespace std;
const double PI=acos(-1);
const double eps=1e-5;
int main(){
int n,a,b,c,d;
scanf("%d",&n);
scanf("%d%d%d%d",&a,&b,&c,&d);
double x=1.0*(a+c)/2.0,y=1.0*(b+d)/2.0;
double len=sqrt(1.0*(a-c)*(a-c)+1.0*(b-d)*(b-d))/2;
double al=atan2(1.0*(d-b),1.0*(c-a));//用atan()会WA,
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
complex<long double> p0, pN2;
{
double x, y;
cin >> x >> y;
p0 = x + y * 1i;
cin >> x >> y;
pN2 = x + y * 1i;
}
complex<long double> g = (p0 + pN2) * (long double)0.5;
complex<long double> rot = polar(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> ... | #include <cstdio>
#include <iostream>
using namespace std;
#define int __int128
int T, X, Y, P, Q;
void read( int &x ) {
x = 0; char s = getchar();
while( s < '0' || s > '9' ) s = getchar();
while( '0' <= s && s <= '9' ) {
x = ( x << 1 ) + ( x << 3 ) + ( s ^ 48 );
s = getchar();
}
}
void exgcd( int a, int b, ... |
#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se sec... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N; cin>>N;
vector<ll> A(N),B,C;
bool isOK=false;
for(ll i=0; i<N; ++i) {
cin>>A[i];
A[i]%=200;
}
// N<=8なら全て
// N>8なら先頭8個のみを全探索
vector<vector<ll>> group(200);
for(ll i=1; i<1ll<<min(8ll,N); ++i) {
bitset<8... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstring>
#include <utility>
#include <numeric>
using namespace std;
int main(){
string s;
cin >> s;
if(s[0] == s[1] && s[1] == s[2]){
cout << "Won" << endl;
}
else{
cout << "Los... | // @iamnifer
#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <stack>
#include <deque>
#include <queue>
#include <iomanip>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <bits/stdc++.h>
#define ll lo... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) ... | /* #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") */
// only when really needed
#include <bits/stdc++.h>
#define for1(i,a,b) for (int i = a; i <= b; i++)
#define for2(i,a,b) for (int i = a; i >= b; i--)
#define int lo... |
/* SHUBHAM KESHARWANI */
#include<bits/stdc++.h>
#define ll long long int
#define mod 1000000007
#define fr(a,b) for(ll i=a;i<b;i++)
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define test ll t; cin>>t; while(t--)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#pragma GCC o... |
#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 int
#define fast ios_base::sync_with_stdio(false)
#define fast_input cin.tie(NULL)
#define fast_output cout.tie(NULL)
#define vi vector<lon... |
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << ... | #include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int num[15] = {0};
for(int i = 0; i < s.length(); i++)
{
num[(s[i]-'0')]++;
}
int ans = 0;
if(s.length() == 1)
{
if((s[0]-'0') == 8)... |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define rep(i, n) for(int i=0;i<n;i++)
#define all(i, v) for(auto& i : v)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int n, m;
ve... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> graph(N, vector<int>(N, 0));
vector<array<int, 2>> edges(M);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
--a; --b;
++graph[a][b];
++graph[b][a];
edges[i] = {a... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; //int:2*10**9
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define pb push_back
#define MOD 1000000007 //998244353... | #include <bits/stdc++.h>
using namespace std;
#define REP(a,b) for(long long a = 0;a < b;++a)
using ld = long double;
unsigned long xor128() {
static unsigned long x=time(NULL), y=362436069, z=521288629, w=88675123;
unsigned long t=(x^(x<<11));
x=y; y=z; z=w;
return ( w=(w^(w>>19))^(t^(t>>8)) );
}
typedef str... |
// Siddhant Dugar
#include<bits/stdc++.h>
#include<string>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include... | #include<iostream>
using namespace std;
int main(){
int X, Y;
cin >> X >> Y;
if (X + 3 > Y && Y + 3 > X) {
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
return 0;
} |
/**
* author: shu8Cream
* created: 02.05.2021 10:37:54
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<ll,ll>;
using vi = vector<double>;
using vvi = vector<vi>;
int n;
double D,H;
bool chec... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define Mp make_pair
#define pb push_back
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef vector<int> vi;
mt19937 mrand(time(0));
#define debug(...) fprintf(stderr, __VA_ARGS__)
ll get(ll r) { return ((ll)mran... |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long int
#define sd(x) scanf("%lld",&x)
#define sdi(x) scanf("%d",&x)
#define sdc(c) scanf("%c",&c)
#define inf 1000000000000000000ll
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fastio ios_base::sync_w... | // main.cpp
// ervb
//
// Created by Kanak Gautam on 21/04/20.
// Copyright © 2020 Kanak Gautam. All rights reserved.
//
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <un... |
#include<bits/stdc++.h>
using namespace std;
#define A(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNI(x) sort(A(x)); (x).erase(unique(A(x)),(x).end())
#define int int64_t
void _read();
const int INF = 3e17 + 9847;
main () { _read();
int n,m;
cin >> n >> m;
int src,des;
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int h[33][33];
int v[33][33];
in... | #include<bits/stdc++.h>
#define y1 qwq
using namespace std;
const int maxn=35;
int x1,y1,x2,y2;
int f[maxn][maxn];
int tol[maxn][maxn];
int tod[maxn][maxn];
int sum[maxn][maxn];
double v[maxn][maxn];
char p[maxn][maxn];
string s;
void dfs(int x,int y) {
if(x==x1&&y==y1) {
return ;
}
if(p[x][y]=='U') {
dfs(x+1... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... | #include <bits/stdc++.h>
using namespace std;
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1.0)
#define nl '\n'
/**-------Library-------*/
#define mem(a,b) memset(a,b,sizeof(a))
#define all(a) a.begin(),a.end()
#define Sort(x) sort(x.... |
#pragma region HEAD
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define EMIT(s) std::cout << (s) << std::endl
#define ANSWER(b) EMIT((b) ? "Yes" : "No")
#define SCREAM(b) EMIT((b) ? "YES" : "NO")
#define WHISPR(b) EMIT((b) ? "yes" : "no")
#include <iostream>
#include <fstream>
#include <vector>
#include <set>... | #include<bits/stdc++.h>
#define int long long int
using namespace std;
#define md 1000000007
int32_t main()
{
int n;
cin>>n;
int a[n];
multiset<int>s;
for(int i=0;i<n;i++){cin>>a[i];s.insert(a[i]);}
int ans=a[0];
for(int i=1;i<n;i++)ans=__gcd(ans,a[i]);
cout<<ans<<endl;
}
|
#include <iostream>
using namespace std;
int main(){
long int N; cin >> N;
long int sum = 0;
int day = 0;
do{
sum += day++;
}while(sum < N);
cout << day-1 << endl;
return 0;
} | #include <cstdio>
#include <cctype>
#include <algorithm>
using namespace std;
#define FOR(i,j,k) for(int i=j; i<=k; ++i)
inline int read (void) {
int x = 0, f = 1, ch = getchar();
while(!isdigit(ch)) { if(ch == '-') f = -f; ch = getchar(); }
while(isdigit(ch)) { x = x * 10 + ch - '0'; ch = getchar(); }
return x * f... |
/*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set... | #include <bits/stdc++.h>
using namespace std;
#define clr(a) memset(a, 0, sizeof(a))
#define full(a) memset(a, 0x3f, sizeof(a))
#define fornext(x, i) for(int i = head[x], y = ver[i]; i; i = nxt[i], y = ver[i])
#define mset(a, b) memset(a, b, sizeof(a))
#define Rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define dRep(i... |
#include <cstdio>
using namespace std;
int main()
{
long long a, mul = 10, res = 1, cur = 1, mod;
int b;
scanf("%lld%d", &a, &b);
mod = 1ll * b * b;
while (cur <= a)
{
if (cur & a)
res = (res * mul) % mod;
mul = (mul * mul) % mod;
cur <<= 1;
}
printf("%lld\n", res / b);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int M = 10005;
typedef __int128 ll;
typedef __int128 lll;
ll n;
int m;
ll inv[M];
map<ll, int> book;
inline void init() {
inv[1] = 1;
for (int i = 2; i <= m; i++) {
inv[i] = (m - m/i) * inv[m%i] % m;
}
}
inline ll qpow(ll a, ll b, ll p) {
ll res = 1;
whil... |
#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<bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define DEBUG fprintf(stderr,"Running on Line %d in Function %s\n",__LINE__,__FUNCTION__)
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#de... |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1000000000
#define INFLL 1000000000000000000
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i, n, s) for (int i = (int)(n); i >= (int)(s); i--)
#define mp make_pa... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
using ll = long long;
using pp = pair<int,int>;
#define rep(i,n) for(int i = 0;i<n;i++)
const int m = 1000000001;
int main(){
ll x, y, a, b;cin >> x >> y >> a >> b;
ll e=0;
if (x < b){
while((a-1)*x < b && x*a < y){
x *= a;
... |
#include <bits/stdc++.h>
#include <time.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;
#define TIME_LIMIT 1.5
int sy,sx;
int t[50][50],p[50][50];
int dx[4]={0, 0, -1, 1}, dy[4]={-1, 1, 0, 0};
map<char,int> mp;
in... | #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 p(x,y) pair<x,y>
#define oset(x) tree<x, null_type, less<x>, rb_tree_tag, tree_order_statistics_node_update>
#define all(x) (x).begin(),(x).end()
#define ll ... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int re()
{
char f=getchar();
int x=0,k=1;
while(f>'9'||f<'0')
{
if(f=='-') k=-1;
f=getchar();
}
while(f>='0'&&f<='9')
{
x=x*10+f-'0';
f=getchar();
}
return x*k;
}
signed main()
... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
vector<int> g[100005];
int d[100005];
int dfs(int u){... |
/**
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⡖⠁⠀⠀⠀⠀⠀⠀⠈⢲⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣼⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣧⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣸⣿⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣿⣇⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣿⣿⡇⠀⢀⣀⣤⣤⣤⣤⣀⡀⠀⢸⣿⣿⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢻⣿⣿⣔⢿⡿⠟⠛⠛⠻⢿⡿⣢⣿⣿⡟⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣀⣤⣶⣾⣿⣿⣿⣷⣤⣀⡀⢀⣀⣤⣾⣿⣿⣿⣷⣶⣤⡀⠀⠀⠀⠀
⠀⠀⢠⣾⣿⡿⠿⠿⠿⣿⣿⣿⣿⡿⠏⠻⢿⣿⣿⣿⣿⠿⠿⠿⢿⣿⣷⡀⠀⠀
⠀⢠⡿⠋⠁⠀⠀⢸⣿⡇⠉⠻⣿⠇⠀⠀⠸⣿⡿⠋⢰⣿⡇⠀⠀⠈⠙⢿⡄⠀
⠀⡿⠁⠀⠀⠀⠀⠘⣿⣷⡀⠀⠰⣿⣶⣶⣿⡎⠀⢀⣾⣿⠇⠀⠀⠀⠀⠈⢿⠀
⠀⡇⠀⠀⠀⠀... | #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#inc... |
#include<bits/stdc++.h>
using namespace std;
/*#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
*/typedef long long ll;
typedef unsigned long long... | /* Priyansh Agarwal*/
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<algorithm>
#include<string.h>
#include<unordered_map>
#include<vector>
#include<unordered_set>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<map>
#include<chrono>
u... |
#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()
typedef long long ll;
int main(){
ll n;
cin >> n;
ll ans = 0;
for(ll i=1; i*i <=2 * n; i++){
if((2*n) % i == 0){
ll a = i;
ll b = (2*n) / i;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
long long count = 0;
int64_t A = sqrt(N);
for (int64_t n = 1; n < 2000000 ; n++) {
if ((2*N - n*(n-1)) > 0 && (2*N - n*(n-1)) % (2*n) == 0){
count += 2;
}
}
cout << count <<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> A(n);
for (int i=0; i<n; i++) cin >> A[i];
sort(A.begin(), A.end());
int amax = A.back();
int gcd = 0;
int ans = 0;
for (int i=2; i<=amax; i++){
int cnt = 0;
for (auto a:A){
... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define U 998244353
#define N 1000005
#define int long long
#define sz(c) (int)c.size()
#define fr first
#define ll long long
#define sc second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define ... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
LL gcd(LL a,LL b)
{
return b ? gcd(b,a%b) : a;
}
LL LCM(LL a,LL b)
{
return a/gcd(a,b)*b;
}
int main()
{
ios::sync_with_stdio(false);
int n;
cin>>n;
LL lcm=1;
f... | #include <bits/stdc++.h>
using namespace std;
int N;
bool isPrime(int n) {
for(int i = n-1; i > 1; i--) {
if(n % i == 0) return false;
}
return true;
}
int main() {
cin >> N;
long long x = 1;
for(int i = 2; i <= N; i++) {
if(isPrime(i)) {
int p = i;
while(p <= N) {
x *= i;
p *= i;
}
}
... |
// Artur Kraska, II UWr
#include <bits/stdc++.h>
#define forr(i, n) for(int i=0; i<n; i++)
#define FOREACH(iter, coll) for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll) for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,P... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <random>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
//#include <atcoder/all>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long... |
//*Bismillahir Rahmanir Raheem
//!BlackBeard
#include <bits/stdc++.h>
#include <algorithm>
#define NFS \
ios::sync_with_stdio(false); \
cin.tie(0)
#define YES cout << "YES" << endl
#define Yes cout << "Yes" << endl
#define yes cout << "yes" << endl
#define No cout << "No" << endl
#define N... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int memo[1<<16];
const string yes="Yes",no="No";
int main(){
int n,m,k;
cin>>n>>m;
vector<int>v(n*m);
cin>>v.at(0);
k=v.at(0);
for(int i=1;i<n*m;i++){
cin>>v.at(i);
k=min(k,v.at(i));
}
int s=0;
for(int i=0;i<n*m;i++){
s+=... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll mod = 1e9 + 7;
int main()
{
int W, H;
cin >> H >> W;
vector<string> mass(H);
for (int i = 0; i < H; i++)
{
cin >> mass[i];
}
vector<vector<ll>> dp(H, vector<ll>(W, 0)), Xs(H, vector<ll>(2222, 0)), Ys(H, vector<ll>(W, 0)), Zs(H, vector<ll>... | #include<bits/stdc++.h>
/*
Pranav Here!!
*/
using namespace std;
#define pb push_back
#define all(x) begin(x), end(x)
#define allr(x) rbegin(x), rend(x)
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define lli long long int
#... |
#include "bits/stdc++.h"
using namespace std;
#define int long long
using ll = long long;
signed main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int N; cin >> N;
vector<int>A(N);
vector<int>sum(N + 1), ma(N+1);
int before = 0;
int tmp = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
sum[i + 1]... | #include <bits/stdc++.h>
using namespace std;
int n, a, ans;
int32_t main () {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a);
ans = __gcd(ans, a);
}
printf("%d\n", ans);
}
|
#include "bits/stdc++.h"
using namespace std;
int main(){
int n;cin>>n;
vector<pair<int, int>> v;
for(int i=0;i<n;i++){
int a,b;cin>>a>>b;
v.push_back(make_pair(a,b));
}
int count=0;
float slopey;
float slopex;
for(int j=0;j<v.size();j++){
for(int i=j+1;i<v.size... | #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=(int)(n)-1; i>=0; --i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end(... |
// Template
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <tuple>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <array>
#include <cassert>
#include <cmath>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i... | #define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printA... |
/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long, int> P;
int main(){
int N;
cin >> N;
vector<P> X(N), Y(N);
for(int i =0 ; i < N; i++) {
long long x, y;
cin >> x >> y;
X[i] = {x, i};
Y[i] = {y, i};
}
sort(X.begin(), X.end());
sort(Y.begin(... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if(C == 0) {
if(A > B) cout << "Takahashi" << endl;
else cout << "Aoki" << endl;
}else {
if(A < B) cout << "Aoki" << endl;
else cout << "Takahashi" << endl;
}
return 0;
... | #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;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#de... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
if(floor(1.08*n)<206) cout<<"Yay!";
if(floor(1.08*n)==206) cout<<"so-so";
if(floor(1.08*n)>206) cout<<":(";
return 0;
} | #include <cstdio>
using namespace std;
char s[12];
int o, x, q, sol, t[12], c[12], cnt;
int a[5];
bool check;
int f(int n){
if(n == 1){
return 1;
} else {
return n * f(n - 1);
}
}
int c4(int a){
switch(a){
case 1: case 3:
return 4;
case 2:
return 6... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i = 0; i < (n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
sort(a.begin(), a.end());
ll ans = 0;
rep(i,n) ... |
#include <iostream>
template<long long mod>
class modint{
private:
long long a;
public:
constexpr modint(const long long x = 0) noexcept : a((x%mod+mod)%mod) {}
constexpr long long& value() noexcept { return a; }
constexpr const long long& value() const noexcept { return a; }
constexpr modint operator+(const... | #define _DEBUG
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define ... |
// give up
#include<iostream>
#include<vector>
constexpr auto MOD = 998244353LL;
template <class T> void in(T& a) {std::cin >> a;}
template <class T, class... U> void in(T& a, U&... b) {in(a); in(b...);}
template <char D = '\n', class T> void out(T a) {std::cout << a << D;}
template <class T, class... U> void out(T a... | #include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
const ll N=5100,P=998244353;
ll n,m,C[N][N],f[20][N];
signed main()
{
scanf("%lld%lld",&n,&m);C[0][0]=1;
for(ll i=1;i<N;i++)
for(ll j=0;j<N;j++)
C[i][j]=((j?C[i-1][j-1]:0)+C[i-1][j])%P;
f[0][0]=1;ll z=0;
for(ll p=1... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A, B, C;
cin >> A >> B >> C;
if(A==B){
if(C==0) ++B;
else ++A;
}
if(A>B){
cout << "Takahashi" << endl;
}else{
cout << "Aoki" << endl;
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int test=1;
//cin>>test;
while(test--)
{
vector<int> v(3);
cin>>v[0]>>v[1]>>v[2];
sort(v.begin(),v.end());
//cout<<v[0]<<v[1]<<v[2];
if... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PP;
//#define MOD 1000000007
#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i = a; i < b; i++)
#define rrep(i,a,b) for (int i = a - 1; i >= b; i--)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ll long long
#define dbwt(x) std::cout... |
//#undef DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll llinf = (1ll<<61)-1;
#define sz(a) int(a.size())
#define all(x) begin(x), end(x)
#ifdef DEBUG
const int DEBUG_END = 26;
#define DOS cout
#include <debug.h>
#else
#define bug(args...) void()
#define cbug(a, args...)
#endif
#defin... | #include <stdio.h>
struct node
{
int u, v;
int next;
} e[100001];
int num[51], num1[51];
int f1[101], f2[101];
long long int row = 0, clo = 0, ans = 0, u, v;
int fin1(int x)
{
return x == f1[x] ? x : (f1[x] = fin1(f1[x]));
}
int fin2(int x)
{
return x == f2[x] ? x : (f2[x] = fin2(f2[x]));
}
void merg1(i... |
#include <bits/stdc++.h>
#include <random>
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef pair<lint, lint> plint; typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),... | #include <bits/stdc++.h>
#define MAX (ll)(1e6 + 7)
#define INF (ll)(1e18 + 7)
#define MOD (ll)(998244353)
using namespace std;
using ll = long long;
using cd = complex<double>;
using ul = unsigned long;
void f_io () {
ios_base :: sync_with_stdio (false);
cin.tie (nullptr);
}
ll f[MAX], t[MAX];
void up (ll ind, ll... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> solve(ll N, vector<ll>& A) {
ll m = 0, s = 0, f0 = 0;
vector<ll> ans(N);
for ( int i = 0; i < N; i++ ) {
m = max(m,A[i]);
s += A[i];
f0 += s;
ans[i] = f0 + (i+1)*m;
}
return ans;
}
a... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(... |
#include <bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int (i) = (a);(i) < (b);i++)
#define Rep(i,n) For((i),0,(n))
#define All(a) (a).begin(),(a).end()
#define sp " "
#define INF 1e18
#define INT_INF 1e9
typedef long long ll;
const ll MOD = 1000000007;
const ll MOD_9 = 998244353;
int main(){
strin... | #include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define ch() getchar()
#define pc(x) putchar(x)
template<typename T>inline void read(T&x){
int f;char c;
for(f=1,c=ch();c<'0'||c>'9';c=ch())if(c=='-')f=-f;
for(x=0;c<='9'&&c>='0';c=ch())x=x*10+(c&15);x*=f;
... |
#include <bits/stdc++.h>
using namespace std;
const int N = 20;
int n;
mt19937 mt;
bool check(string s, vector<vector<char>>& a, int i, int j) {
bool isOk = true;
for (int k = 0; k < s.size() && isOk; ++k) {
if (s[k] != a[i][(j + k) % n]) {
isOk = false;
}
}
if (isOk) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (decltype(n) i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (decltype(n) i = 1, i##_len = (n); i <= i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pl(... |
#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=int64_t;
#define rep(i,n) for(int i=0;i<(n);++i)
static const ll MOD = 1000000007;
int main(){
ll N,P;
cin>>N>>P;
ll sum = P-1;
ll p = P-2,n=N-1;
/*
while(n>0){
if(n%2) sum = (sum*p)%MOD;
n/=2;
p = (p*p)%MOD;
}
*/
for(int i=0;(1LL<<i)... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
double n,m,a;
cin>>n>>m;
// scanf("%lf%lf",n,m);
a=100-((double)(100/n)*m);
printf("%.2lf",a);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
#define pp pair<ll,ll>
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
int main() {
int n;
ll k... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ump unordered_map
#define loop(i, a, n) for(long long i=a; i<=n; i++)
#define ub upper_bound
#define lb lower_bound
#define vi vector<long long>
const long long MOD = 1e9+7;
const long long INF = LLONG_MAX;
const long long N... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=3;
constexpr ll INF=2e18;
ll power(ll x, ll y){
x%=MOD;
ll ret=1;
while(y){
... |
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
long long n,m;
const long long Maxn=25;
long long a[Maxn],s[Maxn],p[Maxn];
inline long long read()
{
long long s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0' && ch<='9')s=(s<<3)+(s<<1)+(ch^48),... | #include<bits/stdc++.h>
#define pb emplace_back
#define AI(i) begin(i), end(i)
using namespace std;
using ll = long long;
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() {cerr << endl;}
template<class T1, class ...T2>
void kout (T1 v, T2 ...e) { cerr << v << ' ', kout(e...); }
temp... |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
ll n,m,sum[10005];
string s;
bool check(ll x)
{
unsigned ll sum=0;
for(int i=0; i<n; i++)
{
if(sum>m/x) return 0;
sum=sum*x+s[i]-'0';
if(sum>m) return 0;
}
return sum<=m;
}
int main()
{
cin >> s;
cin >> m;
if(s.size()==... | #line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>... |
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx2")
#define io_init cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(20)
#include <bits/stdc++.h>
constexpr int INF = 2147483647;
constexpr long long int INF_LL = 9223372036854775807;
constexpr int MOD = 1000000007;
con... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
v[i] %= 200;
}
map<int, vector<set<int> >> dupa;
for (int i = 0; i < n; i++) {
int x = v[i];
set<int> setik;
ma... |
#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define input freopen("input.txt", "r", stdin),freopen("output.txt", "w", stdout);
#define test ll t; cin>>t; while(t--)
#define ll long long
#define pb push_back
#define mod 10000007
#define pi 3.1415926
int m... | #pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
int main(void){
int A, B, C;
cin >> A >> B >> C;
if (C % 2 == 0){
A = abs(A);
B = abs(B);
}
if (A > B) cout << ">" << endl;
else if (A < B) cout << "<" << endl;
else cout << "=" << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ALL(x) x.begin(),x.end()
#define SORT(x) sort(ALL(x))
#define FOR(a,b,c) for(ll (a)= (b);(a)<(c);++(a))
#define REP(a,b) FOR(a,0,b)
#define mp make_pa... | #include <iostream>
using namespace std;
int main() {
long N, M, T;
cin >> N >> M >> T;
long n = N, offset = 0;
for (int i = 0; i < M; i++) {
long A, B;
cin >> A >> B;
offset = A - offset;
n -= offset;
if (n <= 0) {
cout << "No" << endl;
return 0;
};
n += B - A;
if ... |
#pragma GCC optimize("Ofast")
//#pragma GCC target ("sse4")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll k; cin >> k;
vector<ll> a(5, 0), b(5, 0);
vector<ll> x(10, k);
string s, t; cin >> s >> ... |
#include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
int b;
b = a-1;
cout << b;
return 0;
} | /*
ID: tdpenci1
LANG: C++
TASK: beads
*/
#include "bits/stdc++.h"
using namespace std;
#pragma optimize ("Ofast")
typedef long long ll;
#define all(x) x.begin(), x.end()
#define trav(i, x) for(auto &i : x)
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define FOR(i, N) for... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,k;
string s;
int power(int l){
int m=1;
for(int i=1;i<=l;i++){
m*=2;
}
return m;
}
int revi(char a,char b){
if(a=='P'&&b=='R'){
return a;
}
if(a=='P'&&b=='S'){
return b;
}
if(a=='S'&&b=='P'){
return a;
}
if(a=='S'&&b=='R'){
re... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep1(i,n) for (int i=1;i<(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
bool my_compare(pair<int, int> a, pair<int, int> b) {
// 基本はfirstで比較
if(a.first != b.first){
// return a.first < b.first; // 昇... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if(S[0] != S[N-1]) {
cout << 1 << endl;
}
else {
bool flag = false;
for(int i = 1; i < N-2; i++) {
if(S[0] != S[i] && S[N-1] != S[i+1]) {
flag = true;
... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define f first
#define s second
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
const ll inf=1e18+5;
const int mod=1e9+7;
int main(){
// freopen("input.txt","r",stdin);
// freopen("output.txt",... |
#include <bits/stdc++.h>
#include <string>
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
const ll MOD=1000000007ll;
const int MAX=5100000;
using namespace std;
int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll n, a, b, q, c[200007], buf, p[200007];
vector<pair<ll, ll>> e;
vector<pair<ll, bool>> op[200007];
vector<ll> adj[200007];
void find_parent(ll x, ll par) {
p[x] = par;
for(ll i : adj[x]) {
if(i != par) {
find_parent(... |
#include<bits/stdc++.h>
#define w(x) int x; cin>>x; for(int tc=1;tc<=x;tc++)
#define trace(x) cerr<<#x<<": "<<x<<" "<<endl;
#define trace1(x,y) cerr<<#x<<": "<<x<<" "<<endl;cerr<<#y<<": "<<y<<" "<<endl;
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int A, B;
cin >> A >> B;
if(A==B) cout << A << endl;
else cout << 3-A-B << endl;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.