code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
# include <stdio.h>
int main() {
int T, X;
scanf("%d%d", &T, &X);
printf("%.4f", (double) T / X);
return 0;
} | #include<iostream>
using namespace std;
int main(){
int n,m;
int counter=0;
int sum = 0;
while(1) {
cin >> n >> m;
if (n == 0 && m ==0) break;
for (int i = 1; i <= n -2; i++) {
for (int j = i+1; j <= n -1;j++) {
for (int k = j+1; k <= n; k++) {
sum = i + j + k;
... | 0 | 4,131,877 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll n,m,k;
cin >> n >> m >> k;
bool ok=false;
for(int i=0;i<=n;++i){
for(int j=0;j<=m;++j){
if((i*(m-j)+j*(n-i))==k) ok=true;
}
}
if(ok){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int main(){
ll n;
cin >> n;
vector<ll>on(60),off(60);
for(int i=0; i<n; i++){
ll a;
cin >> a;
for(int j=0; j<60; j++){
if(a >> j & 1) on[j]++;
else off[j]++;
}
}
ll ans=0;
for(int i=0... | 0 | 63,226,691 |
#include<bits/stdc++.h>
#define N 300005
#define M 1000000007
#define ll long long
using namespace std;
ll n,m,t,x,y,fac[N]= {1};
ll arr[N];
map<ll,ll> mp;
vector<int> v[N];
ll qpow(ll a,ll b)
{
ll ans=1;
ll k=a;
while(b)
{
if(b&1)ans=a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(l... | 0 | 59,874,524 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n,ans=0,a,b;
int main()
{
cin>>n;
cin>>a;
for(int i=1;i<=n-1;i++)
{
cin>>b;
if(b<a) ans+=a-b;
else a=b;
}
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define LOG(...) fprintf(stderr,__VA_ARGS__)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define S... | 0 | 17,534,041 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int N;
string X;
int i;
cin >> N;
vector<int> t(N);
vector<string> s(N);
for(i = 0; i < N; i++) {
cin >> s[i] >> t[i];
}
cin >> X;
for(i = 0; i < N; i++) {
if(s[i] == X) {... | #include<bits/stdc++.h>
#include<math.h>
#include<set>
#include<string>
using namespace std;
#define jaldichal ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define mk make_pair
#define R return
#define line "\n"
#de... | 0 | 65,126,433 |
#include <iostream>
#include <stdio.h>
using namespace std;
static const int Nmax = 36;
typedef struct Card{
char suit;
char value;
} playcard;
void swap(playcard* a, playcard* b)
{
playcard p = *a;
*a = *b;
*b = p;
return ;
}
void printcards(playcard* array,int length)
{
for(int i = 0; i < length-1; i++)... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <math.h>
#include <string>
#include <numeric>
#include <queue>
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define rep1(i,n) for(ll i=1;i<n;++i)
#define mrep(i,n) for(ll i=n;i>=0;--i)
#defi... | 0 | 73,029,793 |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll dis(ll x1, ll y1, ll x2, ll y2){
return abs(x1 - x2) + abs(y1 - y2);
}
int main()
{
ll n, m;
cin >> n >> m;
vector<ll> a(n), b(n), c(m), d(m);
rep(i, n){
cin >> a[i] >> b... | 0 | 24,647,927 |
#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
int main() {
string s;
string sa[] = {
"dream", "dreamer", "erase", "eraser"
};
cin >> s;
reverse(s.begin(), s.end());
for (int i = 0; i < 4; i++) {
reverse(sa[i].begin(), sa[i].end());
}
b... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,res=0;
scanf("%d",&n);
while(1)
{
res=n%10;
if(res-7==0){
cout << "Yes" << "\n";
break;
}
n=n/10;
res=n%10;
if(res-7==0){
cout << "Yes" << "\n";
break;
}
n=n/10;
res=n%10;... | 0 | 34,328,291 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const int M = 1e7;
int si[] = {-1, 0, 1, 0};
int sj[] = {0, -1, 0, 1};
int main(){
int r,g,b,n;
cin >> r >> g >> b >> n;
int ans = 0;
for (int x = 0; x <= 3000; x++){
for(int y = 0; y <= ... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v)... | 0 | 23,739,850 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int inf = 100100;
int main() {
ll n;
cin >> n;
map<string,ll> m;
for(ll i=0;i<n;i++){
string s;
cin >> s;
sort(s.begin(),s.end());
m[s]++;
}
ll cnt=0;
for(auto x : m){
auto value = x.second;
if(value != 0){
cnt ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
int64_t mod = 998244353 ;
vector<int> getprime(int n){
vector<int> p(0) ;
vector<bool> table(n+1,0) ;
for (int i = 2; i <= n; i++)
{
... | 0 | 54,710,927 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define _GLIBCXX_DEBUG
signed main() {
int N; cin >> N;
int fb=0, ea=0, n=0;
string s;
int ans = 0;
rep(i, 0, N) {
cin >> s;
if(s[0] == 'B') {
... | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
# include <unordered_map>
# include <numeric>
# include... | 0 | 61,812,157 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=(a);i... | #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 mod=1000000007;
const int INF=1001001001;... | 0 | 56,394,658 |
#include <iostream>
using namespace std;
int main() {
int a, b, c, count = 0;
cin >> a >> b >> c;
for (int i = a; i <= b; ++i) {
count += !(c % i);
}
cout << count << endl;
return 0;
} | #pragma GCC optimize(2)
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <unordered_map>
#include <iomanip>
#include <set>
using namespace st... | 0 | 99,707,750 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<pair<long long, long long>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
a[i].first += a[i].second;
}
sort(a.rbegin(), a.rend());
long long ans = 0;
for (int i = 0; i... | #include <iostream>
using namespace std;
int check(void);
#define INIT 0
#define NO 1
int main() {
int W =INIT;
int H =INIT;
int x =INIT;
int y =INIT;
int r =INIT;
int flag =INIT;
cin >> W;
cin >> H;
cin >> x;
cin >> y;
cin >> r;
i... | 0 | 21,253,727 |
#include <bits/stdc++.h>
#include <stdio.h>
typedef long long int LL;
#define fr(i,p,n) for(LL i=p;i<n;i++)
#define fr1(i,p,n) for(LL i=p;i>=n;i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define PI 3.14159265358979323846
#define MOD 1000000007
#defi... | #include <bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define TAM 100100
ll A[TAM];
vi G[TAM];
bool ok ( int i, int pi = -1 ) {
if ( G[i].size() == 1 )
return true;
ll sum = 0, maxAj = 0;
for ( int j : G[i] )
if ( j != pi ) {
if ( !ok(j, i) ... | 0 | 52,368,719 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
class DisjointSet {
public:
int size;
vector<int> rank;
vector<int> parent;
DisjointSet() {}
DisjointSet(int size) {
this->size = size;
rank.resize(size, 0);
parent.resize(size, 0);
for (int i=0; i<size; i++) {
makeSet(i);
}
}
void ... | 0 | 15,766,375 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <bitset>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <list>
#define MOD 1000000007
#define COUNTOF(array) (sizeof(array)/sizeof(array[0]))
using namespace std;
void solve(... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
const int N=200010;
int n;
int a[N],v[N],g[N];
inline int gi() {
int x=0,o=1;
char ch=getchar();
while(ch<'0'||ch>'9') ch=='-'?o=-1:0,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch... | 0 | 17,181,042 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
usi... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int mxn = 1005;
int dp[mxn][mxn];
char grid[mxn][mxn];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
cin >> grid[i][j];
dp[1][1] = 1;
for (int i = 1; i <... | 0 | 53,092,489 |
#include <iostream>
typedef long long ll;
using namespace std;
ll gcd(ll a, ll b) {
if (a % b == 0) return b;
else if (b % a == 0) return a;
else return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
if (a % b == 0) return a;
else if (b % a == 0) return b;
else return a / gcd(a, b) * b;
}
int main(void) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n, i, j, sum, x;
vector <ll> v;
cin >> n;
ll N[n];
for(i=0;i<n;i++)
{
cin >> N[i];
}
sort(N,N+n);
for(i=N[0];i<=N[n-1];i++)
{
sum = 0;
for(j=0;j<n;j++)
{
... | 0 | 16,889,232 |
#include <cstdio>
#include <algorithm>
using namespace std;
struct E{ int a, b, c; };
int main(){
int n;
E edge[45];
int fr, to, co;
int d[10][10];
int town;
const int INF = 100000000;
bool update;
int res_town, res_cost, sub;
while(true){
scanf("%d", &n);
if(n == 0) return 0;
for(int i = 0; i < 10; i++)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
string s;
cin >> n >> s;
int ans = 0;
rep(i, 1000) {
string t;
int x = i;
rep(j, 3) {
t.push_back('0' + x % 10);
x /= 1... | 0 | 3,426,919 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int f(int n) {
if (n % 2 == 0) return n / 2;
else return 3 * n + 1;
}
int main() {
int s;
cin >> s;
int n = 1000000;
vector<int> a(n);
for (int i = 1; i <= n; i++) {
if (i == 1) a[i] = s;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll=vector<ll>;
using vvll=vector<vll>;
using vi=vector<int>;
using vvi=vector<vector<int>>;
using vb=vector<bool>;
using pii=pair<int,int>;
using vpii=vector<pair<int,int>>;
using plli=pair<ll,int>;
using vplli=vector<pair<ll,int>>;
using pllll=... | 0 | 89,066,333 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int n;
... | #include <stdio.h>
int n;
int main() {
while(true) {
scanf("%d",&n);
if(n<=0) break;
int ans = 0;
bool up = true;
int l=0,r=0;
for(int i = 0; i < n; i++) {
char act[4];
scanf("%s",&act);
bool isl = act[0]=='l';
bool isu ... | 0 | 56,332,440 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
const int MAX_N = 15;
const int MAX_W = 110000;
int dp[MAX_N][MAX_W];
int main(){
i... | #include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd... | 0 | 22,130,626 |
#include <iostream>
#include <vector>
using namespace std;
void fnOutput(const vector<int> &argviSort, int argiSortCnt)
{
for (int i = 0; i < argviSort.size(); i++)
{
if (i) cout << " ";
cout << argviSort[i];
}
cout << endl;
cout << argiSortCnt << endl;
}
void fnSelectionSort(vector<int> &argviSort, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
string s, t; cin >> s >> t;
string ans = "";
for(int i = s.size... | 0 | 69,847,103 |
#include <bits/stdc++.h>
#define ft first
#define sd second
#define sz(x) ((int)x.size())
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef double de;
int main() {
int x, y;
cin >> x >> y;
cout << ((x % y)? x: -1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
ll dp[100001][2] = {};
int main(){
int n, i, j;
string l;
cin >> l;
n = l.length();
dp[i][0] = 1;
for(i=0; i<n; i++){
if(l[i] == '0'){
dp[i+1][0] = dp[i][0];
... | 0 | 19,908,144 |
#include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main()
{
int n, k;
cin >> n >> k;
double ans = 0;
repl(i, 1, n + 1) {
double p = 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
const int N = 1e5 + 5;
int n, m;
vector <int> adj[N];
int col[N];
ll cnt[3];
bool val;
void dfs(int v) {
for (auto u : adj[v]) {
if(!col[u]) {
col[u] = 3 - col[v];
dfs(u);
}
else if(col[u] == col[v])
val = 0... | 0 | 3,741,634 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int32_t, int32_t>;
bool IsOkay(const string &s) {
const int32_t length = static_cast<int32_t>(s.length());
if (length % 2 != 0) {
return false;
}
const int32_t half = length / 2;
return (s.substr(0, half) == s.substr(half,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x = N;
int total = 0;
while (x) {
total += x % 10;
x /= 10;
}
if (N % total == 0) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
} | 0 | 23,810,806 |
#include <iostream>
#include <string>
using namespace std;
int n, m, solve[1010][1010];
string s1, s2;
int l1, l2, tmp;
int dp(int n, int m) {
if (solve[n][m] >= 0) return solve[n][m];
else if (n == 0 || m == 0) solve[n][m] = max(n, m);
else {
tmp = min(dp(n - 1, m), dp(n, m - 1)) + 1;
if (s... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<iomanip>
#define pi 3.14159265358979323846
#define int long long
#define elif else if
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
signed main(){
string s;
cin >> s;
int n = s.si... | 0 | 78,385,665 |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | #include<bits/stdc++.h>
#define god dimasi5eks
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mod 1000000007
#define dancila 3.14159265359
#define eps 1e-9
using namespace std;
typedef long long ll;
int n, v[200002];
deque<pair<int, int> >d;
bool chk(int... | 0 | 54,225,170 |
#include<iostream>
#include<cstdio>
#define N 101
using namespace std;
typedef struct{
int q[10000];
int head;
int tail;
}Queue;
Queue que;
int g[N][N];
int n;
int d[N];
bool us[N];
void Enque(int data){
que.q[que.tail]=data;
que.tail++;
}
int Deque(void){
int data;
data=que.q[que.head];
que.head++;
... | #include<stdio.h>
#include<cstdlib>
int H;
int parent(int i){
if(i == 1) return 0;
return i / 2;
}
int left(int i){
if(i * 2 > H) return 0;
return i * 2;
}
int right(int i){
if(i * 2 + 1 > H) return 0;
return i * 2 + 1;
}
void PrintAllElement(int *A){
int i;
for(i = 1; i < H + 1; i++){
printf("node... | 0 | 66,077,628 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
typedef std::vector<ll> vi;
typedef std::vector<std::vector<ll> > vv;
#define MOD 1000000007
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define fo(i,a,b) for(i=a;i<b;i++)
#define mp make_pair
#define pb(x) push_back(x)
#define... | #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... | 0 | 9,472,005 |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0) {
break;
}
vector<long long int> hyou(n+1, 0);
long long int a;
long long int MAX = 0;
int maxn = 0;
for (int i = 0; i < n; i++) {
cin >> a;
hyou[i+1] = hyou[i] + a;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll n;
string s;
char t[10][100005];
int main(void){
cin>>n>>s;
t[0][0]='S';
t[1][0]='S';
t[2][0]='W';
t[3][0]='W';
if(s[0]=='o'){
t[0][1]='S';
t[0][n-1]='S';
t[1][1]='W';
t[... | 0 | 18,853,394 |
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
using namespace std;
int parse(string s) {
int ret = 0;
int multiplier = 1;
for (int i = 0; i < (int)s.size(); i++) {
if('2' <= s[i] && s[i] <= '9') {
multiplier = s[i] - '0';
}
else {
ret += multiplier
* (s[i] == 'm' ? 1000
... | #include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <bitset>
#include <stack>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(... | 0 | 2,249,880 |
#include <bits/stdc++.h>
#define N 5005
#define rep(i,a,b) for(int i=a;i<b;i++)
using namespace std;
int n,k;
int a[N];
vector <int> b[N];
bool dp[N][N];
int read()
{
int x=0;
char ch=' ';
bool flag=false;
while(!isdigit(ch))
{
if(ch=='-')flag=true;
ch=getchar();
}
while(isdigit(ch))
{
x=(x<<3)+(x<<1)+ch-... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 83,163,681 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
struct COODINATE
{
public:
int x, y, n;
};
vector<string> Gin;
Graph Gout;
queue<COODINATE> Q;
int search(int x, int y, int n, int h, int w){
if(x<0 || w<=x || y<0 || h<=y || Gout... | #include <stdio.h>
int main() {
int A, B, flag = 1;
char S[20];
scanf("%d %d %s", &A, &B, S);
for (int i = 0; S[i] != '\0'; i++) {
if (i < A || i > A) {
if (S[i] < '0' || S[i] > '9') {
flag = 0;
}
}
else {
if (S[i] != '-') {
... | 0 | 23,708,564 |
#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; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
struct Train
{
int c,s,f;
};
int main() {
in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 88,268,834 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
int main() {
int n;
cin >> n;
V<string> s(n);
rep(i, n) cin >> s[i];
int ans(0);
rep(i, n) {
int S = s[i].length();
rep(j,... | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pb push_back
#define fi first
#define se second
#define in insert
#define mp make_pair
#define GCD(a,b) __gcd(a,b);
#define endl "\n"
#define FRU f... | 0 | 89,139,729 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<pair<long long, long long> > prime_factorize(long long N) {
vector<pair<long long, long long> > res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
long long ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res... | #include <bits/stdc++.h>
#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)
#define pb push_back
#define sz(x... | 0 | 79,759,544 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 2000000000
typedef long long ll;
bool compare(pair<int, int> a, pair<int, int> b) {
if(a.first != b.first){
return a.first < ... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | 0 | 37,937,145 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
#define ll long long
const long long INF = 1LL<<60;
const long long mod = 1e9 + 7;
int main(){
int A,B;
cin >> A >> B;
int ans;
REP(i,3){
if(i!=A-1 && i != B-1) ans = i;
}
ans++;
cout << ans << endl... | #include<iostream>
#include<string>
#include<list>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
list<int> L;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
if (s == "deleteFirst") {
L.pop_front();
c... | 0 | 7,197,183 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | #include <iostream>
#include <utility>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
for(int i=0; i<n; i++) {
int a, b, c;
cin>>a>>b>>c;
if(a>b) swap(a, b);
if(b>c) swap(b, c);
cout<<((a*a+b*b==c*c) ? "YES\n" : "NO\n... | 0 | 93,507,346 |
#include <iostream>
#include <map>
#include <algorithm>
#include <string>
#include <vector>
#include <numeric>
#include <cmath>
#include <queue>
#include <iomanip>
#include <functional>
#define CHMAX(a,b) a = std::max(a,b)
#define CHMIN(a,b) a = std::min(a,b)
#define CHABS(a) a = std::abs(a)
#define COUT(a) std::cout... | #define _GLIBCXX_DEBUG
#include"bits/stdc++.h"
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define OneToN(i,n) for(ll i=1;i<(ll)(n+1);i++)
#define ZeroToN(i,n) for(ll i=0;i<(ll)(n+1);i++)
#define AToB(i,a,b) for(ll i=a;i<(ll)(b+1);i++)
#define FOR(i,a,b... | 0 | 51,707,681 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
class UnionFind{
private:
unsigned int n_node;
std::vector<uint32_t> parent, rank;
public:
... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
int a[20005], b[20005], k;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
for(int i=1;i<=n;i++) {
cin >> k;
a[k] = i, b[k] = i;
}
for(int i=1;i<=n;i++) {
a[i] += i * n;
b[i] += n * (n - i);
}
for(int i=1;i<=n;i++) cout... | 0 | 63,746,956 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define INF 0x3f3f3f3f
#define NIL (-1)
#define M 1046527
using namespace std;
int T[M+1];
void trans(char *s){
for(int i = 0; i < strlen(s); i++){
if(s[i] == 'A') s[i] = '4';
else if(s[i] == 'C') s[i] = '1';
else if(s[i] == 'G') s[i... | #include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
int N, nmin, nmax, pcurr, pprev, maxi, maxv;
for (;;) {
scanf("%d %d %d", &N, &nmin, &nmax);
if (N == 0 && nmin == 0 && nmax == 0) break;
maxi = -1, maxv = 0;
scanf("%d", &pprev);
for (int i = 2; i <... | 0 | 76,690,692 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s, ope, p, tmp;
int i, j, h, num, start, end;
cin >> s;
cin >> num;
for(j=0;j<num;j++){
cin >> ope;
if(ope == "replace"){
cin >> start >> end >> p;
for(i=start;i<=end;i++){
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define SORT(c) sort((c).begin(),(c).end())
... | 0 | 61,100,656 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
bool f = true;
int n = s.size();
for(int i = 0; i < n / 2; ++i){
if(s[i] != s[n - 1 - i]) f = false;
}
for(int i = 0; i < n / 2 / 2; ++i){
if(s[i] != s[n / 2 - 1 - i]) f = false;
if(s[n / 2 + 1 + i] != s[n - 1 - i]) ... | #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 INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i,n) cin >> h[i];
sort(h.begin(), h.end());
if (k >= n) {
cout << ... | 0 | 12,784,077 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | #include <iostream>
#include <vector>
#include <cassert>
#include <cstdio>
#include <cstring>
using namespace std;
const char* INSERT = "insert";
const char* DELETE = "delete";
const char* DELETE_FIRST = "deleteFirst";
const char* DELETE_LAST = "deleteLast";
struct Node {
int val;
Node *next;
N... | 0 | 94,350,898 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
int main() {
int N, M;
cin >> N >> M;
unordered_map<int,bool> mp1;
unordered_map<int,bool> mp2;
r... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<tuple<int,int,int>> array(n+1);
for(int i=0;i<n;i++){
int t,x,y;
cin >> t >> x >> y;
tuple<int,int,int> d = make_tuple(t,x,y);
array.at(i+1) = d;
}
bool flag = true;
for(int i=0;... | 0 | 55,612,816 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> c(n);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
c[a-1]++;
}
sort(c.rbegin(), c.rend());
vector<int> d(n + 1);
int ... | #include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define pii pair<ll ,ll>
#define vi vector<ll>
#define present(container, element) (conta... | 0 | 18,856,742 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(in... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
typedef pair<int,int> P;
const int MOD = 1000000007;
const ll INF = 1e10;
const double EPS = 1e-10;
const double PI = 3.141592653589793;
template<class T... | 0 | 66,370,748 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int h, w;
cin >> h >> w;
vector<string> grid(h);
vector<vector<int>> light_row_count(h, vector<int>(w, 0));
vector<vector<int>> light_column_count(h, vecto... | 0 | 59,750,715 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const double PI = acos(-1.0);
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int H, W;
while(1) {
cin >> H >> W;
if(H == 0 && W == 0) break;
for(int i = 0; i < H; i++) {
for(int j = 0; j < W; j++) {
if(i... | #include <bits/stdc++.h>
using namespace std;
#define loop(i, n) for(int i = 0;i < int(n);i++)
#define rloop(i, n) for(int i = int(n);i >= 0;i--)
#define range(i, a, b) for(int i = int(a);i <= int(b);i++)
#define SZ(c) int(c.size())
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
#define PI acos(... | 0 | 76,885,052 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<int> getDivisors(int n) {
vector<int> res;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0) {
if (n / i == i) {
res.push_back(i);
} else {
res.push_back(i);
res.push_back(n/i);
}
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
vector<vector<int>> D(M);
vector<int> k(M);
for (int i = 0; i < M; i++) {
cin >> k.at(i);
for (int j = 0; j < k.at(i); j++) {
int s;
cin >> s;
D.at(i).push_back(s);
}
}
vector<int> p(M);
for ... | 0 | 37,667,556 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
#include <stdio.h>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++... | 0 | 61,341,204 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
int n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, 0, n) cin >> a[i];
ll ans = 1e18;
for(int bit = 0; bit < (1<<n); bit++) {
vector<... | #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
string s;
cin >> s;
vector<int> a(4);
rep(i, 0, s.size()) a[i] = s[i] - '0';
rep(bi, 0, 1<<3){
string ans;
int sum = a[0];
... | 0 | 39,874,817 |
#include<bits/stdc++.h>
using namespace std;
int ans(int x,int y,int a[7]){
if((a[4]==x&&a[2]==y)||(a[2]==x&&a[3]==y)||(a[3]==x&&a[5]==y)||(a[5]==x&&a[4]==y)) return a[1];
if((a[1]==x&&a[4]==y)||(a[4]==x&&a[6]==y)||(a[6]==x&&a[3]==y)||(a[3]==x&&a[1]==y)) return a[2];
if((a[1]==x&&a[2]==y)||(a[2]==x&&a[6]==y... | #include <bits/stdc++.h>
#define INF 1000000000000000001
#define ll long long
#define pll pair<ll, ll>
using namespace std;
ll N, A, B, C;
ll mp(vector<ll>& which_stick, vector<ll>& L)
{
ll res = -30;
vector<ll> length(3, 0);
for (ll i = 0; i < N; ++i)
{
if (which_stick.at(i) == 3)
{
continue;
... | 0 | 23,495,639 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int ans = 0;
for(int i=0;i<N;i++){
int X;
int A,B;
cin>>A>>B;
X = B-A+1;
ans+=X;
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
string s; cin>>s;
int k=s.size();
set<char> st;
rep(i,k) st.insert(s[i]);
if(st.size()==k) cout<<"yes"<<endl;
else cout<<"no"<<endl;
} | 0 | 25,447,346 |
#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()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 1000000007;
int main() {... | #include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(int i = 0; i < (int)(x); i++)
#define pb push_back
#define mp make_pair
#define debug(x) cerr << #x << ": " << (x) << "\n";
#define all(x) (x).begin()... | 0 | 56,100,798 |
#include<iostream>
using namespace std;
int main() {
int n, k, u;
cin >> n >> k >> u;
cout << min(n, min(k, u)) << ' ';
if (min(n, min(k, u)) < n && max(n, max(k, u)) > n) {
cout << n;
}
else if (min(n, min(k, u)) < k && max(n, max(k, u)) > k) {
cout << k;
}
else {
cout << u;
}
cout << ' ' << max(n, max... | #include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
ll mod= 1e9 + 7;
int main(){
ll n,m;
cin>>n >>m;
ll ans=0;
vector<pair<ll,ll>> p(n);
for(int i=0;i<n;i++){
long long a,b;
cin >> a >> b;
p[i] = make_pair(a,b);
}
sort(p.begin... | 0 | 88,940,399 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int N = 1e6 + 5;
int x, y;
ll fac[N], inv[N];
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % MOD;
}
a = a * a % MOD;
b >>= 1;
}
re... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int a,b,c;
int tot;
int main(){
cin >> a >> b >> c;
int minn = min(a,b);
for(int i = minn; i > 0; i--){
if(a % i == 0 && b % i == 0) tot++;
if(tot == c){
cout << i;
return 0;
}
}
} | 0 | 48,969,529 |
#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 x, a, b;
cin >> x >> a >> b;
string ans = "safe";
if(a >= b) ans = "delicious";
if(b - a > x) ans = "dangerous";
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const lint MOD =1000000007;
const lint MAX =... | 0 | 53,035,449 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long int;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int n;
cin>>n;
string s[60];
rep(i,n)cin>>s[i];
string ans;
for(char c='a';c<='z';c++){
int small=300;
for(int i=0;i<n;i++){
int cnt=0;
... | #include <bits/stdc++.h>
#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 namespace std;
using ll = long long;
using P = pair<in... | 0 | 56,020,969 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9+7;
int F[1000009];
int pw(int a,int n) {
int y = 1;
for (;n;n/=2) {
if (n & 1) y = 1ll*y*a%mod;
a = 1ll*a*a%mod;
}
return y;
}
int C(int n,int m) {
if (n < m) return 0;
return 1ll*F[n]*pw(F[m],mod-2)%mod*pw(F[n-m],mod-2)%m... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_AS... | 0 | 94,772,124 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, int> psi;
typedef pair<string, string> pss;
#define pb push_back
#define PI acos(-1.0)
#define EPS 1e-4
#define mp make_pair
#define all(x) x.begin(), x.end()
#define fastio ios_base::sync_with_stdio(fal... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vector<int> list;
int no = 1;
int ans = 0;
for (int i = 0; i < N; ++i) {
if (no != a[i]) {
ans++;
}
else {
... | 0 | 24,503,925 |
#include <iostream>
#include <string>
#include <math.h>
#include <vector>
using namespace std;
int main()
{
int ans, A, B, K, itr;
int count = 0;
vector<int> N;
cin >> A >> B >> K;
for (int i = 1; i <= min(A, B); i++)
{
if (A % i == 0 && B % i == 0)
{
N.push_back(i);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
int N;
cin >> N;
vector<ll> A(N),B(N),ABdif(N);
ll sumA=0,sumB=0;
rep(i,N) {
cin >> A[i];
sumA+=A[i];
AB... | 0 | 63,879,843 |
#include <ctype.h>
#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
char map[1000][1000];
bool visited[1000][1000];
int W, H, N;
int startR, startC;
int targetR[10];
int targetC[10];
int dr[4] = {-1, 1, 0, 0};
int dc[4] = {0, 0, -1, 1};
int getMinTime() {
int time = 0;
int curR = startR;... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout <<... | 0 | 20,503,326 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(void){
ll n; cin>>n;
ll f=0;
ll m=n;
while(m>0){
f+=m%10;
m=m/10;
}
if(n%f==0){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
int a[3][3],n;
using Graph = vector<vector<int>>;
vector<vector<i... | 0 | 20,185,763 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[]) {
long long N, C, K;
cin >> N >> C >> K;
vector<long long> t(N);
for (int i = 0; i < N; ++i)
cin >> t[i];
sort(t.begin(), t.end());
long long ret = 1;
long long next_lim = t[0] + K;
long ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int ap, a0, am, k;
cin >> ap >> a0 >> am >> k;
if ( a0 == 0 && am == 0) {
cout << k << endl;
return 0;
}
long long ans = 0;
for(int i = 0; i<k; i++) {
if( ap > 0 ) {
ap--;
ans++;
}
... | 0 | 69,269,765 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int lcs(string a, string b)
{
vector<vector<int> > dp(1001, vector<int>(1001));
for (int i = 0; i < a.size(); ++i)
{
for (int j = 0; j < b.size(); ++j)
{
if (a[i] == b[j])
{
dp[i + 1][j + 1] = dp[i][j] + 1... | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; ++i)
#define rep(i, n) repl(i, 0, n)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>... | 0 | 82,542,488 |
#include<stdio.h>
int main(void){
int a,n,c,d,b,f,r,v,kami[4][3][10]={{{0}}};
scanf("%d",&a);
for(n=0;n<a;n++){
scanf("%d %d %d %d",&b,&f,&r,&v);
b-=1;
f-=1;
r-=1;
kami[b][f][r]+=v;
}
for(b=0;b<4;b++){
for(f=0;f<3;f++){
for(r=0;r<10;r++){
printf(" %d",kami[b][f][r]);
}
printf("\n");
... | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n, a, b;
cin >> n;
vector<vector<int>> red;
vector<vector<int>> blue... | 0 | 60,486,872 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#defi... | #include<bits/stdc++.h>
using namespace std;
#define int long long
class union_find
{
int _setnum;
vector<int> par, nume;
public:
union_find(){
}
union_find(int x){
par.resize(x);
nume.resize(x);
init();
}
~union_fi... | 0 | 67,048,585 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) R... | #pragma GCC positionimize(3,"Otrst","inline")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<algorithm>
#include<tr1/unordered_map>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N... | 0 | 37,339,029 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>
#include <numeric>
using namespac... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n,k;
cin >> n >> k;
ll ans = 0;
vector<vector<int>> a(n);
vector<pair<int,int>> vp(n);
for(int i = 0;i<n;i++)
{
cin >> vp[i].first >> vp[i].second;
}
sort(vp.begin(),vp.end(),[&](auto a,auto b){return a.second>b.second;});
m... | 0 | 88,514,952 |
#include <iostream>
#include <string>
#include <vector>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main()
{
string s;
int n;
cin >> s >> n;
rep(i,n)
{
string s2,s3;
int x,y;
cin >> s2;
if(s2 == "print")
{
cin >> x >> y;
REP(j,x,y+1)
{
... | #include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long l... | 0 | 3,191,321 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main(){
int n; cin >> n;
string s; cin >> s;
bool ok = true;
vector<string> t(4);
t[0] = "SS"; t[1] = "SW"; t[2] = "WS"; t[3] = "WW";
for(int i = 0; i < 4; i++){
for(int j = 2; j < n; j++){
if(t[i][j - 1] == 'S'){
if(s[j - 1] =... | 0 | 50,467,960 |
#include <iostream>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int sum = 0;
long long int mi, ma;
for ( long long int i = 0; i < n; i++ ) {
long long int in;
cin >> in;
if ( i == 0 ) {
mi = in;
ma = in;
}
mi = min( mi, in );
ma = max( ma, in );
... | #include <iostream>
using namespace std;
int main(){
int n, k, a[100000];
while( true ){
cin >> n >> k;
if( n == 0 && k == 0 ) break;
for(int i = 0; i < n; i++){
cin >> a[i];
}
int s = 0, max;
for(int i = 0; i < k; i++){
s += a[i];
... | 0 | 93,569,766 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
int NumStr(const string &str)
{
int n = str.size();
int sum = 0;
for(int i=0; i<n; i++){
if(str[i] == 'A')sum += 1;
else if(str[i] == 'C')sum += 2;
else if(str[i] == 'G')sum += 3;
else if(str[i] == 'T')sum += 4;
s... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define srt(x) sort((x).begin(), (x).end());
#define rsrt(x) sort((x).rbegin(), (x).rend());
#define deb(x) cout<<#x<<" = "<<(x)<<" (L"<<LINE<<")"<<endl;
#define vdeb(x) {cout<<#x<<" = { "; rep(i, x.size()) cout<<x[i]<<' '; cout... | 0 | 10,233,950 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void prime_factorize(ll N, vector<pair<ll, ll>> &res) {
for (ll i = 2; i * i <= N; i++) {
if (N % i != 0)
continue;
ll e = 0;
while (N % i == 0) {
e++;
N /= i;
}
res.push_b... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (int) (n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
int main(){
int n;
cin >> n;
REP(i, n){
string var1, var2;
cin >> var1 >> var2;
int v1 = 0;
int v2 = 0;
int tmp = 1;
REP(j, var1.size()){
if(var1[j... | 0 | 28,860,982 |
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
#include <map>
#include <iterator>
#include <functional>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <fstream>
#include <iomanip>
#include <numeric>
#include <cma... | #include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
#include<queue>
using namespace std;
int arr[36+5];
string str[36+5];
int arr2[... | 0 | 87,144,143 |
#include <iostream>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
while(true) {
int h, w;
cin>>h>>w;
if(h==0 && w==0) break;
for(int i=0; i<h; i++) {
for(int j=0; j<w; j++) {
if(i==0 || j==0 || i==h-1 || j==w-1) cout<<'... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (... | 0 | 21,960,532 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n,a,b;
cin>>n>>a>>b;
int ans[3]={},p;
for (int i = 0; i < n; ++i)
{
cin>>p;
if (p<=a)
{
++ans[0];
}
else if (p>=b+1)
{
++ans[2];
}
else
{
++ans[1];
}
}
cout<<min({ans[0],ans[1],ans[2]})<<endl;
... | #include <bits/stdc++.h>
using namespace std;
string taro,hana,card[2];
int N,Tp,Hp;
int main(){
cin >> N;
for(int i = 0; i < N; ++i){
cin >> taro >> hana;
if(taro == hana){
Tp++; Hp++;
continue;
}
card[0] = taro; card[1] = hana;
sort(card, card +2... | 0 | 79,781,266 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
bool custom1 (pair<int, int> a, pair<int, int> b) {
return (a.first < b.first);
}
bool custom2(pair<int, int>... | #include<iostream>
#include<vector>
using namespace std;
vector<int> parent;
vector<int> L;
vector<int> R;
int n;
vector<int> d(100005);
int Depth(int i, int x){
d[i] = x;
if(R[i] != -1) Depth(R[i], x);
if(L[i] != -1) Depth(L[i], x + 1);
}
void print(int k){
int c;
cout << "node " << k << ": ";
cout <... | 0 | 75,783,894 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <utility>
#define ll (long long)
#define REP(i,n) for(int i = 0;i<(int)n;i++)
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (a);i>(b);i--)
using namespace std;
int main(void){
int... | #include <iostream>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
if(a + b == 15){
cout << '+' << '\n';
}else if(a * b == 15){
cout << '*' << '\n';
}else{
cout << 'x' << '\n';
}
} | 0 | 92,387,231 |
#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... | #include <iostream>
#include <vector>
#include<list>
#include <algorithm>
#include <string>
#include <math.h>
#include<map>
#include <utility>
#include<queue>
using namespace std;
#define REP(i,k,n) for(int i=k;i<n;i++)
#define INF 1844674407370955161
typedef long long unsigned int ll;
#define SIZE_OF_ARRAY(array) (siz... | 0 | 53,400,247 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <assert.h>
#include <numeric>
#include <time.h>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> graph(10, vector<int>(10, 0));
rep(i, m) {
int x, y;
cin >> x >> y;
graph[x... | 0 | 19,715,635 |
#include <iostream>
#include <queue>
using namespace std;
int W, H, N;
char map[1005][1005];
int fact_x[10], fact_y[10];
const int vec_x[] = {-1, 1, 0, 0}, vec_y[] = {0, 0, -1, 1};
int dist[1005][1005];
int main(void)
{
cin >> H >> W >> N;
for(int y = 0; y < H; y++){
for(int x = 0; x < W; x++){
cin >> map[x][y];... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | 0 | 62,119,229 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<")" << "\n";
#define DEB... | #include <iostream>
#include <iomanip>
#include <string>
#include <cctype>
#include <algorithm>
#include <numeric>
#include <iterator>
#include <vector>
#include <map>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
struct Dice {
int top, front, right, left, back, bottom;
void toN() {
swap(top, fro... | 0 | 8,283,911 |
#include<iostream>
#include<vector>
using namespace std;
int main() {
while (1) {
int m, l, f;
vector<int> mem;
cin >> m >> l >> f;
if (m == 0)break;
for (int i = 0; i < m; i++) {
int x;
cin >> x;
mem.push_back(x);
}
int gap = 0, gapi = 0;
for (int i = l - 1; i < f; i++) {
if (mem[i] - mem[... | #include <bits/stdc++.h>
const int INF = 1e9;
const long long INFLL = 1e18;
const int NMAX = 20;
const int MMAX = 20;
const int KMAX = 50;
const int MOD = 1e9 + 7;
using namespace std;
#if __cplusplus >= 201103L
#define ALL(v) begin(v),end(v)
#define SORT(v) sort(begin(v), end(v))
#define FIND(v,x) find(begin(v), end... | 0 | 16,788,549 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 105;
... | #include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
#define COMPARE(left , right) (left == right ? "YES" : "NO")
#define SQUARE(value) (value * value)
#define SIZE 3
int main(void)
{
int ansArray[SIZE] = {0};
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < SIZE;... | 0 | 73,408,847 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
int main(void) {
ll N;
ll A = 0, B = 0, C = 0, D = 0, E = 0;
map<ll, ll> m;
cin >> N;
for(ll i = N;i > 0;i--) {
ll cur = i;
for(ll j = 2;j <= i;j++) {
... | #include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main()
{
ll X, Y, Z, K;
cin >> X >> Y >> Z >> K;
vector<ll> A(X), B(Y), C(Z);
REP(i, X) cin >> A[i];
REP(i, Y) cin >> B[i];
REP(i, Z) cin >> C[i];
sor... | 0 | 69,813,764 |
#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()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define int long long
#define pb push_back
#define double long double
using namespace std;
using namespace __gnu_pbds;
typedef tree< int , null_type, less<int>, rb_tree_tag, tree_order_statis... | 0 | 67,819,085 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define MOD 1000000007
#define all(c) c.begin(), c.end()
#define rep(i, s, e) for (auto i = s; i < e; i++)
#define peek(v) \
for (auto i : v) \
cout << i << ' ';
void solve()
{
ll n, k;
cin >> n >> k;
multiset<pair<ll, ll>> ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, start, count) for(int i=(start); i<(int)(count); ++i)
#define rep(i, count) REP(i, 0, count)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int N;
vector<int> A;
int main(void) {
cin >> N;
A.assign(N, 0);... | 0 | 67,362,132 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int r, d, x;
cin >> r >> d >> x;
vector<int> xx(11, x);
for (int i = 0; i < 10; i++) {
xx[i + 1] = r * xx[i] - d;
cout << xx[i + 1] << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
#define rep(i, n) for (ll (i) = 0; (i) < (n); (i)++)
#define For(i, a, n) for (ll (i) = (a); (i) < (n); (i)++)
#define prl(x) cout << (x) << endl
#define pr(x) cout << (x)
#define all(v) (v).begin(), (v).end()
int main(void){
... | 0 | 51,128,622 |
#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 ... | #include <bits/stdc++.h>
using namespace std;
long long n, m;
vector<vector<int>> g;
vector<int> dist;
long long solve();
int main() {
cin >> n >> m;
g.resize(n);
for (int i = 0; i < m; ++i) {
int a, b;
cin >> a >> b;
g[--a].push_back(--b);
g[b].push_back(a);
}
cout << solve() << endl;
retur... | 0 | 32,073,824 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll INF = 1e18 + 10;
int N, K;
int... | #include <iostream>
using namespace std;
int n,ans;
string s[300],t[300];
bool solve(void){
for(int i=1;i<n;i++){
for(int j=0;j<i;j++){
if(t[i][j]!=t[j][i])return false;
}
}
return true;
}
int main(void){
cin>>n;
for(int i=0;i<n;i++){
cin>>s[i];
t[i]=s[i];... | 0 | 95,014,743 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | 0 | 72,512,124 |
#include <bits/stdc++.h>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define REP(i,n) for(ll i=0;i<n;i++)
#define FOR(i,n1,n2) for(ll i=n1;i<n2;i++)
#define bFOR(i,n1,n2) for(ll i=n1;i>=n2;i--)
#define speed_up ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
... | #include <bits/stdc++.h>
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define pf(a) pu... | 0 | 61,187,856 |
#include<cstdio>
#include<iostream>
#include <string>
#include<algorithm>
using namespace std;
int main()
{
int a,b;
cin >> a >> b;
printf("%d",2*b-a);
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
template<typename T> inline bool chmax(T &a, T b){if(a<b){a=b;return ... | 0 | 65,417,070 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | #include <bits/stdc++.h>
#define N 1007
using namespace std;
int n,x[N],y[N];
long long a[40],l[40],r[40];
int main(){
scanf("%d",&n);
int flag=-1;
for(int i=1;i<=n;++i){
scanf("%d%d",&x[i],&y[i]);
int t=abs(x[i])+abs(y[i]);
if(flag==-1)flag=t%2;
else if(t%2!=flag){puts("-1")... | 0 | 57,796,753 |
#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()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 1000000007;
int main() {... | #include<iostream>
#include<string>
using namespace std;
string replaceAll(string &replacedStr, string from, string to){
unsigned int pos = replacedStr.find(from);
int toLen = to.length();
if(from.empty()){
return replacedStr;
}
while((replacedStr.find(from,pos)) != string::npos){
po... | 0 | 62,176,252 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.