code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 32 101M |
|---|---|---|---|
#include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <numeric>
#include <functional>
using namespace std;
#define ALL(x) ... | #include<iostream>
#include<cstring>
#include<string>
using namespace std;
int main()
{
string str;
char ch;
int m;
int h;
int len;
int i,j,k;
while(1){
cin >> str;
if(str=="-")
break;
i=0;
len=0;
while(str[i]!='\0'){
len++;
i++;
}
cin >> m;
for(i=0;i<m;i++){
cin >> h;
for(j=0;j<h;... | 0 | 15,770,499 |
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
const int maxn = 2e5 + 7;
const int INF = 0x3f3f3f3f... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i... | 0 | 59,433,467 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <sstream>
using namespace std;
int main(){
while(true){
int N, M, P;
cin >> N >> M >> P;
if(N == 0 && M == 0 && P == 0){
break;
}
int hit;
int sum = 0;
for(int i = 0; i < N; i++){
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long A, B;
cin >> A >> B;
vector<long long> usea(40, 0), useb(40, 0);
long long t = 1;
long long ans = 0;
long long cnt = 0;
while(B >= t){
long long syo = B / (t * 2);
long long ... | 0 | 66,925,172 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N;
cin >> N;
vector<ll> a(N);
for(int i=0;i<N;i++){
cin >> a[i];
}
sort(a.begin(),a.end());
ll maxDepth = a.back();
bool ok =true;
if(maxDepth %2 ==0){
int t = maxDepth/2;
for(in... | #include<bits/stdc++.h>
#define fo(i,w,n) for(int i=(int) w;i<(int) n;i++)
#define qi queue<int>
#define vi vector<int>
#define ll long long
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pii pair<int,int>
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define fi first
#define se ... | 0 | 87,767,116 |
#include <iostream>
using namespace std;
int main(void)
{
int num,n,max,min,sum,ave,i;
while(cin >> num){
if(num == 0){
break;
}
sum = 0;
ave = 0;
for(i = 0; i < num; i++){
cin >> n;
if(i == 0){
max = n;
min = n;
}else{
if(max < n){
max = n;
}
if(min > n){
min = n;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end... | 0 | 42,078,446 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair <int, int>;
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 tru... | #include <iostream>
#include <string>
using namespace std;
string str;
void change(){
for(char i = 'a' ; i <= 'z' ; i++) str[i] = i;
for(char i = 'A' ; i <= 'Z' ; i++) str[i] = i;
for(char i = '0' ; i <= '9' ; i++) str[i] = i;
}
int main(){
int n;
while(cin >> n,n){
str = "";
change(... | 0 | 69,863,088 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
signed main(void)
{
int x, y, z, w, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z), d, e;
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
sort(a.rbegin(), a.rend());
s... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> num(3);
for(int i=0; i<3; i++){
cin >> num.at(i);
}
sort(num.begin(),num.end());
int ans=0;
if((num.at(2)-num.at(0))%2 && (num.at(2)-num.at(1))%2){
ans+=num.at(2)-num.at(1)+(num.at(1)-num.at(0))/2;
}
el... | 0 | 30,217,641 |
#include <string>
#include <iostream>
using namespace std;
int main()
{
string str;
int count[26] = {0};
while(cin >> str)
for(auto c : str)
if(isalpha(c)) ++count[tolower(c) - 'a'];
for(int i=0; i<26; ++i)
cout << (char)('a'+i) << " : " << count[i] << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
#define REP(i, n) for (long long i = 0... | 0 | 16,800,689 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
while(h--){
string s;
cin >> s;
cout << s << endl << s << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define LL long long
char c[1001][1001];
int d[1000005], ans;
queue<int> q;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, m; cin >> n >> m;
for(int i = 1; i <= n; i++) cin >> (c[i]+1);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)... | 0 | 22,991,119 |
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cmath>
using namespace std;
int main() {
int queryCount;
scanf("%d", &queryCount);
for (int i = 0; i < queryCount; ++i) {
long long res = 0;
long long first, second;
scanf("%lld%lld", &first, &second);
long l... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N=3;
vector<int> c(4);
int a,b;
for (int i=0;i<N;i++) {
cin >> a >> b;
c[a-1]++;
c[b-1]++;
}
string ans;
for (int i=0;i<4;i++) {
if (c[i]<1 || 2<c[i]) {
ans = "NO";
break;
... | 0 | 15,048,311 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
vector<T> compress(vector<T> &X) {
vector<T> vals = X;
sort(vals.begin(), vals.end());
vals.erase(unique(vals.begin(), vals.end()), vals.end());
for (int i = 0; i < (int)X.size(); i++) {
X[i] = lower_bound(vals.begin(), vals.end... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define sqr(x) ((x)*(x))
#define mp make_pair
#define uint unsigned
#define PI pair<int,int>
inline char gc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)... | 0 | 2,322,222 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define pi 3.141592653589793
int main() {
ll a, b, x;
cin >> a >> b >> x;
double ans;
if (a*a*b <= 2*x) {
ans = atan2((double)2*b - 2*x/(double)(a*a), a)*180/pi;
}else{
ans = ... | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define of(i,l,r) for(int i=l;i>=r;i--)
#define fe(i,u) for(int i=head[u];i;i=e[i].next)
using namespace std;
typedef long long ll;
inline void open(const char *s)
{
#ifndef ONLINE_JUDGE
char str[20];
sp... | 0 | 37,354,767 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<iomanip>
#include<sstream>
#include<map>
#include<cmath>
using namespace std;
#define rep(i,n) for(int i = 0;i < n;i++)
#define req(i,n) for(int i = 1;i <=n;i++)
#define rrep(i,n) for(int i = n -1;i >= 0;i--)
#define ALL(a... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,k;
cin>>a>>b>>k;
if(k<a)
{
cout<<a-k<<" "<<b;
}
else
{
k=k-a;
if(k<b)
{
b= b-k;
}
else b=0;
cout<<0<<" "<<b;
}
return 0;
} | 0 | 46,071,197 |
#include<iostream>
#include<cctype>
#include<string>
using namespace std;
int main(){
char ch;
char aaa[27]="abcdefghijklmnopqrstuvwxyz";
int i=0;
int num=0;
int count[27]={0};
while(cin >> ch){
ch=tolower(ch);
num=ch-'a';
count[num]++;
}
for(i=0;i<26;i++){
cout<<aaa[i]<<" : "<<count[i]<<endl;
}
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>
using namespace ... | 0 | 22,945,794 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
int n;
cin >> n;
vector<int> dim(n, 0);
vector<int> l(n);
for (int i = 0; i < n; i++)
{
cin >> l[i];
}
for (int i = 0; i < n; i++)
{
dim[i] = l[i] - (i + 1);
}
sort(dim.begin()... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string s, t;
cin >> s >> t;
bool flag = true;
int c = 0;
for (int i = 0; i < int(s.size()); ++i) {
flag = true;
c = 0;
for (int j = 0;; ++j) {
if (s[i + j] != t[j]) {
fla... | 0 | 27,448,882 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int m... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int num, kosu;
vector <int> price;
cin >> num >> kosu;
int tmp;
for(int i =0; i < num; i++)
{
cin >> tmp;
price.push_back(tmp);
}
sort(price.begin(), price.end());
int s... | 0 | 54,037,661 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for(int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
const int INF = (int)1e9;
const LL INFL = (LL)1e15;
const int MOD = 1... | #include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <stdlib.h>
using namespace std;
int main(void){
int ch[] = {
0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,0,0,0,0,1,0,0,0,1,0
};
while(1) {
string s;
int flg, ans = 0;
cin >> s;
if(s == "#") break;
flg = ch[s.at(0) - 'a'];
for(int i... | 0 | 94,420,574 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 10000... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin >> s >> t;
if (s[0] == t[0] && s[1] == t[1] && s[2] == t[2]){
cout << "3" << endl;
}
else if (s[0] == t[0] && s[1] == t[1] && s[2] != t[2]){
cout << "2" << endl;
}
... | 0 | 38,586,204 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x,long long y){
if(x%y==0){
return y;
}
return gcd(y,x%y);
}
long long lcm(long long p,long long q){
return (p*q)/gcd(p,q);
}
int main(){
long long a,b;
cin>>a>>b;
cout<<lcm(a,b)<<endl;
return 0;
} | #include<iostream>
#include<set>
using namespace std;
int main(){
int N;
cin >> N;
int loc[N];
int p;
for(int i=0; i<N; i++){
cin >> p;
p--;
loc[p] = i;
}
multiset<int> ms{-1, -1, N, N};
long w, x, y, z;
long ans = 0;
for(long i = N-1; i >= 0; i--){
... | 0 | 32,181,948 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1e9+7,inf=mod*mod*3ll;;
#define rep(i,N) for(ll i=0; i<(N); i++)
#define rep1(i,N) for(ll i=1; i<(N); i++)
#define pb push_back
string S;
ll K;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin>>S>>K;
if(S.siz... | #include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
#include<cmath>
#include<numeric>
using namespace std;
int main(void) {
string s, p;
cin >> s >> p;
s += s;
for(int i=0; i<s.size(); i++){
bool f = true;
for(int j=0; j<p.size(); j++){
if( i+j >= s.size() ){
... | 0 | 56,956,321 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | #include<bits/stdc++.h>
using namespace std;
#define A(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
void _read();
const int mod = 1e9 + 7;
int dp[101][100001];
int pre[101][100001];
int main () { _read();
int n,m;
cin >> n >> m;
vector<int> v(n+1);
for( int i = 1; i <= n; ++i) {
... | 0 | 38,759,362 |
#include<iostream>
#include<string>
using namespace std;
int main() {
string s; cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == ',') s[i] = ' ';
}
cout << s << endl;
return 0;
} | #include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cctype>
#include <map>
#include <stdio.h>
#include <string.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
int main(... | 0 | 9,740,795 |
#include<bits/stdc++.h>
#define lint long long
#define st first
#define nd second
#define INF 0x3f3f3f3f
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int a, b;
cin>>a>>b;
if(a <= 8 && b<=8)
cout<<"Yay!\n";
else cout<<":(\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define vll vector<ll>
#define mll map<ll,ll>
#define MOD 1000000007
#define pll pair<ll,ll>
constexpr ll INF = 1999999999999999997;
#define fastio ios_base:... | 0 | 39,641,416 |
#include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9+7)
#define inf (int)(3e18)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define PP pair<P,P>
#define all(v) v.begin(),v.end()
#define mkp make_pair
#define mkt ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep2(i,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define P pair<long long,long long>
#... | 0 | 73,855,729 |
#include <bits/stdc++.h>
using namespace std;
int main(){
unsigned long N;
cin>>N;
if(N%2==1){
cout<<0<<endl;
return 0;
}
unsigned long answer = 0;
unsigned long pow5 = 10;
for(int i=0; i<log(N)/log(5); ++i){
answer += N / pow5;
pow5 *= 5;
}
cout<<answ... | #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 | 40,246,238 |
#include<bits/stdc++.h>
#include<math.h>
#define mp make_pair
#define fi first
#define se second
#define INF 10000000000000000LL
#define ll long long
const int inf =INT_MAX;
const int MAX=3e5+9;
const ll MOD=1e9+7;
const int TOT_PRIMES=1e6+9;
const int MAX_A=71;
const int LN=20;
using namespace std;
int main(){
l... | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) lol(x.size())
#define ... | 0 | 78,813,692 |
#include <bits/stdc++.h>
using namespace std;
int mygcd(int m, int n) {
if(n==0) {
return m;
}
else {
return mygcd(n, m % n);
}
}
long long mylcm(long long a, long long b) {
return a * b / mygcd(a, b);
}
void solve(long long A, long long B, long long C, long long D){
long long a = (A-1)/C;
a += ... | #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... | 0 | 90,119,778 |
#include<bits/stdc++.h>
using namespace std;
char s[100000005];
int main()
{
scanf("%s",s);
int len=strlen(s);
int m,a;
m=0;
for (int i=0;i<len;i++)
{
a=s[i]-'0';
m+=a;
}
if (m%9==0)
cout<<"Yes";
else
cout<<"No";
return 0;
} | #include<iostream>
using namespace std;
int main(){
int H , W ;
while(1)
{
cin >> H >> W ;
if ( H == 0 && W == 0 ){
break ;
}else{
}
for (int i = 0; i < H ; i = i + 1 )
{
for (int j = 0; j < W ; j = j + 1 )
{
cout << "#" ;
... | 0 | 25,322,482 |
#include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y){
if(y==0)
return 1;
else
{
ll p=power(x,y/2);
if(y%2==0)
return (p*p)%hell;
else
return (x*((p*p)%hell))%hel... | #include<stdio.h>
int main()
{
long long int i,j=0,h,n,s=0;
scanf("%lld%lld", &h,&n);
long long int a[n+5];
for(i=0;i<n;i++)
{
scanf("%lld", &a[i]);
}
for(i=0;i<n;i++)
{
s=s+a[i];
if(s>=h)
{
j=1;
break;
}
}
if(j==1)
... | 0 | 62,514,062 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | using namespace std;
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define EL '\n'
#define el '\n'
#define all(x) x.begin(),x.end()
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define repd(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define large 1000000007
#define MOD 1000000007
#define p... | 0 | 100,639,105 |
#include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD /... | #include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const string YES = "Yes";
const string NO = "No";
void solve(long long N, long long M, std::vector<std::string> A, std::vector<std::string> B){
bool ans = false;
REP(i, N - M + 1) REP(j, N - M + 1) {
... | 0 | 41,733,645 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fix(n) cout<<... | #include <vector>
#include <iostream>
using namespace std;
int main()
{
int a, b, c, d,count=0,x=0;
cin >> a >> b >> c >> d;
if (a > d)
{
cout << d;
}
else if ((a + b) >= d)
{
cout << a;
}
else
{
cout << a - (d - (a + b));
}
} | 0 | 55,745,205 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e2+5;
int n , k;
bool yes[N];
int main(){
scanf("%d%d" , &n , &k);
for(int i = 1; i <= k; i++){
int d;
scanf("%d" , &d);
for(int j = 1; j <= d; j++){
int x;
scanf("%d" , &x);
yes[x] = 1;
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K; cin >> N >> K;
vector<P> v;
for (int i = 0; i < N; i++) {
int t, d; cin >> t >> d; ... | 0 | 100,034,183 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll power(ll p,ll n){
ll result=1;
while(n!=0){
if(n%2==0){
n/=2;
p*=p;
}
else{
n--;
result=result*p;
}
}
return result;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,t,a,b,c,d;... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,n,m) for(int i=n;i<m;i++)
#define elif else if
#de... | 0 | 1,412,819 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define PI 3.141592653589793
using namespace std;
typedef long long ll;
template<class T> void chmax(T &a,T b) { if (a<b) a=b;}
template<class T> void chmin(T &a,T b) { if (a>b) a=b;}
int gcd(int a, int b){
if (a < b) gcd(b,a)... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | 0 | 81,503,682 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template <class T1, class T2>
inline bool chmax(T1 &a, const T2 &b) {
if (a < b) {
... | #include <bits/stdc++.h>
using namespace std ;
int main(){
string A,B;
cin >> A >> B;
int Ak = A.size();
int Bk = B.size();
int Ans=-1;
if(Ak>Bk)Ans=0;
else if(Ak<Bk)Ans =1;
else{
for(int i=0;i<A.size();i++){
if(A[i]>B[i]){
Ans =0;
brea... | 0 | 14,785,485 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
int count=0;
if (N>1){
count += N*(N-1)/2;
}
if (M>1){
count += M*(M-1)/2;
}
cout << count << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <stdio.h>
#include <cstring>
#include <functional>
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
#def... | 0 | 55,169,058 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using Pa = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
vec<int> C = {2,5,5,4,5,6,3,7,6};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N,M;
... | #define TRUE true
#define FALSE false
#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<long long, long long>;
template <class T>
using vec = ... | 0 | 91,563,341 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
const int MOD = 1e9+7;
const ll LINF = 1e18;
con... | #include <iostream>
using namespace std;
int main() {
int A, B;
cin>>A>>B;
if((A==1 && B==3) || (A==3 && B==1)){
cout<<2;
}else if((A==1 && B==2) || (A==2 && B==1)){
cout<<3;
}else if((A==2 && B==3) || (A==3 && B==2)){
cout<<1;
}
} | 0 | 67,201,310 |
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 114514810
int n, a, b, c, v, d[11][11];
void init()
{
for(int i=0; i<11; i++) {
for(int j=0; j<11; j++) {
if(i==j)
d[i][j] = 0;
else
d[i][j] = INF;
}
}
}
int main(voi... | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
#define double long double
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define mp make_pair
#define pb push_back
#define inf INT_MAX
#define f... | 0 | 65,423,110 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<cmath>
#include<math.h>
#include<vector>
#include<queue>
#include<algorithm>
#include<map>
#include<unordered_map>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rep2(i,n) for(int i = (n - 1); i >= 0; i--)
#define PI 3.141592653589793
using namespace... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll k, a, b;
cin >> k >> a >> b;
ll ans;
if (b - a <= 2 || 1 + k <= a) {
ans = 1 + k;
} else {
ans = a;
k -= (a - 1);
if (k & 1) {
ans++;
k--;
ans += (b - a) * (k / 2);
} else {
... | 0 | 23,139,589 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep_n(_1, _2, _3, NAME, ...) NAME
#define rep_2(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rep_3(i, initial, n) \
for (int(i) = (int)(initial); (i) < (int)(n); ++(i))
#define rep(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep_1)(__VA_A... | 0 | 11,404,697 |
#include <iostream>
using namespace std;
int main() {
int scores[7];
int score_length = 0;
int number = 0;
cin>>number;
while (number != 0) {
int max = 0;
int min = 1000;
int score = 0;
int total = 0;
for (int i = 0; i < number; i++) {
cin>>score;
... | #include <cstdio>
#include <cstring>
#include <algorithm>
#define inf 0x3f3f3f3f
using namespace std;
struct Edge {
int t,next;
Edge() {}
Edge(int a,int b):t(a),next(b) {}
};
Edge e[200005];
int head[100005];
int f[100005][2];
void dfs(int x,int fa) {
f[x][1]=-inf;
for(int i=head[x];i;i=e[i].next)
if (e[i... | 0 | 58,828,804 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin >> x >> y;
if(x%y==0) cout << -1 << endl;
else{
for(int i=1;;i++){
if((x*i)%y==0) continue;
else{
cout << x*i << endl;
return 0;
}
}
}
} | #include <bits/stdc++.h>
using namespace std ;
int main(){
string A,B;
cin >> A >> B;
int Ak = A.size();
int Bk = B.size();
int Ans=-1;
if(Ak>Bk)Ans=0;
else if(Ak<Bk)Ans =1;
else{
for(int i=0;i<A.size();i++){
if(A[i]>B[i]){
Ans =0;
brea... | 0 | 17,014,283 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | #include <iostream>
using namespace std;
typedef long long ll;
int main(void)
{
int N;
cin >> N;
ll ans = 0;
int t = 0;
for (int A = 1; A <= N; A++) {
for (int B = 1; B <= N / A; B++) {
int C = N - A * B;
if (C > 0) {
ans++;
}
t... | 0 | 63,400,646 |
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb(n) push_back(n)
#define GSORT(v) sort(v.begin(), v.end(), greater<int>())
#define SORT(v) ... | 0 | 66,637,685 |
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
using ll = long long;
int n, a, b, c;
int ans=1001001001;
vector<int> t;
void calc(vector<int> v){
int at=0, bt=0, ct=0, tmp = 0;
boo... | #include <bits/stdc++.h>
using namespace std;
#define rep0(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define ll long long
#define coYes cout << "Yes" << endl
#define coYES cout << "YES" << endl
#define coyes cout << "yes" << endl
#define coNo cout << "No" << endl
#define coNO cout ... | 0 | 68,467,475 |
#include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const int MAX = 100000;
static const int NIL = -1;
using namespace std;
int main() {
ll n,s,k; cin >> n >> k >> s;
ll p = 0;
ll c = s/k;
ll d = s-c*(k-1);
rep(i,n){
if(p < k){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
int a[m],b[m],c[m];
vector<vector<int>>d(n,vector<int>(n,1000000000));
for(int i=0;i<n;i++)d[i][i]=0;
for(int i=0;i<m;i++){
cin>>a[i]>>b[i]>>c[i];
a[i]--;
b[i]--;
d[a[i]][b[i]]=c[i];
... | 0 | 1,885,863 |
#include "bits/stdc++.h"
using namespace std;
#define FI freopen("input.txt", "r", stdin)
#define FO freopen("output.txt", "w", stdout)
#define FasterIO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
typedef long long ll;
typedef uns... | #include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
templa... | 0 | 37,454,232 |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
int main(){
uint N, M;cin>>N>>M;
vector<int64> X(N),Y(N),Z(N);
for(uint i=0;i<N;++i){cin>>X[i]>>Y[i]>>Z[i];}
int64 m=0;
vector<int64> v(N);
for(uint i=0; i<8; ++i){
int x=(i&0b001)?1:-1;
int y=(i&0b010)?1:-1;
... | #pragma GCC optimize("O3")
#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... | 0 | 20,191,266 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s,t;
cin >> s >> t;
sort(s.begin(),s.end());
sort(t.rbegin(),t.rend());
int i = 0;
while(i < min((int)s.length(),(int)t.length())){
if(s[i]<t[i]){cout << "Yes"; return 0;}
if(s[i]>t[i]){cout << "No"; return 0;}
i++;
}
if(i... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> pint;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;
int main() {
int n; cin >> n;
string s; cin >> s;
vector<bool> dp(n);
rep(first, 2)... | 0 | 56,627,839 |
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
const int INF = 10000000;
int main()
{
int k;
cin >> k;
while(k % 2 == 0) k /= 2;
while(k % 5 == 0) k /= 5;
int a[100002];
fill(a, a + k, INF);
a[1] = 1;
queue<int> que;
que.push(1);
while(que.size())... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (i) != ... | 0 | 48,896,586 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
string x,y;
cin>>x>>y;
if(x<y){
cout<<"<"<<"\n";
}
else if(x>y){
cout<<">"<<"\n";
}
else{
cout<<"="<<"\n";
}
return 0;
} | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lma... | 0 | 21,115,810 |
#include "bits/stdc++.h"
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
vector<pair<long long, long long>>A(M);
vector<long long>Tree(N, 0);
for (long long i = 0; i < M; i++) {
cin >> A.at(i).first >> A.at(i).second;
Tree.at(A.at(i).first - 1) += 1;
Tree.at(A.at(i).second - 1) += -1;
}
if... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
in... | 0 | 71,340,204 |
#include<stdio.h>
int abs(int,int);
int main(void){
int a,b,c,d;
scanf("%d %d %d %d",&a,&b,&c,&d);
if(abs(a,c)<=d || (abs(a,b)<=d && abs(b,c)<=d)){
printf("Yes");
}else{
printf("No");
}
return 0;
}
int abs(int x,int y){
int sub=x-y;
if(sub<=0){
sub=-1*sub;
}
return sub;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 67,541,497 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int a[5];
for(int i=0;i<5;i++)cin>>a[i];
sort(a,a+5);
for(int i=4;i>=0;i--)
{
if(i!=4)cout<<" ";
cout<<a[i];
}
cout<<endl;
return 0;
} | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<cstring>
#include<climits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<deque>
#include<tuple>
#include<list>
#include<unordered_map>
#define ll long long
#define ... | 0 | 70,253,353 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb push_back
#define mp make_pair ... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ft first
#define sd second
#define pb push_back
using namespace std;
const ll mod = 1e9+7;
ll power(ll a, ll b, ll m = mod) {
ll x = 1;
while(b) {
if(b & 1) {
x = 1ll * x * a % m;
}
a = 1ll * a * a %... | 0 | 89,231,813 |
#include <iostream>
using namespace std;
int main()
{
long long a = 0,b = 0,c = 0,d = 0;
long long max = 0;
cin >> a >> b >> c >> d;
max = a * c;
if (max < a * d)
max = a * d;
if (max < b * d)
max = b * d;
if (max < b * c)
max = b * c;
cout << max << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define popcnt(a) __builtin_popcount(a)
#define FastIO() ios::sync_with_stdio(false), cin.tie(0);
#define IO() freopen("palindrome.in","rw",stdin)
#define error(args...) \
{ \
cerr<<"LINE "<<__LINE__; ... | 0 | 84,838,104 |
#include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep1(i,n) for(long long i=1;i<=(long long)(n);i++)
#define all(v) v.begin(),v.end()
#define Sort(v) sort(all(v))
#define Reverse(v) reverse(all(v))
#define Rsort(v) sort(all(v),greater)
#define pub(v)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
namespace Modop {
ll modAdd(ll a, ll b) {
return (a + b) % MOD;
}
ll modSub(ll a, ll b) {
return (((a - b) % MOD) + MOD) % MOD;
}
ll modMul(ll a, ll b) {
return ((a % MOD) * (b % MOD))... | 0 | 61,045,848 |
#include <stdio.h>
#define MAX_N (105)
static
void
swap( int A[], int i, int j )
{
int tmp = A[i];
A[i] = A[j];
A[j] = tmp;
return;
}
static
void
printArray( int A[], int N )
{
int i;
for ( i = 0; i < N; i++ ) {
printf("%d%c", A[i], (i == N-1) ? '\n' : ' ');
}
return;
}
static
void
sel... | #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 fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,K,Q,A,B,L,R;
string S, T;
const ll MOD = ... | 0 | 45,414,879 |
#include <algorithm>
#include <bitset>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#inc... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 8,162,183 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll x,y;
cin >> x >> y;
if (x > 0 && y > 0 && x < y){
cout << y - x << endl;
}
... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <utility>
#include <set>
using namespace std;
typedef long long int ll;
typedef long double ld;
template<class T> inline b... | 0 | 2,627,998 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll x, ll y) {
ll res = 1;
for (ll i = 0; i < y; i++) res... | #include<bits/stdc++.h>
#define fi first
#define se second
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define pb push_back
#define len(x) (int)(x).size()
typedef long long ll;
typedef long double ld;
using namespace std;
const int N = 1e5 + 10 , LG = 18;
int x[N] , f[N], bin[N][LG]... | 0 | 52,585,522 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(int i = (n) - 1; i >= (e); i--)
#d... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string... | 0 | 3,528,672 |
#include <bits/stdc++.h>
#define INF 1e9
#define endl '\n'
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define FORE(i, a, b) for (int i = (a), e = (b); i < e; ++i)
#define RFORE(i, a, b) for (int i = (b)-1, e = (a); i >= e; --i)
#define ALL(x) (x).begin(... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(ll i=(a);i<(n... | 0 | 67,955,934 |
#include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REP2(i, a, b) for(int i = a;i <= b;i++)
#define REPR(i, a, b) for(int i = a; i >= b; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#define v... | #include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include<algorithm>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, ... | 0 | 44,527,293 |
#pragma region header
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = (ll)(s); i < (ll)(n); i++)
#define all(x) (x).begin(),(x).end()
#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
const ll MOD = 1e9+7;
ll LLINF = 1LL << 60;
int INF = INT_MAX;
int main(){
int n; cin>>n;
string s; cin>... | 0 | 57,224,772 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using P = pair<int, int>;
void solve()
{
int k, s;
cin >> k >> s;
int ans = 0;
rep(x, k + 1) rep(y, k + 1)
{
int z = s - x - y;
if (!(0 <= z && z <= k))
continue;
an... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define vt vector
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
signed main() {
... | 0 | 57,884,117 |
#include<bits/stdc++.h>
using namespace std;
main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long i,j,k,l,m,n,o,p,q;
while(cin>>m>>n>>p)
{
if(m>p||m+n<p)
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
}
return 0;
} | #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 (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x)... | 0 | 71,942,508 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
int K;
cin >> N >> S >> K;
char dif = S.at(K-1);
for(int i = 0; i < N; i++){
if(S.at(i) != dif){
cout << "*";
}else{
cout << S.at(i);
}
}
cout << endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <tuple>
#include <iomanip>
#include <queue>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pa;
const ll MOD = 1e9 + 7;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (... | 0 | 50,696,083 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>>graph(n+1, vector<int>(0));
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
graph.at(x).push_back(y);
graph.at(y).push_back(x);
}
queue<int>s;
s.push(1);
vector<int>ed(n+1,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
const int maxn = 2e5 + 7;
const ll inf = 1e18;
vector<ll> v(maxn);
vector<ll> mostposs(maxn);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n;
... | 0 | 30,988,944 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
lli n, m;
int main(void){
cin >> n >>... | #include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | 0 | 49,018,695 |
#include <iostream>
#include <cstdio>
#include <string.h>
using namespace std;
int main(void) {
char str[1001];
int len, i, sum;
while (1) {
gets(str);
len = strlen(str);
for (i = 0, sum = 0; i < len; i++) {
sum += str[i] - '0';
}
if (!sum)
break;
cout << sum << endl;
}
return 0;
} | #include<cstdio>
#include<algorithm>
#include<vector>
#include<string>
#include<iostream>
#include<queue>
#include<map>
#include<set>
#include<complex>
using namespace std;
#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)
#define X real()
#define Y imag()
typedef complex<double> P;
double cros... | 0 | 85,730,511 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
vector<int> H(int m){
vector<int> h;
for(int i = 0; i < m; i++){
int g;
cin >> g;
h.push_back(g);
}
return h;
}
string Shuffle(string Previous, vector<int> h, int m, int n){
char after[200];
string After;
for(int i = 0; i < m; i++){
... | #include<bits/stdc++.h>
using namespace std;
#define mx 1000000000000000000
#define ll long long int
int main()
{
ll n,i,a[100000],count,sum=0;
cin>> n >> count ;
for(i=0;i<count;i++)
{
cin>> a[i];
sum+=a[i];
}
if(sum>=n)
cout << "Yes" << endl;
else
cout << "N... | 0 | 75,940,160 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; ++i)
#define all(a) (a).begin(), (a).end()
int N, K;
vector<int> H;
int main() {
cin >> N >> K;
H.resize(N + 1, 0);
rep(i, N) cin >> H[i + 1];
const ll INF = 1e18;
vector<vector<ll>> dp(N + 1, vec... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll isPrime(int n)
{
if (n <= 1)
return 1;
if (n <= 3)
return 2;
if (n % 2 == 0 || n % 3 == 0)
return 1;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || ... | 0 | 25,248,958 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b;
cin>>a>>b;
if(a>=b){
for(int i=1;i<=a;i++)
cout<<b;
}
else
for(int i=1;i<=b;i++)
cout<<a;
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;
#define re... | 0 | 66,887,059 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n;
cin >> n;
string ss,si;
cout << 0 << endl;
cin >> ss;
if(ss == "Vacant") return 0;
cout << n-1 << endl;
cin >> si;
... | #include <bits/stdc++.h>
#define fi first
#define se second
#define MOD(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,n) for (int i = 0; i < n; i++)
#define forr(i,a,b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
#define pb(x) push_back(x)
using namespace std;
typedef long long ll;
typedef long ... | 0 | 15,409,408 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <list>
#include <numeric>
#include <stack>
#include <unordered_map>
#include <map>
#include <set>
using namespace std;
#define sz(a) int((a).size())
#define all(... | #include<iostream>
using namespace std;
int main()
{
int x;
while(1){
cin >> x;
if(x == 0) break;
int max = -1, mini = 10000, sum = 0, score = 0, y = 0;
for(int i = 0; i < x; i++){
cin >> score;
sum += score;
if(score > max) max = score;
... | 0 | 92,024,626 |
#include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
long long n, m;
vector<vector<int>> p;
vector<bool> used;
vector<int> bw;
bool dfs(int now, int b)... | #pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#define rep2(i, a, b) for... | 0 | 30,214,064 |
#include <iostream>
#include<string>
#include<cstring>
#include <cstdio>
#include<utility>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<bitset>
#include<queue>
#include<stack>
#include<set>
#include <limits>
#include <climits>
#include <numeric>
#include<cassert>
#include<cctype>
#include... | #include <bits/stdc++.h>
using namespace std;
long long k, a[55], x, y;
int main () {
cin >> k;
cout << 50 << "\n";
x = k / 50;
x += 49;
y = k % 50;
for (int i = 0; i < 50; i++) {
if (i < y) {
a[i]+= 51;
for (int j = 0; j < 50; j++) {
a[j]--;
... | 0 | 82,178,374 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define FOR(i,a,b) for(ull i=a;i<b;i++)
#define FORit(it,a) for(auto it=a.begin();it!=a.end();it++)
#define ROF(i,a,b) for(int i=a;i>=b;i--)
#define vec vector
#define vi vec<int>
#define vll vec<ll>
#define pb push... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main()
{
int N;cin >> N;
string str;cin >> str;
for(int i = 0;i < 2;i++){
for(int j = 0;j < 2;j++){
vector<bool> v(N);
v[0] = i;
v[1] = j;
for(int k = 2;k < ... | 0 | 57,704,109 |
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<map>
#include<fstream>
#include<string>
#include<sstream>
#include<iomanip>
#include<iostream>
#include<numeric>
#include<cctype>
using namespace std;
int main() {
long long int a, b, c = 1;
cin >> a ... | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#define div1 1000000007
using namespace std;
int main(void)
{
long long N, H, W, A[1001], B[1001], i, ans=0;
cin >> N >> H >> W;
for(i=1; i<=N; i++){
cin >> A[i] >> B... | 0 | 62,695,249 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
const long long INF=1LL<<60;
long long dp[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)dp[i]=INF;
dp[0]=0;
for(int i=1;i<n;i+... | #include <bits/stdc++.h>
int N, M;
int MOD = 1000000007;
std::vector<int> counts;
std::vector<int> as;
int count(int idx) {
if (idx == N) {
return 1;
}
if (counts[idx] != -1) {
return counts[idx];
}
int cnt = 0;
if (as[idx + 1] == 0) {
cnt += count(idx + 1);
}
if ... | 0 | 26,845,425 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, s;
cin >> k >> s;
int answer = 0;
for (int x = 0; x <= k; x++) {
for (int y = 0; y <= k; y++) {
int z = s - x - y;
if (0 <= z && z <= k) answer++;
}
}
cout << answer;
} | #include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using... | 0 | 36,383,762 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long A, B;
cin >> A >> B;
long long saisho = 1;
for(int i = 2; i <= min(A, B); i++) {
if(A%i == 0 && B%i == 0) saisho = i;
}
long long ans = A*B/saisho;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
string s;
cin >> n >> s;
int cnt = 0;
for (int i = 0; i < 1000; i++) {
vector<int> v(3);
v.at(0) = i / 100;
v.at(1) = (i/10) % 10;
v.at(2) = i % 10;
int v_index = 0;
for (int j = 0; j < n; j++) {
... | 0 | 38,363,858 |
#include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pllll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vect... | #include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include <map>
#include<tuple>
#include<set>
using namespace std;
#define INF 1100000000000000000
#define MAX 100000
#define MOD 1000000007
... | 0 | 63,246,549 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
int main() {
int a, b, c; cin >> a >> b >> c;
if(c <= a + b) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
int main() {
intt H, W; std::cin >> H >> W;
std::vector<std::vector<char>> M(H+2, std::vector<char>(W+2));
for (int i = 1; i < H+1; ++i)
for (... | 0 | 23,380,887 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define rep(i,n) for(int i=0; i<n; i++)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define INF 2147483647
#define LLINF 9223372036854775807LL
int main() {
ll l,r; cin>>l>>r;
ll ans = 3000;
for (ll i=... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 5,656,242 |
#include<iostream>
#include<stdio.h>
#include<limits.h>
using namespace std;
int main() {
int n;
cin >> n;
int max = INT_MIN, min = INT_MAX;
long long int sum = 0;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
max = std::max(max, a);
min = std::min(min, a);
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vc vector<char>
#define mii map<int,int>
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
void MAIN() {
string s, t;
cin >> s >> t;
... | 0 | 81,507,879 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long double a,b,x; cin >> a >> b >> x;
long double ang;
if(x > a*a*b/2){
ang = atan(2*(a*a*b-x)/(a*a*a));
}else{
ang = atan((a*b*b)/(2*x));
}
cout << setprecision(12) << ang * 180/3.14159265358979;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct DLL{
ll x;
DLL *next;
DLL *prev;
};
int main(void){
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
DLL *head;
head = (DLL *)malloc(sizeof(DLL));
head->x = -1;
head->next = head;
head->prev = head;
for(int i = 0... | 0 | 63,265,369 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef vector<pair<ll,ll> > vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) for(ll i=(a);i... | #include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
template <class T, class U> ostream &operator<<(ostream &os,... | 0 | 50,031,104 |
#include <iostream>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
char result;
if(a + b == 15) result = '+';
else if(a * b == 15) result = '*';
else result = 'x';
cout << result;
} | #include <stdio.h>
#include <stack>
#include <math.h>
#include<iostream>
using namespace std;
int main(){
int n,a,c[1000000],count=1;
cin>>n;
cin>>c[1];
for(int i=1;i<n;i++){
cin>>a;
if(a>c[count]){count++; c[count]=a;}
else{
for(int t=1;t<=count;t++){
... | 0 | 49,552,884 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll n;
cin >> n;
vector<ll> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
deque<ll> b;
for(ll i = 0; i < n; i++){
if(i%2 == 0) b.push_back(a[i]);
else b.push_front(a[i]);
}
if(n%2 == 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 RFOR(i,a,b) for(int i=(int)(b-1);i>=(int)(a);--i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define RREP(i,n) for(int i=(int)(n-1);i>=0;--i)
#define ALL(a) (a).begi... | 0 | 805,856 |
#include<iostream>
#include<cstring>
typedef long long ll;
typedef long double ld;
using namespace std;
ll dx[] = {1, -1, 0, 0};
ll dy[] = { 0,0,1,-1 };
ll W, H;
ll cnt;
char field[100][100];
void dfs(ll y, ll x) {
field[y][x] = '#';
for (ll k = 0; k < 4; k++) {
ll ny = y + dy[k];
ll nx = x + dx[k];
if (ny >= 0... | #include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include<chrono>
using namespace std;
using namespace std::chrono;
using namespace __gnu_pbds;
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define fi first
#define se ... | 0 | 40,559,725 |
#include <algorithm>
#include <bits/stdc++.h>
#define ll long long
#define pi (acos(-1))
#define rep(i, n) for (unsigned long long i = 0; i < (unsigned long long)(n); ++i)
using namespace std;
std::vector<unsigned ll> genprimevec(const unsigned ll N);
int main()
{
int n;
cin >> n;
vector<int> v(n), vv;
... | #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 k,n;
cin >> k >> n;
vector<int> a(n);
rep(i,n){
cin >> a[i];
}
vector<int> ans(n);
for(int i=1;i<n;i++){
ans[i] = a[i] - a[i-1];
}
ans[0] = k-a[n-1]+a[0];
int maxim = 0;
rep(... | 0 | 55,243,397 |
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define MAX (1001)
int main() {
static int array[MAX +2][MAX + 2];
for (int i = 0; i <= MAX + 1;i++) {
array[0][i] = i;
array[i][0] = i;
}
char str1[MAX];
char str2[MAX];
cin >> str1 >> str2;
int Len1 = strle... | #include <bits/stdc++.h>
using namespace std;
int main() {
int num;
int nowX = 0;
int nowY = 0;
int tmp1,tmp2,tmp3,tmptCnt;
int tCnt,tX,tY;
bool chk = true;
cin >> num;
for(int i = 0; i < num; i++){
cin >> tCnt >> tX >> tY;
tmp1 = abs(nowX - tX);
tmp2 = abs(nowY - tY);
tmp3 = tmp1 + tmp2... | 0 | 51,459,873 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const int INF = -1e9-100;
signed main(){
int N, K; cin >> N >> K;
vector<int> A(N);
int ans = INF;
for(int i = 0; i < N; i++) cin >> A[i];
for(int a = 0; a <= K; a++){
for(int b = 0; b <= K; b++){
if(a + b > min(N, K)) continue;
... | #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
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | 0 | 82,042,797 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define... | #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... | 0 | 55,339,888 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<cmath>
#include<math.h>
#include<vector>
#include<queue>
#include<algorithm>
#include<map>
#include<unordered_map>
#pragma warning(disable: 4996)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define PI 3.141592653589793
using namespace std;
using ll = long... | #include<bits/stdc++.h>
using namespace std;
long long int min(long long int a, long long int b){
return (a<b) ? a : b;
}
long long int max(long long int a, long long int b){
return (a>b) ? a : b;
}
int main(){
int n,k,q;
cin >> n;
vector<long long int> a(n);
long long int res=0;
long long int allxor=0;
... | 0 | 61,327,800 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
#include <iomanip>
#include <set>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(ll i=(a); i<(b); i++)
#define YES cout << "YES" << endl;
#define NO cout... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
int main(){
cout << setprecision(10);
ll N,M;
cin >> N >> M;
vector<ll> v(N);
map<int,ll> m;
for(int i = 0; i < N; i++){
cin >> v.at(i);
v.at(i) %= M;
if(i > 0){
v.... | 0 | 65,623,907 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.