code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(N);
for(int i = 0; i < N; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
for(int i = 0; i < N; i++) {
}
double ans = v.at(0);
for(int i = 1; i < N; i++) {
ans = (ans + v.at(i)) / 2;
}
cout << ... | #include <iostream>
#include <unordered_set>
#include <cstdint>
#include <vector>
#include <sstream>
#include <string>
#include <climits>
#include <set>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <numeric>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int ... | 1 | 95,413,251 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#define ll long long
using namespace std;
int main(){
ll n,k;
cin>>n>>k;
vector<ll> x(n);
for(int i=0;i<n;i++){
cin>>x[i];
}
ll ans=(n-1)/(k-1);
if(0==(n-1)%(k-1)){
cout<<ans<<endl;
... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 1 | 9,512,169 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string normalize(string s) {
char c = 'A';
unordered_map<char, char> table;
string result = "";
for (int i=0; i<s.size(); i++) {
if (! table[s[i]]) {
table[s[i]] = c;
result.push_back(c);
c++;
} else {
result.push_back(table[s[i]]);... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
int main(){
string s,t;
cin >> s >> t;
int size = s.length();
int trace1[26], trace2[26];
for(int i = 0; i < 26; i++){
trace1[i] = -1;
trace2[i] = -1;
}
string ans = "Yes";
for(int i = 0; i < size; i++... | 1 | 31,206,781 |
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
using namespace std;
void fastio()
{
#ifndef ONLINE_JUDGE
fr... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 1 | 25,882,415 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a)... | #include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <... | 1 | 16,002,445 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#define DIV 998244353
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
ll N; cin >> N;
vector<ll> a(N);
fo... | #include <iostream>
using namespace std;
int main()
{
long long n, a, m = 0, r = 0;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a;
if (a < m + 2)
{
m = max(a, m);
continue;
}
r += (a - 1) / (m + 1), m += m == 0;
}
cout << r << en... | 1 | 99,984,497 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int h,n;
cin >> h >> n;
vector<int> a(n);
REP(i,n) cin >> a[i];
int sum = 0;
REP(i,n) sum += a[i];
i... | #include "bits/stdc++.h"
using namespace std;
int main() {
int H, N;
cin >> H >> N;
int Attack = 0;
for (int n = 0;n<N;++n) {
int num;
cin >> num;
Attack += num;
}
if (Attack >= H) {
cout << "Yes"<< endl;
}
else{
cout << "No" << endl;
}
return 0;
} | 1 | 27,735,649 |
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define MOD 10000
typedef long long ll;
typedef pair<int, string> P;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int c[m];
for (int i = 0; i < m; i++) cin >> c[i];
int dp[m+1][n+1];
for (int i = 0; i <= m; i+... | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
static const int INFTY = (1 << 29);
int MinCoin(int n, int m, int c[]) {
int T[50004];
for (int i = 1;i <= n;i++) T[i] = INFTY;
T[0] = 0;
for (int i = 0;i < m;i++) {
for (... | 1 | 6,274,599 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string a;
bool b;
while(1){
stack<char>stk;
b=true;
getline(cin,a);
if(a==".") break;
for(int i=0;i<a.size();i++){
if(a[i]=='(') stk.push('(');
else if(a[i]=='[') stk.push('[');
else if(a[i]==')'){
if(stk.empty()||stk.... | #include <iostream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#include <algorithm>
#include <limits.h>
using namespace std;
typedef vector<int> vi;
typedef vector<pair<int,int> > vp;
int main()
{
while(1)
{
string s;
getline(cin,s);
if(s==".") break;
stack<cha... | 1 | 64,390,904 |
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#defi... | #include <bits/stdc++.h>
#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 all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << (x) << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
usi... | 1 | 61,792,366 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
signed main()
{
int k,a,b; cin >> k>>a>>b;
for(int i = a; i<=b; ++i){
if(i%k==0) {
cout << "OK"; return 0;
}
}
cout << "NG";
} | #include<bits/stdc++.h>
#define MOD 1000000007
#define mp make_pair
#define ll long long
#define pb push_back
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define debug cout<<"Debugging.."<<endl
using namespace std;
int main()
{
faster;
int k,a,b;
cin>>k;
cin>>a>>b;
if(a%k==0 || b%k==0)cout<... | 1 | 58,203,427 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<ll, int, greater<ll>> m;
rep(i, n) {
ll a;
cin >> a;
m[a]++;
}
int cnt = 0;
ll ans = 0;
for (auto e : m) {
i... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
map<int,int,greater<int>> a;
for(int i=0;i<n;i++){
int x;
cin>>x;
a[x]++;
}
vector<int> r;
vector<int> s;
for(auto x:a){
if(x.second>=2)
r.push_back(x.first);
if(x.second>=4)
s.push_back(x.first);
}... | 1 | 1,370,519 |
#include<iostream>
#include<bits/stdc++.h>
#include<vector>
#define vi vector<int>
#define lli long long int
#define fo(i,n) for(int i=1;i<=n;i++)
#define foo(i,n) for(int i=0;i<n;i++)
#define ff first
#define ss second
#define pb push_back
#define vii vector<lli>
#define ok ios_base::sync_with_stdio(false); cin.tie(NU... | #include <bits/stdc++.h>
using namespace std;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
set<int> h[303030], w[303030];
int main() {
int H, W, M;
int mhCnt = 0, mwCnt = 0;
... | 1 | 84,716 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,a,b) for(int i=(a);i<(b);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
using vint=vector<int>;
using pint=pair<int,int>;
u... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n & 1) cout << (n + 1) / 2 - 1 << '\n';
else cout << n / 2 - 1 << '\n';
return 0;
} | 1 | 63,144,150 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0, b = 0;
cin >> a >> b;
a = (a + b)/2.0 + 0.5 ;
cout << a << endl;
} | #include <iostream>
int main() {
int a, b; std::cin >> a >> b;
std::cout << (a + b + 2 - 1) / 2 << std::endl;
return 0;
} | 1 | 58,688,488 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int M;
cin >> N >> M;
cout << ((N * (N -1)) / 2) + ((M * (M - 1)) / 2);
} | #include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | 1 | 21,134,483 |
#include <iostream>
#include <vector>
#include <iterator>
#include <algorithm>
#include <string>
#include <map>
#include <list>
using namespace std;
int main() {
int H,W;
cin >> H >> W;
char c[H][W];
for(int i=0; i<H; ++i){
for(int j=0; j<W; ++j){
cin >> c[i][j];
}
}
char resC[2*H][W];
for(i... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define endl "\n"
#define speed() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(x) (int)(x).size()
#define _USE_MATH_DEFINES
using namespace std;
typedef long lon... | 1 | 46,418,177 |
#include<iostream>
const unsigned int M= 1000000007;
using namespace std;
int main()
{
long long int n,k;
cin>>n>>k;
long long int ans=0;
long long int sm[200005]={0};
for(int i=1;i<200005;i++)sm[i]=sm[i-1]+i;
for(int i=k;i<=(n);i++)
{
long long int mini=sm[i-1];
long long int maxi=sm[n]-sm[n-i];
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | 1 | 58,312,710 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B;
cin >> A >> B;
for (int i = 1; i < 1250; i++)
{
if (((int)(i * 0.08) == A) && ((int)(i * 0.10) == B))
{
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
} | #include "bits/stdc++.h"
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b;
if(a%2==0)
c=a*12.5;
else
c=a*12.5+1;
for(int i=c;;i++)
{
int x,y;
x=i*0.08;
y=i*0.1;
if((x==a)&&(y==b))
{
cout<<i<<endl;
break;
}
else if(x!=a)
{
cout<<"-1"<<endl;
... | 1 | 71,353,683 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> n(3);
cin>>n.at(0)>>n.at(1)>>n.at(2);
sort(n.begin(),n.end());
cout<<n.at(2)*10+n.at(1)+n.at(0)<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 1 | 42,230,580 |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <vector>
#include <string>
#ifndef INT_MAX
#define INT_MAX 2147483647
#endif
#ifndef INT_MIN
#define INT_MIN -2147483648
#endif
typedef long long ll;
using namespace std;
ll N;
int main(int argc, char * argv[]) {
ios_base::sync_with_stdio(false)... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define Int long long
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
Int n;
cin>>n;
Int cv=(n*(n+1))/2;
cv*=n;
for(int i = 1;i<=n;i++)
{
Int j = (n*(n+1))/2;
j-=(i)*(n-i+1);
cv-=j;
... | 1 | 40,593,827 |
#include<bits/stdc++.h>
using namespace std ;
#define async ios_base::sync_with_stdio(false); cin.tie(NULL);
#define int long long int
#define let auto
#define of :
#define all(y) y.begin(), y.end()
#define present( x, y ) x.find( y ) != x.end()
#define _matrix(T) vector<vector<T>>
template<class T>
auto matrix( int r,... | #define DIN freopen("input.txt","r",stdin);
#define DOUT freopen("output.txt","w",stdout);
#include <bits/stdc++.h>
#include <cstdio>
#define mem(a,b) memset(a,b,sizeof(a))
#define REP(i,a,b) for(int i=(a);i<=(int)(b);i++)
#define REP_(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
using namespace std;
typedef l... | 1 | 26,750,865 |
#include <bits/stdc++.h>
using namespace std;
using vi=vector<int>;
using vvi=vector<vi>;
using vs=vector<string>;
using msi=map<string,int>;
using mii=map<int,int>;
using pii=pair<int,int>;
using vlai=valarray<int>;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define range(i,s,n) for(int i=s;i<n;i++)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<bool> VB;
typedef vector<string> VS;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define REP(i, init, N) for (int i =... | 1 | 26,517,989 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | #include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
bool ans = true;
int n;
string s;
cin >> n >> s;
if (n % 2 != 0)... | 1 | 7,732,910 |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main() {
int h, w;
cin >> h >> w;
vector<string>... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stati... | 1 | 35,722,538 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
ll n;
cin >> n;
vector<string> a(n);
for (string &i : a) cin >> i;
vector<vector<int>> f(n, vector<int>(26, 0));
for (int i = 0; i < n; i++) {
for (char c : a[i]) {
f[i][c - 'a'] += 1;
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin>>n;
int alphabet[26]={0};
for(int i=0; i<n; i++){
int curr[26]={0};
string s;
cin>>s;
for(int j=0; s[j]; j++) curr[s[j]-'a']++;
if(!i){
for(int j=0; j<26; j++) alphabet[j] = curr[j];
}
else{
for(int j=0; j<... | 1 | 90,852,182 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
vector<pair<long long,long long>> prime_factorize(long long p);
class Combi {
public:
Combi();
long long Combinat... | 1 | 65,562,374 |
#include <iostream>
using namespace std;
void solve(std::string S){
string t = "2019/04/30";
if (S <= t) cout << "Heisei" << '\n';
else cout << "TBD" << '\n';
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
std::string S;
std::cin >> S;
solve(S);
return 0;
} | #include <bits/stdc++.h>
#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++)
using namespace std;
int main() {
string s;
cin>>s;
if(s.at(5)=='1'){
cout<<"TBD"<<endl;
}
else if(s.at(5)=='0'&&s.at(6)-'0'>4){
cout<<"TBD"<<endl;
}
else{
c... | 1 | 45,237,269 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
if (K == 1){
cout << 0 << endl;
}
else if(K == N){
cout << 0 << endl;
}
else {
cout << N - K << endl;
}
} | 1 | 27,723,661 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define reps(i,f,n) for(int i=f; i<n; ++i)
#define rep(i,n) reps(i,0,n)
int main()
{
int m, a, b;
while(cin >> m >> a >> b, m){
vector<int> pt(m);
for(int i=0; i<m; ++i){
cin >> pt[i];
}
p... | #include <iostream>
using namespace std;
int main(){
int m,nmin,nmax;
while(cin>>m>>nmin>>nmax){
if(m==0&&nmin==0&&nmax==0) break;
int p[m];
for(int i=0;i<m;i++){
cin>>p[i];
}
int g[nmax-nmin+1],gmax=0,nn;
for(int i=0;i<=nmax-nmin;i++){
g[i]=p[nmin+i-1]-p[nmin+i];
if(g[i]>=gmax){
gmax=g[i];
... | 1 | 40,752,505 |
#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>... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long N,Y;
cin>>N>>Y;
rep(i,N+1){
rep(j,N+1){
rep(k,N+1){
if(i+j+k==N && 10000*i+5000*j+1000*k==Y){
cout<<i<<" "<<j<<" "<<k<<endl;
return 0;
}
if(i+j+k>N) break;
}
if(i+j>N... | 1 | 11,786,931 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> done(n, 0);
for (int i=0; i<n; i++) {
cin >> a[i];
}
int acount = 0;
int now = 1;
while(true) {
if (done[now-1] == 1) {
cout << -1 << endl;
return 0;
}
don... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
bool canstop=false;
vector<int> a(N);
for(int i=0;i<N;i++) cin >> a.at(i);
int now=0,cnt=0;
for(int i=0;i<N;i++){
if(now!=1){
now = a.at(now)-1;
cnt++;
}
else{
... | 1 | 9,811,523 |
#include <iostream>
#include <algorithm>
using namespace std;
void SelectionSort()
{
int N;
int a[100] = {0};
int count = 0;
int min;
int minIndex;
cin>>N;
for (int i = 0; i < N; i++)
{
cin>>a[i];
}
for (int i = 0; i < N - 1; i++)
{
min = a[i];
minIndex = i;
for (int j = i + 1; j < N; j++)
{
if... | #include <iostream>
using namespace std;
int main() {
int n;
cin>>n;
int a[110];
for(int i=0;i<n;i++){
cin>>a[i];
}
int ans=0;
int k,mi;
for(int i=0;i<n-1;i++){
mi=a[i+1];
k=i+1;
for(int j=i+1;j<n;j++){
if(a[j]<mi){
k=j;
mi=a[j];
}
}
if(a[i]>mi){
ans++;
int l=a[i];
a[i]=a[k];
... | 1 | 5,097,195 |
#include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>;
#define vvec(s) vector<vector<s>> ;
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++... | 1 | 45,805,837 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
#define READ(X) cin>>X;
#define READV(X) long long X; cin>>X;
#define READAR(A,N) long long A[N]; fo... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const int INF = 1001001001;
const ll LINF = 1001001001001001001;
int main(){
ll n ; cin >> n;
vector<ll> a(n);
rep(i,n... | 1 | 48,399,045 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define MOD 1000000007
#define P... | #include <iostream>
#include <map>
#include <string>
#define rep(i, n) for(int i=0;i<(n);i++)
using namespace std;
int main() {
int H, W, K;
cin >> H >> W >> K;
char C[10][10];
rep(i, H) {
rep(j, W) {
cin >> C[i][j];
}
}
int ans = 0;
for (int i = 0; i < 1 << H; i++) {
for (int j = 0; j <... | 1 | 3,440,697 |
#include <bits/stdc++.h>
using namespace std;
#define MAX 1010
int Levenshtein_Distance(char *s,char *t){
int N = strlen(s),M = strlen(t);
int dp[N+1][M+1];
for(int i = 0 ; i <= N ; i++){
dp[i][0] = i;
}
for(int i = 0 ; i <= M ; i++){
dp[0][i] = i;
}
for(int i = 1 ; i <= N ; i++){
for(int j = ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int dp[1005][1005];
void ExtendedEditDistance(vector<string> s1, vector<string> s2){
const int INF = 1e9;
for(int i=0;i<1005;i++)
for(int j=0;j<1005;j++) dp[i][j] = INF;
dp[0][0] = 0;
int sum1 = 0, sum2;
for(int i=0;i<(int)s1.size();i++){... | 1 | 49,906,651 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin>>n;
vector<double> a(n);
for(int i=0;i<n;i++)cin>>a[i];
sort(a.begin(),a.end());
double ans=0;
for(int i=1;i<n;i++)
{
a[i]=(a[i-1]+a[i])/2.0;
ans=a[i];
}... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | 1 | 66,271,430 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define pa pair<int,int>
const int Maxn=100010;
const int inf=2147483647;
int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
return x*f;
}
int ... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false); cin.tie(0);
int n;
cin >> n;
int k = 1;
while (k * (k + 1) / 2 < n) k++;
if (k * (k + 1) / 2 != n) {
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
k++;
cout << k << endl;
vector... | 1 | 30,678,368 |
#include<iostream>
#include<set>
#include<string>
using namespace std;
int main(){
ios::sync_with_stdio(false);
int n,i;
cin >> n;
string command, str;
set<string> S;
for (i=0;i<n;i++){
cin >> command >> str;
if (command=="insert"){
S.insert(str);
}else{
if (S.find(str)==S.end()){
cout << "no" <<e... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for((i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
typedef long long ll;
typedef pair<int, int> PII;
const double EPS = 1e-10;
int n;
int main() ... | 1 | 10,887,251 |
#include <bits/stdc++.h>
#define MAXN 100005
const int inf=0x3f3f3f3f;
using namespace std;
struct edge{
int next,to,v;
}e[MAXN<<1];
int n,tot,head[MAXN],dist[MAXN];
bool vis[MAXN];
void add(int x,int y,int z){
tot++;
e[tot].to=y;
e[tot].v=z;
e[tot].next=head[x];
head[x]=tot;
}
void bfs(){
memset(dist,inf,n*size... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(... | 1 | 34,441,180 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using p = pair<int,int>;
int main() {
string S;
cin >> S;
int a,b,c,d;
a = S.at(0) - '0';
b = S.at(1) - '0';
c = S.at(2) - '0';
d = S.at(3) - '0';
string ... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | 1 | 6,073,966 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
ll N;
cin >> N;
vector<ll> a(N);
ll sum = 0;
for (int i = 0; i < N; ++i) {
cin >> a[i];
sum += a[i];
}
bool can = true;
ll x = N*(N + 1) / 2;
if (sum % x != 0) { can = false; }
ll n = sum / x;
ll cnt = 0;
for (int i = 0; i... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <time.h>
#define int... | 1 | 86,069,122 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x)(x).begin(), (x).end()
#define rall(v)(v).rbegin(), (v).rend()
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair < ll, ll >
#define F first
#define S second
const int MOD =... | #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 ... | 1 | 14,289,362 |
#include <bits/stdc++.h>
#define INF 200000000
#define FER 0.0000000001
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<double, double> pdd;
int dp[100001];
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
fill(dp, dp + 100... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int* suu = new int[n];
for (int i = 0;i < n;i++) {
cin >> suu[i];
}
vector<int> dp;
dp.push_back(suu[0]);
for (int i = 1;i < n;i++) {
int index = lower_bound(dp.begin(), dp.end(), suu[i]) - dp.begin();... | 1 | 31,578,409 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
ll factorial(int i) {
if (i == 0) return 1;
return (factorial(i - 1)) * i;
}
int d(ll n) {
if(n == 0) return 1;
int count... | #include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
using lint = long long;
const int MAXN = 250005;
const int MAXV = 1000005;
map<lint, int> mp;
int main(){
int n; scanf("%d",&n);
lint sum = 0;
mp[sum]++;
lint ret = 0;
for(int i=1; i<=n; i++){
int ... | 1 | 79,354,062 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int A,B,C,D,E;
cin>>A>>B>>C>>D>>E;
int A_=A;
int B_=B;
int C_=C;
int D_=D;
int E_=E;
while(true){
if(A_%10==0){
break;
}
A_++;
}
while(true){
if(B_%10==0){
break;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(5);
vector<int> b(5);
vector<int> c(5);
for (int i=0;i<5;i++){
cin >> a.at(i);
b.at(i)=a.at(i)%10;
if (b.at(i)==0){
b.at(i)=10;
}
c.at(i)=a.at(i)/10;
}
sort(b.begin(),b.end());
for (int i=1;i<5;i++){
if (b.at(i)==10){
... | 1 | 9,127,077 |
#include<iostream>
#define loop(i,a,b) for(int i=a;i<b;i++)
using namespace std;
int main(){
loop(i,1,10)
loop(j,1,10)
cout<<i<<"x"<<j<<"="<<i*j<<endl;
} | #include <bits/stdc++.h>
#define LL long long
#define rep(i,x,n) for (int i=x;i<(n);i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
rep(i,1,10){
rep(j,1,10){
cout << i << "x" << j << "=" << i*j << endl;
}
}
return 0;
} | 1 | 76,533,367 |
#include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAX = 200000;
const ll INF = 1001001001;
const ll MOD = 1000000007;
ll N, M, ans=0, tmp=0;
vector<vector<ll>> d;
vector<ll> A, B, C;
void warshall_floyd() {
for (int i = 0; i < N; i++)
for (int j = 0; j < N; ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | 1 | 47,721,356 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> pix(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> pix.at(i).at(j);
}
}
vector<bool> is_row_whight(H);
for (int i = 0; i < H; i++) {
is_row_wh... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >>H >>W;
vector<vector<char>> V(H,vector<char>(W));
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin >> V.at(i).at(j);
}
}
vector<int> HR(H);
vector<int> WR(W);
for (int i=0; i<H; i++){
int A=0;
for(int j=0... | 1 | 67,035,028 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define GET_ARRAY_SIZE(a) (sizeof(a)/sizeof(a[0]))
#define LL long long
#define VI vector<int>
#define VL vector<LL>
#define VII vector< vector<int> >
#define VLL vector< vector<LL> >
#define VS vector<string>
#define ... | #include <bits/stdc++.h>
using ll = long long;
using ld = long double;
#define F first
#define S second
const ll mod = 1e9 + 7;
const ll INF = 922337203685477;
#define pb push_back
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define maxN 200007
usin... | 1 | 45,305,707 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
long long sum[200005];
int main(){
int i;
int n;
long long ans=0x7fffffffffffffff;
scanf("%d", &n);
for(i=1; i<=n; i++){
scanf("%lld", &sum[i]);
sum[i]+=sum[i-1];
}
for(i=1; i<n; i++){
ans=min(ans, abs(sum[n]-2*sum[i]));
}
print... | 1 | 83,547,163 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define _FILE(s) freopen(#s".in", "r", stdin); freopen(#s".out", "w", stdout)
#define gi get_int()
int get_int()
{
int x = 0, y = 1; char ch = getchar();
while (!isdigit(ch) && ch != '-') ch = getchar();
if (ch == '-') y = -1, ch = getchar... | #include<bits/stdc++.h>
using namespace std;
const bool DBG = 1;
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x" = " << x << endl)
#define WATCHR(a,b) TRACE(for(auto it=a; it!=b;) cout<<*(it++)<<" ";cout<<endl)
#define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end());})
#define all(x) (x).begi... | 1 | 79,876,342 |
#include<iostream>
#include<algorithm>
int w,h,x,y,r;
bool func(int x,int y){
if(0<=x && x<=w && 0<=y && y<=h){
return true;
}else return false;
}
int main(){
std::cin>>w>>h>>x>>y>>r;
if(func(x,y) && func(x+r,y) && func(x+r,y+r) && func(x,y+r) && func(x-r,y+r) && func(x-r,y) && func(x-r,y-r) && func(x,y-r) && func... | #include<stdio.h>
int main()
{
int w,h,x,y,r;
scanf("%d%d%d%d%d",&w,&h,&x,&y,&r);
if(((x-r>=0) && (y-r>=0))&&((x+r<=w)&&(y+r<=h)))
printf("Yes\n");
else
printf("No\n");
} | 1 | 1,239,685 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.rbegin(), a.rend());
long long ans1 = 0, ans2 = 0;
for (int i = 0; i < n - 1; i++) {
if (a[i] == a[i + 1]) {
if (ans1 == 0) {... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
int main(){
int n; cin >> n;
map<ll,int> ma;
rep(i,n){
int a; cin >... | 1 | 4,242,058 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, ss, ee) for (int i = (ss); i < (ee); ++i)
void solve() {
int a, b = 0, c;
cin >> a >> c;
string ans = "No";
while (a >= 0) {
if (a * 2 + b * 4 == c) {
ans = "Yes";
break;
}
a--;
b++;
}
cout << ans << endl;
}
int main() ... | #include <iostream>
using namespace std;
int main() {
int a,b,num;
cin>>a>>b;
for(int i=0;i<=a;i++){
num=a-i;
if(i*2+num*4==b){
cout<<"Yes"<<endl;
return 0;
break;
}
}
cout<<"No"<<endl;
return 0;
} | 1 | 38,649,770 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a;
cin >> a;
cout << a*800 - (a/15)*200 << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int main(){
int N; cin >> N;
int a = 800 * N;
int b = N / 15;
int c = b * 200... | 1 | 6,593,159 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
ll dx[4] = { 0, 1, 0, -1 };
ll dy[4] = { 1, 0, -1, 0 };
const ll INF = LLONG_MAX;
const ll MOD = 1e9 + 7;
int H;
vector<int> A;
void print(int i)
{
printf("node %d: key = %d, ", i, A[i]);
if (i / 2 > ... | #include<iostream>
using namespace std;
#define MAX 100000
int parent(int i){return i/2;}
int left(int i){return i*2;}
int right(int i){return i*2+1;}
int main(){
int n;
int heap[MAX+1];
int p, l, r;
cin >> n;
for(int i=1;i<=n;i++) cin >> heap[i];
for(int i=1;i<=n;i++){
p = parent(i); l ... | 1 | 23,967,146 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<bool> sunuke(N, false);
for(int i = 0; i < K; i++){
int d;
cin >> d;
for(int i = 0; i < d; i++){
int a;
cin >> a;
sunuke.at(a-1) = true;
}
}
int result = 0;
for(bool i : sunuke){
... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <ctype.h>
#include <stdlib.h>
#include <map>
using namespace std;
int main()
{
int N, K;
cin >> N >> K;
int d = 0;
vector<bool> KA(N,false);
for (int i = 0; i < K; i++)
{
cin >> d;
int A = 0;
for (int i = ... | 1 | 86,867,342 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<cstdio>
#define initdp(a,b) for(int i=0;i<=a;i++)for(int j=0;j<=b;j++)dp[i][j]=-1;
#define fi first
#define se second
#define pb push_back
#define pii pair<int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
using P = pair<int, int>;
int main() {
int n, ans = 0;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
for (int i = 0; i < n; ++i) {
... | 1 | 12,338,574 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
ll f(ll a) {
ll cnt1 = (a+1)/2;
ll ans = cnt1%2;
if (a%2 == 0) ans ^= a;
return ans;
}
int main() {
ll a, b;
cin >> a >> b;
ll ans = f(b) ^ f(a-1);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 1 | 65,778,455 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
vector<int> v(n);
for(int& i: v) cin>>i;
int mi=0x3f3f3f3f,cnt=0;
for(int i: v){
mi=min(mi,i); if(mi==i) cnt++;
}
cout<<cnt<<"\n";
return 0;
} | 1 | 63,768,564 |
#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>
#incl... | #include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i= (a); i < (b); ++i)
typedef long long ll;
typedef pair<int,int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() { ll K, A, B;
cin >> K >> A ... | 1 | 80,700,516 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
struct UnionFind{
vector<int> d;
UnionFind(int n=0):d(n,-1){}
int find(int x){
if(d[x] < 0) return x;
return d[x] = find(d[x]);
}
bool unite(int x,int y){
x = find(x);y = find(y);
if(x==y) return false;
if(d[x... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using P = pair<int,int>;
using ll = long long;
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n) {
rep(i, n... | 1 | 13,162,765 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<utility>
#include<cmath>
#include<climits>
#include<queue>
#include<stack>
#include<numeric>
#include<set>
#include<iomanip>
#include<map>
#include<type_traits>
#include<tuple>
#include<deque>
#include<cassert>
#include<bitset>
using name... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define Sort(a) sort(a.begin(), a.end())
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
templa... | 1 | 33,822,293 |
#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 n,ans=1;
string s;
cin>>n>>s;
rep(i,n-1){
if(s[i]!=s[i+1]){
ans++;
}
}
cout<<ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin>>N;
string S;cin>>S;
char prev=S[0];
int ans=1;
for (int i = 1; i < N; i++){
if(S[i]!=prev)ans++;
prev=S[i];
}
cout<<ans<<endl;
} | 1 | 7,170,547 |
#include <iostream>
using namespace std;
int main(void){
int n;
cin >> n;
int nums[n];
int sum=0;
for(int i=0; i<n;i++){
cin >> nums[i];
sum+=nums[i];
}
int med = sum/n;
int ans = n*100000;
for(int m=med-10; m <= med+10; m++){
int res=0;
for(int e : nums){
int x = e - m;
res+=x*x;
}
ans = min(ans,... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define ld long double
#define vi vector<vector<ll> >
using namespace std;
const int MOD=1000000007;
const int MOD2=998244353;
const ll MAX=91... | 1 | 5,950,058 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(fals... | #include "bits/stdc++.h"
using namespace std;
int main() {
int A, B;
cin >> A >> B;
for (int n = 0;n<=1000;++n) {
if (A==n*8/100&&B==n*10/100) {
cout <<n<<endl;
return 0;
}
}
cout << -1 << endl;
return 0;
} | 1 | 8,777,238 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000000;
int main(){
long long s;
cin>>s;
cout<<0<<" "<<0<<" "<<inf<<" "<<1<<" "<<(inf-s%inf)%inf<<" "<<(s+(inf-s%inf)%inf)/inf<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e9;
int main(){
ll s;
cin>>s;
ll y2=ceil((1.0*s)/(1.0*INF));
ll x2=y2*INF-s;
cout<<"0 0 1000000000 1"<<" "<<x2<<" "<<y2;
} | 1 | 41,044,961 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s,t;
cin>>s>>t;
int n=s.size();
int m=t.size();
int mn=INT_MAX;
for(int i=0;i+m<=n;i++){
string k=s.substr(i,m);
in... | #include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
int main(){
int ans=1001;
string s,t;
cin>>s>>t;
for(int i=0;i<sz(s)-sz(t)+1;i++){
int c=0;
for(int j=0;j<sz(t);j++){
c+=(s[i+j]!=t[j]);
}
ans=min(ans,c);
}
cout<<ans;
} | 1 | 66,135,480 |
#include<stdio.h>
#include<iomanip>
#include<iostream>
using namespace std;
int main(){
int a,b,d,r;
double f,a2,b2;
cin>>a>>b;
d=a/b;
r=a%b;
a2=a*1.0;
b2=b*1.0;
f=a2/b2;
cout<<d<<" "<<r<<" ";
printf("%5f\n",f);
return 0;
} | #include <iostream>
using namespace std;
int main(void){
double a,b;
scanf("%lf%lf",&a,&b);
int ans = int(a)/int(b);
int ans2 = int(a)%int(b);
double ans3 = a/b;
printf("%d\n",ans);
printf("%d\n",ans2);
printf("%lf\n",ans3);
} | 1 | 58,384,546 |
#include <bits/stdc++.h>
using namespace std;
typedef long long Int;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
Int n, a, b; cin >> n >> a >> b;
if (a > b) {
cout << 0;
return 0;
}
if (n == 1 && a != b) {
cout << 0;
return 0;
}
cout << (b-a)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(int)(a); i++)
typedef long long ll;
int main()
{
ll n,a,b; cin >> n >> a >> b;
ll l = a*(n-1)+b;
ll r = a+(n-1)*b;
cout << max(0LL, r-l+1) << endl;
return 0;
} | 1 | 55,357,862 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vecto... | #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... | 1 | 12,123,183 |
#include<bits/stdc++.h>
#include<unistd.h>
using namespace std;
#define pb(x) push_back(x);
typedef long long int ll;
ll mod = 998244353;
ll hmaxii=0;
vector<ll>values[2*100000+1];
ll MAXN = 2*100000+1;
ll spf[2*100000+1];
ll diff,x,y,z;
ll flag=1;ll price[1001][1001];
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a; }
void... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n,i,cur;
string s;
cin >> s;
n=s.size();
vector<long> ans(n+1,0);
for(i=0; i<n; i++){
if(s[i]=='<'){
ans[i+1]=ans[i]+1;
}
}
for(i=0; i<n; i++){
if(s[n-1-i]=='>'){
ans[n-1-i]=max(ans[n-i]+1,ans[n-1-i]);
}
}
cur=0;
for(i=0; i<n+1; i+... | 1 | 61,300,014 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n, d,x,cnt=0;
double nn = 0.0;
... | #include <bits/stdc++.h>
using namespace std;
#define println(msg) cout << msg << endl
int main() {
int N, D;
cin >> N >> D;
vector<vector<int>> vvi(N);
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) {
int x;
cin >> x;
vvi.at(i).push_back(x);
}
}
set<int> table;
{
... | 1 | 61,551,655 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int h, n;
cin >> h >> n;
int *a = new int[n];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
string ans = "Yes";
if (sum < h) {
ans =... | #include<bits/stdc++.h>
using ll = long long;
using namespace std;
int main(){
ll h,n;
cin>>h>>n;
ll sum=0;
vector<ll>a(n);
for(int i=0;i<n;i++){
cin>>a[i];
sum=sum+a[i];
}
if(sum>=h)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;} | 1 | 76,337,799 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main(){
int p,q,r;
cin >> p >> q >> r;
cout << p + q + r - max(p,max(q,r)) << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007
int main(){
ll P, Q, R;
cin >> P >> Q >> R;
cout << min(P+Q, min(Q+R, P + R)) << endl;
} | 1 | 25,343,147 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define increment(a, b) (a == '.' && b == '#')
int find_root(int h, int w)
{
unsigned int dp[h][w];
string s[h];
REP(i, h)
{
cin >> s[i];
REP(j, w)
{
dp[i][j] = -1;
}
}
dp[0][0] = (s[0][0] == '#'... | #include <bits/stdc++.h>
#warning !!!check the size of arrayss!!!
#define INF 2000000000000000005
#define MOD 1000000007
#define newMOD 998244353
#define MAX 300006
#define pi 3.1415926535897932384626433832795
#define ll long long
#define int long long
#define P(gg) for(auto rax:gg){cout<<rax<<... | 1 | 77,461,061 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int i=n;i>=... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define EPS 1e-10
using namespace std;
typedef long long llong;
string s;
bool check() {
stack<char>S;
for (string::iterator it = s.begin(); it != s.end(); it++) {
switch (*it) {
case '(':S.push(*it); break;
case ')':if (S.empty() || S.top() != '(')return false... | 1 | 40,942,268 |
#include <iostream>
using namespace std;
int main(){
string str, cmd, arg2;
int n, arg0, arg1;
cin >> str >> n;
for(int i = 0; i < n; i++){
cin >> cmd >> arg0 >> arg1;
if(cmd == "print"){
cout << str.substr(arg0, arg1-arg0+1) << endl;
continue;
}
if(cmd == "reverse"){
string tmp1 = str.substr(0, ar... | #include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <complex>
using namespace std;
int main() {
string str;
int n;
cin >> str >> n;
for(int i = 0; i < n; i++){
string com;
cin >> com;
if(com == "print"){
int a, b;
cin >> ... | 1 | 88,695,902 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
#define INF 1e9
int main(void){
string s;
cin>>s;
int N = s.size();
vector<int> dp(1<<26,INF);
dp[0] = 0;
int bit = 0;
rep(i,N){
bit ^= (1<<(s[i]-'a'));
rep(j,26) {
dp[bit] = ... | #include<iostream>
#include<cstring>
#include<cstdio>
#define N 200010
using namespace std;
int minv[(1<<26)+10],bv[N],dp[N];
bool vis[(1<<26)+10];
inline int updv(int x,int p)
{
return x^(1<<p);
}
char s[N];
inline int getv(int x,int p)
{
return (x&(1<<p))>>p;
}
inline int out(int x)
{
for(int i=0;i<26;i++)
print... | 1 | 96,780,831 |
#include<iostream>
using namespace std;
int main()
{
int x,y,z=500,a;
cin>>x>>y;
a=x*500;
if(a>=y){
cout<<"Yes"<<endl;
}
else cout<<"No"<<endl;
return 0;
} | #include <stdio.h>
int main()
{
int a, b;
scanf("%d %d", &a, &b);
if(a*500>=b)
{
printf("Yes");
}
else
{
printf("No");
}
return 0;
} | 1 | 65,881,616 |
#include<stdio.h>
#include<cctype>
int main(){
char ch;
int count[26] = {};
while((ch = getchar()) != EOF){
if(isupper(ch)) ch = tolower(ch);
if(isalpha(ch)) count[ch -'a'] += 1;
}
for(int i = 0;i < 26;i++){
printf("%c : %d\n",i+'a',count[i]);
}
} | #include<iostream>
#include<cctype>
#include<cstdio>
using namespace std;
int main(){
char moji;
int alpha[26] = {0};
while((moji = getchar()) != EOF){
moji = tolower(moji);
alpha[moji - 'a']++;
}
for(int i = 0; i < 26; i++){
printf("%c : %d\n", 97+i, alpha[i]);
}
return 0;
} | 1 | 33,254,431 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
using Graph = vector<vector<int>>;
int main(){
int N;
cin>>N;
int V=0;
int E=0;
vector<int> h(N);
for(int i=0;i<N;i++){
cin>>h[i];
V+=h[i];
}
for(int i=1;i<N;i++){
E+=min(h[i-1],h[i]);
}
cout<<V-E<<endl;
return 0;
} | 1 | 52,000,270 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
string s;
cin >> s;
vector<bool> dp(26,false);
rep(i,int(s.size())){
dp[s[i]-'a']=true;
}
rep(i,26){
if(dp[i]==false){
cout << char('a'+i) << endl;
... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
string s;
cin >> s;
bo... | 1 | 88,356,745 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#include <fstream>
#include <cmath>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
int N, K;
ll height[305];
ll dp[305][305];
ll INF = 0x3f3f3f3f3f3f3f3f;
int main() {
cin >> N >> K;
for (int i=1; i<=N; i++){
scanf("%lld", &height[i]);
}
memset(dp, INF, sizeof(dp));
for (int i=1; i<=N;... | 1 | 27,047,127 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | #include <iostream>
using namespace std;
int main(){
long long a, b, c, k;
cin >> a >> b >> c >> k;
if(k%2LL == 0) {
cout << a-b << endl;
} else {
cout << b-a << endl;
}
return 0;
} | 1 | 83,311,792 |
#include "bits/stdc++.h"
using namespace std;
int fun(){
int A,B,C,K;
cin >> A >> B >> C >> K;
if (A > K) return K;
else if (A+B > K) return A;
else if (A+B+C > K) return A - (K - A - B);
else return A - C;
}
int main(){
cout << fun() << endl;
return 0;
} | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <cmath>
#define endl "\n"
typedef long long int ll;
typedef unsigned long long int ull;
typedef float fl;
typedef short int si;
using namespace std;
void solve()
{ int a,b,c,k; cin >> a >> b >> ... | 1 | 82,570,051 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
int n;
cin >> n;
int ans = 0;
rep(i,n+1){
int j = 0;
int cnt = 0;
while(j < n){
j++;
if(j%2 == 0) continu... | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); i < (ll)(n); i++)
#define repe(i, f, n) for (ll i = (f); i <= (ll)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i <= N; i += 2) {
int cnt = 0;
rep... | 1 | 51,806,588 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> dp(n,INT_MAX);
while(n--){
int in;
cin >> in;
*lower_bound(dp.begin(), dp.end(), in) = in;
}
cout << lower_bound(dp.begin(), dp.end(), INT_MAX)-dp.begin() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
int main(){
int n;
int a[100000];
scanf("%d", &n);
for(int i = 0; i < n; i++){
scanf("%d", a + i);
}
int dp[100000];
fill(dp, dp + n + 1, INF);
dp[0] = -1;
for(int i = 0; i < n; i++){
int* ptr =... | 1 | 83,224,984 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x, y;
int sum;
sum = 0;
for (int i = 0; i < N; i++) {
cin >> x >> y;
sum += (y - x) + 1;
}
cout << sum << endl;
return 0;
} | 1 | 86,357,629 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int N = 1e5+23;
long long a[N], b[N], c[N];
void solve() {
int x, y, z, K; scanf("%d%... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_l... | 1 | 86,665,726 |
#include <iostream>
#ifdef MBP
#include "stdc++.h"
#else
#include <bits/stdc++.h>
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define REP(i, n) for (long long int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (long long int i = 1, i##_len = (n); i <= i##_len; ++... | #include <bits/stdc++.h>
using namespace std;
using ll=long long int;
using ld=long double;
using VI=vector<ll>;
using VD=vector<ld>;
using VVI=vector<VI>;
using VC=vector<char>;
using VVC=vector<VC>;
using VS=vector<string>;
using PLL =pair<ll,ll>;
using PLD=pair<ld,ld>;
using VPLL=vector<PLL>;
#define REP(i,n) for(ll... | 1 | 59,390,363 |
#include <iostream>
int main()
{
int N, K;
std::cin >> N >> K;
int r = N % K;
std::cout << (r == 0 ? 0 : 1) << std::endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
if(a%b==0){
cout << "0" << endl;
}else{
cout << "1" << endl;
}
return 0;
} | 1 | 78,634,303 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> a(N);
rep(i,N) cin >> a[i];
ll num;
rep(i,N) {
if (i == 0) num = a[0];
num = lcm(num, a[i]);... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x%y);
}
ll lcm(ll x, ll y) {
ll g = gcd(x, y);
return x / g * y;
}
int main() {
ll N, M; cin >> N >> M;
ll *A = new ll[N];
for (in... | 1 | 55,757,470 |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n , m;
cin >> n >> m;
ll a[n][n] ,... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 1 | 73,514,551 |
#include <iostream>
#include<vector>
using namespace std;
int main() {
vector<int> a(3),b(3),c(4);
for(int i=0;i<3;i++){
cin>>a[i]>>b[i];
c[a[i]-1]++;
c[b[i]-1]++;
}
for(int i=0;i<4;i++){
if(c[i]==3){
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
return 0;
} | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... | 1 | 34,290,563 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
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<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(llint i=(a);i... | 1 | 5,994,009 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
char s;
cin >> s;
cout << (isupper(s) ? "A" : "a") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
char a;
cin >> a;
if((int)a <= 92){
cout << 'A' << endl;
}
else{
cout << 'a' << endl;
}
} | 1 | 60,471,848 |
#include<iostream>
#include<math.h>
using namespace std;
int main() {
double x1, y1, x2, y2, x3, y3, xp, yp, a, b, c, d, e, f, s1, s2, s3,s4, S1, S2, S3,S4;
while (cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp){
a = pow((pow(x1 - xp, 2) + pow(y1 - yp, 2)), 1.0 / 2);
b = pow((pow(x2 - xp, 2) + pow(y2 - yp, 2... | #include<iostream>
#include<complex>
using namespace std;
typedef complex<double> xy_t;
double cross(xy_t a, xy_t b) { return (conj(a)*b).imag(); }
double x[4], y[4];
int main()
{
while (true) {
for (int i = 0; i < 4; i++) {
cin >> x[i] >> y[i];
}
if (!cin)break;
xy_t a(x... | 1 | 55,299,712 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.