code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<iostream>
using namespace std;
int main(){
char a;int b,sum=0;
while(1){
a=cin.get();
b=(int)a-48;
if(b>=10||b<0)break;
sum+=b;
}
if(sum%9==0)cout<<"Yes";
else cout<<"No";
return 0;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define re... | 0 | 52,442,888 |
#pragma GCC optimize("Ofast")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>
const long long INF_L = 1e17+7;
const long long INF_I = 1e9+7;
const long long MOD = 1e9+7;
const double EPS = 1e-8;
const double PI... | #include <bits/stdc++.h>
#define rep(i,n) for (int64_t i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n; cin>>n;
vector<int> p(n),q(n);
rep(i,n... | 0 | 7,186,300 |
#include<cstdio>
#include<cstring>
#include<vector>
#include<map>
#include<cmath>
#include<algorithm>
#define N 100005
using namespace std;
struct with {
int w;
long long d;
} dt[N];
map<long long, int> chk;
int n;
int parent[N],subn[N];
long long d[N];
long long sum[N];
bool cmp(with i, with j) {
return i.d < j.d;
... | #include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<... | 0 | 30,343,059 |
#include<bits/stdc++.h>
#define mod 1000000007
#define ll long long int
#define ar array
#define mp make_pair
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
string s,b,c;
cin>>s>>b>>c;
if(s[s.length()-1]==b[0] && b[b.length()-1]==c[0])
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
... | #include<bits/stdc++.h>
using namespace std;
const int INF=1e+9;
const int MOD=1e+9+7;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define REPD(i,n) for(int i=n-1;i>=0;i--)
#define REP2(i,a,b) for(int i=a;i<(int)(b);i++)
#define REPD2(i,a,b) for(int i=a;i>(int)(b);i--)
template<class T>
vector<T> make_vec(size_t a){
... | 0 | 27,405,677 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> a(N);
for(auto& i: a) cin >> i;
sort(begin(a), end(a));
auto ok = [&](auto x) {
if(K <= a[x]) return true;
vector<bool> dp(K);
dp[0] = true;
for(auto i = 0; i < N; ++i) if(i != x) if(a[i] < K) {
... | #include <cstdio>
int read_int() {
char ch = getchar_unlocked();
int res = 0;
while('0' <= ch && ch <= '9') {
res = res * 10 + ch - '0';
ch = getchar_unlocked();
}
return res;
}
void print_str(const char* str) {
while(*str != '\0') {
putchar_unlocked(*str);
++str;
}
}
char buf[1024];
void print_int(int x... | 0 | 33,061,675 |
#include <algorithm>
#include <iostream>
using namespace std;
void solve(long long A, long long B, long long C, long long D){
cout << min(A, B) + min(C, D) << '\n';
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long A;
scanf("%lld",&A);
long long B;
scanf("%lld",&B);
long l... | #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>>;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;retur... | 0 | 72,764,070 |
#include <iostream>
using namespace std;
int main(void) {
int a, b, c;
cin >> a >> b >> c;
string result = "Yes";
if (a >= b || b >= c) {
result = "No";
}
cout << result << endl;
return 0;
} | #include <iostream>
#include <fstream>
#include <iomanip>
#include <math.h>
#include <limits.h>
#include <algorithm>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <string>
#include <string.h>
#include <sstream>
#include <ctime>
using namespa... | 0 | 43,551,078 |
#include <iostream>
using namespace std;
int main() {
cin.tie(0); ios::sync_with_stdio(false);
int n, x, cnt;
while (true) {
cin >> n >> x;
if (n == 0 && x == 0) break;
cnt = 0;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
for (int k = j + 1; k <= n; k++) {
if (i + j + k == x... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fix cout << fixed; cout << setprecision(10)
void solve() {
int a, b;
cin >> a >> b;
if(a >= b) {
for(int i = 0; i < a; i++) {
cout << b;
}
}
else {
for(int i = 0; i < b; i++) {
cout << a;
}
}
}
int main() {
ios_base::sync_wi... | 0 | 66,345,828 |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define USE_LLONG_AS_INT
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll<<60)
#else
#define inf (1<<30)
#endif
#define rep(i,n) for(int i=0;i<(n);i++)
#define Rep(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a,b) for(int i=(a);i<=(b);i++)
#define rev(i,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | 0 | 70,405,200 |
#include <iostream>
#include <string>
#include <stack>
using namespace std;
int main(void){
while(true){
string s;
getline(cin, s);
if(s == "."){ break; }
bool ans = true;
stack<char> scale;
for(size_t i = 0; ans && i < s.length(); i++){
if(s[i] == '(' || s[i] == '['){ scale.push(s[i]); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
ll gcd(ll a... | 0 | 43,217,427 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
if(s.size()==2){
if(s[0]==s[1]){
cout<<1<<" "<<2<<endl;
}
else{
cout<<-1<<" "<<-1<<endl;
}
return 0;
}
for(int i=0;i<(int)s.size()-3;i++){
char a = s[i];
char b = s[i+1];
char c = s[i+2];
if(a==b || a==c || b==c){
... | #include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
typedef long long ll;
int main(){
ll x=1,i,lb,rb,mid;
char tp[10];
for(i=1;i<=13;i++,x*=10){
printf("? %lld\n",x);fflush(stdout);
scanf("%s"... | 0 | 91,512,617 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
int n;
cin >> n;
vector<int>t(n+1);
vector<int>x(n+1);
vector<int>y(n+1);
for(int i=1;i<=n;i++){
cin >> t[i] >> x[i] >> y[i];
}
t[0]=0;
x[0]=0;
y[0]=0;
bool judge=tr... | #include<bits/stdc++.h>
using namespace std;
const long long INF = (long long)1 << 60;
struct cake
{
long long x, y, z;
};
int main() {
int N, M;
cin >> N >> M;
vector<cake> input;
for (size_t i = 0; i < N; i++)
{
cake c;
cin >> c.x >> c.y >> c.z;
input.push_back(c);
... | 0 | 35,612,048 |
#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(int i=0;i<n;i++)
#define FOR(i,n1,n2) for(int i=n1;i<n2;i++)
#define bFOR(i,n1,n2) for(int i=n1;i>=n2;i--)
#define speed_up ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s,t;
cin >> s >> t;
int n = s.size();
int q = 0;
for(long i = 0; i<n; i++){
if(s[i]==t[i]){
q++;
}
else{
cout << "No" << endl;
break;
}
}
if(q==n){
cout << "Yes" << endl... | 0 | 19,358,416 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string str, str2;
cin>>str>>str2;
int cnt=0;
for(int i=0; i<str.size(); i++){
if(str[i]!=str2[i]) cnt++;
}
cout<<cnt;
} | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | 0 | 47,480,851 |
#include <iostream>
#include <string>
using namespace std;
int main () {
string x, y;
cin >> x;
cin >> y;
x = x + x;
int a = x.find(y);
if (a == -1) cout << "No" << endl;
else cout << "Yes" << endl;
return 0;
} | #include<iostream>
using namespace std;
int main(){
int m, f, r, i;
while (true){
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1){ break; }
if (m + f >= 80){
cout << "A" << endl;
}
if (m + f >= 65 && m + f < 80){
cout << "B" << endl;
}
if (m + f >= 50 && m + f < 65 && m != -1 && f != -1){
... | 0 | 46,131,766 |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(void){
double n,m,d;
cin >> n >> m >> d;
if (d==0.0) printf("%.12lf\n",(m-1)/n);
else printf("%.12lf\n",(n-d)*2*(m-1)/(n*n));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
bool b[100000];
int main(){
ll n,m; cin >> n >> m;
ll a[n+1];... | 0 | 15,932,856 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x)... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 2*1e18;
vector<long long> A,Al,Ar;
void regist(vector<long long> D){
A=D;
Al=D;
for(long long i=0;i<((long long)D.size())-1;i++){
Al[i+1]=Al[i]+D[i+1];
}
Ar=D;
for(long long i=((long long)D.size())-2;i>=0;i--){
A... | 0 | 30,470,665 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
int main(){
string s;
cin >> s;
int ans = INF;
for(int i = 0; i < (int)s.size()-2; i++){
int x = stoi(s.substr(i, 3));
ans = min(ans, abs(x - 753));
... | #include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <bits/stdc++.h>
using namespace std;
int main() {
int s;cin>>s;
int so = 0;
if(s == 4||s==2||s==1){
cout<<"4";
return 0;
}
for(int i = 1;;i++){
if(s%2 == 0) s=s/2;
else ... | 0 | 84,613,737 |
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf(... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(ll i=(j);i<(n);++i)
#define rrep(i,n) for(int i=(n);i>=0;--i)
#define ssort(n) sort((n).begin(),(n).end())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
#define Yes cout << "Yes" << endl
#def... | 0 | 21,568,913 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
char c;
cin >> c;
if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u') {
cout << "vowel" << endl;
} else {
cout << "consonant" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
map < int , int > me;
#define mod 1000000007
#define N 100005
#define MOD 1000000007
int fact[N], invfact[N];
int pow(int a, int b, int m)
{
int ans=1;
while(b)
{
if(b&1)
ans=(ans*a)%m;
b/=2;
a=(a*a)%m;
... | 0 | 78,436,730 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <vector>
#include <cstdlib>
#include <list>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
int n;
struct Point
{
double x, y;
};
void kock(int n,... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin>>s>>t;
bool ok=false;
for(int i=0;i<t.size();i++)
{
if(s==t)
{
ok=true;
break;
}
t=t.back()+t.substr(0,t.size()-1);
}
if(ok)
{
cout<<"Yes";
... | 0 | 10,156,728 |
#include<iostream>
#include<string>
#include<cmath>
using namespace std;
int main() {
string str;
int N;
string *s;
int *t;
string X;
cin >> N;
s = new string[N];
t = new int[N];
for (int i = 0;i < N;i++) {
cin >> s[i] >> t[i];
}
cin >> X;
int sum = 0;
bool flag = false;
for (int i = 0;i < N;i++) {
if... | bool DBG = false;
#include<bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
using bint = boost::multiprecision::cpp_int;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i... | 0 | 42,181,606 |
#include <bits/stdc++.h>
#include <iostream>
typedef long long ll;
#define rep(i,a,b) for(ll i =a ;i <= b;i++)
#define per(i,a,b) for(ll i =a ;i >= b;i--)
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
int main(int argc, char const *argv[])
{
ll n,a,b;
cin>>n>>a>>b;
ll q = n /(a+ b);
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
int Y,M,D,S;
cin>>Y>>M>>D;
if(Y%3==0){
if(M%2==0){
Y=Y/3-1;
M=M/2-1;
S=196471-Y*590-390-M*40-20-D;
cout<<S<<endl;
}
else{
Y=Y/3-1;
M=M/2;
S=196471-Y*590-390-M*40-D;
cou... | 0 | 31,547,051 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=9982... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <string>
#include <iomanip>
#include <limits>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <list>
#include <queue>
#include <tuple>
#include <deque>
#include <algorithm>
#include <numeric>
... | 0 | 66,716,240 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int H,W;
cin>>H>>W;
for(int i=0;i<H;i++){
string S;
cin>>S;
cout<<S<<endl<<S<<endl;
}
} | #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 | 12,758,639 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N,M,answer=0;
cin >> N >> M;
long long x[N],y[N],z[N],X[N];
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> z[i];
}
for (int n = 0; n < 8; n++) {
for (int i = 0; i < N; i++) {
int m = n;
if (m%2) {
X[i] = x... | #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 INF = 1<<29;
int main(){
int n, m; cin >> n >> m;
vector<int> a(m), b... | 0 | 40,533,316 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | #include <bits/stdc++.h>
using namespace std;
int main(){
cout << fixed << setprecision(20);
long long N;
cin >> N;
vector<long long> L(87);
for(int i=0; i<N+1;i++){
if (i==0){
L[0]=2;
}else if (i==1){
L[1]=1;
}else{
L[i]=L[i-1]+L[i-2];
}
}
cout << L[N] << ... | 0 | 3,387,072 |
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll MAX=500005;
const ll INF=0x3f3f3f3f;
const ll MOD=1000000007;
ll n,m,a[MAX],a_sum[MAX],b[MAX],b_sum[MAX],s1,s2;
int main(){
scanf("%lld%lld",&n,&m);
f... | #include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX/3
int main(){
int N,M,R;cin >> N >> M >> R;
vector<int> vis;
vector<vector<int> >dist(N);
for(int i = 0 ; i < R ; i++){
int r;cin >> r;r--;
vis.push_back(r);
}
for(int i = 0 ; i < N ; i++){
dist[i].resize(N... | 0 | 3,886,509 |
#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];
}
ll cur = 0;
ll l = 0;
ll ans = 0;
for (int r = 0; r < n; r++) {
while (cur & a[r]) {
cur ^= a[l];
l++;
}
cur ^= a[r... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include<unordered_map>
#include <stack>
#incl... | 0 | 92,398,478 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
using namespace std;
int main() {
int A=0, B=0, C=0;
bool flag = false;
cin >> A >> B >> C;
rep(b, B){
if ((A * (b+1)) % B == C) flag = true;
... | #include <bits/stdc++.h>
#define rep(i, m, n) for(int i = m; i < (n); i++)
#define print(x) cout << (x) << endl;
#define printa(x,n) for(int i = 0; i < n; i++){ cout << (x[i]) << " ";} cout << endl;
#define printa2(x,m,n) for(int i = 0; i < m; i++){ for(int j = 0; j < n; j++){ cout << x[i][j] << " ";} cout << endl;}
#d... | 0 | 61,884,720 |
#include<bits/stdc++.h>
#include<climits>
using namespace std;
#define debug(x,y) cout<<(#x)<<" " <<(#y)<<" is " << (x) <<" "<< (y) << endl
#define watch(x) cout<<(#x)<<" is " << (x) << endl
#define fast ios_base::sync_with_stdio(false)
#define fie(i,a,b) for(i=a;i<b;i++)
#define MOD 1000000007
#define mod 998244353
#d... | #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>;
const ll mod = 1000000007;
const double eps = 1e-8;
#ifdef DEBUG
#include "inc/debug.hpp"
#else
#define debug(...) 42
#endif
int main() {
int N, M;
cin >> N >> M;
vector<in... | 0 | 22,392,335 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, p;
cin>>n>>p;
string s;
cin>>s;
if(10%p == 0){
long long ans = 0;
for(int i = 0; i < (int)s.length(); i++ ){
if((s[i]-'0')%p == 0) ans+=(i+1);
}
cout<<ans;
return 0;
}
map<in... | #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>
#inclu... | 0 | 19,014,411 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ll N, K, S;
cin >> N >> K >> S;
vector<ll> A(N);
if(S != 1e9){
for(int i = 0; i < N; i++){
A[i] = S + 1;
}
}else{
for(int i = 0; i < N; i++){
A[i] = S - 1;
}
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PB push_back
#define INF (1LL<<61LL)
typedef pair<int, int> pii;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
while (cin >> n >> k, n) {
int a[100005];
for (int i = 0; i < n; ++i)
cin >> a[i];
int... | 0 | 33,397,698 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define PI 3.14159265358979
#define MOD 1000000007
using namespace std;
using ll = long long;
void solve()
{
string s, t;
cin >> s >> t;
int ans = 0;
for(int i = 0; i < 3; ++i)
{
ans += s[i] ... | #include <iostream>
void out(int n, int* a);
int main() {
int n;
int a[100];
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
}
int count = 0;
for (int i = 0; i < n; i++) {
int minj = i;
for (int j = i; j < n; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
if (i != minj) {
int aa... | 0 | 33,614,359 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_io(); std::ios_bas... | #include <stdio.h>
#include <string.h>
int main()
{
int i,j,k,t,n,m,l,x,y,z;
double b;
long long a,c,d;
while(scanf("%lld%lf",&a,&b)!=EOF){
d=b*100+0.1;
c=a*d/100;
printf("%lld\n",c);
}
return 0;
} | 0 | 81,264,620 |
#include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
int main()
{
ll a, b, c, k;
cin >> a >> b >> c >> k;
if(k % 2 == 0) cout << a - b << endl;
els... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
const int inf = 1000000000;
const ll inff = 1000000000000000000;
int main(){
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> buy(n)... | 0 | 33,082,084 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>
using namespace std;
int main(){
string str;
string tmp;
while(getline(cin, str) && str != "."){
int p = 0, q = 0;
bool flag = 1;
tmp = "";
for(int i = 0 ; i < str.size() ; i++){
if(str[i] == '[' || str[i] == '(' || st... | #include<bits/stdc++.h>
using namespace std;
#define int long long
struct LongestCommonSubstring{
struct node{
int value;
node *next;
node(int value,node *next):value(value),next(next){}
};
const int INF=1LL<<55LL;
string x,y;
LongestCommonSubstring(){}
LongestCommonSubstring(string x,string y):... | 0 | 52,732,253 |
#include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
#de... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
int main()
{
string s,t;
cin >> s >> t;
int ans = t.size();
for(int i = 0;i < s.size();i++)
{
int temp = t.size();
for(int j = 0;j < t.size();j++)
{
... | 0 | 40,431,806 |
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std ;
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define reMin(a, b) a = min(a, b)
#define reMax(a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int L = a+b, R = c+d;
if (L > R) {
cout << "Left" << endl;
} else if (L < R) {
cout << "Right" << endl;
} else {
cout << "Balanced" << endl;
}
} | 0 | 67,961,815 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
int main() {
string s,t;cin >> s >> t;
vector<vector<int>> a(26),b(26);
for(int i = 0; i < s.size(); i++) {
a[(int)s[i]-97].push_back(i);
}
for(int i = 0; i < s.size(); i++) {
... | 0 | 62,645,888 |
#include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll a,b,c,d,p,q;
cin>>a>>b>>c>>d;
p=(a-1)/c+(a-1)/d-(a-1)/(c*d/__gcd(c,d));
q=(b)/c+(b)/d-(b)/(c*d/__gcd(c,d));
cout<<b-a+1-q+p;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<string>
#define rep(i,N) for(int i=0;i<N;i++)
long long INF=1000000000000000000;
long long mod=1000000007;
using namespace std;
void sayNo(){
cout<<"0"<<endl;
return;
}
int main(){
long long N;
cin>>N;
long long T[N+1],A[N+1];
for(... | 0 | 36,543,171 |
#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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define pll pai... | 0 | 100,194,561 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
void solve(){
int n;cin>>n;
vector<int>a(n);
for(int i=0; i<n; i++)cin>>a[i];
int ans=0;
for(int i=1; i<n; i++){
if(a[i]==a[i-1]){
int cnt=2;
i+=1;
while(i<n&&a[i]==a[i-1]){
i+=1;
cnt+=1;
}
ans+=cnt/2;
}
}
cout<<ans<<end... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
templat... | 0 | 2,766,003 |
#include <stdio.h>
int main(){
int angka;
scanf("%d", &angka);
int angka3 = angka % 10;
int angka2 = (angka - angka3) / 10;
int angka2real = angka2 % 10;
int angka1 = angka - (angka2real * 10) - angka3;
int angka1real = angka1 / 100;
if(angka1real == 7){
printf("Yes\n");
}
else if(angka2real == 7){
printf... | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
int shakkinn=100000;
int n;
int i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
shakkinn *= 1.05;
while (shakkinn % 1000 != 0) {
shakkinn++;
}
}
printf("%d\n", shakkinn);
return 0;
} | 0 | 18,458,120 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#define CH(N,A,B) (A<=N&&N<B)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define RREP(i,a,b) for(int i=(b-1);a... | #include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(... | 0 | 72,325,671 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int endA = min(A, B+C);
int trans = endA - B;
cout << C-trans << endl;
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <cmath>
#include <vector>
#include <functional>
#include <stack>
#include <utility>
#include <map>
#include <queue>
#include <set>
#include <array>
#include <climits>
#include <cassert>
using namespace std;
typedef long long ll;
type... | 0 | 12,273,046 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define f(i,j,n) for(int i=j;i<=n;i++)
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int s;
cin>>s;
switch(s){
case 25:
cout<<"Christmas ";
break;
case 24:
cout<<"Christmas E... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <list>
#include <iomanip>
#include <queue>
#include <cmath>
#include <numeric>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n... | 0 | 93,249,151 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD 1000000007
#define ALL(obj) (obj).begin(),(obj).end()
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;}
... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>
... | 0 | 99,870,337 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,mx=0,mn=999999;
cin>>n>>m;
vector<pair<int,int>> v(m);
for(int i=0;i<m;i++){
cin>>v[i].first>>v[i].second;
mx=max(v[i].first,mx);
mn=min(v[i].second,mn);
}
cout<<max(mn-mx+1,0);
return 0;
} | #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... | 0 | 20,775,846 |
#include <bits/stdc++.h>
using namespace std;
void Show(int s){
int i=1,l,r;
while(1){
if(i == 1){
l = 100;
r = 111;
}
else{
r = 100 * i + 10 * i + i;
l = r - 110;
}
if(l <= s && s <= r){
cout << i << i << i << e... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int h,w;cin>>h>>w;
vector<string> m(h);
for(int i=0;i<h;++i){
cin>>m[i];
}
vector<bool> hi(h,false);
vector<bool> wi(w,false);
for(int i=0;i<h;++i){
for(int j=0;j<w;++j){
if(m[i][j]=='#')... | 0 | 67,005,482 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin>>n;
int x = -1;
for (int i = 1; i * (i+1) / 2 <= n; i++) {
if ((i * (i+1)) / 2 == n) x = i;
}
if (x == -1) {
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
cout << x + 1 << endl;
vector<vector<int>> ans;
vect... | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | 0 | 96,266,352 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#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);
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll min, max;
cin >> min >> max;
vector<ll> A;
A.push_back(min);
ll n = min;
for(;;) {
n *= 2;
if(n > max) {
break;
}
A.push_back(n);
}
cout << A.size() << endl;
} | 0 | 72,052,339 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int A[100005], B[100005];
int cnt = 0;
cin >> N;
for ( int i = 0; i < N; i++ ) { cin >> A[i]; B[i] = A[i]; }
sort(B, B + N);
for ( int i = 0; i < N; i++ ) cnt += (i + lower_bound(B, B + N, A[i]) - B) % 2;
cout << cnt / 2 <... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y,i,j,n;
deque<int >v;
cin >> n;
for(i = 0 ;i<n ;i++)
{
cin >> x;
deque<int >:: iterator it;
it = upper_bound(v.begin(),v.end(),x);
if(v.begin()== it)
v.push_front(x);
else... | 0 | 82,831,648 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF 1e18
#define INF 1e9
using namespace std;
#define fs first
#define sc second
using P = pair<ll,ll>;
using Pll = pa... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,W,Z,answer=0;
cin >> N >> Z >> W;
int a[N], X[N], Y[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
X[N-1] = a[N-1];
Y[N-1] = W;
for (int i = N-2; i+1; i--) {
X[i] = a[i];
Y[i] = a[N-1];
for (int j = i+1; j < N-1; j++) {
... | 0 | 76,682,096 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
vector<vector<int>> g( N );
for( int i = 0; i < M; i++ ) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back( b );
g[b].push_back( a );
}
vector<int> v( N );
typedef pair<int, int> P;
queue<P> que;
que.push( P( 0, 0... | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
void solve() {
ll N;
cin >> N;... | 0 | 86,756,849 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define prior priority_queue
#define MOD 1000000007
#define INF64 (long long)1e18
#define INF (int)1e9
#define PI 3.1415926535897932384626433832795
#define ll long long
#define ld long double
#define ret return
... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <stack>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#include <functional>
#define mod 998244353
#define int long long
#define ld long double
#... | 0 | 77,433,767 |
#include <iostream>
using namespace std;
int main(){
int n, m, p, ans;
while(1){
cin >> n >> m >> p;
if(n == 0 && m == 0 && p == 0) break;
ans = 0;
int a;
for(int i = 1; i <= n; i++){
int x;
cin >> x;
ans += x;
if(i == m) a = x;
}
if(a == 0){
ans = 0;
}else{
ans = ans * (100-p) / a;
... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <bitset>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
int main()
{
int n, m; cin >> n >> m;
vector<int> bi(m), pi(m);
int k, s, ans = 0;
rep(i, m){
cin >> k;
bi[i] ... | 0 | 2,585,027 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl;
#define INF 1ll<<60;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool ... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 0 | 55,473,543 |
#include <cstdio>
using namespace std;
int main() {
int a[5], tmp;
for (int i = 0; i < 5; ++i) {
scanf("%d", &a[i]);
}
for (int i = 0; i < 5; ++i) {
for (int j = i + 1; j < 5; ++j) {
if (a[i] < a[j]) {
tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
}
}
printf("%d %d %... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | 0 | 1,220,219 |
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <cassert>
using namespace std; typedef long long ll; const int MINF=-1e9; typedef pair<int,int> P;
int main() {
int n,k; cin>>n>>k;
ll a[n]; for(int i=0;i<n;i++) cin>>a[i];
ll b1[n], b2[n]; b1[0]=max(0LL,a[0]); b2[n-1]=max(0LL,a[n... | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> T(N);
rep(i, N) { cin >> T[i]; }
vector<int> A(N);
rep(i, N) { cin >> A[i]; }
int Tpeak;
int prev = 0;
vector<bool> Lo... | 0 | 70,338,608 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define F first
#define S ... | #pragma GCC optimize("O3")
#include <iostream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <math.h>
#include <set>
#include <stack>
#include <bitset>
#include <map>
#include <queue>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define DE... | 0 | 58,468,555 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> v(2000000,0);
vector<int> v1;
int n,num;
cin >>n;
for(int i=0;i<n;i++){
cin >>num;
v[num]=v[num]+1;
}
int cnt = 0;
for( vector<int>::iterator p=v.begin();p!=v.end();p++){
if(*p!=0){
for(int i=0;i<*p;i++... | #include <iostream>
#include <string>
using namespace std;
bool isLeft(char c){
string list = "yuiophjklnm";
for(int i=0;i<list.size();i++){
if(list[i] == c){
return true;
}
}
return false;
}
int main(){
while(true){
string str;
cin >> str;
if(str == "#"){
break;
}
int cnt = 0;
bool prev = is... | 0 | 38,927,161 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define INF 1073741824
#define ll long long
#define PI (2*acos(0.0))
using namespace std;
char gap = 32;
template<typename T>
ostream& operator<<(ostream &os, const vector<T> &v) {
os << '{';
for (const auto... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int,int>;
#define rep(i,n) for(int (i)=0,temp=(int)(n);(i)<temp;++(i))
#define repi(i,start,end) for(int (i)=(start),temp=(int)(end);i<(end);++(i))
#define rfor(x,v) for(const auto& (x) : (v))
#define all(x) (x).begin(),(x).end()
#de... | 0 | 3,415,165 |
#include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
#define pi 3.14159265358979
int main()
{
ll storeNum, drink, ans = 0, sum = 0;
cin >> storeNum >> drink;
... | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
typedef struct l_e
{
int key;
l_e *previous;
l_e *next;
}list_element;
typedef struct l_i
{
list_element *head;
list_element *tail;
}list_... | 0 | 88,528,520 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define FORR(i,m,n) for(int i = m - 1; i >= n; i--)
#define ALL(v) v.begin(), v.end()
#define itn int
#define Yes() cout << "Yes" ... | #include<bits/stdc++.h>
using namespace std;
#define flash ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define endl "\n"
#define int long long int
#define ll long long
#define ld long double
#define vi vector<int>
#defi... | 0 | 16,956,539 |
#include <iostream>
#include <queue>
#include <algorithm>
#include <numeric>
using namespace std;
const long long INF = 1LL<<40;
int main() {
long long N, K; cin >> N >> K;
vector<vector<long long> > s(N);
for (int i = 0; i < N; ++i) {
long long t, d; cin >> t >> d; --t;
s[t].push_back(d);
... | #include <iostream>
#include <algorithm>
#include <utility>
using namespace std;
using ll = long long;
using P = pair<ll, int>;
int main() {
int W, H;
cin >> W >> H;
const int MAXN = 200000;
static P elts[MAXN];
for (int i = 0; i < W; i++) {
cin >> elts[i].first;
elts[i].second =... | 0 | 81,580,720 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int flag;
int x,y;
cin>>x>>y;
if((y-2*x)<0)
{
flag=0;
}
else if((y-2*x)%2!=0)
{
flag=0;
}
else
{
int b=(y-2*x)/2;
if(0<=b&&b<=x)
{
flag=1;
}
else
{
flag=0;
}
}
if(flag)
{
cout<<"Yes";
}
else
{
cout<<"No";
}
} | #include <bits/stdc++.h>
using namespace std ;
int main()
{
int64_t a, b, k ;
cin >> a >> b >> k ;
for(int i = 0 ; i < k ; i++)
{
if(i == 0 || i % 2 == 0)
{
if(a % 2 == 0)
{
b += a / 2 ;
a /= 2 ;
}
else
{
a -= 1 ;
b += a / 2 ;
a /= 2... | 0 | 24,601,828 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int64_t MOD=1000000007;
int main() {
int N,temp=0,ans;
cin>>N;
vector<int64_t> S(N);
for(int i=0;i<N;i++)cin>>S.at(i);
sort(S.begin(),S.end());
int k=S.at(N-1);
for(int i=0;i<N;i++){
int t=min(k-S.at(i),S.at(i));
if(t>temp){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100000 + 5, P = 1e9 + 7;
int n, m, x[N], y[N];
int main() {
scanf("%d%d", &n, &m);
ll ans = 0, psum = 0;
for (int i = 1; i <= n; ++i) {
scanf ("%d", &x[i]);
ans += 1ll * (i - 1) * x[i] - psum;
ans %= P... | 0 | 64,638,347 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
string ans = "Yes";
int N;
cin >> N;
vector<int> x(N), y(N), t(N);
for (int i = 0; i < N; ++i)
{
cin >> t[i] >> x[i] >> y[i];
}
for (int i = 0; i < N; ++i)
{
if (i == 0)
... | #include<bits/stdc++.h>
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,a,b) for(int i=a;i>=b;--i)
#define mem0(x) memset(x,0,sizeof(x))
#define meminf(x) memset(x,0x3f,sizeof(x))
#define VI vector<int>
#define VL vector<ll>
using namespace ... | 0 | 67,292,745 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin>>A>>B;
if(A==1||B==1){
if(A!=1){
cout<<"Bob"<<endl;
}
else if(B!=1){
cout<<"Alice"<<endl;
}
else{
cout<<"Draw"<<endl;
}
}
else if(A==B){
cout<<"Draw"<<endl;
}
else if(A>B){
cout<<"Alice... | 0 | 32,646,937 |
#include<bits/stdc++.h>
using namespace std;
#define DIV 1000000007
long long N, K;
map<long long, long long>numcount;
map<long long, long long>ans;
long long kaidan[10000000];
long long modpow(long long ori, long long po){
long long res = 1;
while(po > 0){
if(po&1){
res *= ori;
res %= DIV;
}
ori *= ori;
... | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
vector<int> G[102];
int d[102];
int main()
{
int n,u,k,v;
cin >> n;
for(int i = 0; i < n; ++i){
cin >> u >> k;
for(int j = 0; j < k; ++j){
cin >> v;
G[u].push_back(v);
... | 0 | 12,639,948 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k;
cin >> n >> k;
if(n%k==0) cout << "0" << "\n";
else cout << "1" << "\n";
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | 0 | 97,734,675 |
#include <bitset>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <iostream>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <math.h>
using namespace std;
typedef long long ll;
type... | #include <bits/stdc++.h>
#define rep(i, s, n) for(int i = (s); i < (int)(n); i++)
#define INF INT_MAX/2
using namespace std;
int N, K;
int main() {
cin >> N >> K;
queue<int> que1;
que1.push(1);
rep(i, 0, N) {
queue<int> que0;
while (!que1.empty()) {
int x = que1.front(); que1... | 0 | 29,209,339 |
#include <bits/stdc++.h>
using namespace std;
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int> >, rb_tree_tag,tree_order_statistics_node_update>
#define standardVar ll n,m,i,j,k,num,num1,num2,flag=0
#define nn <<"\n"
#define __ <<" "<<
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#defin... | #include<bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin >> h >> w;
for (int i = 0;i < h*w;++i) {
string s;
cin >> s;
if (s == "snuke") {
char a = 'A';
a += i%w;
cout << a << i/w+1 << "\n";
break;
}
}
return 0;
} | 0 | 2,769,320 |
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
using namespace std;
#define CLR(arr,val) memset(arr,val,sizeof(arr))
int fun(int year,int month,int day){
int sum = 0;
if(year%3){
if(month%2)
sum = 20-day+1;
else
sum = 19-day+1;
for(int i = month+1;i <= 10;++i){
if(i%... | #include<bits/stdc++.h>
#define ll long long
#define fixed cout.setf(ios::fixed);
#define Precise cout.precision(7);
using namespace std;
int main()
{
ll n,x,prev,cnt=1;
cin>>n;
cin>>x;
prev=x;
while(--n)
{
cin>>x;
if(x<prev)
{
prev=x;
cnt++;
... | 0 | 81,540,038 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1e9+7
#define rep(i,n) for(ll i=0;i<n;i++)
#define pii pair<int,int>
#define pll pair<ll,ll>
const int maxn = 200000;
ll mod = INF;
ll a[maxn];
ll n;
int main(){
cin >> n;
rep(i,n)cin >> a[i];
sort(a,a+n);
rep(i,n-1){
... | #include<iostream>
#include<vector>
#include<string>
#include<map>
int main(){
std::string S, T;
std::cin >> S >> T;
std::map<char, char> transform, invTransform;
for(int i = 0; i < S.size(); i++){
char s = S[i], t = T[i];
if(transform.count(s)){
if(transform[s] != t){
... | 0 | 38,009,795 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, int> P;
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; } ret... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
char alpha[26] = {'a... | 0 | 4,651,881 |
#include <iostream>
int main()
{
int x;
std::cin >> x;
if (x < 1200)
{
std::cout << "ABC";
}
else
{
std::cout << "ARC";
}
std::cout << std::endl;
return 0;
} | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long LL;
template <typename F, typename S> std::ostream& operator<<(ostream& os, const p... | 0 | 97,280,281 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
int n,m,i,j,k,l,s=0;
cin>>n>>m;
map<int,int> m1;
for(i=1;i<=n;i++)
{
cin>>k;
m1[k]++;
}
map<int,int>::reverse_iterator it;
for(i=1;i<=m;i++)
{
it=m1.rbegin();
j=(it->f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=3e5+5,mod=1e9+7;
bool cmp(pair<ll,ll> a,pair<ll,ll> b){
if(a.first!=b.first)return a.first<b.first;
return a.second<b.second;
}
ll ans[N];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;cin>>n;
vect... | 0 | 94,109,685 |
#include <bits/stdc++.h>
#include <string.h>
#include <vector>
#define MAX 10000
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define rep(i,a,n) for(int i=a; i<n; i++)
#define r0 return 0
#define INF (int)1e15
#define MOD 1000000007
#define acc... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mod 1000000007
#define ff first
#define ss second
#define INF (int)1e9+1
#define INFLL (int)1e18+1
#define sz(bb) (int)bb.size()
#define all(qq) qq.begin(), qq.end()
#de... | 0 | 71,438,772 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
using ll = long long;
ll dp[200005][4];
int main() {
int n, m, sum = 0;
cin >> n >> m;
vector<int> a(n);
rep(i, n) {
cin >> a[i];
sum += a[i];
}
sort(a.begin(), a.end());
string ans;
a[n - m] >= (4 * m + sum - 1... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> G[200020];
vector<ll> P(200020),A(200020);
vector<ll> par(200020,-1);
void dfs(int u){
A[u]=P[u]+A[par[u]];
for(auto x:G[u]){
if(par[x]!=-... | 0 | 5,749,532 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N,A,B;
cin >> N >> A >> B;
ll S;
if(N%(A+B)<=A){
cout << N/(A+B)*A+N%(A+B);
return 0;
}
else if(N%(A+B)>A){
cout << N/(A+B)*A+A;
return 0;
}
} | #include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<vector>
#include<map>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int a[51], b[51];
int c[51], d[51];
int min_point[51];
for(int i = 0; i < N; i++) cin >> a[i] >> b[i];
for(int i = 0; i < M; i++) ... | 0 | 18,117,719 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int price;
int num[5] = {0};
int i = 0;
while (1){
scanf("%d", &price);
if (price != 0){
price = 1000 - price;
if (price / 500 != 0){
num[i] += (price / 500);
price -= (price / 500) * 500;
}
if (price / 100 != 0){
nu... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
#define N 1000
bool M[N][N];
int main(){
int n,u,k,v;
queue<int> Q;
cin >> n;
for(int i=0;i<n;i++){
cin >> u >> k;
u--;
for(int j=0;j<k;j++){
cin >> v;
v--;
M[u][v]=true;
}
}
int d[N]=... | 0 | 77,875,128 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
bool check(ll n, ll m, ll k){
return 2*k + 2*max(0LL, k - n) <= m;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
ll n, m;
cin>>n>>m;
ll ... | #include <cstdio>
#include <iostream>
#include <vector>
#include <math.h>
using namespace std;
int H, M, N;
int go[4][2];
bool K[1002][1002];
int score[1002][1002];
int C[11][2];
int ans = 0;
void saiki(int sx, int sy, int s){
if(K[sx][sy]){
if(score[sx][sy] > s){
score[sx][sy] = s;
for(int i = 0; i <... | 0 | 31,264,174 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b... | #include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | 0 | 97,516,573 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int num[4];
num[0]=n/1000;
num[1]=(n-num[0]*1000)/100;
num[2]=(n-num[0]*1000 -num[1]*100)/10;
num[3]=(n-num[0]*1000 -num[1]*100 -num[2]*10);
if(num[1]==num[2] && (num[0] == num[1] || num[1] == num[3])){
cout << "Yes" << endl;... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
using namespace std; using ll = long long; using pll = pair<ll, ll>;
using vl = vector<... | 0 | 94,707,409 |
#include <bits/stdc++.h>
using namespace std;
int n, x;
vector<pair<int, int>> a;
int main() {
cin >> n;
for(int i = 1; i <= n; i++) {
cin >> x;
a.push_back({x, i});
}
sort(a.begin(), a.end());
for(int i = 0; i < (int)a.size(); i++) {
cout << a[i].second << ' ';
}
ret... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<long long , long long>
#define pb push_back
#define ll long long
#define ld long double
#define precision(x,d) cout<<fixed<<setprecision(d)<<x
#define fill(a,b) memset((a),(b),sizeof((a)))
#define... | 0 | 44,934,984 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1 << 29;
const int MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> graph(n);
int a, b;
rep(i, m) {
cin >> a >> b;
a--;
b--;
g... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
vector<tuple<int,int,int>> x(M);
for (int i=0; i<M; i++) {
int a,b;
cin >> a >> b;
x[i]=make_tuple(a,b,i);
}
sort(x.begin(),x.end());
for (int i=0; i<M; i++) {
if (i==0) {
get<1... | 0 | 2,621,831 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef p... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | 0 | 30,769,772 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
int main(void)
{
ll n,a,b; cin>>n>>a>>b;
vec... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b) {if(a<b) {a=b; return true;} return false;}
template<typename T> bool chmin(T &a,T b) {if(a>b) {a=b; return true;} return false;}
#define itn int
#define fi first
#define se second
#define rep(i,n) for(int i=0... | 0 | 15,344,293 |
#include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n,k;
cin >> n >> k;
vector<int> a(n,0);
rep(i,0,n) cin >> a[i];
sort(a.begin(), a.end());
ll ans = 0;
rep(i,0,n-k) {
ans += a[i];
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define endl '\n'
#define ll long long
const int N = 2e5 + 5;
ll a[N];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin >> n;
for (int i = 1; i <= 2 * n; i++) cin ... | 0 | 15,789,780 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#pragma region defins
#define ll long long
#define loop(i,n) for (int i = 0; i < n; i++)
#define loops(i,f,n) for (int i = (f); i < n; i++)
#define INF 100000000000000
#define sort(a) sort(a.begin(),a.end())
#define rsort(a) sort(a.rbegin(),a.rend... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned l... | 0 | 63,620,081 |
#include <iostream>
#include <map>
using namespace std;
int main(void) {
int N;
cin >> N;
map<int,int> mp;
for(int i=1; i<=N; i++) {
int tmp = i;
for(int j=2; j<=N; j++) {
while(tmp%j == 0) {
tmp /= j;
mp[j]++;
}
}
}
... | #include <bits/stdc++.h>
#include<list>
#include<algorithm>
#define ll long long int
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define rep(a,b,c) for(a=b;a<c;a++)
#define repj(a,b,c) for(a=b;a<c;a++)
#define repr for(i=n-1;i>=0;i--)
#define pii pair<ll,ll>
#define pll pair<ll, ll>
#... | 0 | 51,637,216 |
#include<bits/stdc++.h>
int main()
{
int a,b;
std::cin>>a>>b;
if(a%3==0||b%3==0||(a+b)%3==0)
puts("Possible");
else
puts("Impossible");
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <iomanip>
#include <... | 0 | 64,031,883 |
#include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define PB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define MAX(a,b) (a>b)?a:b
#define MIN(a,b) (a>b)?b:a
#define REP(n) for(int i=0; i<n; i++)
#define REPj(n) for(int j=0; j<n; j++)
#define REPS(... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 1LL << 60
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i, m) for (lon... | 0 | 99,000,158 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define vi vector<int>
#define pi pair<int,int>
#define pl pair<ll,ll>
#define all(a) a.begin(),a.end()
#define mem(a,x) memset(a,x,sizeof(a))
#define pb push_back
#defi... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<iomanip>
#include <math.h>
using namespace std;
int main(){
string s,t,n,ans;
int a=-1;
cin>>s>>t;
n="abcdefghijklmnopqrstuvwxyz";
ans="Yes";
for(int i=0;i<26;i++){
for(int j=0;j<s.size();j++){
i... | 0 | 35,760,198 |
#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1e11;
using Graph = vector<vector<int>>;
signed main(){
vector<int> prime;
for( int i = 2; i <= 100; i++ ){
bool fg = 1;
for( int j = 2; j < i; j++ ){
if( i%j == ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,D,p=0;
cin>>N>>D;
vector<vector<int>> X(N,vector<int>(D));
for(vector<int> &i:X)
for(int &j:i)
cin>>j;
for(int i=0;i<N-1;i++){
for(int j=i+1;j<N;j++){
int l=0;
for(int k=0;k<D;k++)
l+=pow(X[i][k]-X[j][k],2);
... | 0 | 54,818,416 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
template<class S>S sum(vector<S>&a){return accumulate(all(a),S());}
template<class S>S max(vect... | 0 | 86,347,099 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
pll A[100005];
int main() {
cin.tie(0);
ios::s... | #include <bits/stdc++.h>
using namespace std;
int health(int P,int X){
return (P-X)*(P-X);
}
int main(void){
int N,X[101];
cin >> N;
for(int i=0;i<N;i++){
cin >> X[i];
}
int L=X[0],R=X[0];
for(int i=0;i<N;i++){
L=min(L,X[i]);
R=max(R,X[i]);
}
int ans=100000000... | 0 | 49,918,319 |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int ans = 0;
int cnt = 0;
for (int i = 0 ; i < 3; i++) {
if (s[i] == 'R') cnt++;
else cnt = 0;
ans = max(ans, cnt);
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
string s;cin >>s;
int ans=0;
int n=s.size();
for (int i = 0; i < n-1; i++)... | 0 | 45,498,150 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.