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;
#define int long long
int n,ans;
struct vec{
int x,y;
}a[205];
bool cmp(vec a,vec b)
{
if(atan2(a.y,a.x)==atan2(b.y,b.x))
return a.x<b.x;
return atan2(a.y,a.x)<atan2(b.y,b.x);
}
signed main()
{
cin>>n;
for(int i=1;i<=n;cin>>a[i].x>>a[i].y,i++);
sort(a+1,a+1+n,cmp);
... | #include<iostream>
#include <complex>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--){
pair<double,double>a[4];
for(int i=0;i<4;i++){
cin>>a[i].first>>a[i].second;
}
if(abs((a[1].first-a[0].first)*(a[3].second-a[2].second)-(a[3].first-a[2].first)*(a[1]... | 0 | 54,432,879 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<cstdio>
#include<string>
typedef long long int ll;
using namespace std;
string back(string s){
string ret="";
for(int i=s.size()-1;i>=0;i--){
ret+=s[i];
}
return ret;
}
int main(){
string s;
cin>>s;
cout<<back(s)<<endl;
return 0;... | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 2e5 + 100;
char str[maxn];
int a[maxn];
int dp[(1<<26)];
void print(int x)
{
while(x){
cout<<x%2;
x/=2;
}
cout<<endl;
}
int main()
{
cin>>str;
int L = strlen(str), ans = 0;
for(int i = ... | 0 | 27,778,487 |
#include <iostream>
#include <deque>
#include <random>
#include <bitset>
#include <vector>
#include <algorithm>
#include <array>
#include <set>
#include <map>
#include <queue>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <functional>
#include <cassert>
#define repeat(i, n) for (int i = 0;... | #include<bits/stdc++.h>
#define ll long long int
#define vll vector<ll>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k, a;
cin >> n >> k;
vll x;
for(ll i=0; i<n; i++){
cin >> a;
x.push_back(a);
}
sort(x.begin(), x.end());
ll ... | 0 | 46,559,409 |
#include<bits/stdc++.h>
using namespace std;
inline int read()
{
int x = 0, f = 1; char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar()) if (ch == '-') f = -1;
for (; ch >= '0' && ch <= '9'; ch = getchar()) x = (x << 1) + (x << 3) + ch - '0';
return x * f;
}
const int N = 1e5 + 5;
int p[N], l[N], r[N];
... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 22,242,674 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
using namespace std;
#ifdef DEBU... | #include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> x;
int i = 0, n;
while (1) {
cin >> n;
x.push_back(n);
if(x[i] == 0) break;
i++;
}
for(i = 0; i < x.size(); i++) {
if(x[i] == 0) break;
cout << "Case " << i+1 << ": " <... | 0 | 23,520,402 |
#pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
const int INF = 1e9, MOD = 1e9 + 7,... | #include<bits/stdc++.h>
#define ll long long
#define endl '\n'
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int a,b;
char op;
cin>>a>>op>>b;
if(op=='+') cout<<a+b<<endl;
else cout<<a-b<<endl;
return 0;
} | 0 | 41,131,967 |
#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;
cout << (1900 * m + 100 * (n - m)) * pow(2, m) << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long ... | 0 | 83,941,450 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 998244353
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--... | #include<iostream>
#include<vector>
#include<string>
using namespace std;
struct Union_Find {
vector<int> rank, par;
int independent_tree;
int N;
Union_Find(int n) {
N = n;
for (int i = 0; i < N; i++)rank.push_back(1), par.push_back(i);
independent_tree = N;
}
int getroot(int X) {
if (par[X] == X)return X... | 0 | 51,218,374 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
int N; cin >> N;
int a[N]; rep(i,N) cin ... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x)... | 0 | 2,310,057 |
#include <iostream>
using namespace std;
int main(){
long long int answer;
int n;
cin >> n;
answer = 1;
for(int i =1; i<=n;i++)
answer = answer * (long long int)i;
cout << answer << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
const ll INF = 1e16;
void solver(ll N, ll A, ll B, ll &ans){
if(A > B) ans = 0;
else if(N == 1){
if(A == B) ans = 1;
else ans = 0;
}
else{
ll min_sum{}, max... | 0 | 96,834,025 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
int a, n, ans;
cin >> a;
n = a - 2;
ans = 180 * n;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef double Real;
typedef complex<Real> Point;
typedef pair<Point,Point> Line;
const Real EPS=1e-10;
inline Point vec(const Line& a){
return a.second-a.first;
}
Real dot(Point a,Point b){
return (conj(a)*b).real();
}
Real cross(Point a,Point b){
return (conj(... | 0 | 52,207,137 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main(){
int N;
cin >> N;
int l = -1,r = N;
cout << 0 << endl;
string S;
cin >> S;
if(S == "Vacant") {
... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>... | 0 | 21,694,043 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
long double const pi = std::acos(-1.0L);
typedef pair<int,int> P;
int main() {
int n; cin >> n;
vector<int> x(n);
rep(i,n)cin >> x[i];
int minv = 1e9;
for(int i = 1; i <=1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;... | 0 | 15,692,693 |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,x;
cin>>n;
double sum=0.0;
for(int i=0;i<n;i++)
{
cin>>x;
sum+=(1.0/x);
}
sum=1.0/sum;
cout<<setprecision(16)<<sum<<"\n";
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <map>
#include <iostream>
#include <utility>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <unordered_set>
#incl... | 0 | 80,323,767 |
#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)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
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 ... | 0 | 11,213,275 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | #pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for ... | 0 | 73,226,162 |
#include<iostream>
using namespace std;
int main(void){
int a,b,c = 0;
cin >> a >> b >> c;
if(a != b && a != c){
cout << a;
}else if(b != a && b != c){
cout << b;
}else
{
cout << c;
}
} | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
#define pf(n) cout << n << endl
#define ps() cout <<" ";
#define sf(n) cin >> n
#define in(i,n) for (int i = 0; i < n; i++) 2
#define mn -
#define pls +
#define mod %
#define E =
#define EE ==
#define le <=
#define ge >=
inline void S... | 0 | 80,167,653 |
#include<bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long int
#define fi first
#define se second
#define pub push_back
#define mkp make_pair
#define pi pair<int,int>
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for(int ... | #include <iostream>
#include <stack>
#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <functional>
#include <string>
#include <cstdlib>
#include <numeric>
#include <cstdbool>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <sstream>
type... | 0 | 27,044,070 |
#include <stdio.h>
int main(void){
int i,a,b,c,m;
scanf("%d %d %d",&a,&b,&c);
for(i=1;i<=10;++i){
if(a>b){
m=a,a=b,b=m;
}
if(b>c){
m=b,b=c,c=m;
}
}
printf("%d %d %d\n" , a,b,c);
return 0;
} | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, M, tmp=0;
map<ll, pair<ll, ll>> MP;
map<ll, ll> MP1;
vector<string> ans;
signed main(){
cin >> N >> M;
ans.resize(M);
for(int i=0;i<M;i++) {
ll p, y;
cin >> p >> y;
... | 0 | 100,547,420 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int n,i;
string T,H;
int score_T = 0,score_H = 0;
cin>>n;
for(i = 0;i < n;i++){
cin>>T;
cin>>H;
if(T > H)
score_T += 3;
else if(T < H)
score_H += 3;
else {
score_T++;
score_H++;
}
}
cout<<score_T<<" "<<score_H<<endl;
re... | #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 ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
template <typename A,... | 0 | 9,078,618 |
#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
printf("%d\n", 800 * N - 200 * (N / 15));
return 0;
} | #include<iostream>
#include<algorithm>
using namespace std;
int pnt[10000];
int main(){
int n,q;
cin>>n>>q;
for(int i=0;i<n;i++){
pnt[i]=i;
}
int x,y,z;
for(int u=0;u<q;u++){
cin>>z>>x>>y;
if(!z){
while(true){
if(pnt[x]==x)break;
x=pnt[x];
}
while(true){
if(pnt[y]==y)break;
y=pnt[y]... | 0 | 78,263,187 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi=3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF=1e18;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
const int MAX_S = 55;
int ... | 0 | 63,016,399 |
#include <iostream>
int main() {int R, G; std::cin >> R >> G; std::cout << 2 * G - R;} | #include <bits/stdc++.h>
#define repp(i,l,r)for(long long i=(l);i<(r);i++)
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define per(i,n) for (long long i = (n); i >= 0; --i)
#define all(v) v.begin(), v.end()
const int INF = 1 << 30;
const long long int MOD = 1000000007;
using namespace std;
using ll = long long... | 0 | 32,442,497 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long; using ull = unsigned long long;
#define int ll
using vb = vector<bool>; using vvb = vector<vb>;
using vi = vector<int>; using vvi = vector<vi>;
using vl = vector<ll>; using vvl = vector<vl>;
using pii = pair<int,int>; using pll = pair<ll,ll>;
#define F... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | 0 | 9,579,137 |
#include <bits/stdc++.h>
int main(void) {
int n = 0;
std::stack<int> S;
std::vector<int> ans;
while (std::cin >> n) {
if (n != 0) {
S.push(n);
}
else {
ans.push_back(S.top());
S.pop();
}
}
for (int i = 0; i < ans.size(); i++) {
std::cout << ans[i] << std::endl;
}
} | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#inc... | 0 | 98,585,069 |
#include <iostream>
#include <stdio.h>
int main() {
int a, b;
while (true) {
std::cin >> a >> b;
if (a == 0 && b == 0) {
break;
}
if (a > b) {
std::cout << b << ' ' << a << std::endl;
} else {
std::cout << a << ' ' << b << std::endl;
... | #include <iostream>
#include <cmath>
using namespace std;
struct point{
double x, y;
};
void koch(int n, point a, point b){
if (n==0) return;
point s, t, u;
double th = M_PI/3;
s.x = (2.0*a.x + 1.0*b.x)/3.0;
s.y = (2.0*a.y + 1.0*b.y)/3.0;
t.x = (1.0*a.x + 2.0*b.x)/3.0;
t.y = (1.0*a.y + 2... | 0 | 53,118,183 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x;
cin >> x;
cout<<8-((x-400)/200);
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int main(void) {
int n;
scanf("%d", &n);
int *A = new int[n], *B = new int[n], max = -1;
for (int i = 0; i < n; ++i) {
scanf("%d", &A[i]);
if (A[i] > max) {
max = A[i];
}
... | 0 | 54,753,543 |
#include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9;
const int mod =... | #include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
const bool debug=false;
#define DEBUG if(debug==true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
int main(void) {
ll n;cin>>n;
vector<ll> plus,minus;
vector<pair<ll,ll> > control... | 0 | 25,291,031 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include<bits/stdc++.h>
using namespace std;
#define itn int
int main(void){
long long n,k;
cin >> n >> k;
vector<long long> v(100010,0);
for(int i = 0;i < n;i++){
int a,b;
cin >> a >> b;
v[a-1] += b;
}
for(int i = 0;i < 100000;i++){
k -= v[i];
if(k <= 0){... | 0 | 42,426,554 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#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)
#define ALL(x) (x).begi... | 0 | 84,224,491 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int Q,H,S,D,N;
cin>>Q>>H>>S>>D>>N;
S=min({Q*4,H*2,S});
cout<<min(S*2,D)*(N/2)+S*(N%2)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll INF = 1'010'000'000'000'000'017LL;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) {
cin >> a[i];
a[i]--;
}
... | 0 | 68,445,087 |
#include <bits/stdc++.h>
#include <iostream>
typedef long long ll;
#define rep(i,a,b) for(ll i =a ;i <= b;i++)
#define per(i,a,b) for(ll i =a ;i >= b;i--)
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
vvi graph;
vi h;
int n,m;
vector<bool> tallest,visited;
void dfs(int index)
{
if(visit... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll func(ll a){
ll ans = 0;
for(int i=0;i<50;i++){
ll lp = (1LL<<(i+1));
ll cnt = (a+1)/lp * (lp/2);
ll d = (a+1)%lp - lp/2;
if(d>0) cnt += d;
if(cnt%2==1) ans += 1LL << i;
}
return ans;
}
int main(... | 0 | 8,358,278 |
#include <iostream>
#include <cassert>
#include <cstring>
#include <vector>
using namespace std;
vector<long long int> white;
vector<long long int> black;
vector<vector<int>> adj;
const long long int p = 1e9 + 7;
void dfs(int node, int parent){
if(adj[node].size()==1 && adj[node][0]==parent){
white[node] = ... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int N,L,T,S=0,x;
cin>>N>>L>>T;
vector<long long int>X(N),H(N),W(N);
for(long long int i=0;i<N;i++){
cin>>X.at(i)>>W.at(i);
H.at(i)=X.at(i);
}
for(long long int i=0;i<N;i++){
if(W.at(i)==1)X.at(i)=(X.at(i)+T)%L;
else X.at(i)=(... | 0 | 79,856,115 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;
#define forn(i, n) for (int (i) = 0; (i) != (... | 0 | 55,477,591 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <sstream>
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <numeric>
#include <bitset>
#include <ext/algorithm>
#include <ext/numeric>
#define ffor(_a,_f,_t) ... | 0 | 23,564,093 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <climits>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <sstream>
#include <vector>
#include <map>
#include <set>
#include <complex>
#include <functional>
#include <utility>
#include <iterator>
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int n; cin >> n;
int r,l = 0; int a[n];
for(... | 0 | 1,549,752 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 | 81,270,499 |
#include<cstdio>
#include<iostream>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
if (N % 2 == 1) {
printf("No\n");
return 0;
}
char s[110];
scanf("%s", s);
bool ans = true;
for (int i = 0; i < N / 2; i++) {
if (s[i] != s[N / 2 + i]) {
ans = false;
break;
}
}
printf(ans ? "Yes" :... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> A(pow(10, 5) + 5, vector<int>());
r... | 0 | 63,261,504 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(v) (v).begin(),(v).end()
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const ll MOD... | 0 | 3,739,255 |
#include <iostream>
using namespace std;
int main()
{
char ch;
cin>>ch;
int x=ch;
x++;
char out=x;
cout<<out;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long mod = 1e9+7;
void Main()
{
int n, m;
cin >> n >> m;
vector<int> s(n);
vector<int> t(m);
for (int i = 0; i < n; i++)
{
cin >> s[i];
}
for (int i = 0; i < m; i++)
{
cin >> t[i];
}
vector<vector<long>> p(n, vecto... | 0 | 44,439,652 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
#define erep(i,n) for(int i = 0;i<=n;i++)
#define rep1(i,n) for(int i = 1;i<n;i++)
#define erep1(i,n) for(int i = 1;i<=n;i++)
typedef long long ll;
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<strin... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(x) (x).begi... | 0 | 59,568,526 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N = 0;
cin >> N;
vector<double> A(N,0);
for(int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
double ans = 0;
for(int i = 0; i < N; i++) {
an... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
char grid[1010][1010];
bool seen[1010][1010];
int di[]={0,1,0,-1};
int dj[]={1,0,-1,0};
int main(){
int h,w;
cin>>h>>w;
queue<P> q;
rep(i,h)rep(j,w){
cin>>grid[i][j]... | 0 | 47,863,945 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(long long i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll x, k=1;
cin >> x;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for... | 0 | 59,836,046 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n + 2, 0);
REP(i, n) cin >> a[i + 1];
int sum = 0;
REP(i, n + 1) sum += abs(a[i] - a[i + 1]);
for (int i =... | #include <bits/stdc++.h>
using namespace std;
struct edge {
int to;
int weight;
edge(int t, int w) : to(t), weight(w) { }
};
using Graph = vector<vector<int>>;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T... | 0 | 40,730,101 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTIO cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false);
#define loop(i,a,b) for(int i=a; i<b; i++)
#define INF 10000000000099ll
#define mod 1000000007
#define MAX 1000
ll dp[MAX+1][MAX+1];
ll solve(int h, int w)
{
for(int i=1; i<=w;... | #include <bits/stdc++.h>
#include<unordered_map>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const int N=200000;
void Run()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}
ll a[N],s,res,f;
map<char,ll>mp;
vector<ll>v;
int main()
{
Run();
int x,y;
cin>>x>>y;
if(y%2==0)
... | 0 | 37,659,001 |
#include <bits/stdc++.h>
#define gcd(m,n) __gcd(m,n)
#define lcm(m,n) m*(n/gcd(m,n))
#define fast std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pi acos(-1.0)
#define endl '\n'
#define MOD 1000000007
#define ull unsigned long long
#define ll long long
#define ld long double
#define pb push_back
#... | #include <bits/stdc++.h>
using namespace std;
#include <vector>
int main(){
int N, M; cin >> N >> M;
vector<vector<int>> S(M);
vector<int> P(M);
for (int m=0; m<M; m++){
int K; cin >> K;
for (int k=0; k<K; k++){
int s; cin >>s;
S[m].push_back(s);
}
}
... | 0 | 2,131,239 |
#define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
string S;
ll... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i... | 0 | 82,082,343 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ins insert
#define pqueue(... | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 998244353
int main(){
ll n... | 0 | 32,159,785 |
#include <iostream>
#include<vector>
#include<algorithm>
#define ll long long
#define rep(n) for(int i=0;i<n;++i)
using namespace std;
int main(void){
int n;
cin>>n;
vector<int> vec1(n+1), vec2(n);
rep(n+1){
cin>>vec1[i];
}
rep(n){
cin>>vec2[i];
}
ll sum=0;
rep(n){
int a= min(vec1[i], vec2[i]);
vec1[i]... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define arr array
using namespace std;
const int e = 2e6 + 69;
const ll mod = 1e9 + 7;
ll dp[e];
int main()
{
int n, m;
cin >> n >> m;
for(int i=1; i<=m; i++){
int l, r;
cin >> l >> r;
dp[l] ++;
dp[r+1] --;
... | 0 | 41,173,583 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rev(x) greater<x>()
#define MOD 1000000007
#define INF 1000000000
typedef long long LL;
typedef long double LD;
bool compare_by_b(pair<int, int> a, pair<int, int> b)
{
if (a.second != b.second) {
return a.second < b.s... | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
string s, op;
char ss[1000];
int q, a, b;
int main() {
cin >> s >> q;
int size = s.size();
for (int i = 0; i < size; ++i)
ss[i] = s[i];
while (q--) {
cin >> op;
if (op == "replace") {
cin >> a >> b >> op;
for (int i = a, j = 0; i <= b; ++i, ++j... | 0 | 58,313,185 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <set>
#include <math.h>
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
typedef long long ll;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n),c;
rep(i,0,n) cin ... | 0 | 62,427,729 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
IOS;
int x1,y1,x2,y2,x3,y3,x4,y4;
cin >> x1 >> y1 >> x2 >> y2;
x3 = x2 - (y2-y1);
y3 = y2 + (x2-x1);
x4 = x1 - (y2-y1);
y4 = y1 + (x2-x1);
cout << x3 <<" "<<y3 <<" "<<x... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
const char newl = '\n';
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
temp... | 0 | 27,061,658 |
#include <stdio.h>
int main(){
char X[3];
scanf("%s",&X);
if(X[0]=='7'){
printf("Yes\n");
}
else if(X[1]=='7'){
printf("Yes\n");
}
else if(X[2]=='7'){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<long long> vll;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int a, b, c;
cin >> a >> b >> c;
if (a==b && a!= c && b!=c )
{
cout<<"2"<<endl;
}
else if (a==... | 0 | 93,623,845 |
#include<iostream>
using namespace std;
int main()
{
string s1,s2,s3,a,A;
cin>>s1>>s2>>s3;
string ans;
ans += (char) (s1[0]-'a'+'A');
ans += (char) (s2[0]-'a'+'A');
ans += (char) (s3[0]-'a'+'A');
cout<<ans<<endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) fo... | 0 | 3,379,001 |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<iomanip>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
using namespace std;
#define DEBUG(x) cout<<#x<<"="<<x<<endl
#define DEBUG2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 32,037,616 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define ii pair < int , int >
const int N=10;
int a[N];
int b[N];
int c[N];
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)scanf("%d",a+i);
for(int i=0;i<n;i++)scanf("%d",b+i);
bool q=1; i... | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <cmath>
#inc... | 0 | 4,101,375 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
int n, k;
cin >> n >> k;
double ans = 0;
for (int i = n; i >= 1; i--)
{
doub... | #include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 4e18 + 10;
const int dx[9] = {1, 0, -1, 0, 1, -1, -... | 0 | 16,643,488 |
#include<iostream>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<cstring>
#include<string>
#include<cassert>
#include<cmath>
#include<climits>
#include<iomanip>
#include<bitset>
#include<unordered_map>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
const int MOD = 1e9 + 7;
ll qpow(ll a, ll b, ll mod = MOD) {
ll res = 1;
while (b) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
ll dp[maxn];
int main() {
... | 0 | 70,123,148 |
#include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a,int64_t b){return (a%b==0?b:gcd(b, a%b));}
int64_t lcm(int a,int b){return (int64_t)a*b/gcd(a, b);}
int factorial(int a){int b=1;while(a){b*=a--;}return b;}
bool is_prime(int a){if(a<=1)return false;for(int i=2;(int64_t)i*i<=a;i++){if(a%i==0)return fa... | #include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(a); (i)<(b); ++(i))
#define rFor(i, a, b) for(int (i)=(a)-1; (i)>=(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulin... | 0 | 81,789,069 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, K, input;
cin >> N >> K;
vector<int> prices;
for (int i = 0; i < N; ++i) {
cin >> input;
prices.push_back(input);
}
sort(prices.begin(), prices.end());
int cost = 0;
for (int i = 0; i < K; ++i)
... | #include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
using namespace std;
const int maxn = 105;
typedef long long ll;
ll f[maxn][5];
string s;
int k;
ll dfs(int pos, int now, bool lead, bool eq) {
if (now > k) return 0;
if (pos == s.length()) {
if (now == k) retur... | 0 | 82,497,807 |
#include <iostream>
using namespace std;
int main(){
int x,cnt=1;
while(cin >> x && x ){
cout << "Case " << cnt++ << ": " << x << endl;
}
return 0;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end... | 0 | 63,597,280 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i=0;i<(n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
int main(){
string s;
cin>>s;
string t="";
rep(i, s.size()){
if(s[i]!='x') t+=s[i];
}
string u = "";
u += t;
reverse(u.begin(), u.end());
ll ans;
if(u==t) {
... | 0 | 72,023,757 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
using namespace std;
#define INF 1E18
typedef long long ll;
typedef vector<int> vi;
type... | #include<iostream>
using namespace std;
int main() {
int a,b,c,min,mid,max;
cin >> a >> b >> c;
max = a;
if(max < b) {
max = b;
}
if(max < c) {
max = c;
}
min = a;
if(min > b) {
min = b;
}
if(min > c) {
min = c;
}
mid = a;
if((min == a || min =... | 0 | 2,263,106 |
#include "bits/stdc++.h"
#define REP(i, n, N) for(ll i=(n); i<(N); i++)
#define RREP(i, n, N) for(ll i=(N-1); i>=(n); i--)
#define LREP(lst,itr) for(auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a, b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define MCP(a, b) memcpy(b,a,sizeof(b))
#defi... | #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 X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A... | 0 | 7,363,906 |
#include <iostream>
int main()
{
long long int k, a, b; std::cin >> k >> a >> b;
if (b - a <= 2) {
std::cout << (k + 1) << std::endl;
return 0;
}
long long v = std::max(0LL, (k-a+1) / 2);
std::cout << ((b-a) * (v) + (k - v * 2) + 1) << std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
map<char,char> ma;
int main(){
ios_base::sync_with_stdio(false);
int n,m;
char a,b;
while(1){
cin >> n;
if(n==0) break;
for(int i=0;i<n;i++){
cin >> a >> b;
ma[a]=b;
}
cin >> m;
char temp;
for(int i=0;i<m;i++){
cin >> tem... | 0 | 80,725,235 |
#include <bits/stdc++.h>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void){
ll L, R;
cin >> L >> R;
int ans = 2018;
R = min(R, L + 4038);
for (ll i = L; i <= R; i++){
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
vector<long long> divisor(l... | 0 | 95,943,982 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <numeric>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n%k==0) {
printf("0\n");
} else {
printf("1\n");
}
return 0;
} | #include<iostream>
#include <cstddef>
#include<set>
#include<stack>
#include <deque>
#include<queue>
#include<utility>
#include<vector>
#include<map>
#include<cmath>
#include<cstring>
#include<bitset>
#include<cstdio>
#include<iomanip>
#include<algorithm>
#define ll long long
#define ull unsigned long long
#define s... | 0 | 3,299,573 |
# include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, k; cin >> n >> k;
map<char,int> mp;
int r, s, p; cin >> r >> s >> p;
mp['r'] = p; mp['s'] = r; mp['p'] = s;
string t; cin >> t;
int ans = 0;
rep(i,k) {
char now = t[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pb push_back
const int N = 1000006;
int res[N];
int main() {
int m, k;
scanf("%d %d", &m, &k);
if (k > (1 << m) - 1) return printf("-1"), 0;
int n = 1 << (m + 1), mx = (1 << m) - 1;
if (k =... | 0 | 39,694,197 |
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <complex>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
namespace Number {
typedef long long int LL;
... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <numeric>
#define... | 0 | 61,733,937 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int total_t = 0;
vector<int> t(n), v(n);
for(int i=0; i<n; i++){
cin >> t[i];
total_t += t[i];
}
for(int i=0; i<n; i++){
cin >> v[i];
}
vector<int> maxv(2 * total_t+1, 1000);
maxv[0... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<long long> vll;
typedef vector<int> vi;
#define io ios_base::sync_with_stdio(false)
#define pb push_back
#define eb emplace_back
#define mod 998244353
#define PI 2*acos(0.0)
in... | 0 | 82,020,426 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
int count = 0;
for (int i = A; i <= B; i++) {
int a1 = i % 10;
int a10 = (i / 10) % 10;
int a1000 = (i / 1000) % 10;
int a10000 = i / 10000;
if (a1 == a10000 && a10 == a1000) {
count++;
}
}
cout << count << e... | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/adaptor/indexed.hpp>
using namespace std;
using namespace boost::adaptors;
using namespace std::string_literals;
using ll = int64_t;
using vecint = vector<int>;
using ... | 0 | 83,064,421 |
#include <stdio.h>
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <cctype>
#include <iostream>
#include <vector>
#include <deque>
#include <queue>
#include <map>
#include <algorithm>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef pair<int ,int> P;
int main()
{
int N,A,B... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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=1001001001;
const int mod=1e9+7;
stru... | 0 | 68,078,418 |
#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>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
vector<int> v(n);
vector<int> p(n);
vector<int> q(n);
for (int i = 0; i < n; i++)
{
v[i] = i + 1;
}
for (int i = 0; i < n; i++)
{
cin >> p[i];
}
for (int i = 0; i < n; i++)
{
cin >> q[... | 0 | 50,643,299 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll h, w;
cin >> h >> w;
for (ll i = 0; i < h; ++i) {
string s;
cin >> s;
cout << s << endl << s << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll n;
ll a[100005];
ll ans1,ans2;
int main(void){
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
for(int i=n-1;i>=0;i--){
if(a[i]==a[i-1]){
if(ans1==0){
ans... | 0 | 76,313,370 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A;
cin >> A;
if(A/100==1){
cout << 9;
}
else{
cout << 1;
}
if((A%100-A%10)/10==1){
cout << 9;
}
else{
cout << 1;
}
if(A%10==1){
cout << 9;
}
else{
cout << 1;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
vector<int> v = {2,5,5,4,5,6,3,7,6};
int n,m;
cin >> n >> m;
... | 0 | 91,683,859 |
#include <bits/stdc++.h>
using namespace std;;
#define ll long long
#define rep(i, n) for(int i = 0;i < n;i++)
#define repr(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define INF 1<<30
#define LINF 1LL<<62
#define all(x) (x).begin(), (x)... | #include <iostream>
#include <vector>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
int main(void) {
Int n;
cin >> n;
vector<Int> c(n);
vector<Int> s(n);
vector<Int> f(n);
for (Int i = 0; i < n; ++i) {
cin >> c[i] >> s[i] >> f[i];... | 0 | 78,953,622 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define getchar get... | #include <bits/stdc++.h>
using namespace std;
int solve(const vector<vector<int>> &v_positions,
const vector<vector<int>> &h_positions, const pair<int, int> &pos) {
int pos_x = pos.first, pos_y = pos.second, ans = 0;
const vector<int> &v_pos = v_positions[pos_x], &h_pos = h_positions[pos_y];
ans +=
... | 0 | 38,021,839 |
#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef set<int> si;
const int inf = 1e9;
const int mod = 1e9+7;
ll k, a[50];
main(){
... | #include<iostream>
#include<vector>
using namespace std;
int main(void) {
int input_num;
vector<int> train_num;
while (cin >> input_num) {
if (input_num == 0) {
cout << train_num.back() << endl;
train_num.pop_back();
}
else if (input_num >= 1 && input_num <= 10) {
train_num.push_back(input_num);
}
... | 0 | 45,004,058 |
#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... | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <... | 0 | 7,196,572 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T> using v2 = vector<vector<T>>;
template<typename T> inline v2<T> fill(int r, int c, const T& t){ return v2<T>(r, vector<T>(c, t)); }
#define F first
#define S second
int n;
string l;
v2<int> dp;
const int MOD = 1e9+7;
int f(int ind... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(ll test_num) {
(void) test_num;
ll H, W;
cin >> H >> W;
for (ll r = 1; r <= H; ++r) {
for (ll c = 0; c < W; ++c) {
string str;
cin >> str;
if (str == string("snuke")) {
cout << char(c + 'A') << r << endl... | 0 | 100,272,201 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char let;
cin >> let;
if(let=='a'||let=='i'||let=='u'||let=='e'||let=='o'){
cout << "vowel" << endl;
}else{
cout << "consonant" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for (ll i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)
void solve()
{
int n;cin>>n;
string s;int ab=0,a=0,b=0,ans=0;
REP(i,n){
cin>>s;
REP(i,s.size()-2){
if(s[i]=='A'&&s[i+1]=='B')ans++;
... | 0 | 94,274,269 |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include"bits/stdc++.h"
using namespace std;
#define Fast_D cout<<fixed<<setprecision(2);
#define FastIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define nl "\n"
#define sp " "
#define int long long
#defi... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(ll i = (a); i < (b); ++i)
#define FOR_EQ(i,a,b) for(ll i = (a); i <= (b); ++i)
#define rep(i,n) FOR(i,0,n)
#define rep_eq(i,n) FOR_EQ(i,0,n)
#define DEBUG_VARIABLE(variable) cout << #variable << ":" << variable << endl
#define INFTY 1000000000000
#def... | 0 | 60,448,814 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
int main(){
ll A,B,C,K;
cin >> A >> B >> C >> K;
if(K%2 == 0){
cout << A-B << endl;
} else {
cout << B-A << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
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 long long INF = 1LL << 60;
typed... | 0 | 75,062,981 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
int main()
{
string tWord, hWord;
int n, tPoint = 0, hPoint = 0, i;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> tWord >> hWord;
if (tWord > hWord)
tPoint += 3;
else if (hWord > tWord)
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n , x = 0;
cin >> n;
int a[n];
for( int i = 0 ; i < n ; i++ )... | 0 | 87,129,185 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<int> a(n);
for(int i = 0; i < m; i++){
cin >> a[i];
}
int s = 0;
for(int i = 0; i < m;i++)
s += a[i];
if (s > n)
{
cout << "-1" << endl;
}
else... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int arr[200005];
ll psum[200005];
int main()
{
int n;
cin>>n;
ll tot=0;
for(int i=1;i<=n;i++){
cin>>arr[i];
tot+=arr[i];
}
for(int i=1;i<=n;i++)
psum[i]=psum[i-1]+arr[i];
ll ret=1e15;
for(int i=1;... | 0 | 16,015,355 |
#include <iostream>
#include <algorithm>
#define INF 99999999999
using namespace std;
typedef long long int lli;
int main(void){
int n,m,a,b,c;
cin>>n>>m;
lli dp[n][n];
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(i==j)dp[i][j]=0;
else dp[i][j]=INF;
}
}
for(int i=0;i<m;i++){
cin>>a>>b>>c;
dp[a][b]... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <time.h>
using namespace std;
typedef long long ll;
int search(string S, string T)
{
int Tz = T.size();
for (int s = S.size() - 1; s >= 0; --s) {
if (s - Tz + 1 < 0) return -1;
string sub = S.substr(s - Tz + 1, T... | 0 | 27,635,165 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#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 fore(i,a) for(auto &i:a)
#define INF INT_MA... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | 0 | 27,022,674 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define sd(x) scanf("%lf", &x)
#define l0(i,n) for(ll i=0; i<n; i++)
#define MAX 100005
#define maxn 200005
#define pb push_back
#define mk make_pair
#define endl "\n"
#define INF 10... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll isPrime(int n)
{
if (n <= 1)
return 1;
if (n <= 3)
return 2;
if (n % 2 == 0 || n % 3 == 0)
return 1;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || ... | 0 | 86,627,252 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | #include <bits/stdc++.h>
#define int long long
#define counter(m) for(int i=0;i<m;i++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 ... | 0 | 32,211,126 |
#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;
int main() {
int N;
cin >> N;
int tl[N + 2], tr[N + 2], v[N + 2];
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll a[5001], le, ri, mid, n, k, ans;
bool okk(ll i){
bool tmp, ok = true;
if(k <= a[i]){
return true;
}
bitset<5000 + 10> dp;
dp[0] = true;
for(int j = 0; j < n; j++){
if(i == j)continue;
dp |= (dp << a[j]);
}
for(int j = k -... | 0 | 8,420,544 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> pii;
typedef pair<int,pii> pipii;
typedef long long ll;
typedef pair<ll,ll> p... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vb=vector<bool>;
using vvb=vector<vb>;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pll = pair<ll,ll>;
using vpii = vector<pii>;
using vpli = vec... | 0 | 52,400,023 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef double d;
#define tt int t; cin>>t; while(t--)
#define lo(i, a, b) for(int i=a; i<b; i++)
#define rlo(i, a) for(int i=a; i>=0; i--)
#define be(a) a.begin(),a.end()
#define sz(x) x.size()
#define sp " "
#define nl cout<<'\n';
#define su ios_b... | #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;
vector<int> a(n);
vector<bool> b(n, false);
rep(i, n) cin >> a[i], --a[i];
int p = 0;
b[0] = true;
int ans = 0;
... | 0 | 85,936,710 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B, X;
cin >> A >> B >> X;
cout << (X >= A && X <= A + B ? "YES" : "NO") << endl;
} | #include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <array>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <iomanip>
#include <numeric>
#include <climits>
#include <algorithm>
#include <cstdint>
using namespace... | 0 | 91,796,429 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <map>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main()
{
int n;
cin >> n;
ll s[n + 1];
s[0] = 0;
repi(i, n + 1, 1)
{
... | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
signed main() {
... | 0 | 84,766,818 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi atan(1.0)*4
#define pb(x) push_back(x)
#define in(x) insert(x)
#define fl(x,y) for(ll i=x;i<y;i++)
#define vi vector<long long>
#define vs vector<string>
#define vp(vi,x) cin>>x; vi.pb(x);
string en="\n";
string t="hello";
string Y="YES\n";
s... | #include <bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<n;++i)
#define repe(i,k,n) for(int i=k;i<=n;++i)
using namespace std;
int main()
{
cin.tie(0);cout.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n=s.size();
while(s.size()>0){
s = s.substr(0,s.size()-2);
str... | 0 | 13,728,226 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (2e9)
#define INFL (2e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
using vint=vect... | #include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int main()
{
int N, M, X, Y, tmp;
cin >> N >> M >> X >> Y;
int Xmax = X, Ymin = Y;
for (int i = 0; i < N; i++)
{
cin >> tmp;
Xmax = max(Xmax, tmp);
}
for (int i = 0; i < N; i++)
{
cin >> tmp;
... | 0 | 96,543,214 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long N=0,M=0;
cin >> N >> M;
if(2*N>=M){
cout << M/2 << endl;
}
else{
M -= N*2;
M /= 4;
cout << N+M << endl;
}
return 0;
} | #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 | 37,364,766 |
#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()
{
ll n, T;
cin >> n >> T;
ll ans = 0;
vector<ll> t(n);
rep(i, n)
{
cin >> t[i];
}
rep(i, n)
{
... | #include<stdio.h>
int main(){
int i;
int k=0;
int x[2000];
int sum[1000]={0};
do{
int l=0;
for( ; ; ){
if((x[l++]=getchar())=='\n')break;
x[l-1]=x[l-1]-'0';
sum[k]+=x[l-1];
}
k++;
}while(x[0]!=0);
for(i=0; i<k-1; i++)printf... | 0 | 66,643,962 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
string S;
cin >> S;
for (int i = 0; i < A + B + 1; i++)
{
if (i == A)
{
if (S.at(i) != '-')
{
cout << "No" << endl;
return 0;
}
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<P>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template <... | 0 | 60,094,794 |
#include<ctime>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#define file(x)freopen(x".in","r",stdin);freopen(x".out","w",stdout)
#define rt register int
#define l putchar('\n')
#define ll long long
#define r read()
using namespace std;
inlin... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,a,b) for(int i=(a);i<(b);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
using vint=vector<int>;
using pint=pair<int,int>;
u... | 0 | 79,069,854 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.