code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 44 101M |
|---|---|---|---|
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <cmath... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
using v_i = vector<int>;
using v_s = vector<string>;
const int INF = 2147483647;
int main(){
int n;
cin >> n;
v_s s(n);
v_i t(n);
int sum =0;
rep(i,n){
cin >> s[i]... | 0 | 84,284,075 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
l... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
#define REP2(i,m,n) for (int i=m;i<(n);i++)
typedef long long ll;
typedef long double ld;
int N;
void solve() {
cin >> N;
int K = 0;
int x;
for (x = 1; K < N; K += x, x += 1) ;
if (K != N) {
cout << "No\n"... | 0 | 9,342,285 |
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<set>
#include<map>
using namespace std;
int main() {
int a;
cin >> a;
if(a < 1200){
cout << "ABC";
}
else
{
cout << "ARC";
}
cout << endl;
} | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | 0 | 85,090,912 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main(){
long long int n,b=0;
cin >> n;
int a[n];
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<n-1;i++){
if (a[i+1]<a[i]){
b+=a[i]-a[i+1];
a[i+1]=a[i];
}
}
cout <... | #include <bits/stdc++.h>
#define int long long
#define double long double
#define ff first
#define ss second
#define endl '\n'
#define ii pair<int, int>
#define mp make_pair
#define mt make_tuple
#define DESYNC \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie... | 0 | 118,551 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<... | #include <iostream>
#include <vector>
#define swap(type,x,y) do{type t=x;x=y;y=t;}while(0)
using namespace std;
int main(){
int n;cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++)cin>>a.at(i);
int mymin;
int k,count=0;
for(int j=0;j<n-1;j++){
k=j;
mymin=101;
for(int i=j;i<n;i++){
i... | 0 | 5,923,175 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef map<ll,ll>::iterator itll;
typedef long double ld;
typedef map<ll,ll> mapll;
#define con continue
#define pb push_back
#define fi first
#define se second
#define fr front()
#define INF 1000000000000000000
#define all(vl) v... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <complex>
#include <cctype>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <assert.h>
#include <numeric>
#include <iomanip>
using ll = long long;
using P =... | 0 | 67,145,197 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
using vp = vector<P>;
using vpp = vector<... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,k; cin>>a>>b>>k;
for(int i=1; i<=k; i++){
if(i%2==1){
if(a%2==0){
a=a/2;
b+=a;
}
else{
a=a-1; a=a/2;
b+=a;
}
}
... | 0 | 37,549,445 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD 998244353
template<class T>inline bool chmax(T& a,T b){if (a<b){a=b;return 1;}return 0;}
template<class T>inline bool chmin(T& a,T b){if (a>b){a=b;return 1;}return 0;}
const long long INF = 1LL << 60;
bool pairCo... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;
#define re... | 0 | 23,393,422 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
long long * input_num = new long long[n];
for(int i = 0; i < n; i++) cin >> input_num[i];
long long min = input_num[0];
long long max = input_num[0];
long long sum = 0;
for(int i = 0; i < n; i++) {
if(input_nu... | #include <iostream>
using namespace std;
int main()
{
long long a = 0,b = 0,c = 0,d = 0;
long long max = 0;
cin >> a >> b >> c >> d;
max = a * c;
if (max < a * d)
max = a * d;
if (max < b * d)
max = b * d;
if (max < b * c)
max = b * c;
cout << max << endl;
} | 0 | 85,781,652 |
#include<iostream>
using namespace std;
int main() {
int a, b, c, d, e, f, g;
cin >> a >> b >> c;
if (a <= b) {
d = a;
e = b;
} else {
d = b;
e = a;
}
if (e <= c) {
f = c;
} else {
f = e;
e = c;
}
if (d > e) {
g = d;
... | #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 | 54,790,027 |
#include <iostream>
using namespace std;
int main(){
int R, G, B, N, cnt=0;
cin >> R >> G >> B >> N;
for(int r=0; r<=N; r++){
for(int g=0; N - r*R - g*G >= 0; g++){
if( (N - r*R - g*G) % B == 0 ){
cnt++;
}
}
}
cout << cnt << endl;
return 0;... | #include <iostream>
using namespace std;
int main()
{
double v0[2], v1[2], v2[2], p[2];
while (cin >> v0[0] >> v0[1] >> v1[0] >> v1[1] >> v2[0] >> v2[1] >> p[0] >> p[1])
{
double v0v1[2] = {v1[0]-v0[0], v1[1]-v0[1]},
v1v2[2] = {v2[0]-v1[0], v2[1]-v1[1]},
v2v0[2] = {v0[0]-v2[0], v0[1]-v2[1]},
v0p... | 0 | 98,039,141 |
#include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m;i<n;i++)
#define co(n) cout<<n<<endl
#define all(n) (n).begin(),(n).end()
#define pb(n,m) n.push_back(m)
#define fix(n) cout<<fixed<<setprecision(n);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<... | #include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
using n... | 0 | 91,047,672 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a, b, c;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b >> c;
int v1 = abs(a - b) + abs(a - c);
int v2 = abs(b - a) + abs(b - c);
int v3 = abs(c - b) + abs(a - c);
cout << min(min(v1, v2), v3... | #include <bits/stdc++.h>
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7... | 0 | 53,920,031 |
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#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... | #include <bits/stdc++.h>
using namespace std;
#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++)
typedef long long ll;
#define ALL(v) v.begin(), v.end()
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *min_element(ALL(v))
#define chmax(x, a) x = max(x, a... | 0 | 75,748,114 |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline void rd(int &x){
int k;
int m=0;
x=0;
for(;;){
k = getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = getchar_unlocked();
if(... | #include<bits/stdc++.h>
#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long int ll;
const ll mod=1e9+7;
ll f[2006];
int main()
{
ios;
f[0]=1;
for(int i=3;i<=2000;++i)
for(int j=3;j<=i;++j)
{
f[i]=(f[i]+f[i-j])%mod;
}
int s;
cin>>s;
cout<<f[s]<<'\n';
} | 0 | 99,996,214 |
#include <iostream>
#include <iomanip>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <bitset>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (int i = a; i < n; i++)
#define re... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
ll INF = 1ll << 60;
int main(){
int n, m;
cin >> n >> m;
vector<bo... | 0 | 78,636,349 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
const int INF = 1e9;
const int MOD = 1000000007;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
string s;
cin >> s;
int l=0;int r=s.size()-1;
int ans = 0;
while(l<r){
if(s.at(l) == s.at(r)){
++l; --r;
... | #include<iostream>
char judge(int m,int r,int f){
char grade;
int sum=m+r;
if(m==-1 || r==-1) grade='F';
else if(sum>=80) grade='A';
else if(sum>=65) grade='B';
else if(sum>=50) grade='C';
else if(sum>=30){
grade='D';
if(f>=50) grade='C';
}
else grade='F';
return ... | 0 | 94,184,746 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(x) (x).begin(),(x).end()
const int IINF = 1e9;
const LL LINF = 1e18;
const LL MOD = 1e9+7;
int main() {
int N;
cin >> N;
double k = ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
string S;
cin >> N >> S;
if(S.size() <= N){
cout << S << endl;
return 0;
} else if(N < S.size()) {
S.erase(N);
cout << S << "..." << endl;
return 0;
}
} | 0 | 14,918,443 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,a,b) for (int i = (a); i < (b); ++i)
int main(){
string s,t;
cin>>s>>t;
if(s[0]==t[2] && s[1]==t[1] && s[2]==t[0]) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in, n) for(int i=0; i<n; i++) cin>>in[i]
#define forout(out) for(int i=0; i<(int)out.size(); i++) cout<<out[i]<<" "
#define rep(i, n) for(int i=0; i<(n); i++)
int main(){
int minnum = 200050;
int cnt = 0;
int n; cin>> n;
ve... | 0 | 32,493,661 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "["; for (int i = 0; i < v.size(); ++i) { os << v[i]; if (i != v.size() - 1) os << ", "; } os << "]"; return os; }
template <typename T> void print(T v, string s = "\n") { cout << ... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define REP(i, n) for (LL i = 0; i < (LL)(n); i++)
#define REP2(i, n) for (LL i = 1; i <= (LL)(n); i++)
#define FOR(i, m, n) for (LL i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define ALL(x) ... | 0 | 73,168,329 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n, k, x, y;
cin >> n >> k >> x >> y;
int firstk = min(n, k);
int remainingnights = n - min(n, k);
cout << (long long)firstk*x + remainingnights*y;
} | #include <bits/stdc++.h>
using namespace std;
# define ll long long
# define endl "\n"
# define str string
# define vll vector<ll>
# define pb push_back
# define mll map<ll,ll>
# define mp make_pair
# define ff first
# define ss second
# define pll pair<ll,ll>
# define f(x,y) for(int x=0;x<y;x++)
int main(){
ios_ba... | 0 | 9,398,568 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define S second
#define F first
#define pb push_back
#define all(c) (c).begin(),(c).end()... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 0 | 42,302,496 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
for (int i = 100; i > 0; i /= 10) {
if (N / i == 7) {
cout << "Yes" << endl;
return 0;
}
N %= i;
}
cout << "No" << endl;
} | #include<stdio.h>
int main(void)
{
int a,b,i,j;
scanf("%d %d",&a,&b);
while(a!=0 || b!=0){
for(i=0;i<a;i++){
for(j=0;j<b;j++){
printf("#");
}
printf("\n");
}
printf("\n");
scanf("%d %d",&a,&b);
}
return 0;
} | 0 | 93,770,536 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
char a;
int count[26] = { 0 };
a = getchar();
while (a != EOF)
{
if ('a' <= a && a <= 'z')
{
count[a- 'a']++;
}
if ('A' <= a && a <= 'Z')
{
count[a- 'A']++;
}
a = getchar();
}
for (int... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
string s;
int main() {
cin >> s;
int cnt = 0;
int n ... | 0 | 14,218,587 |
#include<iostream>
using namespace std;
long long F[100000] = {};
long long f(int);
int main(){
int n;
cin >> n;
cout << f(n) << endl;
return 0;
}
long long f(int k){
if(F[k] != 0) return F[k];
else if (k <= 1) return F[k] = 1;
else{
return F[k] = f(k-1) + f(k-2);
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> an(n);
for(int i=0; i<n; ++i) cin >> an[i];
sort(an.begin(),an.end());
int ans = 0;
for(int i=0; i<n; ++i){
if(i == 0 && an[i] > 0) ans -= an[0];
else if(i == n-1 && an[i] < 0) ans += an[n-1];
else ans += a... | 0 | 40,147,908 |
#include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define range(i,l,h) for(int i=l;i<h;i++)
#define endl '\n'
#define I INT_MAX
#define L INT_MIN
#define pb push_back
#define ll long long
#define ull unsigned long long
#define vi vector<int>
using namespace std;
using std::ios;
... | #include <bits/stdc++.h>
using namespace std;
#define rp(i, k, n) for (int i = k; i < n; i++)
using ll = long long;
using ld = double;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return ... | 0 | 50,525,811 |
#include<iostream>
#include<string>
#include<stack>
using namespace std;
int main(){
string a;
while(getline(cin,a)){
if(a[0]=='.')break;
stack<char> b;
int c=0;
for(int i=0;i<a.size();i++){
if(a[i]=='['||a[i]=='(')b.push(a[i]);
if(a[i]==']'||a[i]==')'){
if(b.empty())c++;
... | #include <iostream>
using namespace std;
int main() {
int a[5+1];
for (int i = 1; i <= 5; i++)
cin >> a[i];
for (int j = 2; j <= 5; j++) {
int key = a[j];
int i = j-1;
while (i >= 1 && a[i] < key) {
a[i+1] = a[i];
i--;
}
a[i+1] = key;
}
for (int i = 1; i < 5; i++) {
cout << a[i] << " ";
}
co... | 0 | 89,374,634 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s; cin >> s;
set<char> u;
string ans = "no";
int sn = s.size();
rep(i,sn) u.insert(s[i]);
if (u... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) x.begin(),x.end()
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define N 100010
ll n,a[N],b[N],s[N];
int main(){
cin>>n;
for(i... | 0 | 69,780,296 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> h(n), dp(n);
for(int i = 0; i < n; i++) cin >> h[i];
dp[1] = abs(h[1] - h[0]);
for(int i = 2; i < n; i++){
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
struct SegmentTree {
int n;
vector<int> dat;
SegmentTree(int n_) {
n = 1;
while (n < n_) n *= 2;
dat.resize(2*n-1, INF);
}
void up... | 0 | 88,634,446 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m; cin >> n >> m;
vector<vector<int>> s(m);
for (int i = 0; i < m; i++) {
int k; cin >> k;
for (int j = 0; j < k; j++) {
int x; cin >> x;
x--;
s[i].push_back(x);
}
}
vector<int> p(m);
for (int i = 0; i < m; i++)... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<V... | 0 | 35,213,741 |
#include <bits/stdc++.h>
#include<numeric>
#include<cstdlib>
#include <iostream>
#define ll long long int
#define all(x) x.begin(),x.end()
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define v vector<long long int>
#define vv vector< int>
#define gcd(m,n) __gcd(m,n)
#define vp vector<... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo LLONG_MAX
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool... | 0 | 16,515,944 |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
int main(){
int a, b, c;
cin >> a >> b >> c;
int fi, se, th;
if(a > b){
if(b > c){
fi = a;
se = b;
... | 0 | 89,626,671 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define io ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define clr(v) v.clear()
vector<ll>v;
pair<ll,ll>p;
map<ll,ll>mp;
set<ll>st;
deque<ll>dq;
priority_queue<ll>pq;
#define f(i,b) for(i=0;i<b;i++)
#define f1(i,b) for(i=1;i<... | #include "bits/stdc++.h"
using namespace std;
#define rep(i,a,n) for(ll i=a;i<n;i++)
#define ALL(s) s.begin(),s.end()
#define P pair<ll,ll>
#define vl vector<ll>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vvl vector<vector<ll>>
#define print(n) cout<<n<<endl
const int M=100010;
const int MOD=100000000... | 0 | 32,092,187 |
#include<iostream>
#include<cmath>
#include<math.h>
using namespace std;
int main(){
double a,b,c;
cin >> a >> b >> c;
cout << fixed << 0.5*a*b*sinf(c*M_PI/180) << endl;
cout << fixed << a + b + sqrt(pow(a, 2) + pow(b, 2) - 2*a*b*cosf(c*M_PI/180)) << endl;
cout << fixed << b*sin(c*M_PI/180) << endl;... | #include<bits/stdc++.h>
#include<cmath>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pii;
const int inf = 0x3f3f3f3f,oo = inf;
#define pi 3.14159265358979323846
#define IL inline
#define RG register
#define rep(i,a,b) for(RG int i=(a);i<(b);++i... | 0 | 81,169,205 |
#include "bits/stdc++.h"
using namespace std;
#define int long long
int mod=1e9+7;
signed main(){
int n;
cin>>n;
int a=0;
int b=0;
for(int i=0;i<n;i++){
string s,t;
cin>>s>>t;
if(s>t)a+=3;
if(s<t)b+=3;
if(s==t)a++,b++;
}
cout<<a<<" "<<b<<endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <climits>
#include <bitset>
#include <cmath>
#include <queue>
#include <set>
using namespace std;
using ll = long long int;
const ll MOD = 1e9 + 5;
ll mod_pow(ll k, ll p)
{
if (k == 0)
{
return 1 % p;
... | 0 | 90,963,804 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int N,D,rs=0;
double wa=0,ans=0;
int digi=0;
cin >> N >> D;
vector<vector <int>> X(N,vector<int>(D));
for(int i = 0;i < N;i++)
for(int j = 0;j < D;j++){
cin >> X.at(i).at(j);
}
for(int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, int> piipi;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define e... | 0 | 98,935,372 |
#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long int> v(n, 0);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
vect... | #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pii = pair<int,int>;
... | 0 | 6,848,777 |
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#define all(c) (c).begin(),(c).end()
using namespace std;
int main(void){
int n;
while(cin >> n,n){
vector<int>a(n);
for(int i=0;i<n;i++)cin >> a[i];
sort(all(a));
int ans = 1<<29;
for(int i=0;i+1<n;i++)
ans = min(ans,... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
#define vi vector<int>
#define vvi vector<vi>
#define vpii vector<pii>
#define vpipii vector<pipii>
#define vpiipi vector<piipi>
#define pb push_back
#define pob pop_back
#define pii pair<int,int>
#define pipii pair<int,pii>
... | 0 | 17,457,900 |
#include <stdio.h>
int x[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int main(){
int a;
scanf("%d",&a);
printf("%d",x[a-1]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define DEBUG(x) std::cerr << #x << " : " << (x) << std::endl;
int dx... | 0 | 36,336,710 |
#include<bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
int a,b,c; cin>>a>>b>>c;
if (a==b&&b==c&&c==a) cout<<"Yes";
else cout<<"No";
return 0;
} | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
typedef pair<int,int> PII;
typedef long long LL;
const int inf=(1<<30),N=100010;
int n,m;
deque<PII> q;
inline int in()
{
char ch=getchar();
int f=1,tmp=0;
while(ch<'0'||ch>'9') {if(ch=='-') f=-1;c... | 0 | 92,748,744 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
int main(){
int n, k; cin>>n>>k;
string s; cin>>s;
vector<pair<int,int>> a(1,{1,0});
for(auto i:s){
if(a.back().first==i-'0') a.back().second++;
else a.push_back({i-'0',1});
}
if(a.back().first==0) a.push_back({1,0});
d... | #include <stdio.h>
#include <iostream>
using namespace std;
int main(){
int N;
scanf("%d", &N);
int t, x, y;
int t_pre = 0, x_pre = 0, y_pre = 0;
for(int i = 0; i < N;i++){
scanf("%d %d %d", &t, &x, &y);
if(!((t - t_pre >= abs(x - x_pre)+ abs(y... | 0 | 44,266,845 |
#include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (int i = 0; i < n; i++)
#define IREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(a, b) for (int i = a; i < b + 1; i++)
#define all(v) v.begin(), v.end()
#define SENTINEL 2000000000
#define NIL -1
using namespace std;
typedef long long ll;
const ll IN... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define vi vector<int>
#define inf (int)(1e9+7)
#define mod (ll)(1e9+7)
#define eps 1e-10
#define eb emplace_back
#define F first
#define S second
#define SZ(x) ((int)(x).size())
#define all(v) v.begin(), v.end()
#define ios c... | 0 | 36,555,750 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int>A(N);
for (int i=0; i<N; i++)cin>>A[i];
int MAX=A[0];
int cnt=0;
for (int i=0; i<N; i++){
if (MAX<A[i])MAX=A[i];
if (MAX<=A[i])cnt++;
}
cout<<cnt<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
bool custom1 (pair<int, int> a, pair<int, int> b) {
return (a.first < b.first);
}
bool custom2(pair<int, int>... | 0 | 61,297,412 |
#include <iostream>
#include <cmath>
#include <iomanip>
double distanceBetweenPoints(double x1, double y1, double x2, double y2) {
return std::sqrt(std::pow((x2 - x1), 2) + std::pow((y2 - y1), 2));
}
int main() {
double x1, y1, x2, y2;
std::cin >> x1 >> y1 >> x2 >> y2;
std::cout << std::setprecision(12) << std:... | #include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <complex>
#include <string>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#includ... | 0 | 27,450,878 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int S, W;
bool ans = true;
cin >> S >> W;
if(W >= S)
ans = false;
if(ans) cout << "safe" << "\n";
else cout << "unsafe" << "\n";
return 0;
} | #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
void debug(int k){
cout << k << endl;
}
int A[2000001],B[2000001];
int C[10002];
int main(){
int n;
int max = 0;
cin >> n;
for (int i = 0; i < 10002; i++) {
C[i] = 0;
}
for (int i = 0; i < n; i++) {
... | 0 | 56,942,206 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,ll>
con... | #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 | 41,148,941 |
#include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
vector<lon... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
int main()
{
char str[200];
scanf("%s", str);
int n = strlen(str);
for (int i = n - 2; i; i -= 2) {
... | 0 | 80,662,278 |
#include <cstring>
#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 <queue>
#include <c... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 88,515,741 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define Mid ((l+r)/2)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define drep(i,a,b) for(int i=(a);i>=(b);--i)
#define file(a) freopen(#a".in","r",stdin),freopen(#a".out","w",stdout);
const int maxn=3e5+5,mod=1e9+7,inf=0x3f3f3f3f;
int n,... | #include <bits/stdc++.h>
using namespace std;
class mint {
int value;
public:
static const int MOD = 1000 * 1000 * 1000 + 7;
mint(long long x)
: value(x % MOD) {}
mint operator+(mint y) const {
return mint(value + y.value);
}
mint operator+=(mint a) {
return *this = *this + a;
}
mint opera... | 0 | 87,714,664 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll INF = 1LL << 60;
ll ans = INF;
int main()
{
ll n , k ;
cin >> n >> k ;
vector<ll> h(n+1);
rep(i, n){
cin >> h[i+1];
}
vector<vector<ll>> dp(n-k+1, vector<ll>(n+1,INF) );
dp[0][0]=0;
rep(i,n... | #include "bits/stdc++.h"
using namespace std;
const int MOD = 1e9 + 7;
typedef long long lint;
const int INF = 1e7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, k, n) for (int i = (k); i < (int)(n); ++i)
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define all(x) (x).begi... | 0 | 29,503,515 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | #include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define setbits(x) __builtin_popcount(x)
#defin... | 0 | 78,608,733 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
#define REP2(i,m,n) for (int i=m;i<(n);i++)
typedef long long ll;
typedef long double ld;
int N;
void solve() {
cin >> N;
int K = 0;
int x;
for (x = 1; K < N; K += x, x += 1) ;
if (K != N) {
cout << "No\n"... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N , M;
cin >> N;
vector <string> s (N);
vector <string> t (M);
int num_max=0, num_now=0;
for(int i = 0;i < N; i++){
cin >> s.at(i);
}
cin >> M;
for(int i = 0;i < M; i++){
cin >> t.at(i);
}
for(int i=0;i < N; i++){
num_now... | 0 | 5,938,454 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x = N;
while (x >= 0) {
if (x % 4 == 0) {
cout << "Yes" << endl;
return 0;
};
x -= 7;
}
cout << "No" << endl;
return 0;
} | 0 | 55,671,874 |
#include <bits/stdc++.h>
using namespace std;
#define sws ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INFINITO 1000000000
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end(... | #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 | 17,896,897 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int dx = x2 - x1, dy = y2 - y1;
cout << x2 - dy << ' ' << y2 + dx << ' ' << x1 - dy << ' ' << y1 + dx << endl;
return 0;
} | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#define MAX 1000001
using namespace std;
class element{
private:
int key;
element *next;
element *previous;
public:
element(int K,element *N,element *P){
key = K;
next = N;
previous = P;
}
int getKey(){
return key;
}
element(int K){
key = K;
... | 0 | 93,480,182 |
#include<bits/stdc++.h>
#define lint long long
#define st first
#define nd second
#define INF 0x3f3f3f3f
#define MOD 1000000007
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n, m; cin>>n>>m;
vector<lint> b(n+1,1);
vector<lint> pd(n+1,1);
pd[0] = 1;
for(int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n,m,ans=0;
cin >> n >> m;
vector<vector<long>> p(n,vector<long>(3));
for(long i=0;i<n;i++) cin >> p[i][0] >> p[i][1] >> p[i][2];
for(long i=0;i<8;i++) {
vector<long> psum(n);
for(long j=0;j<n;j++) {
if(i&1) psum[j]+=p[j][0];
... | 0 | 74,249,588 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,h,g,br=0;
cin >> h >> n;
for (int i=0;i<n;i++)
{
cin >> g;
br+=g;
}
if(br>=h)
cout << "Yes";
else
cout << "No";
} | #include<iostream>
#include<vector>
#include <string>
#include <map>
#include <algorithm>
#include <cmath>
using namespace std;
vector<int> digit(int num, int n){
vector<int> v(n, 0);
for(int i =0 ; i < n; i++){
v[i] = num%2;
num /= 2;
}
return v;
}
int main(){
int n, m;
cin >> n... | 0 | 69,151,886 |
#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;
void solve() {
long double N, K;
cin >> N >> K;
long double ans;
ans = 0;
for (int i = 1; i <= N; i++)
{
if (i < K)
{
ans += powl(0.5, ceil(log2(K/i)));
}
else
{
ans += 1;
}
... | 0 | 15,993,862 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string N;
cin >> N;
if (N.at(1) == N.at(2))
{
if (N.at(0) == N.at(1) || N.at(2) == N.at(3))
{
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()
#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for(int i = ... | 0 | 13,613,694 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
const int MOD=1e9+7;
ll bi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < n; i++)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
int main() {
string S; cin >> S;
... | 0 | 63,601,050 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <tuple>
#include <random>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_wi... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll W,H; cin >> W >> H;
ll a = W+1;
ll b = H+1;
vector<pair<ll,ll>> edge;
for(int i = 0; i < W; i++){
ll p; cin >> p; edge.push_back({p,1});
}
for(int j = 0; j < H; j++){
ll q; cin >> q; edge.push_back({q,2});
}
sor... | 0 | 6,726,319 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for(int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for(int i = ((int)(n)... | #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>... | 0 | 97,149,776 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,av;
cin>>a>>av;
cout<<2*av-a;
} | #include<bits/stdc++.h>
using namespace std;
void solve()
{
int dp[3][3];
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
cin>>dp[i][j];
}
}
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
for(int i=0;i<n;i++)
{
for(i... | 0 | 44,631,007 |
#include<iostream>
#include<set>
int main(void){
int n, m;
std::cin >> n >> m;
std::multiset<int> as;
for(int i = 0; i < n; i++){
int a;
std::cin >> a;
as.insert(a);
}
for(int i = 0; i < m; i++){
auto max = std::next(as.end(), -1);
int redu = *max / 2;
... | #include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#def... | 0 | 34,047,628 |
#include <iostream>
using namespace std;
int main(){
int h,w;
while(1){
cin >> h >> w;
if(h==0 && w==0) break;
else{
for(int i=0;i<w;i++){
cout << "#";
}
for(int j=0;j<h-2;j++){
cout << "\n#";
for(int k=0... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) ... | 0 | 55,415,467 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<vector<int>> s(m,vector<int>());
for(int i=0;i<m;i++){
int k;
cin>>k;
for(int j=0;j<k;j++){
int a;
cin>>a;
a--;
s[i].push_back(a);
... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9+7;
const long long MAXN = 1e5+5;
long long arr[MAXN];
long long arr2[MAXN];
long long dp[MAXN];
long long dp2[MAXN];
int main(){
long long n,m;
cin>>n>>m;
for(long long i=1;i<=n;i++){
cin>>arr[i];
}
d... | 0 | 86,706,397 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n), b(n);
for(int i = 0; i < n; i++) a[i] = (n+1)*(i+1);
for(int i = 0; i < n; i++) b[i] = (n+1)*(n-i);
vector<int> r(n);
for(int i = 0; i < n; i++){
int x; cin >> x;
r[x-1]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define each(i,c) for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(a, n) memset(a, n, sizeof(a))
typed... | 0 | 19,827,565 |
#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 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int 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
#de... | 0 | 53,526,180 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N, M, X, Y;
cin >> N >> M >> X >> Y;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define For(i, a, b) for(int i = (a); i < (b); ++i)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
typedef vector<int> vint;
typedef vector<long long> vlint;
typedef vector<string> vstr;
typedef vector<char> vchar... | 0 | 16,820,987 |
#include <iostream>
using namespace std;
int main(void) {
string A,B;cin>>A>>B;
if (A < B) cout << "<" << endl;
else if (A > B) cout << ">" << endl;
else cout << "=" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin >> n >> k;
vector<int> a(n+1);
for ( int i=0; i<n; i++ ) {
cin >> a[i];
}
for ( int i=0; i<k; i++ ) {
vector<int> b(n+1);
for ( int i=0; i<n; i++ ) {
int l=max(0,i-a[i]);
int r... | 0 | 63,838,889 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int m;
cin>>m;
ll sum=0,dig=0;
rep(i,m){
int d;
ll c;
cin>>d>>c;
s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string> ... | 0 | 50,802,636 |
#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... | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_... | 0 | 100,874,289 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <iostream>
#include <string.h>
using namespace std;
class LCS{
private:
char x[1000 + 1];
char y[1000 + 1];
int lcs[1000][1000];
public:
LCS(const char x[], const char y[]);
int calcLCS();
int calcLCS(int i, int j);
};
LCS::LCS(const char x[], const cha... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define dunk(a) cout << (a) << "\n"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
cons... | 0 | 64,925,516 |
#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(... | #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 | 20,233,928 |
#include <iostream>
#include <string>
using namespace std;
void test();
string ReverseStr(string str);
int main(void)
{
test();
return 0;
}
void test()
{
string s;
cin >> s;
s = ReverseStr(s);
cout << s << endl;
}
string ReverseStr(string str)
{
string s;
int i, t;
s = str;
for (i = 0,t = str.size() - 1; i < ... | #include <iostream>
#include <iosfwd>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cassert>
#include <cctype>
#include <climits>
#include <vector>
#include <bitset>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <deque>
... | 0 | 44,737,454 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char x, y; cin >> x >> y;
if (x<y) cout << '<';
if (x>y) cout << '>';
if (x==y) cout << '=';
return 0;
} | #include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <cstdio>
using namespace std;
#define prev prev55
long long n, a[500], ss;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
long long fh = 1e18;
for (int i = 0; i < ... | 0 | 72,746,679 |
#define ll long long
#define dn double
#define mp make_pair
#define pb push_back
#define se second
#define fi first
#define mod 1000000007
#define sob(v) v.begin(),v.end()
#define sobr(v... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
double ans = 0;
rep(i, n)
{
double x;
string u;
cin >> x >> u;
if (u == "BTC")
x *= ... | 0 | 60,278,526 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i< i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formin=(b);i>=i##formin;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz... | #include <iostream>
using namespace std;
int main(){
int a,b,c,m,i,g,h;
cin>>a>>b>>c;
i=0;
for(m=1;m<=c;m++){
if(c%m==0){
g=m;
if(a<=g && b>=g){
h=i+1;
i=h;
}
}
... | 0 | 28,953,544 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, ans = 1;
cin >> N;
vector<int64_t> A(N + 1), MA(N + 1), MI(N + 1);
for (int i = 0; i <= N; i++)
{
cin >> A.at(i);
}
MA[N] = MI[N] = A[N];
for (int i = N - 1; i >= 0; i--)
{
MI[i] = (MI[i + 1] + 1) / 2 + A[i];
MA[i] = MA[... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,m;
... | 0 | 98,956,738 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll ans = 0;
int main()
{
ll n ;
cin >> n ;
vector<ll> a(n);
ll su=0;
rep(i, n){
cin >> a[i];
su^=a[i];
}
rep(i,60){
if(su>>i & 1LL){
ans+=1LL<<i;
}
}
rep(i,n){
a[i]=(a[i]|ans)^ans;
}
ll s... | #include <iostream>
using namespace std;
int main(void){
int N,A,B,C,X,Y[100];
while(cin>>N>>A>>B>>C>>X){
if(N==0 && A==0 && B==0 && C==0 && X==0) break;
for(int i=0; i<N; i++)
cin>>Y[i];
int Cn=0;
for(int i=0; i<=10000; i++){
if(Y[Cn]==X) Cn++;
... | 0 | 84,606,113 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N;
string S;
cin >> N;
cin >> S;
vector<int> a(N);
for (int i = 0; i < N; i++) {
if (S[i] == 'R') a[i] = 0;
if (S[i] == 'G') a[i] = 1;
if (S[i] == 'B') a[i] = 2;
}
vector<long long> count(3, 0);
for (int i =... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db double
#define ld long double
#define str string
#define pi pair
#define tup tuple
#define vec vector
#define temp template
#define tn typename
#define ff first
#define ss second
#define SZ(x) (ll) x.size()
#def... | 0 | 87,291,983 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main()
{
double a, b, x;
cin >> a >> b >> x;
x /= a;
double ans;
if (x <= a * b / 2.0)
ans = M_PI_2 - atan(2.0 * x / (b * b));
else
a... | #include <iostream>
#include <iomanip>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <bitset>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define rep... | 0 | 40,612,836 |
#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng... | #include<bits/stdc++.h>
using namespace std;
long long ara[2003][2003],tra[2003][2003],val[2003],tal[2003];
long long mod=1000000007;
int main()
{
long long n,m,i,j,k,x,y,z,p,q,r,a,b=1;
scanf("%lld %lld",&n,&m);
for(i=1;i<=n;i++)
{
scanf("%lld",&a); val[i]=a;
}
for(i=1;i<=m;i++)
{
... | 0 | 62,181,562 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef complex<double> Vec;
ll N;
vector<Vec> Vs;
const double EPS = 1e-10;
double R;
ll classify(Vec v, Vec w) {
Vec dotcross = conj(v) * w;
double dot = dotcross.real(), cross = dotcross.imag();
return cross > EPS ? 0 : -cross > EPS ? 1 : dot ... | #include<bits/stdc++.h>
using namespace std;
int getMaxPoint(vector<int> v,int &p){
int point=INT_MIN,act=-1;
for(int i=0;i<3;i++){
if(i==p)
continue;
if(v[i]>point){
point=v[i];
act=i;
}
}
p=act;
return point;
}
int main(){
int n;
cin>>n;
vector<vector<int> >... | 0 | 66,020,838 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
void solve(){
int d; cin >> d;
string s = "Christmas";
for(int i = d; i < 25; i++){
s += " Eve";
}
cout << s << endl;
return;
}
int main(){
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | 0 | 11,259,404 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#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; i >= n; --i)
#define ALL(v) (v).begin(),(v... | #include<stdio.h>
int main()
{
int N, i, j, test;
unsigned long long mul;
long long A[100001], tt=1000000000000000000;
scanf("%d", &N);
mul=1;
test=1;
for(i=1; i<=N; i++){
scanf("%lld", &A[i]);
}
for(i=1; i<=N; i++){
if(A[i]==0){
test=0;
break;... | 0 | 30,413,763 |
#include <iostream>
using namespace std;
char conv[128];
void make() {
for(int i = 0; i < 128; ++i) conv[i] = i;
}
main() {
int n, m;
while((cin >> n) && n) {
make();
for(int i = 0; i < n; ++i) {
char a, b;
cin >> a >> b;
conv[a] = b;
}
cin >> m;
for(int i = 0; i < m; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e6;
int V,E;
vector<vector<long long int>> d;
int main(){
cin >> V >> E;
d.assign(V, vector<long long int>(V, INF));
for (int i=0; i<V; i++){
d[i][i] = 0;
}
vector<int> a(E), b(E), c(E);
for (int i=0; i<E; i++){
... | 0 | 36,525,531 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string s; cin >> s;
string a,b;
for(int i = 0; i < s.size(); i++){
if(i < s.size() / 2){
a.push_back(s[i]);
}
if(i > s.size()/ 2){
b.push_back(s[i]);
}
}
for(int i = 0; i < s.size() / 2; i++){
if(s[i] != s[s.size(... | #include<bits/stdc++.h>
#define LL long long
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPA(i,n) for(int i=1;i<(n);++i)
#define PII pair<int,int>
#define PLI pair<long long, int>
#define PLL pair<long long, long long>
#define MOD ((int)1e6 + 3)
#define INF ((int)1e9)
#define INFLL ((LL)1e18)
#define ALL(x) (x).be... | 0 | 14,985,017 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,n) for(int i=(a); i<(n); i++)
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using P = pair<int ,int>;
const int INF = 1e9;
const int MOD = 1e9+... | 0 | 6,653,563 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 100000000... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
int t = 0;
if (n % 2)
{
for (int i = n-1; i >= 0; i-=2 )
{
b[t] = a[i];
t++;
}
... | 0 | 34,486,492 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <ra... | 0 | 63,205,010 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
type... | #include <bits/stdc++.h>
#define DAYS 5000000000000000
using namespace std;
int main(void){
string s;
long long int k, tmp, cnt = 0;
cin >> s >> k;
for (int i=0; i<s.size(); i++){
if (s[i] == '1') cnt++;
else{
for (int j=1; j<=DAYS; j++){
tmp = pow(s[i] - '0',... | 0 | 94,328,675 |
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve(const int n, const int m, ll x, vector<ll> c, vector<vector<ll>> a) {
const int bit = 1 << n;
ll res = -1;
for(int i=0; i< bit; i++) {
ll cost = 0;
vector<ll> temp(m, 0);
for(int j=0;j<n;j++) {
if(i & (1 << j)) {
cost +... | 0 | 79,015,406 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
string S; cin >> S;
string k = "keyence"... | #include "bits/stdc++.h"
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll =long long;
using P =pair<int,int>;
int main(){
int n;
cin >> n;
vector <int> w(n);
vector <int> wa(n);
int wa2=0;
rep(i,n){
cin >> w[i];
wa2+=w[i];
wa[i]=wa2;
}
int ... | 0 | 34,487,152 |
#pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for ... | #include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | 0 | 71,750,624 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define For(i,j,k) for(int i=j;i<=k;++i)
#define Dow(i,j,k) for(int i=k;i>=j;--i)
#define ll long long
#define inf 1e8
using namespace std;
inline ll read()
{
ll t=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
while... | #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
ll N, M;
int main(){
cin >> N >> M;
priority_queue<ll> A;
rep(i, N) {
ll a;
cin >> a;
A.push(a);
}
while(M) {
ll a = A.top();
A.pop();
A.push(a/2);
M--;
}
... | 0 | 82,722,779 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> H(N);
for(int i = 0; i < N; i++) {
cin >> H[i];
}
int ans = 0;
if(N > 1) {
for(int i = 0; i < N - 1; i++) {
int count = 0;
for(int j = 0; j < N - i - 1; j++) {
if(H[i + j] >= H[i +... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
cin >> N;
vector<string> B(N);
vector<string> R(M);
map<string,int> ans;
for(int i=0; i<N; i++){
string s; cin >> s;
if(ans.count(s)){
ans.at(s)++;
}else{
ans[s] = 1;
}
... | 0 | 10,576,817 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int K, A, B;
cin >> K >> A >> B;
int ans = 0;
for (int i=A ; i<=B ; i++){
if (i%K == 0){
ans = 1;
break;
}
}
if (ans == 1)
cout << "OK" << endl;
else
cout << "NG" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
struct edge {
int i, j, w;
};
int main() {
int n, m;
cin >> n >> m;
vector< vector<int> > d(n, vector<int>(n, 1001));
vector<edge> es(m);
rep(i, m) {
cin >> es[i].i >> es[i].j >> es[i].w;
}
for (auto ee... | 0 | 67,106,081 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);
int N;
int K;
int a = 0;
long long int sum = 0;
cin>>N;
cin>>K;
int arr[N];
for(int i = 0;i < N;i++){
cin>>arr[i];
}
sort(arr,arr + (N),greater<int>());
for(int i = 0;i <= N && i < K;i++){
... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, co... | 0 | 42,264,816 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#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, begin, end) for (int i = begin; i >= end; i--)
templa... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
using Graphl = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i+... | 0 | 41,317,483 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.