code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
int main() {
ios_base::sync_with_stdio(false);... | #include<bits/stdc++.h>
using namespace std;
#define intt long long int
#define intu unsigned long long int
#define vi vector<int>
#define ii pair<int,int>
#define pb push_back
#define ff first
#define ss second
#define fast_io ios::sync_with_stdio(0);cin.tie(NULL);std::cout.tie(NULL);
# define PI 3.141592653... | 1 | 39,680,548 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int c,ans=0;
for(int i=0;i<a;i++){
cin >> c;
if(c>=b)ans++;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, ans=0;
cin >> N >> K;
vector<int> h(N);
for(int i=0; i<N; i++) {
cin >> h.at(i);
if(h.at(i) >= K) ans++;
}
cout << ans << endl;
} | 1 | 35,122,299 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 200005;
string n;
int k;
ll dp[111][4][2];
ll f(int i, int j, int less) {
if(j > k) return 0;
if(i == (int)n.size()) return j == k;
ll &ans = dp[i][j][less];
if(~ans) return ans;
ans = 0;
if(less) {
return ans = f(i + 1, j, less) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; 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 ... | 1 | 61,432,851 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include <iomanip>
using namespace std;
int main(){
int n,k,ans=0;
cin>>n>>k;
vector<int> a(100000000);
n=n-k;
ans++;
for(int i=0;0<n;i++){
n=n-k+1;
ans++;
}
cout<<ans<<endl;
return 0;
} | #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++)
using namespace std;
typedef long lo... | 1 | 50,105,903 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9+7;
void add(int64_t& a, int64_t b){
a = (a+b) % MOD;
}
void mul(int64_t& a, int64_t b){
a = a*b % MOD;
}
vector<int64_t> fact, seq_inv, fact_inv;
void create_fact_mod(int num){
fact[0] = fact[1] = 1;
for(int i=2; i<=num; i++) fact[i] ... | #include <iostream>
#include <vector>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <unordered_map>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll sz;
ll power(ll x, ll y){
ll ret = 1;
x %= MOD;
while(y > 0){
... | 1 | 59,330,411 |
#include<stdio.h>
int main() {
int i = 8;
while (i++ < 89) {
printf("%dx%d=%d\n", i / 9, i % 9 + 1, i / 9 * (i % 9 + 1));
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
for(int i=1;i<10;i++)
for(int j=1;j<10;j++)
printf("%dx%d=%d\n",i,j,i*j);
} | 1 | 64,342,023 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, x;
cin >> N;
x = N%10 + (N%100)/10 + (N%1000)/100 + (N%10000)/1000 + (N%100000)/10000 + (N%1000000)/100000 + (N%10000000)/1000000 + (N%100000000)/10000000 + (N%1000000000)/100000000;
if (N / x * x == N)
cout << "Yes" << endl;
else cout << "No... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | 1 | 1,533,089 |
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n;
ll a[100005];
ll ans;
ll mx, mn;
ll f(ll p)
{
for(ll i = 1; i <= n; i++)
{
p = p / a[i] * a[i];
}
return p;
}
int main()
{
scanf("%lld", &n);
for(ll i = 1; i <= n; i++)
{
scanf("%lld", &a[i... | #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 drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 1 | 14,528,082 |
#include<bits/stdc++.h>
#define lln long long int
#define llu unsigned lln
#define sc(n) scanf("%d",&n);
#define scl(n) scanf("%lld",&n);
#define scd(n) scanf("%lf",&n);
#define pf(res) printf("%d\n",res);
#define pfl(res) printf("%lld\n",res);
#define pfd(res) printf("%lf\n",res);
#define maxii 100005
using namespace ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define repr(i,x,n) for(int i=x; i<(n); i++)
#define ALL(x) (x).begin(),(x).end()
#define INF 1e9
typedef long long ll;
using VI = vector<int>;
using VB = vector<bool>;
using VS = vector<string>;
using graph = vector<vector<int>>;
i... | 1 | 38,496,538 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstddef>
#include<queue>
#include<math.h>
#include<iomanip>
using namespace std;
int main()
{
char s, ans;
string a = "abcdefghijklmnopqrstuvwxyz";
cin >> s;
for(int i = 0; i < 26; ++i){
if(a.at(i) ==... | #include <stdio.h>
int main (){
char a;
scanf("%c", &a);
a++;
printf ("%c", a);
return 0;
} | 1 | 63,970,588 |
#include <bits/stdc++.h>
using namespace std;
#define rep3(i, s, n ,a) for (int i = (s); i < (int)(n); i+=a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
int main(){
int n;
cin >> n;
vector<int> a;
vector<long> sum;
rep(i, n){
int num;
cin >> num;
a.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) for(ll i=(a);i>=(b);... | 1 | 76,873,406 |
#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() {
char c;
cin >> c;
if ('A' <= c && c <= 'Z') cout << 'A' << endl;
else cout << 'a' << endl;
} | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define MAX 1000001
ll prime[MAX];
long long mod;
ll rec(vector<vector<ll> >& dp,vector<ll>& arr,int n,int i,int k,int w)
{
ll ans=0;
if(i>=n)
return 0;
if(dp[i][k]!=-1)
return... | 1 | 62,689,126 |
#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
bool sortbysec(const pair<ll,ll>&a,const pair<ll,ll>&b)
{
return (a.second<b.second);... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
const double pi=acos(-1);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
double a,b,x;
cin>>a>>b>>x;
if(2*x==a*a*b) cout<<fix... | 1 | 67,796,738 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
vector<int> g[100010];
bool used[100010];
int dfs(int now){
used[now]=true;
bool leaf=true;
int w... | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> adj[100010];
int dfs(int x, int pre = 0) {
int cnt = 0;
for (int i = 0; i < adj[x].size(); ++i) {
int y = adj[x][i];
if (y != pre)
cnt += dfs(y, x);
}
return cnt < 2 ? cnt ^ 1 : cnt;
}
int main() {
scanf("%d", &n);
for (int i = 1; i < n; ++i)... | 1 | 73,874,583 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(int argc, const char * argv[]) {
int a,b,c,d;
double e;
cin >> a >> b;
c = a/b;
d =a%b;
e= 1.0*a/b;
printf("%d %d %.8lf\n",c,d,e);
return 0;
} | #include <iostream>
#include<stdio.h>
using namespace std;
int main(void){
int a,b,x,y;
cin>>a>>b;
double z;
x = a/b;
y = a%b;
z = 1.0 * a/b;
cout<<x<<" "<<y<<" ";
printf("%.6lf\n", z);
} | 1 | 65,270,930 |
#include<bits/stdc++.h>
using namespace std;
int main () {
string S;
cin >> S;
int n = (int)S.size();
int dif = 0;
for (int i = 1; i < n; i ++) {
if (S[i - 1] != S[i]) dif ++;
}
cout << dif << endl;
} | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zero-upper")
#pragma GCC target("avx2")
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#d... | 1 | 962,822 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
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) { a = b; return true; } return false; }
using ll=long long;
int main(){
... | #include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <set>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
int main(void){
int a[32] = { 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} ;
int N ;
cin >>... | 1 | 30,703,011 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define io ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define clr(v) v.clear()
vector<ll>v;
pair<ll,ll>p;
map<ll,ll>mp;
set<ll>st;
deque<ll>dq;
priority_queue<ll>pq;
#define f(i,b) for(i=0;i<b;i++)
#define f1(i,b) for(i=1;i<... | #include <iostream>
#include <cstring>
#include <string.h>
using namespace std;
int main()
{
string a,b;
cin>>a>>b;
bool flag=false;
string c=a+a;
if( c.find(b)!=string::npos)
flag=true;
if(flag)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | 1 | 14,840,059 |
#include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define ll long long
const int INF=1e9+7;
int main(){
#ifndef ONLINE_JUDGE
freopen("C:\\Users\\User\\Documents\\input.txt","r",stdin);
#endif
int T,i,j;
int n;
cin>>n;
vector<int> dp(n+1,INF),a(n+1);
for(i=1;i<=n;++i){
scanf("%d",&a[i]);
}
d... | #include<bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define mp make_pair
#define PI acos(-1)
using namespace std;
ll dp[200005],a[200005],n;
ll solve(ll idx)
{
if(idx>=n-1)
return 0;
if(dp[idx]!=-1)
return dp[idx];
ll res=INT_MAX;
if(idx+1<n)
res=min(res,abs(a[id... | 1 | 83,448,493 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int ... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <math.h>
#include <iomanip>
using namespace std;
int main(void){
int N; cin >> N;
int i = 0;
double sum = 0;
while (i < N) {
double tmp1;
string tmp2;
cin >> tmp1 >> tmp2;
if (tmp2 == "JPY") sum += tmp1;
... | 1 | 9,659,892 |
#include <bits/stdc++.h>
#define dcout cout << fixed << setprecision(15)
#define rep(i, a) for(int i = 0; i < a; i++)
#define arep(i, x) for(auto i : x)
#define all(v) v.begin(), v.end()
#define int long long
#define F first
#define S second
#define VE vector<int>
#define pb(x) push_back(x)
using namespace std;
signed ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll oddxor(ll a){
return ((a+1)/2)%2 ;
}
ll funcxor(ll b){
if(b%2) return oddxor(b);
else return oddxor(b+1)^(b+1);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for(int i = 0;i<n;i++){
cin >> a[i];
}
int ans = 0;
for(int i... | 1 | 64,716,553 |
#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... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <fstream>
#include <string>
#include <math.h>
#include <set>
#include <string>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define rep(i, n) for (l... | 1 | 21,733,366 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int N;
char s[4002];
int r[4002],g[4002],b[4002];
long long int ans = 0;
int main(){
scanf("%d",&N);
scanf("%s",&s[1]);
for(int i=N-1;i>0;i--){
r[i] = r[i+1];
g[i] = g[i+1];
b[i] = b[i+1];
if(s[i+1] == 'R')r[i] ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100005;
int r[N],g[N],b[N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin>>n;
string s;
cin>>s;
ll ans = 0;
if(s[0] == 'R')r[0]++;
if(s[0] == 'G')g[0]++;
if(s[0] == 'B')b[0]++;
for(int i=1;i<n;... | 1 | 3,989,872 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<string> S(N);
vector<int> T(N);
for(int i=0; i<N; i++){
cin >> S.at(i) >> T.at(i);
}
string X;
cin >> X;
int P;
for(int i=0; i<N; i++){
if(S.at(i)==X){
P=i;
}
}
int Ans=0;
for(int i=P+1; i<N; i++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
vector<string>s(n);
vector<ll>t(n);
for(ll i=0;i<n;i++){
cin >> s[i] >> t[i];
}
ll ans=0;
string x;
cin >> x;
ll ti;
for(ll i=0;i<n;i++){
if(s[i]==x){
ti=i;
br... | 1 | 7,521,695 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define maxs(a, b) a = max(a, b)
#define mins(a, b) a = min(a, b)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
co... | #include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main() {
string s;
cin >> s;
ll ans = 0;
for (int i = 0; i < s.size() - 1; i++) {
if ((s[i] == 'B' && s[i + 1] == 'W'... | 1 | 10,604,482 |
#include <iostream>
#define MAX 2000000
#define INFTY 2000000000
using namespace std;
int A[MAX+1], h;
void heapIncreaseKey(int i, int key){
if(key < A[i]) cerr << "new key is smaller than current key" << endl;
A[i] = key;
while(i > 1 && A[i/2] < A[i]){
int tmp = A[i/2];
A[i/2] = A[i];
... | #include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
int main(){
priority_queue <int> a;
int tmp1;
char tmp2[10];
while(scanf("%s",tmp2),tmp2[2]!='d'){
if(tmp2[0]=='i'){
scanf("%d",&tmp1);
a.push(tmp1);
}
else{
printf("%d\n",a.top());
a.pop();
}
}... | 1 | 32,528,063 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll=long long;
int main(){
int n;
cin>>n;
n--;
vector<int>c(n),s(n),f(n);
rep(i,n)cin>>c[i]>>s[i]>>f[i];
rep(i,n){
int x=c[i]+s[i];
for(int j=i+1; j<n; ++j){
if(x<s[j])x=s[j]... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <numeric>
#include <sstream>
#include <ioman... | 1 | 62,707,109 |
#include <iostream>
using namespace std;
int main()
{
int N;
cin >> N;
long A[N + 1], B[N];
for (int i = 0; i < N + 1; i++) cin >> A[i];
for (int i = 0; i < N; i++) cin >> B[i];
long res = 0;
for (int i = 0; i < N; i++)
{
if (A[i] >= B[i])
{
res += B[i];
continue;
}
else
... | #include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef hacks
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll... | 1 | 65,382,845 |
#include<bits/stdc++.h>
using namespace std ;
const int N =3e5 + 7 ;
int n , m ;
int occ[N] ;
vector<long long> v , v2 ;
long long solve(int x){
long long ret = 0 ;
int l = 1 , r = n ;
while(l<=r){
long long mid = (l + r) >> 1 ;
long long deli = upper_bou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> C(n + 1, 0), D(n + 1, 0), skD(n + 1), sD(n + 1), f(n + 1);
for (int i = 0; i < n; i++) {
int A;
cin >> A;
C[A]++;
}
for (int i = 0; i <= n; i++) {
D[C[i]]... | 1 | 33,162,314 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
signed main() {
int n;
cin >> n;
vector<int> w(n);
rep(i, n) cin >> w[i];
int ans = 99999;
rep(t, n) {
int a = 0; int b = 0;
for (int j = 0; j <= t; j++) {
a += w[j];
}
for (int k = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
ll now ... | 1 | 49,733,652 |
#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... | #include <iostream>
#include <map>
using namespace std;
int main() {
int n, m;
map<string, int> s;
string x;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (s.find(x) == s.end()) {
s[x] = 0;
}
s[x]++;
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> x;
if (s.find(x) !... | 1 | 1,282,242 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int nxt[20][100000], rev[20][100000];
int main(){
int n;
cin >> n;
vector<int> x(n);
for(int i = 0; i < n; i++) cin >> x[i];
vector<int> y(n);
for(int i = 0; i < n; i++) y[i] = 1e9-x[n-1-i];
int l;
cin >> l;
... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp make_pair
typed... | 1 | 57,149,801 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | 1 | 57,960,624 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 10000... | #include<bits/stdc++.h>
using namespace std;
long long n;
int main()
{
scanf("%lld",&n);
printf("%lld\n",n*(n-1)/2);
return 0;
} | 1 | 99,103,752 |
#include <iostream>
#include <cmath>
#include <cstring>
using namespace std;
int N;
int INF = 1e9 + 1;
int dp[100001];
int a[100001];
int main(void){
cin >> N;
for(int i=0; i<N; ++i) cin >> a[i];
fill(dp, dp+N, INF);
for(int i=0; i<N; ++i){
*lower_bound(dp, dp+N, a[i]) = a[i];
}
cout <<... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<ld> vld;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef priority_queue<ll, vector<ll>, greater... | 1 | 53,189,043 |
#include <bits/stdc++.h>
#define off exit( 0 )
#define cn continue
#define rt return
#define sc scanf
#define pr printf
#define pb push_back
#define pf push_front
#define p_f pop_front
#define p_b pop_back
#define ff first
#define ss second
#define ll long long
#define ld long double
#define N ... | #include<stdio.h>
#include<cmath>
#define MAX_LEN 200000
int main(){
int n, i, d;
long long c;
long long sum = 0, digit_num=0;
int check = scanf("%d", &n);
for(i=0;i<n;i++){
int check = scanf("%d %lld", &d,&c);
sum += d * c;
digit_num += c;
}
long long reduction_num =... | 1 | 56,518,303 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
vector<int> H, W;
int i = 0, n, m;
while(1) {
cin >> n >> m;
H.push_back(n);
W.push_back(m);
if(H[i] == 0 && W[i] == 0) break;
i++;
}
for(i = 0; H.size(); i++) {
if(i != 0) cout <<... | #include<bits/stdc++.h>
using namespace std;
signed main(){
int a,b;
while(scanf("%d%d",&a,&b),a||b){
for(int c=0;c<a;c++){
for(int d=0;d<b;d++){
if(c==0||a-1==c||d==0||b-1==d) printf("#");
else printf(".");
}
printf("\n");
}
printf("\n");
}
} | 1 | 8,709,352 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
float a,b,x;
cin>>a>>b;
x=(a+b)/2;
cout<<round(x);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,x;
cin >> a >> b;
if((a+b)%2<0.5)
x=(a+b)/2;
else
x=(a+b)/2+1;
cout << x <<endl;
} | 1 | 28,591,505 |
#include "bits/stdc++.h"
using namespace std;
void solve()
{
int n, k;
cin >> n >> k;
vector<int> as(n), bs(n);
for (int i = 0; i < n; i++)
{
cin >> as[i] >> bs[i];
}
long ans = 0;
for (int x = 0; x < n; x++)
{
bool f = 1;
for (int i = 30; i >= 0; i--)
... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int N, K;
vector<pii> P;
int main() {
scanf("%d %d", &N, &K);
P.resize(N);
for(int i = 0; i < N; i++) {
scanf("%d %d", &P[i].first, &P[i].second);
}
ll mx = 0;
ll cost = 0;
for(int i = 0; i... | 1 | 9,155,214 |
#include <iostream>
using namespace std;
int main(){
int a, b, c, min, mid, max;
cin >> a >> b >> c;
min = a;
if (min > b){
min = b; mid = a;
} else{
mid = b;
}
if (min > c){
max = mid; mid = min; min = c;
} else{
if(mid < c){
max = c;
} else{
max = mid; mid = c;
}
... | #include <algorithm>
#include <iostream>
using namespace std;
int a[3];
int main (){
for(int i=0;i<3;i++){
cin>>a[i];}
sort(a,a+3);
for(int i=0;i<3;i++){
cout<<a[i];
if(i!=2){cout<<" ";}}
cout<<endl;
return 0;
} | 1 | 25,014,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>;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
ll x;
cin >> x;
ll res = 0;
rep(i, n) {
ll xi;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,i,j;
cin>>n>>x;
int ara[n+1];
ara[0]=x;
for(i=1;i<=n;i++)
cin>>ara[i];
sort(ara,ara+n+1);
int bra[n];
for(i=1;i<=n;i++)
{
bra[i-1]=ara[i]-ara[i-1];
}
sort(bra,bra+n);
for(i=bra[0];i>=1;i--)
... | 1 | 9,604,635 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, beg, end) for (int i = (beg); i < (end); i++)
#define rrep(i, beg, end) for (int i = (beg); i >= (end); i--)
typedef long long ll;
typedef pair<ll, ll> P;
typedef unsigned long long ull;
const int INF = 2e9;
const int mod = 1e9 + 7;
const int N = 1010;
ll gcd... | #include<bits/stdc++.h>
#include<vector>
#include<string>
#include<stack>
#include<iostream>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define MOD 1000000007
#define vec(a) vector<int>a
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("output.txt",... | 1 | 11,169,657 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a , b;
cin >> a >> b;
if(a/2*2 != a && b/2*2 != b) {
cout << "Odd" << endl;
}
else {
cout << "Even" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int a, b;
cin >> a >> b;
int x = a*b % 2;
if (x != 0) {
cout << "Odd" << endl;
}
else cout << "Even" << endl;
} | 1 | 85,292,828 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
ll n, m;
ll a[2005], b[2005];
ll dp[2005][2005], sum[2005][2005];
int main() {
cin.tie(0);
cou... | #include<bits/stdc++.h>
using namespace std;
long long ara[2003][2003],tra[2003][2003],val[2003],tal[2003];
long long mod=1000000007;
int main()
{
long long n,m,i,j,k,x,y,z,p,q,r,a,b=1;
scanf("%lld %lld",&n,&m);
for(i=1;i<=n;i++)
{
scanf("%lld",&a); val[i]=a;
}
for(i=1;i<=m;i++)
{
... | 1 | 48,765,123 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main(){
int n,k;
cin >> n >> k;
ll a[n];
... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) begin(x),end(x)
#define rz(x) resize(x)
#define asn(x,y) assign(x,y)
#define mem(a,b) memset(... | 1 | 47,734,706 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
typedef pair<ll,ll>pll;
const ll MAX=100000;
const ll MOD=1e9+7;
vector<ll>sot,unsot;
ll f[MAX+100];
int main()
{
ll n;
cin>>n;
ll ara[n+3];
for(ll i=0;i<n;i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1);
int main(void)
{
ll n; cin>>n;
vector<ll> v(n);
rep(i,n) cin>>v[i];
sort(v.begin(),v.end());
double tmp=v[0];
fo... | 1 | 13,738,903 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define All(V) v.begin(), v.end()
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1e9+7, INF = 1e9;
int main()
{
ll a, b; cin >> a >> b;
if(a <= b)cout << 0 << endl;
else cout << a-b << endl;
system("... | #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... | 1 | 74,477,904 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n,l,t,cnt,ans[100010];
int main()
{
scanf("%d%d%d",&n,&l,&t);
for(int x,y,i=1;i<=n;i++)
{
scanf("%d%d",&x,&y);
ans[i]=x+t*(y==1?1:-1);
cnt+=ans[i]>0?ans[i]/l:(ans[i]-l+1)/l;
ans[i]=(ans[i]%l+l)%l;
}
sort(ans+1,ans+n+1);
cnt=(... | #include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int N,L,T,d,A[maxn];
int pre(int x) {return x == 1 ? N : x - 1;}
int nex(int x) {return x == N ? 1 : x + 1;}
int main(){
#ifdef DMC
freopen("DMC.txt","r",stdin);
#endif
cin >> N >> L >> T;
for (int i = 1; i <= N; i++){
... | 1 | 9,408,711 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | #include<cstdio>
#include<string>
#include<cstring>
#include<utility>
#include<cmath>
#include<map>
#include<queue>
#include<set>
#include<algorithm>
#include<vector>
#include<iostream>
#define ll long long
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define inf 0x7fffffff
using na... | 1 | 22,517,589 |
#include<stdio.h>
#include<string.h>
int main()
{
int i,t,j,s=0;
char S[210],T[210];
char d;
scanf("%s",S);
scanf("%s",T);
t=strlen(S);
for(i=0;i<t;i++)
{
if(strcmp(S,T)==0)
{
s=1;
break;
}
d=S[t-1];
for(j=t-2;j>=0;j--)
{
S[j+1]=S[j];
}
S[0]=d;
}
if(s==0)
printf("No");
else
print... | #include <iostream>
#include <string>
std::string StringRotation(std::string s);
int main() {
std::string S, T;
std::cin >> S >> T;
bool flag{false};
for (int i = 0; i < S.length(); i++) {
S = StringRotation(S);
if (S == T) {
flag = true;
break;
}
}
if (flag)
std::cout << "Yes" <... | 1 | 98,337,713 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<list>
#define N 10002
using namespace std;
vector<int> G[N+1];
list<int> ans;
bool visited[N+1];
int indeg[N+1];
int n;
void dfs(int node){
visited[node]=true;
for(int i=0;i<G[node].size();i++){
int v=G[node][i];
if(... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define reps(i, s, n) for(int i=(s); i<=(n); ++i)
#define outl(x) cout<< (x) << '\n'
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef const int let;
int V, E;
vector <int> G... | 1 | 97,723,805 |
# include <bits/stdc++.h>
# define sz(x) (int)((x).size())
# define F first
# define S second
# define pb push_back
# define ub upper_bound
# define lb lower_bound
# define all(x) x.begin(), x.end()
# define pqueue priority_queue
# define mset multiset
# define umap unordered_map
# define Speed() ios_base::sync_with_st... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long N,M;cin>>N>>M;
long long A[N],B[N];
vector<pair<long long,long long>>C(N);
for(int i=0;i<N;i++){
cin>>A[i]>>B[i];
C[i].first=A[i];
C[i].second=B[i];
}
sort(C.begin(),C.end());
long long ans=0;
... | 1 | 1,604,239 |
#include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define f... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int a,b,c,d;
cin >> a >> b >> c >> d;
if(b<c || d<a){
cout << 0 << endl;
}
else if(b>=d && c>=a) cout << d-c << endl;
else if(d>b && a>c) cout << b-a << endl;
else if(b-c>=d-a) cout << d-a << endl;
else if(d-a>b-c) cou... | 1 | 76,764,584 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main(void)
{
string devide[4] = {"dream", "dreamer", "erase", "eraser"};
string S;
bool flag1,flag2;
cin >> S;
reverse(S.begin(),S.end());
rep(i, 4)
reverse(devide[i].b... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
string s; cin>>s;
bool flg=true;
while(flg){
flg=false;
int dream = s.rfind("dream");
int dreamer = s.rfind("dreamer");
int erase = s.rfind("erase");
... | 1 | 97,068,348 |
#include<iostream>
using namespace std;
int main(void){
int info;
cin >> info;
int b = 0,f = 0,r = 0,v = 0;
int room[4][3][10]={{{}}};
for (int i = 1; i <= info; i++){
cin >> b >> f >> r >> v;
room[b-1][f-1][r-1] += v;
}
for (int x = 0; x <= 3; x++){
for (int y = 0; y... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int b;
int f[4][3][10] = {};
cin >> b;
for (int i = 0; i < b; i++)
{
int a, c, d, e;
cin >> a >> c >> d >> e;
f[a-1][c-1][d-1] += e;
}
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 3; j++)
{
for (int k = 0; k < 10; k++)
... | 1 | 68,580,034 |
#include <bits/stdc++.h>
#define vsort(v) sort(v.begin(), v.end())
#define rvsort(v) sort(v.begin(), v.end(), greater<ll>())
#define ll long long
#define ld long double
#define fixset(val) cout << fixed << setprecision(10) << val << endl;
#define rep(i, s, g) for (ll i = (s); i < (g); i++)
#define mod 1000000007
#defin... | #include <bits/stdc++.h>
#define f(i,n) for(int i=0;i<(n);i++)
#define inf (int)(3e18)
#define int long long
#define mod (int)(1000000007)
#define intt long long
#define P pair<int,int>
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
using namespace std;
int modpow(int x, int y, int m = mod... | 1 | 86,453,565 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using st = string;
using P = pair<int, int>;
#define mrep(i, m, n) for(int i = m; i < n; i++)
#define rep(i, n) mrep(i, 0, n)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
const int mod = 1e9 + 7;
int main() {
int n;
cin >... | #include <cstdio>
#include <iostream>
#include <cmath>
#include <limits>
#include <iomanip>
#include <cstring>
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int s;
long long r[2001];
long long mod = 1000000007;
cin >> s;
fill_n(r, 2001, 1);
r[0] = 0... | 1 | 32,477,044 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
map<int,int> mp;
int ans=0;
for(int i=0;i<n;i++){
cin >> a[i];
mp[a[i]]++;
mp[a[i]-1]++;
mp[a[i]+1]++;
ans=max(ans,max(mp[a[i]],max(mp[a[i]-1],mp[a[i]+1])));
}
cout... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
int r=100001;
int n; cin>>n;
vector<int> v(r);
rep(i,n){
int a; cin>>a; v[a]++;
}
int mx=0;
for(int i=1; i<r-1; i++){
int sum=v[i-1]+v[i]+v[i+1];
mx=max(mx,sum);
}
cout<<mx<<endl;
} | 1 | 89,190,113 |
#include <array>
#include <iostream>
#include <vector>
int main() {
int n;
std::string s;
std::cin >> n >> s;
std::vector<std::array<int, 3>> sum(n + 1);
for (int i = n - 1; i >= 0; --i) {
int c;
if (s[i] == 'R')
c = 0;
else if (s[i] == 'G')
c = 1;
else if (s[i] == 'B')
c = 2... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) (cerr << #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); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF ... | 1 | 8,492,180 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inlin... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w; cin >>h >>w;
vector<string> s(h);
for (int i = 0; i < h; i++) cin >>s[i];
string ret = "Yes";
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (s[i][j] == '#') {
if (i>0 && s[i-1]... | 1 | 28,655,995 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #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... | 1 | 12,068,307 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 1 | 78,651,340 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
string dog;
string pig;
getline(cin, dog);
getline(cin, pig);
string cat = pig.substr(0, pig.size() - 1);
if (dog == cat)
cout << "Yes";
else
cout << "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string st1,st2;
cin>>st1>>st2;
int s1=st1.size();
int s2=st2.size();
int c=0;
for(int i=0;i<s2;i++){
if(st1[i]==st2[i]){
c++;
}
else if(st1[i]!=st2[i] && c==s1){
cout<<"Yes"<<endl;
}
else{
cout<<"No... | 1 | 22,656,691 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in, n) for(int i=0; i<n; i++) cin>>in[i]
#define forout(out, n) for(int i=0; i<n; i++) cout<<out[i]<<endl
int main(){
int X, A; cin>>X>>A;
if(X<A){
cout<<"0"<<endl;
}else{
cout<<"10"<<endl;
}
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 1 | 72,411,966 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
vector<pair<T, T>> prime_factor(T n) {
vector<pair<T, T>> ret;
for (T i = 2; i * i <= n; i++) {
T tmp = 0;
while (n % i == 0) {
tmp++;
n /= i;
}
ret.push_back(make_pair(i, tmp));
}
... | #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>;
vector<pair<ll, ll> > prime_factorize(ll N) {
vector<pair<ll, ll> > res;
for (ll a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
ll ex = 0;
whil... | 1 | 57,943,301 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <iomanip>
#include <cmath>
#include <map>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1LL << 60;
int main() {
cin.tie(0); ios_base::sync_with_stdio(false);
ll M; cin >> M;
vector<ll> ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-... | 1 | 35,456,761 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
double pi=acos(-1);
int main(){
double a,b,x;
cin>>a>>b>>x;
x/=a;
if(a*b>=2*x){
double y=2*x/b;
... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int64_t a, b, x;
double theta1, theta2;
double deg;
cin >>a >>b >>x;
theta1 = atan(2.0*b/a - 2.0*x/a/a/a);
if(b-a*tan(theta1)>=0) deg=theta1*180.0/M_PI;
else{
theta2=atan(a*b*b/2.0/x);
deg=theta2*180.0/M_PI;
}
printf("%2.15f", deg);... | 1 | 95,629,264 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
string str;
char ch = 'a';
int charaarray[26] = {};
while(getline(cin,str)){
for ( int i = 0 ; str[i] != '\0' ; i++){
if ( (str[i] >= 'a') && (str[i] <= 'z')){
charaarray[str[i] - 'a']++;
}else if ( (str[i] >= 'A'... | #include<cstdio>
int main() {
char ch;
int cnt[26] = {};
while (scanf("%c", &ch) != EOF) {
if (ch > 'Z') ch -= ('a' - 'A');
cnt[ch - 'A']++;
}
for (int i = 0; i < 26; i++) printf("%c : %d\n", 'a' + i, cnt[i]);
return 0;
} | 1 | 50,001,562 |
#include <bits/stdc++.h>
#define debug(var) \
do { \
std::cout << #var << " : "; \
view(var); \
} while (0)
template <typename T>
void view(T e) { std::cout << e << std::endl; }
template <typename T>
void view(const std::vector<T>& v) ... | #include<bits/stdc++.h>
using namespace std;
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int>pi;
typedef pair<long long, long long>pl;
#define F first
#define S second
#define pb push_back
#define ... | 1 | 78,306,255 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<mem... | #include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
int main(){
vector<string> results;
int N = 0;
cin >> N;
for(int i = 0; i < N; i++){
array<int, 3> triangle_vertex;
for(int j = 0; j < 3; j++){
cin >> triangle_vertex[j];
}
... | 1 | 90,148,664 |
#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;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, f, n) for (int i = (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 1000000007;
const ll MOD2 ... | 1 | 1,398,216 |
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <cassert>
#pragma war... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000
template <typename T>
bool chmax(T &a, const T& b) {
if ... | 1 | 81,486,202 |
#include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
bool f = false;
for(int i = 0; i <= n/7; i++){
for(int j = 0; j <= n/4; j++){
if(7*i + 4*j == n) f = true;
}
}
if(f) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 87,016,745 |
#include <iostream>
#include <algorithm>
#include <string>
#define ll long long
using namespace std;
int main(){
ll n;
cin>>n;
ll total=0;
ll price[1001];
ll p;
cin>>p;
for (ll i = 0; i <n ; ++i) {
cin>>price[i];
}
sort(price,price+n);
for (int j = 0; j <p ; ++j) {
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<int,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n, k... | 1 | 56,213,998 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,b,a) for(int i=b;i>=a;i--)
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Forenska(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define ... | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <iomanip>
#include <cassert>
#include <random>
#include <tuple>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
ty... | 1 | 40,242,143 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char A,B;
cin>>A>>B;
if(A==B)
cout<<'='<<endl;
else if(A<B)
cout<<'<'<<endl;
else
cout<<'>'<<endl;
} | #include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define e "\n"
#define MaRiaMa { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); }
#define fix(n) cout << fixed << setprecision(n);
using namespace std;
int main()
{
MaRiaMa;
char a,b;
cin >> a >> b;
if (a < b)
cout << "<";
else if (a > b)
... | 1 | 95,242,935 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int N;
cin >> N;
int a[110];
for (int i = 0; i < N; i++) cin >> a[i];
int ans = 0;
for (int i = 0; i < N; i++) {
int num = 0;
for (int j = 0; j < N; j++) {
num = abs(a[i] - a[j]);
... | #include <bits/stdc++.h>
using ll = long long int;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
ll n = 0;
std::cin >> n;
ll val = 0;
std::cin >> val; n--;
ll min = val;
ll max = val;
while (n--) {
std::cin >> val;
min = std::m... | 1 | 73,788,308 |
#include <bits/stdc++.h>
#include <iomanip>
#include <algorithm>
#define ll long long
#include <unordered_map>
using namespace std;
int main() {
ll N, M;
cin >> N >> M;
cout << (M * 1900 + (N - M) * 100) * pow(2, M) << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
using ll = long long;
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define all(x) (x).begin(),(x).end()
#define REP(i,n) for... | 1 | 24,719,322 |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
int x,y;
cin>>x>>y;
if(y>=x*2 && y<=x*4)
{
y-=x*2;
if(y%2==0)
{
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int x,y,flag=0;
cin >> x >> y;
rep(i,x+1){
if(i*2+(x-i)*4==y) flag = 1;
}
if(flag) cout << "Yes" << endl;
else cout << "No" << endl;
} | 1 | 16,320,516 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx,avx2,fma")
#pragma GCC optimize ("03")
#define ll long long
#define pb push_back
#define nl '\n'
#define popb pop_back()
#define sz size()
#define inf 10... | 1 | 73,771,476 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
string O,E;
cin>... | #include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
string O, E;
cin >> O >> E;
int j=0;
int k=0;
for(int i=0; i<O.size()+E.size(); i++){
if((i+1)%2==0){
cout << E[j];
j++;
}else{
cout << O[k];
k... | 1 | 22,390,288 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
int H, W;
char c[110][110];
char c2[210][110];
cin >> H >> W;
for(int i = 1; i <= H; i++){
for (int j = 1; j <= W; j++){
cin >> c[i][j];
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
u... | 1 | 68,981,783 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> p;
#define rep(i, ... | 1 | 26,462,665 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long N,H,W;
cin>>N>>H>>W;
vector<long> a(N);
vector<long> b(N);
for(int i=0;i<N;i++) cin>>a[i]>>b[i];
long ans=0;
for(int i=0;i<N;i++){
if(a[i]>=H&&b[i]>=W) ans++;
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(void){
long long N,H,W;
cin>>N>>H>>W;
vector<long long> A(N),B(N);
for(int i=0;i<N;i++){
cin>>A[i]>>B[i];
}
long long ans=0;
for(int i=0;i<N;i++){
if(A[i]>=H&&B[i]>=W) ans++;
}
cout<<ans<<endl;
return 0;
} | 1 | 71,931,299 |
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
typedef long long ll;
const int INF = 1e9+1;
const int MOD = 2e9 + 9;
const ll LINF = 1e18;
using namespace std;
int main(){
int n;
int sum=0;
cin >> n;
vector<int> a(n+2);
a.at(0) = 0;
for (int i = 1... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n,ans=0;
int a[100005];
signed main()
{
cin>>n;
n+=2;
for (int i=2;i<=n-1;i++) cin>>a[i];
for (int i=1;i<=n-1;i++) ans+=abs(a[i+1]-a[i]);
for (int i=2;i<=n-1;i++) cout<<ans-abs(a[i]-a[i-1])-abs(a[i+1]-a[i])+abs(a[i+1]-a[i-1])<<endl;
return... | 1 | 79,240,490 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
template... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)
const int INF = 1e9;
int dp[100010];
int main(){
int n;
cin >> n;
rep(i,n+1) dp[i] = INF;
dp[... | 1 | 70,248,326 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s,t;
cin>>s>>t;
long long int cnt=0;
for(unsigned int i=0;i<s.size();i++){
if(s.at(i)!=t.at(i))
cnt++;
}
cout<<cnt;
} | #include <iostream>
#include <string>
int main() {
std::string S, T; std::cin >> S >> T;
int ans = 0;
for (int i = 0; i < S.size(); ++i)
if (S[i] != T[i])
ans++;
std::cout << ans << "\n";
return 0;
} | 1 | 7,220,208 |
#include<stdio.h>
int main (){
int i,j,a,b;
scanf("%d%d",&i,&j);
if(i>j){
printf("a > b\n");
}
else if(i<j){
printf("a < b\n");
}
else{
printf("a == b\n");
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int a;
int b;
cin >> a >> b;
string symbol;
if (a < b) {
symbol = " < ";
} else if (a > b) {
symbol = " > ";
} else {
symbol = " == ";
}
cout << 'a' << symbol << 'b' << endl;
} | 1 | 52,565,411 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) sort(ALL(c));for(bool c##p=1;c##p;c##p=next_permutation(ALL(c)))
#define ALL(obj) (obj).begin(), (obj).end()
#define pb push_back
... | #include <iostream>
#include <string>
#include <cctype>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <bitset>
#include <vector>
#define REP(i, n) for(int i = 0; i < (n); ++i)
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
int main(){
int n, cnt=0; cin >... | 1 | 44,868,672 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
double res = 0;
rep(i,n) {
double m;
string s;
cin >> m >> s;
if (s == "JPY") res += m;
if (s == "BTC") res += m * 380000;
}
cout << fixed << setprecision(10);
cout <... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin>>N;
vector<double> x(N);
vector<string> u(N);
for(int i=0;i<N;i++){
cin>>x[i]>>u[i];
}
double ans=0.0;
for(int i=0;i<N;i++){
if(u[i]=="JPY") ans+=x[i];
if(u[i]=="BTC") ans+=x[i]*380000.0;
... | 1 | 100,843,268 |
#include<iostream>
using namespace std;
int main(){
int H,N;
cin >> H >> N;
int A[N+1], B[N+1];
int i,j;
for(i=1; i<=N; i++){
cin >> A[i] >> B[i];
}
int dp[N+1][H+1];
for(i=0; i<=N; i++){
dp[i][0] = 0;
}
for(j=1; j<=H; j++){
dp[1][j] = (j/A[1] + (j%A[1]>0)... | #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... | 1 | 80,464,554 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 2e5 + 7;
char s[N];
int t[N];
int main() {
int n;
scanf("%d", &n);
scanf("%s", s);
for (int i = 0; i < 2 * n; i++) {
t[i] = s[i] == 'B' ? 1 : 0;
if (i % 2 == 0) t[i] ^= 1;
}
int cnt = 0;
for (int i = 0; i < 2 * n; i++)
cnt... | #include <bits/stdc++.h>
using namespace std;
const long long mod=1000000007;
int main(int argc, char const *argv[])
{
int n;
string s;
cin>>n>>s;
if (s.at(0)=='W')
{
cout<<"0\n";
return 0;
}
string memo="A";
for (int i = 1; i < 2*n; ++i)
{
if (s.at(i-1)==s.at(i))
{
if (memo.at(i-1)=='A')
{
m... | 1 | 2,956,894 |
#include<set>
#include<map>
#include<stack>
#include<cmath>
#include<queue>
#include<cstdio>
#include<cstring>
#include<climits>
#include<cstdlib>
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
#define LL long long
#define ULL unsigned long long
LL read(){
LL f=1,x=0;char c=getchar();
wh... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x,y;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin>>x>>y;
if(abs(x-y)<=1)
cout<<"Brown"<<endl;
else
cout<<"Alice"<<endl;
return 0;
} | 1 | 4,517,348 |
#include<bits/stdc++.h>
#define ll long long
#define P pair<int,int>
#define PP pair<P,int>
using namespace std;
int inf = 1ll<<30;
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
int main(){
int h,w;
cin >> h >> w;
char g[1005][1005];
queue<PP>que;
for(int i=0;i<h;i++)for(int j=0;j<w;j++) {
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll MOD=1e9+7;
int dy[]={1,0,-1,0}... | 1 | 57,243,733 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
int main(){
string s,t,u; cin>>s>>t>>u;
s[0]=char(s[0]-32);
cout<<s[0];
t[0]=cha... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(2);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";new... | 1 | 76,342,149 |
#include <bits/stdc++.h>
using namespace std;
char dat[100005];
bool zz[100005];
int main()
{
int n;
scanf("%d%s",&n,&dat);
for(int i=0;i<2;i++)
{
for(int j=0;j<2;j++)
{
zz[0]=i;
zz[1]=j;
for(int k=1;k<n-1;k++)
{
zz[k+1]=zz[k-1]^zz[k]^(dat[k]=='x');
}
if((dat[n-1]=='x')==(zz[n-2]^zz[n-1]^z... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2... | 1 | 95,976,806 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;
int n;
string ans, newans;
int main() {
cin.tie(0), ios::sync_with_stdio(0);
cin >> n;
cout << "0\n";
cout.flush();
cin >> ans;
if(ans == "Vacant"... | 1 | 60,597,147 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>;
const int inf=1e9+7;
const ll INF=1LL<<61;
const ll mo... | #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=9982443... | 1 | 37,078,102 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#def... | #include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#def... | 1 | 63,263,102 |
#include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <stdio.h>
int main(void){
int h1,m1,h2,m2,t,k;
std::cin >>h1>>m1>>h2>>m2>>k;
t=(h2-h1)*60+(m2-m1);
if(t==k){
std::cout << "0";
}else{
std::cout << t-k;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int h1, h2, m1, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int min = (60 - m1) + (h2 - h1 - 1) * 60 + m2;
cout << min - k << endl;
} | 1 | 81,024,826 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.