code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
#define int ll
main(){
ll n;
cin >> n;
ll ans = 0;
for(ll i=1;i<=n;i++){
ans += (n/i)*((n/i)+1)*i/2;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,K,add=1,ans=0,now=0;
cin >> N >> K;
string S;
cin >> S;
vector<int> sum;
bool zero;
if(S[0]=='0'){
zero = true;
}else{
zero = false;
}
for(int i=1;i<N;i++){
if(zero){
if(S[i]=='0')... | 0 | 5,607,244 |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int sum[maxn];
int main() {
memset(sum, -1, sizeof(sum));
long long n;
int x, m;
scanf("%lld%d%d", &n, &x, &m);
int cnt = 1;
long long ans = 0;
while (cnt <= n) {
if (sum[x] != -1) {
long long tans = ... | 0 | 57,793,917 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define ROF(i, a, b) for (int i = a; i >= (b); i--)
using pii = pair<int, int>; using vpii = vector<pii>... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 99,832,459 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N;
cin >> N;
int sum = 0;
int W[N];
for(int i = 0; i < N; i++){
W[i] = 0;
cin >> W[i];
sum += W[i];
}
int ans =... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... | 0 | 8,352,731 |
#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;
ll fac(ll x){
ll tmp = 1;
for(ll i = 1; i <= x; i++){
tmp *= ... | #include <bits/stdc++.h>
#include <fstream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
/*
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int xdif = x1 - x2, ydif = y1 - y2;
cout << x... | 0 | 35,187,285 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
vector<int> List;
int count = 0;
cin >> n;
for(int i = 0; i < n; i++){
int Value;
cin >> Value;
List.push_back(Value);
}
for(int i = 0; i < n; i++){
int Min = i;
for(int j = i; j < n; j++){
if(List[j] < List[Min]){
... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <string>
#include <queue>
#include <iomanip>
#include <iterator>
#define MOD 1000000007
#define INF 1000000001
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
... | 0 | 24,589,389 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | #include <iostream>
using namespace std;
int main()
{
int a, x;
while (cin >> a >> x) {
if (a == 0 && x == 0) break;
int ans = 0;
for (int i = 1; i <= a - 2; i++) {
for (int j = i + 1; j <= a - 1; j++) {
for (int k = j + 1; k <= a; k++) {
i... | 0 | 90,771,591 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define F... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
int n;
cin>>n;
set<string>s ;
vector<string> v;
for(int i=0;i<n;i++)
{
string str;
cin>>str;
v.push_back(str);
s.insert(str);
}
if(s.size()!=n)
{
cout<<"No"<<e... | 0 | 67,512,160 |
#include<bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int (i) = 1; (i) <= (n); (i++))
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define yn {puts("Yes");}else {puts("N... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair <ll,ll> P;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = n-1; i >= 0; i--)
#define FOR(i, n, m) for(int i = n; i < (int)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.end()... | 0 | 46,307,146 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int n,m;
cin >> n >> m;
vector<int> a(n);
rep(i,m) cin >> a[i];
int sum=0;
rep(i,m) sum+=a[i];
if(sum>n) cout << -1 << endl;
else cout << n-sum << endl;
} | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | 0 | 99,832,161 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int mod = 1000000007;
void solve();
int main(void){
string A; cin >> A;
ll lenA = A.length();
ll alp[26] = {0};
rep(i, lenA){
alp[A[i] - 'a']++;
}
ll ans = lenA * (lenA-1) / 2... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(c) (c).begin(),(c).end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const int INF = 1e9 + 10;
int N, M, X;
int A[15][15], under[15];
int main() {
... | 0 | 75,807,933 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = (A); I < (B); ++I)
#define FORR(I,A,B) for(ll I = ((B)-1); I >= (A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end()))
#define REV(x) (reverse(x.begin(),x.end()))
ll gcd... | #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
main() {
int64_t n;
cin >> n;
vector<double> t(n + 2), v(n + 2);
for (auto i : irange(1L, n + 1)) {
cin >> t[i];
t[i] += t[i - 1];
... | 0 | 32,747,422 |
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
string in;
cin >> in;
vector<string> s;
int curr;
for (int i = 0; i < in.length(); ++i) {
if (in[i] == '0') {
s.pb("0");
} else if(in[i] == '1') {
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define vll vector<ll>
#define mll map<ll,ll>
#define MOD 1000000007
#define pll pair<ll,ll>
constexpr ll INF = 1999999999999999997;
#define fastio ios_base:... | 0 | 71,941,888 |
#include <map>
#include <set>
#include <ctime>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cctype>
#include <string>
#include <numeric>
#include <cstring>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <algorit... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct node
{
ll d;int id;
}c[100005];
bool cmp(node x,node y){return x.d>y.d;}
int fa[100005],siz[100005],deep[100005];
ll d[100005];
vector<int>to[100005];
void dfs(int x){for(auto tar:to[x])deep[tar]=deep[x]+1,dfs(tar);}
int main()
{
int n;
... | 0 | 80,148,059 |
#define _USE_MATH_DEFINES
#define INF 100000000
#include <iostream>
#include <cstdio>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#inclu... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n, m;
cin >> n >> m;
vector<vector<int>> d(n, vector<int>(n, -1)), next(n, vector<int>(n, -1)),
indeces(n, vector<int>(n, -1));
for (int i = 0; i < m; ++i) {
int a, b, c;
cin >> a >> b >> c;
a--;
b--... | 0 | 71,191,691 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int h, w, a, b;
cin >> h >> w >> a >> b;
vector<vector<int>>grid(h, vector<int>(w,0));
for (int i = 0; i < b; i++) {
for (int j = a; j < w; j++)grid.at(i).at(j) = 1;
}
for (int i = b; i < h; i++) {
for (int j = 0; j < a; j++)grid... | #include <iostream>
#include <vector>
using namespace std;
void abc_170a();
void abc_171a();
void abc_172a();
void abc_173a();
void abc_174a();
void abc_175a();
void abc_170b();
int main()
{
abc_170b();
}
void abc_170a()
{
vector<int> x(5);
for (int i = 0; i < 5; ++i) cin >> x[i];
for (int i = 0; i < 5; ++i)
... | 0 | 54,972,662 |
#include <bits/stdc++.h>
using namespace std;
struct Point {
long long x, y;
long long sign;
Point() {}
friend istream& operator>>(istream& in, Point& p) {
in >> p.x >> p.y;
if (p.y < 0 || (p.y == 0 && p.x < 0)) {
p.x *= -1;
p.y *= -1;
p.sign = -1;
... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
#include<stack>
const long long MOD = 1000000007;
using namespace std;
typedef long long llong;
bool check(int n){
llong... | 0 | 67,770,270 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b; cin >> n >> a >> b;
deque<int> ans;
if ((long long) a * b < (long long) n) {
cout << -1 << endl;
return 0;
}
if (max(a, b) == n && min(a, b) != 1) {
cout << -1 << endl;
return 0;
}
if (a +... | #include <bits/stdc++.h>
using namespace std;
int main (void) {
int N, K;
cin >> N >> K;
map<int, int> ball;
int a;
for ( int i=0; i<N; i++ ) {
cin >> a;
ball[a]++;
}
vector<int> n_num;
for ( auto itr : ball ) {
n_num.push_back(itr.second);
}
sort(n_num.be... | 0 | 94,073,628 |
#include<iostream>
#include<algorithm>
using namespace std;
struct Mat {
int row;
int col;
};
long mcm(Mat* M, int n) {
long dp[101][101];
for(int i=2; i<=n; i++) {
for(int j=0; j<=n-i; j++) {
dp[i][j] = 99999999999L;
for(int k=1; k<i; k++) {
dp[i][j] = min(dp[k][j]+dp[i-k][j+k]+M[j].row*M[j+k].row*M[j+... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(x) ll((x).size())
#define all(v) (v).begin(),(v).end()
#define trace(x) cerr << #x << " = " << x << endl
#define fastio ios_base::sync_with_stdio(0);cin.tie(0)
#define For(i,a,b) for(ll i = ll(a); i < ll(b);... | 0 | 31,904,742 |
#include<iostream>
#include<string>
using namespace std;
int main() {
string s;
string tmp1, tmp2;
int n;
int h;
while (cin >> s, s != "-") {
cin >> n;
while (n--) {
cin >> h;
tmp1 = "";
for (int i = 0; i < h; i++) {
tmp1 += s[i];
}
tmp2 = "";
for (int i = h; i < s.size(); i++) {
tmp2... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N);
vector<int> B(N-1);
for(int i = 0; i < N-1 ; i++){
cin >> B.at(i);
}
A.at(0) = B.at(0);
for(int i = 0; i < N-1; i++){
if(B.at(i) < A.at(i)){
A.at(i) = B.at(i);
... | 0 | 26,628,844 |
#include<bits/stdc++.h>
#include<numeric>
using namespace std;
const long double PI = 3.141592653589793238;
const double EPS = 1e-6 ;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define dd double
#define vll vector<ll>
#define vs vector<string>
#define fn(i,n) for(ll i = 0; i<n; i... | #include<iostream>
#include <stdio.h>
using namespace std;
int main(){
int n,x;
int c;
int i,j,k;
for (;;){
cin >> n >> x;
c=0;
if (n==0 && x==0)break;
for (i=0;i<n;i++){
for (j=0;j<n;j++){
for (k=0;k<n;k++){
if (i + j + k +... | 0 | 44,652,619 |
#include<iostream>
#include<set>
#include <bitset>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include <cstdio>
#include<algorithm>
#include <sstream>
#include<string>
#include<string.h>
#include <cmath>
#include <iomanip>
#include <string>
#include<list>
#include <limits>
#include <numeric>
#includ... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | 0 | 56,061,245 |
#pragma GCC optimize (3)
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<algorithm>
#include<unordered_map>
#define ll long long... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define MOD 1000000007
#define ll long long int
#define u64 un... | 0 | 99,485,467 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_e... | 0 | 84,867,578 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long a,b;
cin >> a >> b;
vector<string> ans(100,"");
for(long i=0;i<100;i++) ans[0]+=".";
for(long i=0;i<100;i++) ans[99]+="#";
for(long i=1;i<99;i++) {
ans[i]=".";
for(long j=0;j<49;j++) {
ans[i]+="#";
}
for(long j=0;j<49;j++)... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using intpair=pair<int,int>;
using llpair=pair<ll,ll>;
using llvec=vector<ll>;
using llmat=vector<vector<ll>>;
#define llmattp(name,a,b,num) name(a,vector<ll>(b,num))
#define INTINF 1<<30
#define LLINF 1LL<<60
#define ABS(x) ( (x)>0 ? (x) : -(x) )
templa... | 0 | 49,350,481 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string a,b;
cin>>a>>b;
if(a==b) cout<<"EQUAL"<<endl;
else if(a.size()>b.size()) cout<<"GREATER"<<endl;
else if(b.size()>a.size()) cout<<"LESS"<<endl;
else if(a>b) cout<<"GREATER"<<endl;
else cout<<"LESS"<<endl;
} | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
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; retur... | 0 | 19,778,707 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
int main() {
int n, a, b;
cin >> n >> a >> b;
if ((abs(a - b) - 1) % 2) cout << "Alice" << endl;
else cout << "Borys" << endl;
} | #include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
#include <cstdint>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph =... | 0 | 24,740,778 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long row, col;
cin >> row >> col;
cout << abs((row - 2) * (col - 2)) << endl;
return 0;
} | #include <bits/stdc++.h>
#define _for(i,a,b) for(int i=(a),_b=(b);i<_b;++i)
using namespace std;
const int maxn = 100001;
typedef long long ll;
const ll mod = 1e9 + 7;
ll f[maxn];
int n,k;
vector<int> d[maxn];
void _sieve()
{
for(int i = 2; i<maxn; ++i)
for(int j = i ; j<maxn; j+=i)
d[j].push_b... | 0 | 65,256,417 |
#include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int result = 0;
for (int n = 1; n <= N; ++n) {
int sum = 0;
int n2 = n;
while (n2) {
sum += n2 % 10;
n2 /= 10;
}
if (sum >= A && sum <= B) result += n;
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int64_t, int64_t> Pair;
void fail(){
cout << -1 << endl;
exit(0);
}
int main(){
int i, j, k;
int N;
cin >> N;
vector<Pair> D(N);
for(i=0; i<N; i++){
int64_t d;
cin >> d;
D.push_back({d, i});
}
sort(D.r... | 0 | 85,125,859 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
cin >> s;
vector<string> words = {"dream", "dreamer", "erase", "eraser"};
reverse(s.begin(), s.end());
rep(i, 4) reverse(words.at(i).begin(), words.at(i).end());
bool canCreate = true;
... | #include<stdio.h>
int main(){
long long a,b,k;
scanf("%lld%lld%lld",&a,&b,&k);
if(a>=k){
a-=k;
}else if(a+b>=k){
k-=a;
a=0;
b-=k;
}else{
a=0;
b=0;
}
printf("%lld %lld",a,b);
return 0;
} | 0 | 31,714,173 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | #include<bits/stdc++.h>
#define REP(i,n) for(long long i=0;i<n;++i)
#define FOR(i,a,b) for(long long i=a;i<b;++i)
using namespace std;
const int INF=1<<30;
int n,graph[101][101],v[101];
void bfs(int s){
queue< int > q;
fill(v,v+101,INF);
q.push(s);
v[s]=0;
while(!q.empty()){
int p=q.front();... | 0 | 76,725,076 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int a, saizu;
int num[100] = {0}, num2[100] = {0};
vector<int> array;
while(cin >> a){
array.push_back(a);
}
saizu = array.size();
for(int i = 0; i < saizu; i++){
num2[array[i]-1]++;
num[array[i]-1]++;
}
sort(num,... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define... | 0 | 99,493,210 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | #include <queue>
#include <iostream>
using namespace std;
int main() {
int n; cin >> n;
int dist[n];
fill(dist, dist+n, 100);
priority_queue<pair<int, int> > pq;
for (int i = 1; i < min(10, n); i++)
if (dist[i] > i) {
dist[i] = i;
pq.push({-i, i});
}
while... | 0 | 78,711,843 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
ll ans = 0;
for (int i = 0; i < n - 1; ++i) {
for (int j = i + 1; j < n; ++j) {
ans += a[i] * a[j];
... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<iomanip>
#include<queue>
#include<stack>
#include<time.h>
#define rep(i,n)for(int i=0;i<n;i++)
#define int long long
#define ggr getchar();getchar();return 0;
#define prique priority_queue
constexpr auto mod ... | 0 | 63,930,964 |
#include <bits/stdc++.h>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define x first
#define y second
#define debug(...) cout << "[" << #__VA_ARGS__ << ": " << __VA_ARGS__ << "]\n"
#define rd() abs((int)rng())
using namespace std;
typedef long long ll;
typedef long double ld;
type... | #include <iostream>
#include <string>
using namespace std;
void print (string str, int a, int b) {
cout << str.substr(a, b-a+1) << endl;
return;
}
string reverse (string str, int a, int b) {
string s1, s2_b, s2_a="", s3;
s1 = str.substr(0, a);
s2_b = str.substr(a, b-a+1);
for (string::reverse_iterator ritr ... | 0 | 2,867,964 |
#include <iostream>
using namespace std;
long long fib(int n){
long long a = 1, b = 1, tmp = 0;
while (n--){
tmp = a;
a += b;
b = tmp;
}
return b;
}
int main()
{
int n = 0;
cin >> n;
cout << fib(n) << endl;
return 0;
} | #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;
const ll mod = 1000000007;
const int inf = 1e9;
const long long INF = 1LL << 60;
int main()
{
int h,w,d; cin >> h >> w >> d;
int a[h][w]; rep(i,h) rep(j,w) cin... | 0 | 54,376,983 |
#include <functional>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <iomanip>
#include <utility>
#include <cstdlib>
#include <sstream>
#include <bitset>
#include <vector>
#include <cstdio>
#include <ctime>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <list>
#includ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(-1)
const ll INF... | 0 | 7,353,218 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string s1,s2;
cin >> s1;
cin >> s2;
int i=0,j=0,minnum;
int L[1001][1001];
for(i=0;i<1001;i++)
L[0][i]=i;
for(j=0;j<1001;j++)
L[j][0]=j;
for(i=1;i<=s1.size();i++)
for(j=1;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using iii = pair<ii, int>;
#define vt vector
#define pq priority_queue
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define __lcm(a, b) a * b / __gcd(a, b)
const int MOD =... | 0 | 98,154,267 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for((i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
typedef long long ll;
typedef pair<int, int> PII;
const double EPS = 1e-10;
const int N = 1000... | #include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
string upper(string str);
string lower(string str);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pb push_b... | 0 | 67,759,324 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
using ull = uint64_t;
using ll = int... | #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() {
int n, k;
cin >> n >> k;
vector<int> v(n, 0);
for (... | 0 | 75,884,748 |
#include <iostream>
#define int long long
using namespace std;
int powmod(int a, int n, int mod) {
if (n == 0) return 1;
if (n % 2 == 0) return powmod((a * a) % mod, n / 2, mod);
return (a * powmod(a, n - 1, mod)) % mod;
}
int mod = 1000000007;
int x, y;
int fact[2000001];
int finv[2000001];
int comb(int n, int k) {... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <climits>
#include <set>
#include <map>
#include <stack>
#include <iomanip>
#include <tuple>
#define ll long long
using namespace std;
ll factorial(ll n){
if(n==0){
return 1;
}
els... | 0 | 30,424,473 |
#include <bits/stdc++.h>
#define ll long long
#define maxn 200100
#define base 1000000007
using namespace std;
int n,a[maxn];
ll ans=1;
string s;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>n;
cin>>s;
a[0] = (s[0]=='W'?0:1);
for (int i=1;i<2*n;i++) a[i] = (s[i]==s[i-1]?1-a[i-1]:a[i-1... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define ld long double
#define vi vector<vector<ll> >
using namespace std;
const int MOD=1000000007;
const int MOD2=15000007;
const ll MAX=918... | 0 | 23,898,944 |
#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() {
int n, m;
cin >> n >> m;
vector<vector<long long int>> v(8, vec... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | 0 | 87,268,364 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep( i, n, m ) for(int i = ( n ); i < ( m ); i++)
#define rep_d( i, n, m ) for(int i = ( n ) - 1; i >= ( m ); i--)
#define sort_asc( X ) sort(( X ).begin(), ( X ).end())
#define sort_desc( X ) sort(( X ).begin(), ( X ).end(), greater <>())
... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const int MAX_N = 100000;
const int MAX_S = 317;
int n, s, j, skip, nextskip, lis, idx, nextidx;
int a[MAX_N], sz[MAX_S * 2], top[MAX_S * 2], p[MAX_S], nextp[MAX_S];
int PatienceSorting(int nexti){
int r = -1;
int l = -1;
if(p[0] == -... | 0 | 1,922,681 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll A[1000], B[1000], C[1000];
int main() {
ll X, Y, Z, K;
cin >> X >> Y >> Z >> K;
for (int i=0; i<X; i++) {
cin >> A[i];
}
for (int i=0; i<Y; i++) {
cin >> B[i];
}
for (int i=0; i<Z; i++) {
cin >> C[i];
}
vector<ll> P;
P.reserve(X*Y);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void)
{
int N;
string s, t;
cin >> N >> s >> t;
int matchLen = 0;
for(int slide = 0; slide < N; slide++){
int match = 0;
for(int i = slide; i < N; i++){
if(s[i] == t[i-slide]) match++;
}
... | 0 | 53,997,289 |
#include <bits/stdc++.h>
#include <ext/numeric>
using namespace std;
using namespace __gnu_cxx;
#define all(v) v.begin(), v.end()
#define UNIQUE(c) (c).resize(unique(all(c)) - (c).begin())
#define endl "\n"
#define pb push_back
#define F first
#define S second
#define START cin.tie(0); cout.tie(0); ios_base::sync_wit... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_l... | 0 | 46,336,549 |
#include <iostream>
#include <string>
#include <queue>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
string s;
cin >> s;
if (s.size()>=4 &&
... | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned un;
#define sf scanf
#define si(a) sf("%d",&a)
#define sc(a) sf("%c",&a)
#define sii(a,b) sf("%d %d",&a,&b)
#define siii(a,b,c) sf("%d %d %d",&a,&b,&c)
... | 0 | 49,990,853 |
#include <iostream>
using namespace std;
const int MAX_N=36;
struct Card{
char type;
int value;
};
void bubbleSort(Card *,int);
void selectionSort(Card *,int);
int main(){
Card bubbleC[MAX_N],selectionC[MAX_N];
int n;
cin>>n;
int i;
for (i=0;i<n;i++){
char temp[3];
cin>>temp;... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | 0 | 52,927,051 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main(){
string s;
cin >> s;
int n;
cin >> n;
for(int i=0;i<n;i++){
string m;
int a,b;
cin >> m >> a >> b;
if(m=="print") cout << s.substr(a,b-a+1) << endl;
else if(m=="reverse"){
st... | #include<bits/stdc++.h>
#define fasterthanlight ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define endl "\n"
#define int long long
#define vi vector<int>
#define pb push_back
#define mod 1000000007
#define MAX 1e9
#define MIN -1e9
#define hi "visited\n"
using namespace std;
int minCost(int n, int ... | 0 | 12,692,494 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
ll ans = 9000000000000000000;
vector<ll> vx;
vector<ll> vy;
vector<pair<ll, ll>> vxy;
rep(i,n){
ll x, y;
cin >> x >> ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,M,a,b;
cin>>N>>M;
int P[10][10];
int F[10];
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
P[i][j]=0;
}
}
for(int i=0;i<M;i++){
cin>>a>>b;
a--;
b--;
P[a][b]=1;
P[b][a]=1;
}
vector<int>vec(N-1,0);
for(int i... | 0 | 94,028,306 |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main() {
int n,k,ans=0;
cin>>n>>k;
vector<int>arr(n);
for(int i=0;i<n;i++){
cin>>arr[i];
if(arr[i]>=k){
ans++;
}
}
cout<<ans;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <queue>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using vi = vecto... | 0 | 70,509,925 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
vector<vector<ll>> g;
vector<bool> seen;
vector<ll> ans;
const long long NIL = -1;
deque<ll> todo;
int main() {
ll n, m... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template<class T> inline bool chmin(T& a, T b){
if(a > b){
a = b;
return true;
}
return false;
}
template<class T> inli... | 0 | 18,020,153 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define bg begin()
#define end end()
#define sz size()
#define vi vector<int>
#define vl vector<long long int>
#define mod 1000000... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main()
{
int a, b, c;
cin >> a >> b >> c;
bool flg = false;
int n = abs(a - b);
int d = abs(a - b);
while (n != 0)
{
... | 0 | 76,772,706 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<pair<int, int>, int> PP;
const ll INFL = 1LL << 60;
const ll MOD = 1000000007;
const int INF = 1000000000;
const int MAX = 300000;
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
vecto... | #include<bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define endl '\n'
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
const ll mod=1e9+7;
bool sortbysec(const pair<int,int>&a,const pair<int,int>&b)
{
ret... | 0 | 51,640,960 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>
#include<iterator>
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbeg... | #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... | 0 | 79,090,342 |
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
long long MOD = 1000000007;
int main(){
int N; cin >> N;
ll ans=0, min_=MOD;
int flag=1;
for(int i=0; i<N; i++){
ll A, B;
cin >> A >> B;
ans+=A;
if(A>B){
min_=min(min_, B);
... | #include<bits/stdc++.h>
#include<iostream>
#include<fstream>
#define ll long long
using namespace std;
int main(){
ll W, H;
cin >> W >> H;
vector<pair<int,int>> cost;
for(int i=0; i<W; i++){
int p; cin >> p;
cost.push_back({p,0});
}
for(int i=0; i<H; i++){
int p; cin >>... | 0 | 86,534,395 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define read(a) scanf("%d", &a)
#define x first
#define y second
#define N 1514
int n, K;
char s[N];
int dp[N][26];
int main() {
scanf("%s%d", s, &K);
n = int(strlen(s));
bool all = 1;
for (int i = 1; i < n; i++) all &= ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
if(T.size() != S.size()+1) cout << "No" << endl;
else {
for(int i = 0; i < S.size(); i++) {
if(S.at(i) != T.at(i)) {
cout << "No" << endl;
break;
}
else {
if(i == S.size() -1) cou... | 0 | 12,484,151 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
using ll=long long;
constexpr ll mod=1000000007;
constexpr int inf=1000000000;
constexpr ll linf=1000000000000000000;
struct Combination{
vector<ll> fac,finv,inv;
Combination(int mx){
fac.resize(mx+1);
finv.resize... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_AS... | 0 | 85,871,473 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
int main(){
ll N;cin>>N;
if(N==1||N==2){
cout<<0<<endl;
return 0;
}
ll ans=0;
for(ll i=1;i*(i+1)<N;i++){
if(N%i==0)ans+=N/i-1;
}
cout<<ans<<endl;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
const int INF = 1e6;
using namespace std;
using ll = long long;
using ld = lon... | 0 | 31,777,021 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int n; cin >> n;
for(int i = n; i <= 999; ++i){
int t = i;
... | 0 | 51,281,440 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const int BIG = 1e9 + 555;
const int maxN = 2000 + 555;
int n, m;
int s[maxN], t[maxN];
ll memo[maxN][maxN];
ll memop[maxN][maxN];
void update(int r){
for(int i = 0; i <= m; i++){
memop[r + 1][i + 1] = (m... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
const int inf = 2e9;
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int n, m;
cin >> n >> m;
vector<string> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<vector<int> > dp(... | 0 | 73,796,648 |
#include <iostream>
using namespace std;
int H;
int A[250 + 5];
int parent(int i) {
return i / 2;
}
int left(int i) {
return i * 2;
}
int right(int i) {
return i * 2 + 1;
}
bool check(int i) {
return 1 <= i && i <= H;
}
int main() {
cin >> H;
for (int i = 1; i <= H; i++) {
cin >> A[i];
}
for (int i ... | #include <iostream>
using namespace std;
int main(){
int H,W;
while(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 || j==W-1 ||i==H-1) cout << "#";
else cout << ".";
}
cout << "\n";
}
cout << "\n";
}
} | 0 | 98,879,133 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define per(i,n) for(int i=(n)-1; i>=0; i--)
using namespace std;
using vi = vector<int>;
using vv = vector<vi>;
const int MOD = 1000000007;
int main(){
int n,m;cin>>n>>m;
vi a(n,0);
rep(i,m){
int b;cin>>b;
a[b]++;
}
... | 0 | 36,638,558 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for(int i=int(m); i<int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define all(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV = ve... | #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 ... | 0 | 99,650,478 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int64_t n,z,w;
cin >> n >> z >> w;
int64_t k[n];
rep(i,n)cin >> k[i];
int64_t y[n];
int64_t u[n];
y[0]=0;
u[0]=0;
int64_t mi=1000000000000;
int64_t ma=0;
rep(i,n-1){
int q=n-2-i;
y... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define all(x) (x).begi... | 0 | 80,619,870 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
int main(){
std::string s;
std::cin >> s;
if (s == "A")
{
s = "T";
}
else if (s == "C")
{
s = "G";
}
else if (s == "G")
{
s = "C";
}
el... | #include <iostream>
#include <string>
#include <cstring>
#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>
#incl... | 0 | 39,894,948 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for(int i = 0; i < N; i++){
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
vector<int> num(100000,0);
for(int i = 0; i < N; i++){
num.at(vec.at(i))++;
... | 0 | 25,695,047 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s1, s2, s3;
cin >> s1 >> s2;
int a, b;
cin >> a >> b;
cin >> s3;
if(s3==s1) cout << a-1 << " " << b << endl;
else cout << a << " " << b-1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a,long long int b)
{
if(b==0)
return a;
else
return gcd(b,a%b);
}
int main()
{
long long int x,i,y,ans=0;
scanf("%lld%lld",&x,&y);
if(x==y ||((x>y) && (gcd(x,y)==y)))
printf("-1");
else
{
... | 0 | 5,118,270 |
#include <bits/stdc++.h>
using namespace std;
#define sync ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl "\n"
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
#define debug(x) cerr << #x << ": " << x << endl
#define debugP(p) cer... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define sz(v) (int)((v).size())
#define pb push_back
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
string r, b; cin >> r >> b;
int nr, nb; cin >> nr >> nb;
string u; cin >> u;
if (u==r) ... | 0 | 29,947,039 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | #include<bits/stdc++.h>
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pii pair<int,int>
#define ll long long int
#define ull unsigned long long int
#define inf LONG_MAX;
using namespace std;
ll dp[100005], h[100005],n,k;
int main()
{
fast_io
for(int i=2;i<=100000;i++)
dp[i]=inf... | 0 | 47,413,347 |
#include <iostream>
using namespace std;
const int M = 1046527;
const int L = 14;
string H[M];
int getChar(char ch) {
if (ch == 'A') {
return 1;
}
else if (ch == 'C') {
return 2;
}
else if (ch == 'G') {
return 3;
}
else if (ch == 'T') {
return 4;
}
ret... | #include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>
#include <cmath>
#include <string>
#include <stdlib.h>
#include <fstream>
#include <set>
#include <map>
#include <stack>
#include <deque>
#include <iterator>
#include <iomanip>
using namespace std;
int main() {
long long n, m;
cin >> n >> m... | 0 | 55,781,431 |
#include <iostream>
using namespace std;
int main()
{
string s;
cin >> s;
if ((s[0] == 'R') && (s[1] == 'R') && (s[2] == 'R')) {
cout << "3";
}
else if (((s[0] == 'R') && (s[1] == 'R')) || ((s[1] == 'R') && (s[2] == 'R'))) {
cout << "2";
}
else if (s[0] == 'R' || s[1] == 'R' ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define big 1e18+100000000
#define small -big
#define pb push_back
template <typename T>
void prarr(T a)
{
cerr << "[ ";
for(auto i : a){
cerr << i << " ";
}
cerr << "]" << e... | 0 | 19,193,763 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll a, b, k;
cin >> a >> b >> k;
cout << max(a - k, (ll)0) << " " << max(b - max(k - a, (ll)0), (ll)0) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E18;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | 0 | 40,346,892 |
#include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
int n, m;
int h[100000];
int a[100000];
int b[100000];
void solve() {
int ma[n+1];
memset(ma, 0, sizeof(ma));
for (int i=0;i<m;i++) {
ma[a[i]] = max(ma[a[i]], h[b[i]-1]);
ma[b[i]] = max(ma[b[i]], h... | 0 | 3,176,235 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | #include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main(){
int h,w;
while(cin >> h >> w, h||w){
rep(i,h){
rep(j,w){
if(i == 0 || j == 0 || i == h - 1... | 0 | 18,319,749 |
#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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b... | 0 | 82,517,721 |
#include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define ll long long
#define ii pair<string,int>ii;
string IntToStr(int tmp){
ostringstream out;
out << tmp;
return out.str();
}
int main()
{
int x,a,b;
cin>>x>>a>>b;
if(a>=b)cout<<"de... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,ll> P;
const ll INF = 10010010010;
void warshall_floyd(int n, vector<vector<ll> > &D) {
rep(k,n) rep(i,n) rep(j,n) D[i][j]... | 0 | 85,472,241 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
typedef long long ll;
using namespace std;
int mo[4]={0,1,0,-1};
int main(){
int h,w,n,ans=0;
bool fl[1000][1000]={0}... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
#define int ll
vector<ll> node[100005];
ll group[100005]={0},group_num[100005]={0},col[100005]={0};
ll nibu[100005]={0};
bool used[100005]={0};
bool dfs(ll pos,ll k,ll cl){
used[pos]=true;
group[pos]=k... | 0 | 47,218,855 |
#include <iostream>
using namespace std;
int main() {
long long n; cin >> n;
long long ans = 0;
for (long long i = 1; i * i <= n; ++i) {
if (n % i == 0) {
long long m = n / i - 1;
if (m == 0) continue;
if (n / m == n % m) ans += m;
}
}
cout << ans << endl;
return 0;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | 0 | 17,695,927 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<set>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
const double PI = acos(-1.0);
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, a, n) for (int i... | #include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<... | 0 | 41,849,950 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)
int main(){
int n;
cin >> n;
string s;
cin >> s;
int now = 0;
int left = 0;
int right = 0;
for (int ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long long int
const int mod = 1000000007;
#define PI 3.1415926535897932384626
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
map<int,int>primes;
void factor... | 0 | 2,281,472 |
#include<bits/stdc++.h>
#define god dimasi5eks
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mod 1000000007
#define dancila 3.14159265359
#define eps 1e-9
using namespace std;
typedef long long ll;
int add(int a, int b)
{
int x = a+b;
if(x >= mo... | #include<bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vector<int> >
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
using ll = long long;
using ld =long double;
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=... | 0 | 63,861,500 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef LOCAL
#include<debug.h>
#else
#define db(...) 21
#endif
#define debug(x) cout << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N, K, R, S, P;
string T;
cin >> N >>... | 0 | 4,604,122 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
int main() {
int n;
cin >> n;
cout << n / 3 << endl;
} | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n;
... | 0 | 72,408,239 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i,n) cin >> v[i];
int ans = 0;
rep(i,n+1) for(int j = 0; j+i <= n; j++){
if(i+j > k) conti... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define si(x) scanf("%d", &x)
#define sll(x) scanf("%lld", &x)
#define ssll(x,y) scanf("%lld %lld", &x ,&y)
#define sd(x) scanf("%lf", &x)
#define l0(i,n) for(ll i=0; i<n; i++)
#define MAX ... | 0 | 65,304,049 |
#include<iostream>
#define max 1000010
using namespace std;
bool isp[max];
int ans[max]={};
void sieve(){
for(int i=0;i<max;i++)isp[i]=true;
for(int i=2;i<max;i++){
if(isp[i]){
ans[i]++;
for(int j=2*i;j<max;j+=i)isp[j]=false;
}
}
for(int i=1;i<max;i++)ans[i]+=ans[i-1];
return;
}
int main()
{
int n;
sie... | #include <bits/stdc++.h>
#warning !!!check the size of arrayss!!!
#define INF 1000000000000000005
#define inf 1000000003
#define MOD 1000000007
#define newMOD 998244353
#define MAX 200006
#define pi 3.1415926535897932384626433832795
#define ld long double
#define ll long long
#define int lon... | 0 | 6,212,101 |
#include <bits/stdc++.h>
using namespace std;
#define deb(x) cerr << #x << " = " << x << "\n";
#define deb2(x, y) cerr << #x << " = " << x << ", " << #y << " = " << y << "\n";
#define deb3(x, y, z) cerr << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " << z << "\n";
#define pb push_back
#... | #include<bits/stdc++.h>
#define ro(a) (a).begin(),(a).end()
using namespace std;
using ll = long long int;
string sk;
int main(){
vector<ll> vo(3);
for(ll &i:vo) cin>>i;
sort(ro(vo));
for(ll i = 2;i>=1;i--) sk+=to_string(vo[i]);
cout<<stoll(sk)+vo[0]<<'\n';
} | 0 | 45,450,047 |
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
using ll = long long;
#define int ll
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
template<class T = ll> using V = vector<T>;
template<class T = ll> using VV = V<V<T>>;
#define IOS\
ios::sync_with_stdio(false);\
cin.tie(0);\
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int curr=1;
set<int> s;
s.insert(n);
while( true)
{
if(n%2==0)
{
curr++;
n=n/2;
if( s.find(n)== s.end() )
{
s.insert(n);
}
... | 0 | 50,020,333 |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,l,i;
cin>>n>>l;
if(n<l)
for(i=0;i<l;i++)
cout<<n;
else
for(i=0;i<n;i++)
cout<<l;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i,s,n)for(ll i=s;i<n;i++)
#define repe(i,s,n)for(ll i=s;i<=n;i++)
static const ll MOD = 1e9 + 7;
static const ll INF = (ll)1 << 62;
static const ll MAX_N = 100001;
static const ll MAX_M = ... | 0 | 86,743,980 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
int h1,m1,h2,m2,k,t;
cin >> h1 >> m1 >> h2 >> m2 >> k;
t = (h2-h1)*60+m2-m1;
int ans = t-k;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long ;
int main(){
map<string,int> kotoba;
bool ok=true;
int n;
cin >> n;
char old,now;
rep(i,n){
string s;
cin >> s;
if(kotoba[s]>0){
ok=false;
... | 0 | 73,298,459 |
#include<iostream>
using namespace std;
int main()
{
long long n,m,s=0,k;
cin>>n;
if(n%2!=0)
{
cout<<0<<endl;
}
else
{
k=10;
while(k<=n)
{
s+=(n/k);
k*=5;
}
cout<<s<<endl;
}
return 0;
} | const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> v... | 0 | 78,084,006 |
#include<bits/stdc++.h>
using namespace std;
int main()
{long long v[]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
long long n;cin>>n;cout<<v[n-1];
} | #include <iostream>
#include <string>
#include <cctype>
int main () {
std::string s; std::cin >> s;
std::string ans;
int count = 0;
int CID = 0;
if(s[0] == 'A') {
count ++;
}
for(auto i = 2; i <= s.length() - 2; i++) {
if(s[i] == 'C') {
count ++;
CID = i;
}
}
... | 0 | 63,706,813 |
#include <iostream>
using namespace std;
int main()
{
int K, A, B;
int x = 0;
cin >> K >> A >> B;
if (A == B) {
if (A % K == 0)
cout << "OK" << "\n";
else
cout << "NG" << "\n";
}
else {
int i = A;
while (i <= B) {
if (i % K == 0)
x += 1;
i++;
}
if (x == 0)
cout << "NG" << "\n";
el... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for((i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
typedef long long ll;
typedef pair<int, int> PII;
const double EPS = 1e-10;
typedef struct edg... | 0 | 67,644,707 |
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdio>
#include <bitset>
#include <cstring>
#include <iostream>
#include <algorithm>
#define maxn 100010
using namespace std;
void write(int x){if(x<0){putchar('-');x=-x;}if(x>9) write(x/10);putchar(x%10+'0');}
int read(){int d... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef ... | 0 | 85,510,083 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(void){
int N, L, T, x, w, gap;
cin >> N >> L >> T;
vector<int> X;
rep(i,N){
cin >> x >> w;
x += ((w+1) % 3 - 1) * T;
gap += x / L;
if(x < 0 && x % L != 0)gap--;
X.emplace_... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MOD 1000000007
#define INF 800000000
#define MAX 1000
int main(){
int N,K;
cin>>N>>K;
vector<ll> A(N),sum(N+1,0);
for(int i=0;i<N;i++){
cin>>A.at(i);
sum.at(i+1)=sum.at(i)+A.at(i);
}
for(int i=0;i<=N;i++){
sum.at(i)-=i;
... | 0 | 5,846,141 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include <bits/stdc++.h>
using namespace std;
const int N = 500005;
int n, m, a[N], b[N], c[N];
bool vis[N];
long long value[N];
vector<pair<int, int> > V[N];
long long mn = 1e18;
long long mx = -1e18;
void DFS(int w) {
mn = min(mn, value[w]);
mx = max(mx, value[w]);
vis[w] = true;
for (int i = 0; i < (... | 0 | 6,085,263 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define INF 1000000000
#define PB ... | 0 | 37,996,437 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
const int DIRECTSIZE = 4;
struct _direct {
int drow;
int dcol;
} direct[DIRECTSIZE] = {{0, -1}, {0, 1}, {-1, 0}, {1, 0}};
const int N = 1000;
const int N2 = 10;
char grid[N][N], visited[N][N];
int h, w, n;
struct _factory... | #include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
#de... | 0 | 98,270,651 |
#include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
using namespa... | #include<iostream>
#include<cstring>
using namespace std;
#define M 1046527
#define L 14
char st[M][L];
int h1(int key){return key%M;}
int h2(int key){return 1+key%(M-1);}
int h(int key,int i){return (h1(key)+i*h2(key))%M;}
int getChar(char ch){
if(ch == 'A') return 1;
else if (ch == 'C') return 2;
else if (ch ==... | 0 | 98,464,163 |
#include <iostream>
#include <cmath>
#define K 1000000007
using namespace std;
int main(){
int n,m,i;
cin >> n >> m;
long long x[n],y[m],a=0,b=0;
for(i=0;i<n;i++){
cin >> x[i];
x[i] = (x[i]+K)%K;
}
for(i=0;i<m;i++){
cin >> y[i];
y[i] = (y[i]+K)%K;
}
for(i=0;i<n;i++){
a = a+(2*(i+1)-n-1+K)%K*x[i];
a ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
for (int i = 0; i < h; i++) cin >> s[i];
int cnt = 0;
queue<pii> q;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (s[i][j] ... | 0 | 51,412,442 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.