code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template<class T> i... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 14,111,290 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char s[4];
scanf("%s", s);
map <char, int> freq;
for(int i = 0; i < 4; i++){
freq[s[i]]++;
if(freq[s[i]] >= 3)
return puts("No"), 0;
}
for(auto x : freq){
if(x.second != 2)
return puts("No")... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
const double p... | 0 | 19,041,414 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a.at(i);
}
int count=1;
int ans=0;
for(int i=0; i<n; i++){
if(a.at(i) == count){
count++;
}
else{
... | #include <stdio.h>
#include <iostream>
using namespace std;
int N,R, inner;
int main(){
cin >> N >> R;
if (N<10){
inner = R+ 100*(10-N);
cout << inner;
}else {
cout << R;
}
} | 0 | 20,004,844 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1LL<<60;
const double PI = acos(-1);
int main(int, char**) {
double a, b, x; cin >> a >> b >> x;
double angle;
if (2 * x > a * a * b) {
angle = atan(2 * (a*a*b - x) / (a*a*a)) * (180/PI);
} else {
angle... | #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... | 0 | 88,816,556 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using int64 = int64_t;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, n;
cin >> h >> n;
int mx = h + 10010;
const int INF = (int)1e9;
vector<int> dpOld(mx, INF), dpNew(mx, INF);
dpOld[0] = 0;
wh... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = long long;
using ld = long double;
#define vl vector<long long>
#define vvl vector<vector<long long>>
#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++)
using pll = pair... | 0 | 790,732 |
#include <iostream>
using namespace std;
int main(){
int X;
cin >> X;
int i=1;
while(360*i % X != 0){
i++;
}
cout << 360*i / X << endl;
} | #include<iostream>
#include<bits/stdc++.h>
#define rep(i,n) for(i=0;i<n;i++)
#define pb push_back
#define lli long long int
#define all(v) (v.begin(),v.end())
#define fr first
#define sc second
#define mp make_pair
using namespace std;
int k=pow(10,9)+7;
int main()
{
int n,m,i,j;
cin>>n>>m;
char a[n][m];
... | 0 | 84,550,343 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(ll i=1;i<=n;i++)
#define repk(i,m,n) for(int i=m;i<n;i++)
#define MotoHaiyaku ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef u... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define per(i, n) for (int i = (n)-1; i > -1; i--)
#define reps(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define sper(i, s, n) for (int i = (s); i >= (int)(n); i--)
using namespace std;
using ll = long long;
using... | 0 | 6,642,699 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
a += b, c += d;
if(a > c) cout << "Left" << endl;
else if(a == c) cout << "Balanced" << endl;
else cout << "Right" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m; cin >> n >> m;
vector<vector<int>> ab(m+1);
for(int i = 0; i < n; i++){
int a, b; cin >> a >> b;
if(a > m) continue;
ab.at(a).push_back(b);
}
priority_queue<int> que;
int ans = 0;
for(int i = 1; i <= ... | 0 | 49,723,463 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
int main()
{
int n;
int w[110];
cin>>n;
rep(i,n)cin>>w[i];
int csum[110];
csum[0]=0;
reps(i,n+1)csum[i]=csum[i-1]+w[i-1];
int min=200;
reps(i,n)... | #include <iostream>
#include <cstdlib>
#include <vector>
int main(void) {
int N;
int A;
int B;
int C;
int X;
int next_X;
int Y;
int next_Y;
int flame_num;
std::cin >> N;
while (N != 0) {
Y = -2;
flame_num = 0;
std::cin >> A >> B >> C >> X;
for ... | 0 | 32,263,922 |
#include <iostream>
#include <algorithm>
#include <vector>
int main()
{
std::vector<int> Numbers;
for(std::size_t i = 0; i < 5; ++i){
int n;
std::cin >> n;
Numbers.push_back(n);
}
std::sort(Numbers.begin(), Numbers.end(), std::greater<int>());
for(std::size_t i = 0; i < Numbe... | #include<cstdio>
#include<cstring>
int main(){
char s[100];
char p[99];
char ss[10000];
scanf("%s %s", s,p);
strcpy(ss,s);
strcat(ss,s);
if (strstr(ss, p)) printf("Yes\n");
else printf("No\n");
return 0;
} | 0 | 76,176,732 |
#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 t, x;
cin >> t >> x;
double ans = (double)t / x;
printf("%.10f\n", ans);
return 0;
} | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 95,522,657 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
ll MOD = po... | #include<bits/stdc++.h>
using namespace std;
#define sf(a) scanf("%d",&a)
#define sff(a,b) scanf("%d%d",&a,&b)
#define sfff(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define sffff(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d)
#define sl(a) scanf("%lld",&a)
#define sll(a,b) scanf("%lld%l... | 0 | 88,915,450 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string str;
while(cin>>str,str!="#"){
bool flag=true;
int co=0;
switch(str[0]){
case 'a':
case 'q':
case 'z':
case 'x':
case 's':
case 'w':
case 'e':
case 'd':
case 'c':
case 'v':
case 'f':
case 'r':
cas... | #include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#includ... | 0 | 77,098,450 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <climits>
#define DEBUG if(false)
using namespace std;
int main(){
vector<int> A(3);
cin >> A[0] >> A[1] >> A[2];
sort(A.begin(), A.end());
cout << abs(A[0] - A[1]) + abs(A[2] - A[1]) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long int
#define mod 1000000007
#define deb(x) cout ... | 0 | 79,992,502 |
#include <stdio.h>
#include <math.h>
#include <string.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
int main(){
int len;
char s[1010];
while(1){
int ans=0;
scanf("%s",s);
len=strlen(s);
if(len==1 && s[0]=='0') break;
rep(i,0,len){
ans+=s[i]-'0';
}
printf("%d\n",ans);
}
return 0;
} | #include <bits/stdc++.h>
#define DEBUG_ENABLED 0
typedef long long int ll;
int main()
{
using namespace std;
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<pair<int, int>> ab;
for (int i = 0; i < M; i++)
{
int a, b;
cin >> a >> b;
pair<in... | 0 | 49,281,852 |
#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;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main()
{
int n, m;
cin >> n;
m = n + 1;
int a[m], b[n];
rep(i, m) cin >> a... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9 + 7;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
int dx[] = {0, 0, -1, 1};
int dy[]... | 0 | 25,547,169 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
const int MOD=1000000007;
int INF=100100100100100;
map<int,int> ma;
int beki[200010]... | 0 | 42,182,551 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int X, Y, A, B, C;
cin >> X >> Y >> A >> B >> C;
vector<pair<ll, ll>> apple;
ll tmp;
rep(i, A) {
cin >> tmp;
apple.push_back(make... | #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 drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
#define ii(x) int x; cin >> (x)
#define ii2(x, y) int x, ... | 0 | 87,453,622 |
#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() {
string S, T;
cin >> S >> T;
int A, B;
cin >> A >> B;
string U;
cin >> U;
if (U == S)
--A;
else
--B;
cout << A << ... | #include <stdio.h>
int main(){
int arr[3][3];
int arr1[3][3] = {};
int n;
for(int i = 0 ; i < 3 ; i++){
for(int j = 0 ; j < 3 ; j++){
scanf("%d", &arr[i][j]);
}
}
scanf("%d", &n);
int b[n];
for(int i = 0 ; i < n ; i++){
scanf("%d", &b[i]);
}
for(int i = 0 ; i < n ; i++){... | 0 | 33,799,788 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#de... | #include<bits/stdc++.h>
#include<cstring>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define umapii unordered_map<int,int>
#define ps(x,y) fixed<<setprecision(y)<<x
#define arr(a,n) int n... | 0 | 47,946,843 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <random>
#include <chrono>
#include <queue>
#include <ctime>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll,... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typed... | 0 | 91,224,989 |
#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 N;
cin >> N;
ll num = 0;
for(ll i = 1; i <= N; i++) {
if(to_string(i).size() % 2 == 1) {
num++;
}
}
cout << num << endl;
} | #include<iostream>
#include<string>
using namespace std;
long long pow(long long x,long long n){
long long re=1;
for(int i=0;i<n;i++)re*=x;
return re;
}
int main(){
int k=0;
while(k<10){
cout<<"? "<<pow(10,k+1)<<endl;
cout.flush();
string ans;
cin>>ans;
if(ans=="N")break;
k++;
}
if(k==10){
k=0;
w... | 0 | 38,937,948 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef vector<int> vi;
typedef pair<int,int> pii... | 0 | 90,065,593 |
#include<bits/stdc++.h>
typedef long long int ll;
#define ull unsigned long long int
#define lld long double
#define endl "\n"
#define fi first
#define sec second
#define sp setprecision
#define lb lower_bound
#define ub upper_bound
#define For(i, a, b) for(long long int i = (a); i <= (b); i++)
#define Forr(i, a, b)... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | 0 | 100,505,255 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> h(n);
for(int i=0; i<n; i++) cin >> h[i];
int est = h[0];
int ans = 1;
for(int i=1; i<n; i++){
if(est <= h[i]){
est = h[i];
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
struct Atack {
int power;
int magic;
};
int main() {
int H, N;
cin >> H >> N;
vector<Atack> atack(N);
int A, B;
for (int i = 0; i < N; i++) {
cin >> atack[i].power;
cin >> atack[i].magic;
}
long dp[H+1];
for (int i = 1... | 0 | 42,450,342 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int k,n;
cin>>k>>n;
vector<int>arr(n);
for(int i=0; i<n; i++) cin>>arr[i];
int total = k;
int mn = total;
for(int i=1; i<n; i++){
mn = min(mn,total-(arr[i]-arr[i-1]));
}
mn = min(mn,total-(k-arr[n-1])-arr[0]);
cout<<mn;
} | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long long i... | 0 | 46,555,245 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define db double
#define mod 1000000007
#define pb push_back
#define pp pair<int,int>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repe(i,a,b)... | #include <iostream>
#include <cstring>
using namespace std;
int a, b;
bool con[20][20];
int memo[20][20];
inline bool inside(int y, int x) {
return 0 <= y && y < b && 0 <= x && x < a;
}
int dfs(int y = 0, int x = 0) {
if (!inside(y, x)) return 0;
if (con[y][x]) return 0;
if (y == b - 1 && x == a - 1) return 1;
... | 0 | 7,640,724 |
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <utility>
#include <stdio.h>
#include <string>
using namespace std;
int gcd(int x, int y) { return (x % y) ? gcd(y, x % y) : y; }
int main()
{
vector<int> intArray(3);
for (int i = 0; i < 3; i++)
{
cin >> intArray[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int S;
cin >> S;
int A, B, C, D;
A = S / 1000;
B = (S - A*1000) / 100;
C = (S - A*1000 - B*100) / 10;
D = (S - A*1000 - B*100 - C*10);
vector<string> vec(3);
vector<int> N = {B, C, D};
for(int i = 0;... | 0 | 98,194,893 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string S, T;
cin >> S;
cin >> T;
int S_l = S.length(), T_l = T.length();
int roop = S_l - T_l + 1;
int ans = T_l;
for (int i = 0; i < roop; ++i){
int count = 0;
for (int j = 0; j < T_l; ++j){
i... | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | 0 | 97,111,988 |
#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>;
using Graph = vector<vector<int>>;
int main() {
string S, T;
cin >> S >> T;
cout << T << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
void solve(long long N, std::vector<long long> A) {
ll ans = 0;
for (ll i = 0; i < N; i++) {
for (ll j = i + 1; j < N; j++) {
ans = max(ans, abs(A[i] - A[j]));
}
... | 0 | 66,673,271 |
#include <bits/stdc++.h>
using namespace std;
int count_lighting_bulb(int M, const vector<int> &p_vec,
const vector<bitset<10>> &connected, const bitset<10> &switches)
{
int cnt = 0;
for (int i = 0; i < M; ++i) {
int num_valid_switches = (connected.at(i) & switches).count();
if (num_val... | #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 char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | 0 | 70,434,279 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<set<int>> light_bulbs(m);
for (int i = 0; i < m; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int s;
cin >> s;
s--;
light_bulbs.at(i).insert(s);
}
... | #include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<string, int, int> TU;
typedef tuple<int, int, int> TI;
int main()
{
string s;
cin >> s;
int dp[3] = {... | 0 | 37,846,002 |
#include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 998244353
int main(){
stri... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, tenant[4][3][10]{};
int b, f, r, v;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> b >> f >> r >> v;
tenant[b - 1][f - 1][r - 1] += v;
}
for (int i = 0; i < 4 - 1; i++)
{
for (int j = 0; j < 3; j++)... | 0 | 20,505,411 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
if (k > (n - 1) * (n - 2) / 2) cout << -1;
... | #include<iostream>
#include<vector>
using namespace std;
int main() {
int N{};
cin >> N;
vector<int> num(N);
for (size_t i = 0;i < N;++i) {
cin >> num.at(i);
}
size_t i = 0,j=N-1;
int left = num.at(i), right = num.at(j);
while (i!=j) {
if (left >= right) {
j--;
if (i == j) {
break;
}
else {
... | 0 | 44,348,887 |
#include <stdio.h>
int kuadrat(int a, int b)
{
int total = 1;
while(b > 0){
total *= a;
b--;
}
return total;
}
int main()
{
int cases;
scanf("%d", &cases);
long long int arr[cases], total = 1;
int i = 0;
char temp;
do
{
scanf("%lld%c", &arr[i], &temp);... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define xx first
#define yy second
#define sci(n) scanf("%d",&n)
#define scii(n,m) scanf("%d%d",&n,&m)
#define sciii(n... | 0 | 30,915,434 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define loop(i,n) for(int i=0;i<(int)(n);i++)
#define foi(i,k,n) for(int i=(k); i<(int)(n); i+=1)
#define fod(i,n,k) for(int i=k; i>=(int)n; i-=1)
#d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >> n >> m;
vector<int> sx(n); vector<int> sy(n);
vector<int> cx(m); vector<int> cy(m);
for (int i=0; i<n; i++) cin >> sx.at(i) >> sy.at(i);
for (int i=0; i<m; i++) cin >> cx.at(i) >> cy.at(i);
for (int i=0; i<n; i++) {
int d=100... | 0 | 51,012,226 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int i,j,cnt=0;
int n;
cin>>n;
if(n%2==0)cout<<n/2-1;
else cout<<n/2;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << e... | 0 | 59,273,315 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char x,y;
cin>>x>>y;
if(x<y) cout<<"<"<<endl;
else if(x==y) cout<<"="<<endl;
else cout<<">"<<endl;
return 0;
} | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll H, W, ans=0, tmp=0;
queue<pair<ll,ll>> Q;
vector<vector<ll>> color;
void bfs() {
while(!Q.empty()) {
pair<ll,ll> p = Q.front();
Q.pop();
if(p.first+1<H&&color[p.first+1][p.sec... | 0 | 15,266,244 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include ... | #include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin, (x).rend()
#define endl '\n'
#define F first
#define S second
typedef pair<int,int> pii;
typedef long long ll;
void A(){
}
int main(){
int n; cin>>n;
int arr[n]; cin>>arr[0];
for(int i=1; i<n; i++){
cin>>... | 0 | 92,852,702 |
#include<bits/stdc++.h>
#define mod 1000000007
#define int long long int
#define phi 1.6180339
#define rep(i,n) for(auto i=0;i<(n);i++)
#define endl "\n"
#define For(i,a,b) for(auto i=(a);i<(b);i++)
#define op1 cin.tie(NULL)
#define op2 cout.tie(NULL)
#define op3 std::ios_base::sync_with_stdio(false)
#define MAXX 10000... | #include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<type... | 0 | 60,305,318 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
map<ll,int> A;... | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
using P = pair<int,int>;
using ivec = vector<int>;
using Graph = vector<vector<int>>;
template<class T> inlin... | 0 | 88,056,931 |
#include <bits/stdc++.h>
#define vi vector<int>
#define ll long long
#define pb push_back
#define mp make_pair
#define endl "\n"
#define ii pair<int,int>
#define qu queue <int>
#define qmax priority_queue <int>
#define qmin priority_queue <int, vector<int>,greater<int>>
using namespace std;
int main(){
ios_base::sy... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 0 | 29,999,018 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<memory.h>
using namespace std;
int dp[1001][1001];
int n;
int solve(string a,string b)
{
int len1=a.size(),len2=b.size();
for(int i=0;i<=len1;i++)
dp[i][0]=i;
for(int j=0;j<=len2;j++)
dp[0][j]=j;
for(int i=1;i<=len1;i++)
for(int... | #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;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll N, X;
vector<ll>a, p;
ll f(ll L, ll X) {
if (L == 0) {
if (X <= 0) return 0;
return 1;
}
ll m... | 0 | 68,130,175 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 10000;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (... | #include<iostream>
#include<algorithm>
#include<string>
#include<bits/stdc++.h>
using std::string;
int main()
{
int N;
std::cin >> N;
int arr[2 * N];
for(int i = 0; i < 2 * N; i++)
{
std::cin >> arr[i];
}
int n = sizeof(arr)/sizeof(arr[0]);
std::sort(arr, arr + n);
int ans =... | 0 | 44,445,010 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define reps(i,s,n) for (int i = (s); i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N;
int K;
cin >> N >> K;
int A[N];
for(int i = 0; i < N; i++){
cin >> A[i];
}
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, a[100];
int cnt[100] = {0};
cin >> n;
int mn = n, mx = 0;
for(int i=0;i<n;++i){
cin >> a[i];
mn = min(mn, a[i]);
mx = max(mx, a[i]);
++cnt[a[i]];
}
if(mx % 2){
if(cnt[mn] != 2) goto l_ng;... | 0 | 42,946,576 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1000000000000;
const int mod = 1000000007;
int test[12345678][2], aa[1234][1234], bb[1234][1234];
signed main() {
int n, m = 0, k, z = 0, cnt = 1, ans = 0;
cin >> n >> k;
if (k > (n - 1)* (n - 2) / 2) { cout << -1 << endl; return 0; }... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long int64;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<29;
const long long INFL = 1e18;
const int MOD = 1000000007;
const int MAX = 210000;
const int MAX_NUM = 999999999;
vector<... | 0 | 89,877,474 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define LINF 1e18
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
... | #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... | 0 | 76,530,465 |
#include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int total = 0;
for (int n=1; n<=N; ++n) {
int r = n;
int sub = 0;
while (r != 0) {
sub += r % 10;
r /= 10;
}
if (((A <= sub) && (sub <= B))) {
... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
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)... | 0 | 36,910,561 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
#define P pair<int, int>
using namespace std;
const int M = 1000005;
int main() {
int x;
cin >> x;
int zy = x / 100;
int per = x % 100;
int cnt = z... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define es erase
#define in insert
#define pii pair<ll, ll>
#define ll long long
#define lb long double
#define ioss \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.... | 0 | 43,846,941 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(){
char c[1200];
fgets(c,1200,stdin);
for (int i = 0;i<1200;i++){
if (c[i] == '\n') break;
if (islower(c[i])) c[i] = toupper(c[i]);
else if (isupper(c[i])) c[i] = tolower(c[i]);
printf("%c",c[i]);
}
printf("\n");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
char ch[4];
cin>>ch;
sort(ch,ch+4);
if((ch[0]==ch[1])&&(ch[1]!=ch[2])&&(ch[2]==ch[3]))
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
} | 0 | 30,631,359 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n;
cin >> n;
vector<ll> a(n);
ll mx = -1;
for(int i = 0; i < n; i++){
cin >> a[i];
... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mod 1000000007
#define lli long long int
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define ve vector<lli>
#define vep vector<pair<lli,lli> >
#define pii pair<int,int>
#define pll pair<lli,lli>
#define fr(i,n)... | 0 | 56,673,507 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
int N, K;
cin >> N >> K;
LL ans = K;
rep(i,N-1) ans *= K - 1;
cout << ans << endl;
} | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef uin... | 0 | 74,229,772 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = (ll)(s); i < (ll)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll MOD = 1e9+7;
ll LLINF = 1LL << 60;
int INF = INT_MAX;
int main(){
int n,k; cin>>n>>k;
string s; cin>>s;
vector<int> num;
int conti... | #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 char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | 0 | 46,477,410 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n,k,x,y;
cin>>n>>k>>x>>y;
if(n>=k)
{
ll a=k*x;
ll b=y*(n-k);
ll c=a+b;
cout<<c<<endl;
}
else
{
ll c=n*x;
cout<<c<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,w;
cin >> h >> w;
bool mp[h*w];
string tmp;
for(int i = 0; i < h; i++) {
cin >> tmp;
for(int j = 0; j < w; j++) {
... | 0 | 14,587,052 |
#include <iostream>
#include <bitset>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define ll long long
using namespace std;
int main(){
ll n,k;
cin>>n>>k;
ll a[n];
for (int i=0;i<n;i++) cin>>a[i];
ll ans=1e18;
for (ll bit=0;bit<(1<<n);bit++){
ll max_h=a[0];
ll sum=0;
ll cn... | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
int main()
{
string s;
cin >> s;
int n = s.size();
bool ans = false;
rep(i, n + 1) {
... | 0 | 45,815,826 |
#include <bit>
#include <bitset>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <stack>
typedef long double ld;
typedef long long ll;
us... | #include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <iomanip>
#include <iterator>
#include <algorithm>
#include <functional>
#include <typeinfo>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (in... | 0 | 71,367,914 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N;
cin >> S;
int count = 0;
bool finished = false;
int tmp;
vector<int> digit(3);
for(int num = 0; num < 1000; num++) {
tmp = num;
for(int d = 2; d >= 0; d--) {
digit[d] = tm... | #include <bits/stdc++.h>
using namespace std;
struct edge {
int to;
int weight;
edge(int t, int w) : to(t), weight(w) { }
};
using Graph = vector<vector<edge>>;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class ... | 0 | 9,827,549 |
#include <bits/stdc++.h>
#define boost_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define int long long
#define num(a) a-'0'
#define charr(a) (a - 'A' + 1)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define maxs(a,b) if(b>a)a=b
#define mins(a,b) if(b<a)a=b
#define debug(x) cerr<<"["<<#x<<":"<<x<<"] "
#define debug2... | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <algorithm>
#include <bitset>
#define range(i, r) for(int i=0;i<r;i++)
#define ranges(i, l, r) for(int i=l;i<r;i++)
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi std::vector<std::vector<int> >
#define vvl std::... | 0 | 95,175,932 |
#include<bits/stdc++.h>
using namespace std;
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define faster() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const long long i... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cstring>
#include <functional>
using namespace std;
typedef long long ll;
typedef ... | 0 | 89,513,640 |
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <queue>
#include <bitset>
#include <cstdlib>... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
const ll MOD=1000000007;
ll abs1(ll a){
if(a>=0)return a;
else return -a;
}
ll pow1(ll a,ll b,ll p=LLONG_MAX){
ll ret=1;
while(b!=0){
if((b&1)==1){
ret*=a;
}
a*=a;
if(a>=p)a%=p;
... | 0 | 49,488,373 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
for (int i = 0; i < q; ++i) {
string s, t;
cin >> s >> t;
int sl = s.size(), tl = t.size();
int dp[1010][1010];
dp[0][0] = 0;
for (int j = 1; j <= sl; ++j) {
for (int k = 1;... | #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 | 2,411,426 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define ll long long
#define pii pair<int,int>
int fac[9];
void init() {
int i=0;
fac[0]=1;
for(int i=1;i<9;i++)
fac[i]=i*fac[i-1];
}
void test_case()
{
... | #include <bits/stdc++.h>
#define X first
#define Y second
#define MP make_pair
using namespace std;
typedef long long ll;
const int N = 1e5 + 12;
const ll mod = 1e9 + 7;
int n, m;
string s[N];
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for(int i = 1;i <= n;i++)
cin >> s[i];
s... | 0 | 31,777,219 |
#include <iostream>
#include <string>
#include <map>
using namespace std;
int main()
{
string s;
cin >> s;
map<int, int> d;
int h = 0, m;
d.insert(make_pair(h, 0));
for (auto c : s) {
h ^= 1 << c - 'a';
m = -1;
for (int i = 0; i < 26; i++) {
auto it = d.find(h ^ 1 << i);
if (it != d.end() && (m < 0 ||... | #include<iostream>
using std::cout;
using std::cin;
using std::endl;
void numberOfWay(int n, int x) {
int num = 0;
int first;
int second;
int third;
for (first = 1; first <= n - 2; first++) {
third = x - first;
for (second = first + 1; second <= n - 1; second++) {
int th... | 0 | 7,695,992 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 49,485,989 |
#include <bits/stdc++.h>
using namespace std;
int effort(int q,vector<int> &adress,int &N){
int a=0;
for(int i=0;i<N;i++){
a+=(q-adress.at(i))*(q-adress.at(i));
}
return a;
}
int main(){
int N;
cin>>N;
vector<int> adress(N);
for(int i=0;i<N;i++){
cin>>adress.at(i);
}
int ans=1... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937_64 mrand(chrono::steady_clock::now().time_since_epoch().count());
#define ii for(int i=1;i<=n;++i)
#define ji for(int j=1;j<=n;++j)
#define jj for(int j=1;j<=m;++j)
#define ij for(int i=1;i<=m;++i)
#define sz(x) ((ll)x.si... | 0 | 9,706,703 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP(i, n) for (int i = 1... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iomanip>
#include<vector>
#include<queue>
#include<deque>
#include<string>
#include<utility>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<set>
#include<map>
#include<bitset>
#include<stack>
#include<ctime>
using namespace ... | 0 | 56,967,467 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod= 1e+9+7;
int main(){
string s,t,u; cin>>s>>t>>u;
s[0]=char(s[0]-32);
cout<<s[0];
t[0]=cha... | #include<bits/stdc++.h>
using namespace std;
#define cinsc ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOR(i,k,n) for(int64 i=k;i<(int64)n;i++)
#define FORr(i,k,n) for(int64 i=(int64)k;i>=n;i--)
#define FORE... | 0 | 97,908,445 |
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int n,m,x,y,d[N];
int main(){
scanf("%d%d",&n,&m);
while (m--)scanf("%d%d",&x,&y),d[x]^=1,d[y]^=1;
int cnt=0;
for (int i=1;i<=n;i++)cnt+=d[i];
if (cnt>1)puts("NO");
else puts("YES");
} | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define MOD 1000000007
typedef long long ll;
typedef pair<int,int> pii;
int n, k;
const int N = 1e5 + 5;
ll f[N], res;
ll expo(ll a, ll b) {
if (b == 0) return 1;
if (a == 0) return 0;
ll temp = expo(a, b / 2);
temp = (temp * temp) % MOD;
... | 0 | 3,313,635 |
#include<bits/stdc++.h>
using namespace std;
int main(){
float a,b,c;
int k;
cin>>a>>b>>c>>k;
int k1=0,k2=0;
if(b<=a){
k1 = floor(log2(a/b)) + 1;
b = b*pow(2,k1);
}
if(c<=b){
k2 = floor(log2(b/c)) + 1;
}
if(k>=k1+k2) cout<<"Yes\n";
else cout<<"No\n";
} | #include<cstdio>
#define MIN(X,Y) ((X<Y)?(X):(Y))
int main(void) {
while(true) {
int n,m,dis[11]={};
scanf("%d%d",&n,&m);
if(!n) break;
for(int i=0; i<n; i++) {
int d,p;
scanf("%d%d",&d,&p);
dis[p] += d;
}
for(int i=10; i; i--) {
... | 0 | 74,333,512 |
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
typedef ll int__;
#define rep(i,j) for(int__ (i)=0;(i)<(j);(i)++)
#define repeat(i,j,k) for(int__ i=(j);i<(k);(i)++)
#define all(v) v.begin(),v.end()
int main()
{
ios::sync_with_stdio(... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | 0 | 67,688,490 |
#include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1000000009;
const long long INF = 1LL << 60;
int main() {
int N , K;
cin >> N >> K;
vector<ll> P(N), C(N);... | 0 | 87,427,632 |
#include <iostream>
#define ll long long
#include <cstring>
using namespace std;
int arr[500005];
int main() {
string s;
cin >> s;
memset(arr, 0, sizeof(arr));
ll ans = 0;
int cntr = 0;
for (int i = 0; i < s.length(); i++){
if (s[i] == '<'){
arr[i+1] = arr[i]+1;
}
}
for (int i = s.length()... | #include <iostream>
using namespace std;
int nsum_two(int m, int n, int sum)
{
int nsum = 0;
for (int i = m; i < (sum / 2.0); i++)
{
if ((sum - i) > n) continue;
nsum++;
}
return nsum;
}
int main()
{
while (true)
{
int n, x;
cin >> n >> x;
if (n == 0 ... | 0 | 38,435,534 |
#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 ENDL '\n'
#define io ios_base::sync_with_stdio(false);cin.tie(0);
#define sayy cout<<"YES"<<ENDL;
#define sayn cout<<"NO"<<ENDL;
int main(){
io
int n;
string s;
cin >> n >> s;
int cont(1);
char last = s[0];
for(int i(0); i<s.length(); i++... | 0 | 27,849,923 |
#include<bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll MOD=998244353;
const ll INF=1000000010;
const ll LINF=1000000000000000010;
int dx[8]={0,0,1,1,1,-1,-1,-1};
int dy[8]={1,-1,1,-1,0,1,-1,0};
int main(){
ll s=1;
int keta=0;
... | #include <stdio.h>
int main()
{
int m,f,r,summf;
while(1){
scanf("%d %d %d",&m,&f,&r);
if(m==-1&&f==-1&&r==-1){
break;
}
summf=m+f;
if(m==-1||f==-1){
printf("F\n");
}else
if(80<=summf){
printf("A\n");
}else
if(65<=summf&&summf<80){
printf("B\n");
}else
if(50<... | 0 | 61,464,585 |
#include <cstdio>
#include <iostream>
using namespace std;
void print(int a[][10]){
for (int i = 0; i < 3; i++){
for (int j = 0; j < 10; j++){
cout<< " " << a[i][j];
}
cout << endl;
}
}
int main()
{
int n,b,f,r,v = 0;
cin >> n;
int A[3][10], B[3][10], C[3][10], D[... | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#define div1 1000000007
using namespace std;
int main(void)
{
long long N, H, W, A[1001], B[1001], i, ans=0;
cin >> N >> H >> W;
for(i=1; i<=N; i++){
cin >> A[i] >> B... | 0 | 50,941,528 |
#include<bits/stdc++.h>
using namespace std;
int main(){
cout << fixed << setprecision(12);
double x1,y1,x2,y2,a,b,ans;
cin >> x1 >> y1 >> x2 >> y2;
a = x2-x1;
if(a<0) a = a * (-1);
b = y2-y1;
if(b<0) b = b * (-1);
a = pow(a,2);
b = pow(b,2);
ans = a+b;
ans = sqrt(ans);
cout << ans << endl;
re... | #include <bits/stdc++.h>
#include <algorithm>
#include <map>
#include <cstdlib>
#include <cmath>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
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++){
... | 0 | 52,332,889 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<map>
#include<random>
#include<unordered_map>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M, X;
cin >> N >> M >> X;
vector<ll> price(N);
vector<vector<ll>> book(N, vector<ll>(M));
for(ll i = 0; i < N; i++) {
cin >> price.at(i);
for(ll j = 0; j < M; j++) {
cin >> book.at(i).a... | 0 | 74,264,354 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,mini;
cin>>n;
int a[n+1],cnt=0;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
{
mini=i;
for(int j=i;j<n;j++)
{
if(a[j]<a[mini])
mini=j;
}
swap(a[i],a... | 0 | 57,424,512 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=b;i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 0 | 22,622,291 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N+1), b(N+1), c(N+1);
for (int i = 1; i <= N; i++) {
cin >> a[i] >> b[i] >> c[i];
}
vector<int> aa(N+1, a[1]), bb(N+1, b[1]), cc(N+1, c[1]);
for (int i = 2; i <= N; i++) {
aa[i] = max(bb... | #include <bits/stdc++.h>
using namespace std;
int main(void){
string S;
cin >> S;
string T = "keyence",S1 = " ", S2 = " ",T1;
int k = 0;
bool flag = true;
for(int i = 0; i < S.size(); i++){
if(S[i] != T[k] && flag == true){
flag = false;
S1 = S.substr(0,i);
... | 0 | 11,665,611 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
const int maxn = 105 + 5;
ll a[maxn];
int main()
{
ios::sync_with_stdio(false);
int n ; cin >> n;
for (int i = 1 ; i <= n ; i++){
cin >> a[i];
}
sort(a + 1 , ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
string S, T;
cin >> S >> T;
int lenS = S.si... | 0 | 40,253,272 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,l,r) for (int i = (l); i < (r); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c)... | #include <bits/stdc++.h>
using namespace std;
int main(){
double a, b;
cin >> a >> b;
int answer = -1;
int answerbegin = (int)(a/0.08 +0.9);
int answerend = (int)((a+1)/0.08 +0.9);
bool br = false;
for(int i=answerbegin; i<answerend; i++){
for(int j=0; j<10; j++){
if( i==(... | 0 | 74,000,764 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
using namespace std;
#define FOR... | #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, const T &b) { if (b < a)... | 0 | 43,333,751 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
long N;
cin >> N;
vector<long> d(N);
for (long i=0; i<N; i++) {
cin >> d.at(i);
}
sort(d.begin(), d.end());
long diff = d.at(d.size()/2)-d.at(d.size()/2-1);
cout << diff << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 15,066,385 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T... ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, K;
cin >> N >> K;
vector<int> cand(N, 1);
rep(i,... | 0 | 20,390,782 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<math.h>
#include<queue>
#include<deque>
#include<stack>
#include<cstdio>
#include<utility>
#include<set>
#include<list>
#include<cmath>
#include<stdio.h>
#include<string.h>
#include<iomanip>
#include<cstdio>
#include<cstdlib... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<vector<char>> vec;
int main(){
ll H,W,ans=0;
cin>>H>>W;
ll dp[111][111];
vec.resize(H,vector<char>(W));
vector<vector<ll>> answer(H,vector<ll>(W));
for(ll i=0;i<H;i++){
for(ll j=0;j<W;j++){
cin>>vec.at(i).at(j);
}
}
... | 0 | 64,226,196 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 1000001;
ll max(ll a, ll b) {
if (a > b) { return a; }
return b;
}
ll min(ll a, ll b) {
if (a > b) { return ... | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << '\n'
#define Int int64_t
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
Int INF = 1e18;
int inf = 1e9;
Int mod = 1e9+7;
int main() {
Int N, M, V, P;
cin >> N >> M >> V >> P;
vector<Int> A(N);
for (Int ... | 0 | 25,303,390 |
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline ll read()
{
ll x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1; c... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
int main(){
int N; cin >> N;
map<long long, long long> mp;
mp[0] = 1;
long long sum = 0;
long long res = 0;
for(int i=0;i<N;i++){
long long a; cin >> a;
sum += a;
if(mp.count(sum)){
res ... | 0 | 3,637,212 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
ll a,b,k; cin>>a>>b>>k;
for (int i=0; i<k; i++) {
if(i%2) swap(a,b);
if(a%2) a--;
a/=2;
b+=a;
if(i%2) swap(a,b);
}
cout<<a<<" "<<b<<"\n";
retur... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define ... | 0 | 60,356,417 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S>... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
using ll=long long;
#... | 0 | 47,911,280 |
#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 <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <bitset>
#include <cmath>
#include <stack>
#include <iomanip>
#include <map>
#include <math.h>
#include <list>
#include <deque>
typedef long long ll;
using namespace std;
template<class T> inline bool chmax(T& a,... | 0 | 82,174,876 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <functional>
#includ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
map<char,bool> right;
right['y']=right['u']=right['i']=right['o']=right['p']=
right['h']=right['j']=right['k']=right['l']=
right['n']=right['m']=true;
int cnt=0;
char now=getchar(),before;
while(before=now,now=getchar(),before!='#... | 0 | 92,210,755 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int N; cin >> N;
int n = N;
... | #include<iostream>
using namespace std;
int main(void)
{
long long int n,m,i,max=0,min=10000000,all=0;
cin>>n;
for(i=1;i<=n;i++){
cin>>m;
all=all+m;
if(max<=m) max=m;
if(min>=m) min=m;
}
if(n==1) cout<<m<<" "<<m<<" "<<m<<endl;
else cout<<min<<" "<<max<<" "<<all<<endl;
return 0;
} | 0 | 66,091,243 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define debug(s) cout << #s << " = " << s << endl
#define all(v) (v).begin(), (v).end()
#define mem(a,val) memset(a, val, sizeof a)
#define maxn 100010
#define INF 1e... | #include<cstdio>
#include<algorithm>
using namespace std;
int yaku[10000];
int array_addr = 0;
void Yakunum(int c){
int i = 1;
while(i != c+1){
if(c % i == 0){
yaku[array_addr] = i;
array_addr++;
}
i++;
}
}
int main(){
int a,b,c,yaku_cout=0;
scanf("%d %d %d",&a,&b,&c);
Yakunum(c);
... | 0 | 95,252,809 |
End of preview. Expand in Data Studio
- Downloads last month
- 61