code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double doublel;
#define f first
#define s second
const int N = 1e6 + 100;
const ll mod = 1e9 + 7;
const ll inf = 1e17;
set<pair<ll, ll>> s;
int par[N], cnt[N];
ll h[N];
vector<pair<int, int>> ans;
vector<int> adj[N];
void dfs(int u)
{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<LL, LL> pll;
typedef pair<int, int> pii;
#define IO freopen("in.txt", "r", stdin);freopen("out.txt", "w", stdout)
#define FIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define rep(i,... | 0 | 27,033,410 |
#include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define range(i,l,h) for(int i=l;i<h;i++)
#define endl '\n'
#define I INT_MAX
#define L INT_MIN
#define pb push_back
#define ll long long
#define ull unsigned long long
#define vi vector<int>
using namespace std;
using std::ios;
... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
template <typename A, typename B>
string to_s... | 0 | 29,111,645 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#inclu... | #include <bits/stdc++.h>
#define rep(i,j) for (int (i)=0;(i)<(int)(j);++(i))
#define put(i) cout << i << endl
using namespace std;
const int MAX = 1000;
int n;
string s1, s2;
int dp[MAX+1][MAX+1];
int rec(int x, int y) {
if (dp[y][x] >= 0) {
return dp[y][x];
}
int sz1 = s1.size(), sz2 = s2.size();
... | 0 | 50,139,155 |
#include<bits/stdc++.h>
using namespace std;
long long N, M;
int main(){
cin >> N >> M;
for(long long i = 0; i < M; i++) {
long long tmp;
cin >> tmp;
N-=tmp;
}
if(N >= 0) {
cout << N << endl;
}else{
cout << -1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 49,674,677 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, y;
cin >> n >> y;
if (y > n * 10000 || y < n * 1000) {
cout << -1 << ' ' << -1 << ' ' << -1 << '\n';
return 0;
}
int a = 0, b = 0, c = y / 1000;
while (a + b + c > n... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(i = 0; i < n; i++)
#define A1 cout<<"No"<<endl
#define A2 cout<<"Yes"<<endl
#define A3 cout<<ans<<endl
#define AA(i) cout<<i<<endl
const int U=2e5+5;
const ll MOD=1000000007;
const int INF = 1001001001;
#define size 200010
ll POW(... | 0 | 55,395,024 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B, C, X;
while (cin >> N >> A >> B >> C >> X, N) {
int ans = 0;
for (int i = 0; i < N; i++) {
int Y;
cin >> Y;
if (i != 0) {
X = (A * X + B) % C;
ans++;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
void make_lunlun(int d, ll i, vector<ll> &all){
if(d==11) return;
all.push_back(i);
if(i%10 == 0){
make_lunlun(d+1,i*10+(i%10),all);
make_lunlun(d+1,i*10+(i%10)+1,all);
}
else if(i%10 == 9){
make_lunlun(d+1,i*... | 0 | 89,880,363 |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int N; cin >> N;
ll ans = 0; int a = 0, b = 0, ab = 0;
REP(i, 0, N) {
string s; cin >> s;
REP(j, 0, s.size() - 1) {
if (s[j] == 'A' && s[j + 1] == 'B'... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | 0 | 91,033,130 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define endl "\n"
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
int s,w;
cin >> s >> w;
if (w>=s)
{
cout << "unsafe" << endl;
}
else
{
cout <... | #include<bits/stdc++.h>
#define LL long long
using namespace std;
LL k,maxx=9;
void bfs(){
queue<pair<LL,LL> > q;
q.push(make_pair(1ll,1ll));
q.push(make_pair(2ll,2ll));
q.push(make_pair(3ll,3ll));
q.push(make_pair(4ll,4ll));
q.push(make_pair(5ll,5ll));
q.push(make_pair(6ll,6ll));
q.push(make_pair(7... | 0 | 21,771,892 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <algorithm>
using namespace std;
bool solve(){
vector<double> x(4);
vector<double> y(4);
for(int i=0;i<4;i++){
cin>> x[i]>> y[i];
}
double ... | #include <iostream>
using namespace std;
const int coin[] = {500, 100, 50, 10, 5, 1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
while(cin >> n && n != 0){
int a = 1000 - n;
int cnt = 0;
for(int i = 0; i < 6; ++i){
while(a >= coin[i]){
a -= coin[i];
++cnt;
}
}
cout << cnt <<... | 0 | 8,169,830 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE") << endl
#define Possible(n) cout <<... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define INF 10e7
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
void solve(void)
{
string s;
... | 0 | 9,715,864 |
#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):v... | #include <bits/stdc++.h>
#define ln "\n"
#define SORT(X) sort(X.begin(), X.end())
#define SORTi(X) sort(X.begin(), X.end(), greater<ll>())
#define REP(x, a, b) for (auto x = a; x <= b; x++)
#define REPi(x, b, a) for (auto x = b; x >= a; x--)
#define REPit(x, A) for (auto x = A.begin(); x != A.end(); x++)
#define REPr(x... | 0 | 66,321,284 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,ll>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=9... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
ll b;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> n;
vector<ll> a(n), b(n);
for (auto& i : a) cin >> i;
for (auto& i : b) cin >> i;
vector<int> diff(n);
for (int i = 0; i < n; i++) {
diff[i] = b[i]... | 0 | 30,548,740 |
#include<bits/stdc++.h>
using namespace std;
#define itn int
#define int long long
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,k,p,sum=0;
itn a[1000000];
cin>>n>>k;
n-=k;
if(n==0) cout<<1<<"\n";
else cout<<n/(k-1)+(n%(k-1)!=0?1:0)+1<<"\n";
} | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
using namespace std;
int main()
{
int n,t2 = 0,t1 = 0;
scanf("%d",&n);
int a[10][10];
for(int i=0; i<n; ++i)
a[0][i] = i+1;
for(int j=1; j<=2;++j)
for(int i=0; i<n; ++i)
... | 0 | 65,910,746 |
#include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
int main(){
ll N, M , K; cin >> N >> M >> K;
... | #include<bits/stdc++.h>
using namespace std;
const long long MOD=1000000007;
long long counta[300000][60][2];
int main(){
long long N;
cin >> N;
long long A[N];
long long i,j,k;
for(i=0; i<N; i++){
cin >> A[i];
}
long long nibeki[60];
nibeki[0]=1;
for(i=1; i<60; i++){
... | 0 | 77,259,920 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int a,b,c,i,j,count=0;
cin>>a>>b>>c;
for(i=a;i<=b;i++){
if(a>b){
break;
}
j=c%i;
if(j==0){
count++;
}
}
cout<<count<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct mat {
ll num[66];
mat()
{
memset(num, 0, sizeof(num));
}
void add(ll a)
{
for (int i = 63; i >= 0; i--)
{
if (!((a >> i) & 1))
continue;
if (!num[i])
... | 0 | 68,272,176 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
string A[60], B[60];
int mai... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define in(a) ll a; cin>>a;
#define in2(a,b) ll a,b; cin>>a>>b;
#define in3(a,b,c) ll a,b,c; cin>>a>>b>>c;
#define in4(a,b,c,d) ll a,b,c,d; cin>>a>>b>>c>>d;... | 0 | 45,808,641 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b;
for(int i=1;i<=b;i++){
cin>>c;
a-=c;
if(a<=0){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
const int64_t MAXN = 100010;
int64_t P[MAXN];
int64_t pow_mod(int64_t x, int64_t n)
{
int64_t res = 1;
if (n > 0)
{
res = pow_mod(x, n / 2);
if (n % 2 == 0)
res = (res * res) % MOD;
else
res = (((res * res) % MOD... | 0 | 83,688,344 |
#include<ctype.h>
#include<stdio.h>
int main(void)
{
char c;
while(1){
if(c=='\n') break;
scanf("%c",&c);
if(islower(c)){
c=toupper(c);
}
else c=tolower(c);
printf("%c",c);
}
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <regex>
#include <stack>
#include <queue>
#include <vector>
#define MAX_N 100
#define INF 10000000
using namespace std;
string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
long n,a,b;
string s;
void solve(){
if (a + b == 15)... | 0 | 64,044,175 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <string.h>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stri... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define endl '\n'
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<ii> vii;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const int T = 1e5+5;
int ... | 0 | 91,415,072 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MOD = 1000000007;
int main()
{
int n;
cin >> n;
ll arr[n];
for(int i = 0;i < n;i++)
cin >> arr[i];
sort(arr, arr + n);
if(arr[n - 1] <= n - 1){
cout << 0;
return 0;
}
ll k = 0;
ll res = 0;
for(int i = n - 1;i >=... | 0 | 20,873,555 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const double Pi=acos(-1);
int main() {
double a,b,x;
cin>>a>>b>>x;
if(a*a*b<2*x){
double left=2*b-2*(x/(a*a));
double answer=atan(left/a);
cout << fixed << setprecision(9) << answer/Pi*180 << endl;
}
else{
double left=x*2/(a*b)... | #include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#in... | 0 | 20,008,202 |
#include "bits/stdc++.h"
using namespace std;
class friends {
private:
int n, m;
int ans = 1;
int depth = 0;
vector<set<int>> adjacencyList;
vector<bool> seeked;
public:
friends(int _n, int _m) {
n = _n;
m = _m;
adjacencyList.resize(n + 1);
seeked.resize(n + 1);
for (auto e : seeked) e = false;
}
void... | #include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a) ... | 0 | 58,482,200 |
#include <bits/stdc++.h>
using namespace std;
#define EmiliaMyWife ios::sync_with_stdio(0); cin.tie(NULL);
#define mem(i,j) memset(i,j,sizeof (i));
#define F first
#define S second
#define lowbit(x) ((x)&(-(x)))
#define siz(v) (long long)(v).size()
typedef int64_t ll;
typedef uint64_t ull;
const double EPS = 1e-8;
con... | #include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,a[200005],b[200005],one,two;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
b[i]=a[i];
}
sort(b,b+n);
one=b[n-1];
two=b[n-2];
for(int... | 0 | 16,396,288 |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
typedef double d;
typedef int i;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
char a , b;
... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define REP(a,b) for(int a=0;a<(b);++a)
#define REP1(i,n) for(int i=1;i<=(n);++i)
#define debug(x) cerr<<#x<<": "<<x<<'\n'
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define YES() printf("YES\n")
#define NO() ... | 0 | 92,658,726 |
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <string>
#include <algorithm>
#include <iomanip>
static const double PI = 3.14159265359;
int main()
{
int64_t N, M;
std::cin >> N >> M;
int64_t day = 0;
for (int64_t i = 0; i < M; ++i) {
int64_t A;
std::cin >> ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int reverce(int n){
int reverced_num = 0;
int digit = pow(10, to_string(n).length()-1);
while(n){
reverced_num += (n % 10) * digit;
n /= 10;
... | 0 | 57,117,219 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <sstream>
using namespace std;
int main()
{
int n;
cin >> n;
int birth[1000][11][21];
int ctn = 196470;
for (int y = 1; y < 1000; y++) {
for (int m = 1; m < 11; m++) {
int ma;
if (y % 3 == 0) ma = 20;
... | 0 | 91,419,539 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a, x;
cin >> a >> x;
int amari = a % 500;
if(amari > x) cout << "No" << endl;
else cout << "Yes" << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i<(n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
set<int> se;
rep(i, N) se.insert(A[i]);
... | 0 | 74,493,735 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>
using namespace std;
#define ll long long
int main() {
int m, minn, maxn, hoge, ans, maxhoge;
while (1) {
cin >> m >> minn >> maxn;
if (m == 0 && minn == 0 && maxn == 0)break;
vector<int> p(m);
for (int i = 0; i < m; ... | #include <stdio.h>
#include <utility>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(void) {
ll i, j, n, k, s;
scanf("%lld%lld%lld", &n, &k, &s);
if(s == 1e9) {
for(i = 0; i < k; ++i) printf("%lld ", s);
for(; i < n; ++i) printf("%lld ", 1);
} else {
for(i = 0; i < k; ++i) ... | 0 | 94,513,208 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, O = 0, P = 0, Q = 0;
cin >> N;
vector<int> X(N);
for (int i = 0; i < N; i++) {
cin >> X.at(i);
O += X.at(i);
}
O /= N;
for (int i = 0; i < N; i++) {
if (O > X.at(i)) {P += (O - X.at(i)) * (O - X.at(i));}
else {P += (X.at(i) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | 0 | 58,718,308 |
#include<bits/stdc++.h>
#define test ll t; cin>>t; while(t--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long long
#define ull unsigned long long
#define MAX 1000005
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector< vector<int> >
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
int main(){
int N;
cin >> N;
vector<int> A(N + 1), L(N + 1);
... | 0 | 66,320,740 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
long numbers[n], i =0;
while(cin >> numbers[i]) i++;
long max = numbers[0], min = numbers[0], sigma = 0;
for(i = 0; i < sizeof(numbers) / sizeof(numbers[0]); i++){
if (numbers[i] > max) max = numbers[i];
if (numbers[i] < min) min = numbers... | #include<bits/stdc++.h>
using namespace std;
void solve()
{
int n,m,x;
cin>>n>>m>>x;
vector<vector<int>>a(n,vector<int>(m));
vector<int>c(n);
for(int i=0;i<n;i++)
{
cin>>c[i];
for(int j=0;j<m;j++)
cin>>a[i][j];
}
int all=1<<n;
int ans=INT_MAX;
for(int mask=0;mask<all;mask++)
{
... | 0 | 49,989,333 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) m... | #include <algorithm>
#include <bitset>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <cassert>
#include <ccty... | 0 | 84,331,926 |
#include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
int vx[4] = {0,1,0,-1};
int vy[4] = {1,0,-1,0};
int re[1002][1002];
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main()
{
int n;
cin >> n;
int ans = 0;
int now = 1;
rep(i, n)
{
int a;
cin >> a;
if (a == now)
++now;
els... | 0 | 99,637,364 |
#include <iostream>
using namespace std;
int main () {
int x;
cin >> x;
if (x < 1200){
cout << "ABC\n";
} else {
cout << "ARC\n";
}
} | #include<bits/stdc++.h>
using namespace std;
#define ms(x,y) memset(x, y, sizeof(x))
#define lowbit(x) ((x)&(-x))
#define sqr(x) ((x)*(x))
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
void run_case() {
LL n; cin >> n;
LL x = n+1, y = n+1;
for(LL i = 1; i*i <= n; ++i) {
i... | 0 | 26,096,115 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina c... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const ll MOD=1e9+7;
ll dp[100100];
ll sum[100100];
bool used[100100];
int main(){
int N,M,X; cin >> N >> M >> X;
int c[N];
int a[N][M];
for(int i=0;i<N;i++){
cin >> c[i];
for(in... | 0 | 17,387,283 |
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | #include <iostream>
#include <deque>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
using namespace std;
int main(){
std::ios_base::sync_with_stdio(false);
deque<int> a;
int num, n;
string command;
cin>>n;
for(int i=0;i<n;i++){
cin>>command;
if((command.length() >= 6) && (command[... | 0 | 10,342,869 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef vector<pair<int,int>> vpi;
const long long Mod = 998244353;
const long long mod = 1000000007;
const long long INF = 10000000000000;
#define pb push_back
#define mp make_pair
#define mins(x,y) x = min(x,y)
#define maxs(x... | #include <iostream>
#include <vector>
#include <fstream>
#include <utility>
#include <algorithm>
#include <map>
using namespace std;
#define ll long long
ll myabs(ll x)
{
return (x > 0 ? x : -x);
}
int main()
{
int n = 0;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
a[i] -= (i + 1);
... | 0 | 89,405,363 |
#include <iostream>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
int main(){
string S;
cin >> S;
int N = S.size();
bool appeared[26] = {false};
rep(i, N)
appeared[ S[i]-'a'] = true;
rep(i, 26)
if(!appeared[i]){
cout << S << (char)(i+'a') << endl;
return 0;
}
for(in... | #include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main(void){
int n;
cin >> n;
vector<int> a(n);
int amax = 0;
for(int i = 0; i < n; ++... | 0 | 40,524,211 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
double n,m,d;
cin>>n>>m>>d;
double ans=(d*2+(n-(d*2))*2)/(n*n);
ans*=(m-1);
if(d==0) ans/=2... | #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast,no-stack-protector")
#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define LL long long int
#define vi vector<int>
#define vl vector<LL>
#define pb push_back
#define all(V) V.begin(),V.end()
#define sci(x) scanf("%d",&x)
#define scl(x) scanf("... | 0 | 73,247,277 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include<iostream>
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define endl '\n'
using namespace std;
int main()
{
fastio;
string str;
cin>>str;
long long i,a[str.size()],cnt=0,sum=0;
for(i=0;i<str.size();i++)
{
if(str[i]=='B')
... | 0 | 5,510,971 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
constexpr ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
ll x[60];
ll p[60];
ll c{0};
ll f(ll N, ll X)
{
if (X == 1) {return N == 0;}
else if (1... | #include <bits/stdc++.h>
#define ll long long
#define _ ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
using namespace std;
int main() { _
int n, m, z, ans = 0; cin >> n >> m >> z;
char arr[6][6];
set <int> row, col;
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
... | 0 | 94,352,578 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s;
ll k;
cin>>s>>k;
char c;
int n=s.size();
for(ll i=0;i<n;i++){
if(i==k-1){
c=s[i];
break;
}
if(s[i]!='1'){
c=s[i];
break;
}
if(i==n-1) c=s[i];
}
cout<<c<<endl;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include<chrono>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define fi first
#define se ... | 0 | 60,422,630 |
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <algorithm>
#include <array>
using namespace std;
int INF = 100000000;
struct Matrix { int row, col; };
int getMinMCM(const vector<Matrix>& matVec) {
const size_t n = matVec.size();
vector< vector<int> > table(n, vector<int>(n, 0))... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define yesno(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define MAX_N 1002
#define i197 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P1;
typedef pair<int,int> Pi;
typedef pa... | 0 | 94,858,572 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#define all(x) x.begin(), x.end()
#ifdef _DEBUG
#define dd(x) cout << #x << " : " << x << endl
#else
#define dd(x)
#endif
using namespace std;
using ll = int64_t;
constexpr int SIZE = 1e6+1;
int ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = acos(-1) ;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | 0 | 68,247,394 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a;
vector<int>v(4);
for(int i=0;i<6;i++){
cin>>a;
v[a]++;
}
bool f=true;
for(int i=0;i<=4;i++){
if(v[i]>=3) f=false;
}
if(f){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
... | #pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define owo(i,a, b) for(int i=(a);i<(b); ++i)
#define uwu(i,a, b) for(int i=(a)-1; i>=(b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout<<"ayaya~"<<endl
using nam... | 0 | 24,089,041 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include<bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define fwd(i,a,n) for(int i=a;i<=n;i++)
#define bak(i,a,n) for(int i=a;i>=n;i--)
#define all(v) v.begin(),v.end()
#define pb push_back
#define lop '\n'
#define mp make_pair
typedef long long ll;
typ... | 0 | 43,789,438 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
void tost... | #include <iostream>
using namespace std;
int main()
{
int n;
int a;
int min, max;
long int sum = 0;
cin >> n;
cin >> a;
min = a;
max = a;
sum += a;
for (int i = 0; i < n - 1; i++) {
cin >> a;
if (min > a) {
min = a;
}
if (max < a) {
max =a;
}
sum += a;
}
cout << min << " " << max << " " <<... | 0 | 37,254,099 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll h,w;
ll direction2[4][2]={{1,0},{0,1},{0,-1},{-1,0}};
bool valid(int a,int b)
{
if(a>=1&&a<=h&&b>=1&&b<=w)return true;
else return false;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,k;
cin>>n>>k;
ll... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
string S, T;
cin >> S >> T;
vector<vector<int>> _s(30), _t(30);
REP(i, S.size()) {
_s[S[i] - 'a'].push_back(i);
_t[T[i] - 'a'].push_back(i);
}... | 0 | 75,269,256 |
#include<bits/stdc++.h>
using namespace std;
static const int64_t INF=10000000000;
int main(){
int N;
cin>>N;
int64_t sum=0; int64_t MIN=INF;
for(int i=0;i<N;i++){
int64_t a,b; cin>>a>>b;
sum+=a;
if(b<a){if(b<MIN) MIN=b;}
}if( MIN==INF)
cout<<0<<endl;
else{
cout<<sum-MIN<<endl;
}
return 0;... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i... | 0 | 43,399,191 |
#include <bits/stdc++.h>
using namespace std;
const int N = 310;
int n;
char a[N][N], b[N][N];
int shift(int x) {
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
b[i][j] = a[i][(j + x) % n];
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
if (b[i][j] != b[j][i])
return 0;... | #include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
using ll=long long;
using pll=pair<ll,ll>;
#define fi first
#define se second
#define pb push_back
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } retu... | 0 | 24,087,484 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N - 1; i >= 0; i--)
const ll INF = 1000000000;
const ld PI = (acos(-1));
using Graph = vector<vector<int>>;
template<class T> inline bool chmin(T& a, T b... | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <unordered_map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
template<... | 0 | 100,855,728 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int rating, new_rating;
cin >> rating >> new_rating;
int result= 2*new_rating - rating;
cout << result << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const lint MOD =1000000007;
const lint MAX =... | 0 | 92,392,118 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
int C=A-B;
if(C<0){
cout<<0<<endl;
}
else {
cout<<C<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 100001;
int arr[N][3];
int dp[N][2][2][2];
ll findans(bool f, bool s, bool t, int n){
if(n < 0) return 0;
ll ans = 0;
if(dp[n][(int)f][(int)s][(int)t]) return dp[n][(int)f][(int)s][(int)t];
if(f && s){
ans = max(findans(0, 1, 1, n -... | 0 | 935,722 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
#define vel vector<long long>
#define int long long
#define rep(i,n) for(long long i=0;i<n;i++)
#define sor(v) sort(v.begin(),v.end())
long long p = 998244353;
vel kai(2001, 1);
vel ink(2001, 1);
vel uni(vel &list) {
if (list... | #include <bits/stdc++.h>
#define watch(x) cout <<(#x)<<" is "<<(x)<<endl
#define debug cout <<"hi"<<endl
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
int main(){
int x,y,a,b,c; cin >>x >>y >>a >>b >>c; ll ans=0;
vector<int>p(a); vector<int>q(b); vector<int>r(x+y+c);
for(int i=0; i<a; i++) cin >>... | 0 | 21,426,581 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int ... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
ll M = 1000000007;
ll inv[100005], fac[100005], fiv[100005];
ll combination(ll x,... | 0 | 84,187,739 |
#include<iostream>
using namespace std;
int main(void){
int h,w;
while(1){
cin>>h>>w;
if(h==0&&w==0)break;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(i!=0&&j!=0&&i!=h-1&&j!=w-1){
cout<<".";
... | #include <vector>
#include <queue>
#include <utility>
#include <iostream>
#include <tuple>
using ll = long long;
using lli = long long int;
lli n, m, a, b, src_num;
std::queue<std::vector<lli>> q;;
std::vector<std::vector<lli>> vec;
std::vector<std::vector<lli>> visited;
int main() {
std::cin >> n >> m;
visited... | 0 | 32,274,241 |
#include <iostream>
using namespace std;
int min(int a, int b){
if( a <= b ) return a;
else return b;
}
int main(void){
int w, h, x, y, r;
int d_edge;
cin >> w >> h >> x >> y >> r;
if( x < 0 || w < x || y < 0 || h < y ) cout << "No" << endl;
else{
d_edge = min( min(x, w-x), min(y, h-y) );
if( d_edge < r ) co... | #include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define SIZE(a) int((a).size();
const int INF=INT_MAX;
int main(){... | 0 | 70,958,211 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <unordered_map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
template<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define debug(a) cout << #a << ": " << a << endl
#define debuga1(a, l, r) fto(i, l, r) cout << a[i] << " "; cout << endl
#define fdto(i, r, l) for(int i = (r); i >= (l); --i)
#define fto(i, l, r) for(int i = (l); i <= (r); +... | 0 | 87,642,942 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
#include<deque>
#include <iomanip>
#include<utility>
us... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 0 | 85,996,405 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
int main()
{
int n,d;
cin>>n>>d;
int arr[n][d];
for(int i=0;i<n;i++)
for(int j=0;j<d;j++)
cin>>arr[i][j];
int sqr{},counter{};
for(int i=0;i<n-1;i++)
{
for(int j=i+1;j<n;... | #include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long long ll;
typedef unsigned long long ull;
... | 0 | 93,438,666 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include <sstream>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include <iomanip>
#include <numeric>
#include <iterator>
#include <math.h>
#include <list>
#include <bits/stdc+... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
vector<char> s = {'a', 'b', 'c', 'd', 'e',
'f', 'g', 'h', 'i', 'j',
'k', 'l', 'm', 'n', 'o',
'p', 'q', 'r', 's', 't',
'u', 'v', 'w', 'x', 'y'... | 0 | 13,787,949 |
#include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 101010
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
templ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#de... | 0 | 98,434,862 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using str = string;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
const double PI = 3.141592653589793238;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define REP(i, m, n) for (int i = m; i < (int)n; i++)
#def... | #include <iostream>
#include <unordered_set>
using namespace std;
int main() {
long long n;
cin >> n;
unordered_set<int> buttons;
long long b[n + 1] = {1};
long long dest = 1;
long long curr_button = 1;
long long nmoves = 0;
for (long long i = 1; i <= n; i++) {
cin >> b[i];
}
buttons.insert(1);
... | 0 | 41,154,617 |
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> time(5);
for (int i=0 ; i<5 ; i++)
cin >> time.at(i);
int n;
vector<int> ten(5);
for (int i=0 ; i<5 ; i++){
n = time.at(i)/10;
n *= 10;
if (time.at(i)%10 != 0)
n += 10;
ten.at(i) = n;
}
int mini = ten.at(0)-tim... | 0 | 85,493,292 |
#include <iostream>
#include <atcoder/dsu>
using namespace std;
int main(){
int N,Q;
cin >> N >> Q;
int query[Q][3];
for(int i = 0; i < Q; i++){
cin >> query[i][0] >> query[i][1] >> query[i][2];
}
atcoder::dsu d(N);
for(int i = 0; i < Q; i++){
int u = query[i][1];
in... | #include<iostream>
using namespace std;
int main()
{
int hh[108][108];
int n,m,u,v;
cin>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
hh[i][j]=0;
}
}
for(int i=1;i<=n;i++)
{
cin>>u>>m;
for(int j=1;j<=m;j++)
{
c... | 0 | 95,469,518 |
#include<cstdio>
int main(){
int a[44],n;
a[0]=a[1]=1;
for(int i=2;i<=44;i++) a[i]=a[i-1]+a[i-2];
scanf("%d",&n);
printf("%d\n",a[n]);
return 0;
} | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <stack>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#include <functional>
#define mod 998244353
#define int long long
#define ld long double
#... | 0 | 81,220,548 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, K, ans;
cin >> N >> K;
ans=0;
vector<int> l(N);
for (int i=0; i<N; i++) {
cin >> l[i];
}
sort(l.begin(),l.end());
reverse(l.begin(),l.end());
for (int j=0; j<K; j++) {
a... | #include <bits/stdc++.h>
#define MAXN 100005
const int inf=0x3f3f3f3f;
using namespace std;
struct edge{
int next,to,v;
}e[MAXN<<1];
int n,tot,head[MAXN],dist[MAXN];
bool vis[MAXN];
void add(int x,int y,int z){
tot++;
e[tot].to=y;
e[tot].v=z;
e[tot].next=head[x];
head[x]=tot;
}
void bfs(){
memset(dist,inf,n*size... | 0 | 15,857,589 |
#include"bits/stdc++.h"
#define int long long
#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 itr(i,x) for(auto i=(x).begin();i!=(x).end();++i)
#define All(x) (x).begin(),(x).en... | #pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef l... | 0 | 72,250,134 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> V(K);
for (int i = 1; i <= N; i++) {
V.at(i % K)++;
}
long ans = 0;
for (int i = 0; i < K; i++) {
int a = i;
int b = (K - a) % K;
int c = (K - a) % K;
if ((b + c) % K == 0) {
ans += (l... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << ... | 0 | 20,108,259 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] != 'A') {
cout << "WA" << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1e9+7
#define rep(i,n) for(ll i=0;i<n;i++)
#define pii pair<int,int>
#define pll pair<ll,ll>
const int maxn = 200000;
ll mod = INF;
ll n;
ll a[maxn];
ll sum=0;
map<ll,ll> m;
int main(){
cin >> n;
rep(i,n){
cin >> a[i];
... | 0 | 13,326,993 |
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).b... | 0 | 30,637,023 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> void print(T t) { cout<<t<<endl; }
template<typename T, typename... Args> void print(T t, Args... args) { cout<<t<<" "; print(args...); }
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define int long long
#define doub... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(ll i=a;i<=b;i++)
#define fi(i,a,b) for(ll i=a-1;i>=b;i--)
#define endl '\n'
#define spc " "
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define pi 3.14159265358979323
#define sz(a) (int)((a).size())
#define len(... | 0 | 89,102,796 |
#include<bits/stdc++.h>
using namespace std;
int h,w,m,h1,w1,maxr,maxc,row[300005],col[300005];
vector<int> vr;
vector<int> vc;
set<pair<int,int> > st;
int main(){
cin>>h>>w>>m;
for(int i=1;i<=m;i++){
cin>>h1>>w1;
st.insert(make_pair(h1,w1));
row[h1]++;
if(row[h1]==maxr){
vr.push_back(h1);
}
if(row[h1]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int Grundy[100050];
int N;
vector<int> pathes[100500];
int parent[100050];
void bfs(int from) {
Grundy[from] = 0;
for(int i = 0; i < pathes[from].size(); i++) {
int to = pathes[... | 0 | 81,295,572 |
#include <iostream>
using namespace std;
int main(void){
int b,c=1,kun=0;
int a[100001]={};
cin>>b;
for(int z=1;z<b+1;z++){
cin>>a[z];
}
while(1){
if(b<0){
cout<<-1<<endl;
break;
}
c=a[c];
if(c==2){
cout<<kun+1<<endl;
... | #include <iostream>
#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>
#include... | 0 | 28,304,818 |
#include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <iomanip>
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 >= ... | #include <bits/stdc++.h>
#define lop(i, n) for (int i = 0; i < (n); ++i)
#define tc(t) int t; cin>>t; while(t--)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a,b,c;
cin>>a>>b>>c;
int a1 = a + b;
int a2 = a + c;
int a3... | 0 | 97,203,181 |
#include <iostream>
#include <stack>
using namespace std;
int main(){
stack<int> stop;
int come;
while(cin >> come){
if(come!=0) stop.push(come);
else{
cout << stop.top() << endl;
stop.pop();
}
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
const long MOD = 1000000007;
typedef pair<int, int> P;
typedef long long ll;
int main(){
int N;
cin >> N;
vector<P> v[N];
for(int i=0; i<N-1; i++){
int a, b, c;
cin >> a >> b >> c;
a-... | 0 | 37,626,276 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n, m;
cin >> n >> m;
vector<string> a(n);
vector<string> b(m);
for(int i=0; i < n; i++){
cin >> a.at(i);
}
for(int i=0; i < m; i++){
cin >> b.at(i);
}
re... | #include<bits/stdc++.h>
using namespace std;
const int maxn=100000+10;
int x[maxn],xx[maxn],w[maxn];
int k,l,r,s,t,n,m;
long long c;
inline int read(){
int r=0,w=1;
char ch=getchar();
while(ch>'9'||ch<'0'){ if(ch=='-') w=-1;ch=getchar(); }
while(ch>='0'&&ch<='9'){ r=r*10+ch-'0'; ch=getchar(); }
return r*w;
}
int m... | 0 | 77,769,992 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
long long gcd(long long x, long long y){
if(y == 0){
return x;
}
return gcd(y, x%y);
}
int main(){
long long n, x;
cin >> n >> x;
long long g = 0;
long long xx[n];
for(long long i = 0; i < n; i++){
... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <cmath>
#include <algorithm>
#include <vector>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=... | 0 | 15,725,221 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main() {
long double l;
cin>>l;
long double size=l/3;
cout<< fixed << setprecision(10) <<size*size*size<<endl;
} | #define _GLIBCXX_DEBUG
#include <iostream>
#include <cstdio>
using namespace std;
int main(void){
int n, y, i, j;
cin >> n >> y;
y /= 1000;
for(i=n; i>=0; i--){
for(j=n-i; j>=0; j--){
if(i*10 + j*5 + n-i-j == y) goto SKIP;
}
}
cout << "-1 -1 -1\n";
return 0;
SKIP:... | 0 | 84,558,201 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include <iostream>
using namespace std;
int day(int y, int m, int d) {
int ans = 0;
for (int i=1; i<y; i++) {
if (i%3 == 0) {
ans += 200;
} else {
ans += 195;
}
}
bool dai = (y%3 == 0);
for (int i=1; i<m; i++) {
if (dai || i%2 != 0) {
ans += 20;
} else {
ans += 19;... | 0 | 99,228,062 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
Graph G;
vector<int> points;
vector<int> ans;
void dfs(int v, int sum, int p) {
ans[v] = sum + points[v];
for (auto nv : G[v]) {
... | 0 | 54,827,368 |
#include <math.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v... | 0 | 99,882,492 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include <climits>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n), c(n);
for (int i = 0; i < n; ++i)
cin >> p[i];
for (int i = 0; i < n; ++i)
cin >> c[i];
ll ans = LLONG_MIN;
for (int i = 0; i < n; ++i) {
... | 0 | 61,041,586 |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define pb push_back
typedef pair<ll,ll> ipair;
#define F first
#define S second
int main() {
ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
ll n,i,j,p,k,m,ans=0;
cin>>n;
vector<pa... | #include <iostream>
#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>
#include <cctype>
#in... | 0 | 10,085,302 |
#include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | #include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
using namespace std;
int main(){
string s;
while(getline(cin,s),s!="."){
stack<int> a;
for(int i=0;i<s.size();i++){
if(s[i]=='('||s[i]=='['){
a.push(s[i]);
}
else if(s[i]==')'){
if(a... | 0 | 7,318,978 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int s, w;
cin >> s >> w;
cout << (s > w ? "safe" : "unsafe") << "\n";
return 0;
} | #include <cstdio>
using namespace std;
char str[100];
int main() {
while (~scanf("%s", str)) {
char *ptr = str;
while (*ptr) ++ptr;
for (--ptr; ptr >= str; --ptr) printf("%c", *ptr);
puts("");
}
} | 0 | 45,471,711 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
const double pi=acos(-1);
int main()
{
ll N; cin>>N;
map<ll,ll> list;
vector<ll> A(N);
rep(i,N)
{
cin>>A.at(i);
if(list.count(A.at(i))) {lis... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define min_3(a,b,c) min(a,min(b,c))
#define max_3(a,b,c) max(a,max(b,c))
#define nout(ans) cout << (ans) << "\n"
#define sout(ans) cout << (ans) << " "
using namespace std;
const double pi = 3.14159265359;
con... | 0 | 40,144,513 |
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm( a, b ) (a)/__gcd((a),(b))*(b)
#define endl '\n'
using namespace std;
typedef long long LL;
typedef pair< int, int > P;
typedef pair< LL, LL > LP;
static const int INF = INT_... | #include<bits/stdc++.h>
#define _USE_MATH_DEFINES
using namespace std;
#define ll long long int
#define pb push_back
#define rep(i , j , n) for(ll i = j ; i < n ; i++)
#define pre(i , j , n) for(ll i = j ; i >= n ; i--)
#define all(x) x.begin(), x.end()
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vecto... | 0 | 7,709,023 |
#include <bits/stdc++.h>
using namespace std;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef long double ld;
#define double long double
#define pii pair<int,i... | #include <bits/stdc++.h>
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
ll N; cin >> N;
ll A[N];
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
ll ans = 0;
ans += A[0]/2;
A[0] = A[0]%2;
for (int i = 1; i < N; i++)
{
if(A[i] == 0) cont... | 0 | 37,673,545 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | #include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
int n, a[100005];
int BS_low(int x)
{
int l = 1, r = n, mid, save = -1;
while (l <= r)
{
mid = (l + r) / 2;
if (a[mid] <= x)
{
l = mid + 1;
save = mid;
}
else r = ... | 0 | 95,044,903 |
#include <iostream>
#include <math.h>
using namespace std;
int main(){
int n;
cin >> n;
while(n--){
double x[4], y[4], o;
for(int i = 0; i < 4; i++) cin >> x[i] >> y[i];
o = (x[1]-x[0])*(y[3]-y[2]) - (y[1]-y[0])*(x[3]-x[2]);
if(fabs(o) < 1e-10) cout << "YES" << endl;
else cout << "NO" << endl;
}
return 0... | #include <bits/stdc++.h>
using namespace std;
const int N = 110000;
int go[17][N];
int main() {
int n; cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int L; cin >> L;
for (int i = 1, j = 1; i <= n; i++) {
while (j < n && a[j + 1] - a[i] <= L) j++;
go[0][i] = j;
}
for (int i ... | 0 | 2,315,706 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
char a[4];
cin>>a[0]>>a[1]>>a[2];
if(a[0]==a[1]&&a[0]==a[2]&&a[1]==a[2])cout<<"No";
else cout<<"Yes";
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000000;
constexpr ll INF= 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for(int i = 0;i < N;i++) {
cin >> vec.at(i);
}
ve... | 0 | 71,408,034 |
# include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<long long ,long long >
typedef long long ll;
ll memo[1005][10005],h,n;
pii arr[1005];
ll f(int idx,int x){
if(idx > n) return 1e15;
if(x<=0 ) return 0;
if(memo[idx][x... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define pb push_back
#define ALL(v) v.begin(),v.end()
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<class T> inline bool ... | 0 | 62,045,549 |
#include <iostream>
#include <limits.h>
using namespace std;
int main()
{
int n;
while(cin >> n && n)
{
int buf[5001]={};
int max_sum = INT_MIN;
for(int i=0; i<n; i++)
{
cin >> buf[i];
}
for(int i=0; i<n; i++)
{
int sum = 0;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi=vector<int>;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void... | 0 | 74,166,261 |
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#include <sstream>
#include <iostream>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
ll ... | 0 | 86,529,200 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int w, h, x, y, r;
cin >> w >> h >> x >> y >> r;
string ans;
if(x + r > w || y + r > h) ans = "No";
else if(x < r || y < r) ans = "No";
else ans = "Yes";
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define call(var) cout<<#var<<"="<<var<<endl;
#define dup(x,y) (((x)+(y)-1)/(y))
using ll=long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using Graph = vector<vi>;
using P = pair<int,int... | 0 | 97,140,863 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll INF64 = 1LL << 60;
const int INF32 = 1 << 29;
const int MOD = 1000000007;
void normalize(vector<pll> &nums) {
if (nums.size() > 1) {
if (nums[nums.size()-1].first == nums[nums.size()-2].first) {
... | #include <iostream>
#include <string>
#define rep(i, n)for(int i=0; i<n; i++)
using namespace std;
int main(){
int n;
string s;
cin >> n >> s;
int num[1000]{};
rep(i,1000){
string strint = to_string(i);
if(i<10){
strint[2] = strint[0];
strint[0] = strint[1] = ... | 0 | 61,477,259 |
#include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <iomanip>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define outD(fpv) cout << setprecision(... | #include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define AfterDecimal(n) cout << fixed << setprecision(n);
#define ll long long int
#define ld long double
#define all(a) a.begin(), a.end()
#define pii ... | 0 | 75,087,740 |
#include<bits/stdc++.h>
using namespace std;
#define close std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define eps 1e-8
typedef long long ll;
const int maxn = 1e6+10;
const int INF = 0x3f3f3f3f;
const ll linf = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1.0);
ll mod = 1e9+7;
int main()
{
int a , b ;
... | #include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
using namespace std;
#pragma warning(disable: 4996)
#define _sort(v,type,order) do { sort(v.begin(),v.end(),order<type>()); } while(0)
#define _sum(v... | 0 | 33,710,930 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef long long unsigned llu;
typedef pair<long long, long long> pll;
const long long inf = 2000000000000000000LL;
#define pi acos(-1.0)
#define fast ios_base::sync_with_stdio(0);cin.tie(0);c... | #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 second
... | 0 | 13,628,732 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.