code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 2
101M
|
|---|---|---|---|
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 1;
int in[N], pref[N];
signed main()
{
#ifdef home
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
#else
#endif
ios_base::sync_with_stdio(0);
int n, k, ans = 0, sum = 0;
;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> in[i];
for (int i = 1; i <= n; i++)
{
pref[i] = pref[i - 1] + in[i];
}
for (int i = n; i > k; i--)
if (in[i] > 0)
sum += in[i];
for (int l = 1, r = l + k - 1; r <= n; l++, r++)
{
ans = max(ans, sum);
ans = max(ans, sum + pref[r] - pref[l - 1]);
if (in[l] > 0)
sum += in[l];
if (r + 1 <= n && in[r + 1] > 0)
sum -= in[r + 1];
}
cout << ans;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<list>
#include<set>
#include<string>
using namespace std;
int gcd(int a, int b) {
int c = a % b;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
return b;
}
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++) par[i] = i;
}
int root(int x) {
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
typedef long long ll;
ll M = 1000000007;
vector<ll> fac(300001);
vector<ll> ifac(300001);
ll mpow(ll x, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1) ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
ll comb(ll a, ll b) {
if (a == 0 && b == 0)return 1;
if (a < b || a < 0)return 0;
ll tmp = ifac[a - b] * ifac[b] % M;
return tmp * fac[a] % M;
}
long long modinv(long long a) {
long long b = M, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= M;
if (u < 0) u += M;
return u;
}
vector<vector<ll>> mul(vector<vector<ll>> a,vector<vector<ll>> b,int n){
int i,j,k,t;
vector<vector<ll>> c(n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
t = 0;
for (k = 0; k < n; k++)
t = (t + a[i][k]*b[k][j] % M)%M;
c[i].push_back(t);
}
}
return c;
}
int main() {
ll n, i, k, a[111111], sum[111111], psum[111111], ans = 0,t=0;
cin >> n >> k;
for (i = 1; i <= n; i++)
cin >> a[i];
sum[0] = 0;
psum[0] = 0;
for (i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + a[i];
if (a[i] > 0)
psum[i] = psum[i - 1] + a[i];
else
psum[i] = psum[i - 1];
}
for (i = 1; i + k <= n + 1; i++)
ans = max(ans, max(t,sum[i + k - 1] - sum[i - 1]) + psum[i - 1] + psum[n] - psum[i + k - 1]);
cout << ans << endl;
} | 1 | 43,617,878 |
#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() {
double w, h, x, y;
cin >> w >> h >> x >> y;
double ans = w*h/2;
printf("%.10f\n", ans);
if (x == w/2 && y == h/2) cout << 1 << endl;
else cout << 0 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
int main(){
double w,h,x,y;
cin >> w >> h >> x >> y;
double ans = 0;
int flag = 0;
if(w/2 == x && h/2 == y) flag = 1;
cout << fixed << w * h / 2 << " " << flag << endl;
return 0;
} | 1 | 1,012,078 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int INF=1e18;
const int MOD=1e9+7;
const double pi = acos(-1.0);
signed main(){
int n;cin>>n;
int x[n],y[n];
REP(i,n)cin>>x[i]>>y[i];
double ans=0;
for(double w=0;w<2*pi;w+=pi/18000.0){
double vx=cos(w),vy=sin(w);
double nx=0,ny=0;
REP(i,n){
double inpro = vx*x[i]+vy*y[i];
if(inpro>0){
nx+=x[i];
ny+=y[i];
}
}
chmax(ans,sqrt(nx*nx+ny*ny));
}
cout<<fixed<<setprecision(20.20)<<ans<<endl;
} | #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>
#include<unordered_set>
#include<bitset>
#include <queue>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ldb = long double;
#define REP(i,a,b) for(ll i = a; i < b; ++i)
#define PRI(s) cout << s << endl
#define PRIY PRI("Yes")
#define PRIN PRI("No")
#define MINS(a,b) a = min(a,(decltype(a))(b))
#define MAXS(a,b) a = max(a,(decltype(a))(b))
int main() {
ll N;
cin >> N;
vector<pair<ll,ll>> P(N);
REP(i, 0, N) {
cin >> P[i].first >> P[i].second;
}
sort(P.begin(), P.end(), [](const pair<ll, ll>& a, const pair<ll, ll>& b) {return atan2l(a.second, a.first) < atan2l(b.second, b.first); });
ldb ans = 0;
REP(i, 0, N) {
REP(j, i, i + N) {
pair<ll, ll> p = { 0,0 };
REP(k, i, j + 1) {
p.first += P[k % N].first;
p.second += P[k % N].second;
}
MAXS(ans, sqrtl(p.first* p.first + p.second * p.second));
}
}
printf("%.11Lf\n", ans);
return 0;
} | 1 | 34,688,715 |
#include<iostream>
#include<map>
#include<algorithm>
#include <iomanip>
#include <cmath>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <deque>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#include <list>
constexpr int INF = 1050000000;
constexpr int MOD = 1000000007;
constexpr long long LONGINF = 1005000000000000000;
using namespace std;
using ll = long long;
class UnionFind {
private:
std::vector<int> parent;
std::vector<int> height;
std::vector<int> m_size;
public:
UnionFind(int size_) : parent(size_), height(size_, 0), m_size(size_, 1) {
for (int i = 0; i < size_; ++i) parent[i] = i;
}
void init(int size_) {
parent.resize(size_);
height.resize(size_, 0);
m_size.resize(size_, 1);
for (int i = 0; i < size_; ++i) parent[i] = i;
}
int find(int x) {
if (parent[x] == x) return x;
return parent[x] = find(parent[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
int t = size(x) + size(y);
m_size[x] = m_size[y] = t;
if (height[x] < height[y]) parent[x] = y;
else parent[y] = x;
if (height[x] == height[y]) ++height[x];
}
bool same(int x, int y) {
return find(x) == find(y);
}
int size(int x) {
if (parent[x] == x) return m_size[x];
return size(parent[x] = find(parent[x]));
}
};
int main() {
int n, a, b, c, x;
while (1) {
cin >> n >> a >> b >> c >> x;
if (n == 0) { return 0; }
int y[100];
for (int i = 0; i < n; i++) {
cin >> y[i];
}
int i = 0, j = 0;
bool swich = true;
while (i <= 10000) {
if (x == y[j]) { j++; if (j == n) { cout << i << endl; swich = false; break; } }
x = (a*x + b) % c;
i++;
}
if (swich) {
cout << "-1" << endl;
}
}
} | #include<cstdio>
#include<iostream>
#include<string>
#include<vector>
#define rep(X,Y) for(int (X)=0;(X)<(Y);++(X))
typedef long long ll;
using namespace std;
int main(){
ll n,b,c,a,x;
while(cin>>n>>a>>b>>c>>x){
if(!n)break;
int cnt=0,ub=10000;
vector<ll> yy(n);
rep(i,n)cin>>yy[i];
rep(i,n){
ll y=yy[i];
while(x!=y){
x=(a*x%c+b)%c;
if(++cnt>ub){cnt=-1;break;}
}
if(cnt<0)break;
if(i!=n-1){x=(a*x%c+b)%c; ++cnt;}
}
cout<<cnt<<endl;
}
} | 1 | 22,673,209 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int dp[2][2010], a[2010];
int N, Z, W;
const int INF = 1000000000;
int rec(int i, int j) {
if (dp[i][j] != -1) {
return dp[i][j];
}
int ret;
if (i == 0) {
ret = -2 * INF;
for (int k = j + 1; k <= N; k++) {
ret = max(ret, rec(1, k));
}
ret = max(ret, abs(a[N] - a[j - 1]));
} else if (i == 1) {
ret = 2 * INF;
for (int k = j + 1; k <= N; k++) {
ret = min(ret, rec(0, k));
}
ret = min(ret, abs(a[N] - a[j - 1]));
}
dp[i][j] = ret;
return ret;
}
int main() {
cin >> N >> Z >> W;
a[0] = W;
for (int i = 0; i < N; i++) cin >> a[i + 1];
memset(dp, -1, sizeof(dp));
cout << rec(0, 1) << endl;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <sstream>
#include <string>
#include <string.h>
#include <tuple>
#include <vector>
#include <unordered_map>
#define REP(i,x) for(int i{ 0 }; i < (int)(x); i++)
#define REPC(i,x) for(int i{ 0 }; i <= (int)(x); i++)
#define RREP(i,x) for(int i{ (int)(x) - 1 }; i >= 0 ;i--)
#define RREPC(i,x) for(int i{ (int)(x)}; i >= 0; i--)
#define REP1O(i,x) for(int i{ 1 }; i < (int)(x); i++)
#define REP1C(i,x) for(int i{ 1 }; i <= (int)(x); i++)
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
using namespace std;
typedef int64_t ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
typedef pair<int, int> pii;
typedef tuple<int, int, int> tupiii;
typedef tuple<ll, ll, ll> tuplll;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
const int INTMAX = 2147483647;
const ll LLMAX = 9223372036854775807;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
void SWAP(ll& a, ll& b) { a ^= b; b ^= a; a ^= b; }
void SWAP(int& a, int& b) { a ^= b; b ^= a; a ^= b; }
class D {
int n, x, y;
vi a;
public:
D()
{
cin >> n >> x >> y;
a.resize(n);
REP(i, n)
cin >> a[i];
}
void solve()
{
if (n == 1)
cout << abs(a[0] - y) << endl;
else
cout << max(abs(a[n - 1] - y), abs(a[n - 1] - a[n - 2])) << endl;
}
};
int main()
{
D solution;
solution.solve();
return 0;
} | 1 | 16,521,230 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define MAX_N 1010
#define MAX_M 100010
const long long mod = pow(10, 9) + 7;
#define vec vector<int>
#define vecll vector<ll>
#define vecllvec vector<vector<ll>>
#define vecb vector<bool>
#define vecBvec vector<vector<bool>>
#define vecst vector<string>
#define veche vector<char>
#define vecd vector<double>
#define vecvec vector<vector<int>>
#define vecDvec vector<vector<double>>
#define vecHvec vector<vector<char>>
#define all(x) (x).begin(),(x).end()
#define ent cout<<endl
#define printvec(vec) for(int aqw=0;aqw<vec.size();aqw++){cout<<vec[aqw]<<" ";}ent;
#define rep1(n) for(ll i = 0; i < (n); ++i)
#define rep2(i, n) for(ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for(ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for(ll i = (a); i < (b); i += (c))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define print(x) cout<<x<<endl;
using P = pair<int, int>;
#define PLL pair<ll, ll>;
#define MAX_V 10010
#define PI 3.141592653589793
#define vecP vector<P>
ll gcd(ll a,ll b){
if(a%b>0){
gcd(b,a%b);
}
else{
return b;
}
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
int main(){
int n;
ll x,y;
cin>>n>>x;
for(int i;i<n-1;i++){
cin>>y;
x=lcm(x,y);
}
print(x);
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
ll gcd(ll a, ll b) {
if (b == 0) return a;
else return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll x = a / gcd(a, b);
return x * b;
}
int main() {
int N;
cin >> N;
vl T(N);
rep(i, N) {
cin >> T[i];
}
if (N == 1) {
cout << T[0] << endl;
return 0;
}
ll ans = lcm(T[0], T[1]);
for (int i = 2; i < N; i++) {
ans = lcm(ans, T[i]);
}
cout << ans << endl;
} | 1 | 56,320,933 |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rp(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>())
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";};
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
void solve(){
int n;
cin >> n;
if(n<1200) print("ABC");
else if(n<2800) print("ARC");
else print("AGC");
return;
}
int main(){
cin.tie(0);ios::sync_with_stdio(false);
std::cout<<std::fixed<<std::setprecision(30);
solve();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define f(i,j,n) for(int i=j;i<=n;i++)
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int r;
cin>>r;
if(r<1200)
cout<<"ABC";
else if(r<2800 && r>=1200)
cout<<"ARC";
else
cout<<"AGC";
} | 1 | 75,656,655 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
bool isVowel(char ch) {
return ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u';
}
int main() {
fastIO;
char ch;
cin >> ch;
if (isVowel(ch))
cout << "vowel" << endl;
else
cout << "consonant" << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(void){
char c;
cin >> c;
if( c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o' ){
cout << "vowel\n";
}
else{
cout << "consonant\n";
}
} | 1 | 90,055,041 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cstdio>
using namespace std;
int toInt(string a){
int ret = 0;
for(int i=0;a[i];i++){
int num = 1;
if(isdigit(a[i])){
num = a[i++]-'0';
}
if(a[i]=='m') ret += num * 1000;
else if(a[i]=='c') ret += num * 100;
else if(a[i]=='x') ret += num * 10;
else if(a[i]=='i') ret += num * 1;
}
return ret;
}
string toString(int a){
string ret;
char l[5]="ixcm";
for(int i=0;i<4;i++){
if(a%10) ret += l[i];
if(a%10>1) ret += a%10+'0';
a/=10;
}
reverse(ret.begin(), ret.end());
return ret;
}
int n;
main(){
int i,j;
cin >> n;
while(n--){
string a,b;
cin >> a >> b;
cout << toString(toInt(a) + toInt(b)) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)
#define vary(type,name,size,init) vector< type> name(size,init)
#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using dict = map<string,int>;
using pii = pair<int,int> ;
using pll = pair<ll,ll> ;
const int mod = 1000000007;
constexpr int imax = ((1<<30)-1)*2+1 ;
constexpr int inf = 100000000;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0};
const int dx[] = {0,-1,0,1};
inline bool value(int x,int y,int w,int h){
return (x >= 0 && x < w && y >= 0 && y < h);
}
template<typename T>
void Unique(vector<T> &v){
sort(all(v));
v.erase(unique(all(v)),v.end());
}
template<typename T>
T ston(string& str, T n){
istringstream sin(str) ;
T num ;
sin >> num ;
return num ;
}
void Ans(bool f){
if(f) cout << "YES"<<endl;
else cout << "NO"<<endl;
}
vector<string> Split(char c,string s){
vector<string> res(0);
string str = "";
rep(i,s.size()){
if(s[i] == c){
res.push_back(str);
str.clear();
}
else{
str += s[i];
}
}
res.push_back(str);
return res;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
string s;
cin.ignore();
rep(l,n){
getline(cin,s);
auto vs = Split(' ',s);
ll tmp = 1,num = 0;
rep(i,2){
rep(j,vs[i].size()){
if(vs[i][j] - '0' > 1 && vs[i][j] - '0' < 10){
tmp = vs[i][j] -'0';
}
else{
if(vs[i][j] == 'm'){
num += 1000 * tmp;
}
else if(vs[i][j] == 'c'){
num += 100 * tmp;
}
else if(vs[i][j] == 'x'){
num += 10 * tmp;
}
else{
num += tmp;
}
tmp = 1;
}
}
}
string ans = "";
if(num/1000){
if(num/1000 != 1){
ans += to_string(num/1000);
}
ans += "m";
}
num %= 1000;
if(num/100){
if(num/100 != 1){
ans += to_string(num/100);
}
ans += "c";
}
num %= 100;
if(num/10){
if(num/10 != 1){
ans += to_string(num/10);
}
ans += "x";
}
if(num % 10){
if(num % 10 != 1){
ans += to_string(num % 10);
}
ans += "i";
}
cout << ans << endl;
}
return 0;
} | 1 | 53,080,945 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main(void) {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector <int> sum;
sum.push_back(0);
char pre_updown = '0';
int continue_cnt = 0;
for (int i = 0; i < N; i++) {
char updown = S[i];
if (updown != pre_updown) {
sum.push_back(sum[sum.size()-1] + continue_cnt);
pre_updown = updown;
continue_cnt = 1;
} else {
continue_cnt += 1;
}
}
sum.push_back(sum[sum.size()-1] + continue_cnt);
sum.push_back(sum[sum.size()-1]+0);
int ans = 0;
for (int st = 0; st < sum.size(); st+=2) {
int en = min(st+K+K, (int)sum.size()-1);
ans = max(ans, sum[en]-sum[max(st-1,0)]);
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <deque>
#include <numeric>
using lint = long long;
int main()
{
lint n, k;
scanf("%lld", &n);
scanf("%lld", &k);
std::string s;
std::cin >> s;
std::vector<lint> line;
std::vector<lint> line_state;
lint stream = 0;
lint state;
if (s.front() == '0')
state = 0;
else
state = 1;
for (int i = 0; i < n; ++i)
{
if (s[i] == '0')
{
if (state == 0)
{
stream++;
}
else
{
line.push_back(stream);
line_state.push_back(state);
stream = 1;
state = 0;
}
}
else
{
if (state == 1)
{
stream++;
}
else
{
line.push_back(stream);
line_state.push_back(state);
stream = 1;
state = 1;
}
}
}
line.push_back(stream);
line_state.push_back(state);
if (line_state.size() - std::accumulate(line_state.begin(), line_state.end(), 0) <= k)
{
printf("%lld", n);
return 0;
}
else
{
std::vector<lint> line_cumsum(line.size());
lint cumsum = 0;
for (lint i = 0; i < line.size(); i++)
{
cumsum += line[i];
line_cumsum[i] = cumsum;
}
lint ans = 0;
lint cand;
for (int i = 0; i < line.size(); i++)
{
lint right;
lint left;
if (line_state[i] == 0)
{
left = std::max(0, i - 1);
right = std::min(i + 2 * int(k) - 1, int(line.size()) - 1);
}
else
{
left = i;
right = std::min(i + 2 * int(k), int(line.size()) - 1);
}
if (right >= line.size())
break;
if (left == 0)
cand = line_cumsum[right];
else
cand = line_cumsum[right] - line_cumsum[left - 1];
ans = std::max(ans, cand);
}
printf("%lld", ans);
return 0;
}
return 0;
} | 1 | 97,823,282 |
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
int main() {
ll w, h;
cin >> h >> w;
vl p(h), q(w);
priority_queue<ll, vector<ll>, greater<ll>> ppq, qpq;
rep (i, h) {
cin >> p[i];
ppq.push(p[i]);
}
rep (i, w) {
cin >> q[i];
qpq.push(q[i]);
}
ll cnt = 0;
ll pcnt = 0, qcnt = 0;
ll ans = 0;
ppq.push(INF);
qpq.push(INF);
while (cnt < (h + 1) * (w + 1) - 1) {
if (ppq.top() <= qpq.top()) {
ll yasu = ppq.top();
ppq.pop();
if (cnt + (w + 1 - qcnt) <= (h + 1) * (w + 1) - 1) {
ans += yasu * (w + 1 - qcnt);
cnt += (w + 1 - qcnt);
}
else {
ans += yasu * ((h + 1) * (w + 1) - 1 - cnt);
cnt = (h + 1) * (w + 1) - 1;
}
pcnt++;
}
else {
ll yasu = qpq.top();
qpq.pop();
if (cnt + (h + 1 - pcnt) <= (h + 1) * (w + 1) - 1) {
ans += yasu * (h + 1 - pcnt);
cnt += (h + 1 - pcnt);
}
else {
ans += yasu * ((h + 1) * (w + 1) - 1 - cnt);
cnt = (h + 1) * (w + 1) - 1;
}
qcnt++;
}
}
cout << ans << endl;
} | #include <iostream>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <algorithm>
#include <functional>
#include <cstring>
#include <limits.h>
#include <bitset>
#include <complex>
#include <cassert>
#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define SZ(i) ((int)i.size())
#define GI(i) (scanf("%d",&i))
#define GLL(i) (scanf("%lld",&i))
#define GD(i) (scanf("%lf",&i))
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define GET0(x) (get<0>(x))
#define GET1(x) (get<1>(x))
#define GET2(x) (get<2>(x))
#define ALL(X) (X).begin(),(X).end()
#define LLMAX (1LL<<60)
#define LLMIN -(1LL<<60)
#define IMAX (1<<30)
#define IMIN -(1<<30)
typedef long long LL;
using namespace std;
const int VERTICAL = 0;
const int HORIZONTAL = 1;
int main(void){
LL W,H;
GLL(W);GLL(H);
vector<pair<LL,int> > edge;
REP(i,W){
LL p;
GLL(p);
edge.PB(MP(p,VERTICAL));
}
REP(i,H){
LL q;
GLL(q);
edge.PB(MP(q,HORIZONTAL));
}
sort(ALL(edge));
LL numHorizontal = 0;
LL numVertical = 0;
LL ans=0;
for(auto e:edge){
if(e.second==VERTICAL){
ans+=(H+1-numHorizontal)*e.first;
numVertical++;
}else{
ans+=(W+1-numVertical)*e.first;
numHorizontal++;
}
}
printf("%lld\n",ans);
return 0;
} | 1 | 55,592,577 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(){
int n;
int even[2]={19,20};
scanf(" %d", &n);
for(int i=0; i<n; ++i){
long ans=0;
int y, m, d;
scanf(" %d %d %d", &y, &m, &d);
int e=0;
if(y%3==0) e=1;
if(m%2==0) ans+=19+e-d+1;
else ans+=20-d+1;
++m;
while(m<11){
if(m%2==0) ans+=19+e;
else ans+=20;
++m;
}
for(int j=y+1; j<1000; ++j){
if(j%3==0) ans+=200;
else ans+=195;
}
printf("%ld\n", ans);
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int n,y,m,d;
cin >> n;
for(int i=0; i<n; i++){
cin >> y >> m >> d;
int toBD =(y-1)*195 +((y-1)/3)*5 +(m-1)*20 +d -1;
if(y%3!=0) toBD -= (m-1)/2;
cout << 196470 - toBD << endl;
}
return 0;
} | 1 | 80,813,985 |
#include"bits/stdc++.h"
using namespace std;
int main() {
int64_t N, K;
cin >> N >> K;
vector<int64_t> A(N), B(N);
for (int64_t i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
int64_t ans = 0;
for (int64_t i = 0; i < N; i++) {
if ((A[i] | K) == K) {
ans += B[i];
}
}
for (int64_t i = 0; i < 30; i++) {
if ((K & (1LL << i)) == 0) {
continue;
}
int64_t Ki = K;
Ki ^= (1LL << i);
for (int64_t j = 0; j < i; j++) {
Ki |= (1LL << j);
}
int64_t curr = 0;
for (int64_t j = 0; j < N; j++) {
if ((A[j] | Ki) == Ki) {
curr += B[j];
}
}
ans = max(ans, curr);
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
const ll MOD=1000000007;
const ll INF=1000000010;
const ll LINF=4000000000000000010LL;
const int MAX=310;
const double EPS=1e-9;
int dx[4]={0,0,1,-1};
int dy[4]={-1,1,0,0};
int a[100010],b[100010];
int main(){
ll n,k;cin>>n>>k;
for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
}
bitset<31> bk(k);
ll ans=0;
for(int i=0;i<n;i++){
bitset<31> ba(a[i]);
bool f=true;
for(int j=0;j<=30;j++){
if((!bk[j]&1)&&(ba[j]&1)){
f=false;
break;
}
}
if(f){
ans+=b[i];
}
}
for(int i=31;i>=0;i--){
bitset<31> bit=bk;
if(!bk[i])continue;
bit[i]=0;
for(int j=i-1;j>=0;j--){
bit.set(j);
}
ll co=0;
for(int j=0;j<n;j++){
bitset<31> ba(a[j]);
bool f=true;
for(int k=0;k<=30;k++){
if((!bit[k]&1)&&(ba[k]&1)){
f=false;
break;
}
}
if(f){
co+=b[j];
}
}
ans=max(ans,co);
}
cout<<ans<<endl;
} | 1 | 72,404,967 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<bool> a(n + 1, 0);
while (m--) {
int i;
cin >> i;
a[i] = 1;
}
vector<ll> c(n + 1);
c[0] = 1;
ll M = (ll)1e9 + 7;
for (int i = 1; i <= n; i++) {
if (a[i]) {
c[i] = 0;
} else if (i == 1) {
c[i] = 1;
} else {
c[i] = c[i - 2] + c[i - 1];
c[i] %= M;
}
}
cout << c[n] << '\n';
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 998244353;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,m;cin>>n>>m;
vector<ll> dp(n+1),a(n);
rep(i,0,m){
int b;cin>>b;
a[b-1] = 1;
}
dp[0] = 1;
if (a[0]==0) dp[1] = 1;
rep(i,1,n){
if (a[i]!=1){
dp[i+1] = (dp[i]+dp[i-1])%mod;
}
}
cout<<dp[n]<<endl;
} | 1 | 44,672,503 |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
typedef double d;
typedef int i;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n , a[100000] = {} , b , x = 0 , y = 0;
cin >> n;
for ( int i = 0 ; i < n ; i++ ) {
cin >> b;
a[b]++;
}
for ( int i = 0 ; i < 100000 ; i++ ) {
if ( a[i] % 2 == 1 ) x++;
else if ( a[i] % 2 == 0 && a[i] > 0 ) y++;
}
if ( y % 2 == 0 ) cout << x + y;
else cout << x + y - 1;
} | #include<bits/stdc++.h>
#define s(a,l,r) sort(a+l,a+r+1)
#define f(i,l,r) for(int i=l;i<=r;i++)
using namespace std;
int a[110000];
int main()
{
int n,ans=0;
scanf("%d",&n);
f(i,1,n) scanf("%d",&a[i]);
s(a,1,n);
f(i,1,n) if(a[i]==a[i-1]) ans++;
ans=(ans+1)/2*2;
printf("%d\n",n-ans);
return 0;
} | 1 | 60,148,298 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw "\n"
int main(void)
{
CIN;
ll tc,l,k,sum=0,x=0,y,z=0,m=1,n=0,ans=0,cnt=0;
cin>>x>>y>>z>>k;
if(k%2)ans=y-x;
else ans=x-y;
cout<<ans;
} | #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>
#include <cmath>
#include <math.h>
#define rep(i , n) for (int i = 1; i <= (int)(n); i++)
#define repz(i , n) for (int i = 0; i < (int) n; i++)
#define repi(i , r, n) for (int i = r; i <= (int)(n); i++)
#define repd(i , r, n) for (int i = r; i >= (int)(n); i--)
using namespace std;
int main(){
int64_t a , b , c , k;
cin >> a >> b >> c >> k;
if ( abs( a - b) <= pow( 10 ,18 )){
if ( k % 2 )cout << b - a << endl;
else cout << a - b << endl;
return 0;
}
else
cout << "Unfair" << endl;
return 0;
} | 1 | 83,863,172 |
#include<bits/stdc++.h>
using namespace std;
long long n,i,j,k,l,a[100005],b[100005],du[100005],flag,y,z;
long long top,nex[200005],to[200005],fir[100005];
long long read(){
char ch=getchar();
long long x=0;
while(ch<'0'||ch>'9')
ch=getchar();
while(ch>='0'&&ch<='9'){
x=x*10+ch-'0';
ch=getchar();
}
return x;
}
int lj(long long u,long long v){
top++;
nex[top]=fir[u];
fir[u]=top;
to[top]=v;
return 0;
}
int ss(long long u,long long v){
if(flag==1)
return 0;
long long max1=0,sum=0;
for(int top1=fir[v];top1;top1=nex[top1])
if(to[top1]!=u){
ss(v,to[top1]);
sum+=b[to[top1]];
max1=max(max1,b[to[top1]]);
}
if(du[v]==1){
b[v]=a[v];
}
else{
if(a[v]*2<sum||a[v]>sum){
flag=1;
return 0;
}
if(max1>a[v]){
flag=1;
return 0;
}
b[v]=2*a[v]-sum;
}
return 0;
}
int main(){
n=read();
for(i=1;i<=n;i++)
a[i]=read();
if(n==2){
if(a[1]==a[2])
printf("YES\n");
else
printf("NO\n");
return 0;
}
for(i=1;i<n;i++){
y=read();
z=read();
lj(y,z);
lj(z,y);
du[y]++;
du[z]++;
}
for(i=1;i<=n;i++)
if(du[i]!=1){
ss(i,i);
if(flag==0&&b[i]==0)
printf("YES\n");
else
printf("NO\n");
return 0;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
int n, a[MAXN];
vector<int> con[MAXN];
void dfs(int x, int pre) {
if (con[x].size() == 1) return;
long long sum = 0, max_val = 0;
for (int _i = 0; _i < con[x].size(); ++_i) {
int y = con[x][_i];
if (y != pre) {
dfs(y, x);
sum += a[y];
max_val = max(max_val, (long long)a[y]);
}
}
if (a[x] > sum || sum > 2 * a[x]) {
puts("NO");
exit(0);
}
int k = sum - a[x];
if (k > sum - max_val) {
puts("NO");
exit(0);
}
a[x] -= k;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%d", a + i);
for (int i = 1; i < n; ++i) {
int x, y;
scanf("%d%d", &x, &y), --x, --y;
con[x].push_back(y);
con[y].push_back(x);
}
if (n == 2) {
puts(a[0] == a[1] ? "YES" : "NO");
return 0;
}
int root = 0;
while (con[root].size() == 1) ++root;
dfs(root, -1);
puts(a[root] == 0 ? "YES" : "NO");
} | 1 | 21,439,398 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int W, H, N;
cin >> W >> H >> N;
int x, y, a, b[4] = {0, W, 0, H};
for (int i=0; i<N; i++) {
cin >> x >> y >> a;
a--;
if (a == 0)
b[a] = max(b[a], x);
else if (a == 1)
b[a] = min(b[a], x);
else if (a == 2)
b[a] = max(b[a], y);
else
b[a] = min(b[a], y);
}
int ans = max(0, b[1]-b[0]) * max(0, b[3]-b[2]);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int w,h,n;cin>>w>>h>>n;
int s=0;
int t=0;
rep(i,n){
int x,y,a;cin>>x>>y>>a;
if(a==2)w=min(w,x);
if(a==1)s=max(s,x);
if(a==4)h=min(h,y);
if(a==3)t=max(t,y);
}
int ans = max((w-s)*(h-t),0);
if((w-s)<=0 ||(h-t)<=0)ans=0;
cout<<ans<<endl;
return 0;
} | 1 | 33,893,486 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#define LOG(x) if(DEBUG)cout<<TO_STRING(x)<<"="<<x<<" ";
#define LOGE if(DEBUG)cout<<endl;
template<class T>bool chmax(T & a, const T & b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
int main(){
lli N,Y;
cin>>N>>Y;
REP(x,0,N+1){
REP(y,0,N-x+1){
lli z = N-x-y;
if(z<0)continue;
if(10000*x+5000*y+1000*z == Y){
cout<<x<<" "<<y<<" "<<z<<endl;
return 0;
}
}
}
cout<<"-1 -1 -1"<<endl;
return 0;
} | #include <iostream>
int main()
{
int N, Y, result_10000 = -1, result_5000 = -1, result_1000 = -1;
std::cin >> N >> Y;
for(int i = 0; i <= N; i++)
{
for(int j = 0; j <= N - i; j++)
{
int k = N - i - j;
if(Y == (10000*i + 5000*j + 1000*k))
{
result_10000 = i;
result_5000 = j;
result_1000 = k;
}
}
}
std::cout << result_10000 << " " << result_5000 << " " << result_1000;
return 0;
} | 1 | 32,807,184 |
#include <iostream>
using namespace std;
int main()
{
int i;
int a;
int b;
int c;
int count=0;
cin >> a >>b >>c;
for(i=a;i<=b;i++)
{
if(c%i==0)
count++;
}
cout << count <<"\n";
} | #include<iostream>
using namespace std;
int main(){
int a,b,c,sum=0;
cin>>a>>b>>c;
for(;a<=b;a++){
if(c%a==0)
sum++;
}
cout<<sum<<'\n';
return 0;
} | 1 | 631,225 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,S=0,m=100000000;
cin>>N;
vector<int>v(N);
for(int i=0;i<N;i++){
cin>>v[i];
if(m>v[i]){
S++;
m=v[i];
}
}
cout<<S<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pi pair<int,int>
#define pb push_back
#define F first
#define S second
#define B begin()
#define E end()
const int N=2e5+3;
int main()
{
ft
ll t,i,j,n,m,l=INT_MAX,r=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>m;
if(m<=l)
{
l=m;
r++;
}
}
cout<<r<<"\n";
return 0;
} | 1 | 84,075,494 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
const ll MAX = 100010;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void Main(){
int n;
cin >> n;
vector<int> p(n+1,-1);
ll outer;
For(i,0,n+1){
int a;
cin >> a;
if(p[a]==-1) p[a] = i;
else{
outer = n - i + p[a];
}
}
COMinit();
For(k,1,n+2){
ll ans = COM(n+1,k) - COM(outer,k-1);
cout << (ans+MOD)%MOD << endl;
}
}
int main(){
Main();
return 0;
} | #include<bits/stdc++.h>
#define int long long
#define dd second
#define ff first
#define mp make_pair
#define pb push_back
using namespace std;
int n;
int tab[100005];
int poz1,poz2;
int mod = 1e9+7;
int sil[100005];
int poww(int x, int y)
{
if(y == 0) return 1; if(y == 1) return x;
if(y & 1) return poww(x,y-1)*x % mod;
int k = poww(x,y/2);
return k*k%mod;
}
int newton(int a, int b)
{
if(b > a) return 0;
if(b < 0) return 0;
if(b == 0) return 1;
return (sil[a]*poww(sil[b],mod-2)%mod)*poww(sil[a-b],mod-2) % mod;
}
int count(int dl)
{
return (mod+newton(n+1,dl) - newton(poz1-1+n+1-poz2, dl-1))%mod;
}
main()
{
ios_base::sync_with_stdio(false);
cin >> n;
sil[0] = 1; for(int i = 1; i < 100005; ++i) sil[i] = sil[i-1]*i % mod;
for(int i = 0; i <=n; ++i) tab[i] = -1;
for(int i = 1; i <= n+1; ++i)
{
int temp; cin >> temp;
if(tab[temp] != -1)
{
poz1 = tab[temp]; poz2 = i;
}
tab[temp] = i;
}
for(int i = 1; i <= n+1; ++i)
{
cout << count(i) << endl;
}
} | 1 | 59,291,587 |
#include <iostream>
#include <cmath>
#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>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define mod 1000000007
using ll = long long;
using namespace std;
struct UnionFind{
vi par;
UnionFind(int N) : par(N){
rep(i, N) par[i] = i;
}
int root(int x){
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y){
int rx = root(x);
int ry = root(y);
if (rx == ry) return;
par[rx] = ry;
}
bool same(int x, int y){
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
int main(){
int n,m;
cin >> n >> m;
vi p(n);
rep(i, n){
int a;
cin >> a;
a--;
p[i] = a;
}
UnionFind tree(n);
rep(i, m){
int x,y;
cin >> x >> y;
x--; y--;
tree.unite(x, y);
}
int ans = 0;
rep(i, n){
if(i == p[i]){
ans++;
continue;
}
if(tree.same(i, p[i])){
ans++;
}
}
cout << ans << endl;
} | #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;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
class UnionFind {
public:
UnionFind(int n = 0): d(n, -1) {}
int find(int x) {
if (d[x] < 0) return x;
return d[x] = find(d[x]);
}
bool unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return false;
if (d[x] > d[y]) swap(x, y);
d[x] += d[y];
d[y] = x;
return true;
}
bool same(int x, int y) {
return find(x) == find(y);
}
int size(int x) {
return -d[find(x)];
}
private:
vector<int> d;
};
vector<int> ps;
int main(void) {
int N, M;
cin >> N >> M;
ps.resize(N);
for (int i = 0; i < N; i++) {
cin >> ps[i];
ps[i]--;
}
UnionFind uf(N);
for (int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
uf.unite(x, y);
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (uf.same(i, ps[i])) {
ans++;
}
}
cout << ans << endl;
return 0;
} | 1 | 86,666,604 |
#include <bits/stdc++.h>
#define L long long
using namespace std;
L n;
char st[200010];
L a[200010];
void go(){
L i;
for(i=2;i<n;i++)
{
a[i]=a[i-1]^a[i-2]^st[i-1];
}
a[n]=a[0];
a[n+1]=a[1];
a[n+2]=a[2];
if(a[n]==a[n-1]^a[n-2]^st[n-1])
if(a[n+1]==a[n]^a[n-1]^st[n])
{
for(i=0;i<n;i++)
{
printf("%c",a[i]?'W':'S');
}
exit(0);
}
}
int main()
{
scanf("%lld",&n);
scanf("%s",st);
L i;
for(i=n;i<2*n;i++)
{
st[i]=st[i-n]=st[i-n]=='o'?0:1;
}
a[0]=a[n]=1;
go();
a[1]=a[n+1]=1;
go();
a[0]=a[n]=0;
go();
a[1]=a[n+1]=0;
go();
puts("-1");
} | #include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <climits>
using namespace std;
#define MOD1097 1000000007
#define ll long long
#define pint pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define mpair make_pair
#define pm(first, second) pb(mpair(first, second))
#define SPACE " "
#define fpf first.first
#define fps first.second
#define spf second.first
#define sps second.second
#define all(X) (X).begin(), (X).end()
#define reall(X) (X).rbegin(), (X).rend()
#define divcel(a, b) (((a) + ((b) - 1)) / (b))
int main(){
int N;
string S;
cin >> N >> S;
vector<int> V(N);
bool able = false, flag1, flag2;
V[0] = 1;
V[1] = 1;
for(int i = 1; i < N - 1; i++){
if(V[i] == 1){
if(S[i] == 'o'){
V[i + 1] = V[i - 1];
}
else{
V[i + 1] = -V[i - 1];
}
}
else{
if(S[i] == 'o'){
V[i + 1] = -V[i - 1];
}
else{
V[i + 1] = V[i - 1];
}
}
}
flag1 = false;
flag2 = false;
if(V[0] == 1){
if(S[0] == 'o'){
if(V[1] == V[N-1])flag1 = true;
}
else{
if(V[1] != V[N-1])flag1 = true;
}
}
else{
if(S[0] == 'o'){
if(V[1] != V[N-1])flag1 = true;
}
else{
if(V[1] == V[N-1])flag1 = true;
}
}
if(V[N-1] == 1){
if(S[N-1] == 'o'){
if(V[N-2] == V[0])flag2 = true;
}
else{
if(V[N-2] != V[0])flag2 = true;
}
}
else{
if(S[N-1] == 'o'){
if(V[N-2] != V[0])flag2 = true;
}
else{
if(V[N-2] == V[0])flag2 = true;
}
}
if(flag1 && flag2){
for(int i = 0; i < N; i++){
if(V[i] == 1)cout << "S";
else cout << "W";
}
cout << endl;
return 0;
}
V[0] = 1;
V[1] = -1;
for(int i = 1; i < N - 1; i++){
if(V[i] == 1){
if(S[i] == 'o'){
V[i + 1] = V[i - 1];
}
else{
V[i + 1] = -V[i - 1];
}
}
else{
if(S[i] == 'o'){
V[i + 1] = -V[i - 1];
}
else{
V[i + 1] = V[i - 1];
}
}
}
flag1 = false;
flag2 = false;
if(V[0] == 1){
if(S[0] == 'o'){
if(V[1] == V[N-1])flag1 = true;
}
else{
if(V[1] != V[N-1])flag1 = true;
}
}
else{
if(S[0] == 'o'){
if(V[1] != V[N-1])flag1 = true;
}
else{
if(V[1] == V[N-1])flag1 = true;
}
}
if(V[N-1] == 1){
if(S[N-1] == 'o'){
if(V[N-2] == V[0])flag2 = true;
}
else{
if(V[N-2] != V[0])flag2 = true;
}
}
else{
if(S[N-1] == 'o'){
if(V[N-2] != V[0])flag2 = true;
}
else{
if(V[N-2] == V[0])flag2 = true;
}
}
if(flag1 && flag2){
for(int i = 0; i < N; i++){
if(V[i] == 1)cout << "S";
else cout << "W";
}
cout << endl;
return 0;
}
V[0] = -1;
V[1] = 1;
for(int i = 1; i < N - 1; i++){
if(V[i] == 1){
if(S[i] == 'o'){
V[i + 1] = V[i - 1];
}
else{
V[i + 1] = -V[i - 1];
}
}
else{
if(S[i] == 'o'){
V[i + 1] = -V[i - 1];
}
else{
V[i + 1] = V[i - 1];
}
}
}
flag1 = false;
flag2 = false;
if(V[0] == 1){
if(S[0] == 'o'){
if(V[1] == V[N-1])flag1 = true;
}
else{
if(V[1] != V[N-1])flag1 = true;
}
}
else{
if(S[0] == 'o'){
if(V[1] != V[N-1])flag1 = true;
}
else{
if(V[1] == V[N-1])flag1 = true;
}
}
if(V[N-1] == 1){
if(S[N-1] == 'o'){
if(V[N-2] == V[0])flag2 = true;
}
else{
if(V[N-2] != V[0])flag2 = true;
}
}
else{
if(S[N-1] == 'o'){
if(V[N-2] != V[0])flag2 = true;
}
else{
if(V[N-2] == V[0])flag2 = true;
}
}
if(flag1 && flag2){
for(int i = 0; i < N; i++){
if(V[i] == 1)cout << "S";
else cout << "W";
}
cout << endl;
return 0;
}
V[0] = -1;
V[1] = -1;
for(int i = 1; i < N - 1; i++){
if(V[i] == 1){
if(S[i] == 'o'){
V[i + 1] = V[i - 1];
}
else{
V[i + 1] = -V[i - 1];
}
}
else{
if(S[i] == 'o'){
V[i + 1] = -V[i - 1];
}
else{
V[i + 1] = V[i - 1];
}
}
}
flag1 = false;
flag2 = false;
if(V[0] == 1){
if(S[0] == 'o'){
if(V[1] == V[N-1])flag1 = true;
}
else{
if(V[1] != V[N-1])flag1 = true;
}
}
else{
if(S[0] == 'o'){
if(V[1] != V[N-1])flag1 = true;
}
else{
if(V[1] == V[N-1])flag1 = true;
}
}
if(V[N-1] == 1){
if(S[N-1] == 'o'){
if(V[N-2] == V[0])flag2 = true;
}
else{
if(V[N-2] != V[0])flag2 = true;
}
}
else{
if(S[N-1] == 'o'){
if(V[N-2] != V[0])flag2 = true;
}
else{
if(V[N-2] == V[0])flag2 = true;
}
}
if(flag1 && flag2){
for(int i = 0; i < N; i++){
if(V[i] == 1)cout << "S";
else cout << "W";
}
cout << endl;
return 0;
}
cout << "-1" << endl;
return 0;
} | 1 | 26,236,264 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
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;
}
int main(){
ll n;cin >> n;
vl v(n);rep(i,n)cin >> v[i];
map<ll,ll> mp;
ll now=0;mp[0]++;
ll res=0;
rep(i,n){
now+=v[i];
res+=mp[now];
mp[now]++;
}
cout << res <<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll n;
ll a[200005],b[200005];
ll t;
ll ans;
int main(void){
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
b[i+1]=b[i]+a[i];
}
sort(b,b+n+1);
for(int i=1;i<=n;i++){
if(b[i]!=b[i-1]){
ans+=(i-t)*(i-t-1)/2;
t=i;
}
}
ans+=(n+1-t)*(n-t)/2;
cout<<ans<<endl;
} | 1 | 32,827,392 |
#include <iostream>
#include <algorithm>
#include <string>
#include <math.h>
#include <cstdint>
#include <sstream>
#include <map>
#include<vector>
using namespace std;
typedef long long ll;
ll ans,mx,sum,mn=1e8,cnt;
int main(){
ll n;
cin>>n;
if(n<1200) cout<<"ABC";
else cout<<"ARC";
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi first
#define se second
#define setpre(x) cout << fixed << setprecision(x)
#define ii(x) int x; cin >> (x)
#define ii2(x, y) int x, y; cin >> (x) >> (y)
#define ii3(x, y, z) int x, y, z; cin >> (x) >> (y) >> (z)
#define out(x) cout << (x) << endl
#define outs(x) cout << (x) << " "
#define yn(x) cout << ((x)?("Yes"):("No")) << endl
#define YN(x) cout << ((x)?("YES"):("NO")) << endl
#define bit_c(x) __builtin_popcountll(x)
inline void logger(){ cout << " [LOGGER] " << endl; }
template<typename A, typename... B>
void logger(const A& a, const B&... b){
cout << a << " , ";
logger(b...);
}
typedef pair<lint, lint> P;
const lint MOD = 1000000007;
const lint MOD9 = 998244353;
const lint INF = MOD * MOD;
const int MAX = 200005;
int main(){
ii(x); string ans = "ARC";
if(x < 1200) ans = "ABC"; out(ans);
} | 1 | 40,422,645 |
#include <iostream>
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <limits>
#include <iomanip>
using namespace std;
using ll = long long;
constexpr ll INF = 1010000000000000017LL;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
ll GCD(ll a, ll b) { if(b==0) return a; else return GCD(b, a%b); }
ll LCM(ll a, ll b) { return a/GCD(a,b)*b; }
class AMaximizeTheFormula {
public:
void solve(std::istream& in, std::ostream& out) {
int a,b,c;in>>a>>b>>c;
out<<max({a,b,c})*9+a+b+c<<endl;
}
};
int main() {
AMaximizeTheFormula solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define INF 100000000
typedef long long ll;
int main(){
VL a(3);
cin>>a[0]>>a[1]>>a[2];
sort(a.begin(),a.end());
cout<<a[2]*10+a[1]+a[0]<<endl;
return 0;
} | 1 | 60,418,420 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
char op;
cin >> a >> op >> b;
switch (op) {
case '+':
cout << a + b << endl;
break;
default:
cout << a - b << endl;
break;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
char k;
cin>>a;
cin>>k;
cin>>b;
if(k=='+'){
cout<<a+b<<'\n';
}
if(k=='-'){
cout<<a-b<<'\n';
}
return(0);
} | 1 | 3,964,103 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
const int MAX = 510000;
const int MOD = 1000000007;
int main(){
ll N,X;cin>>N>>X;
ll ans = N;
ll a = max(N-X,X), b= min(N-X,X);
while(b){
ll p = a / b;
ll r = a % b;
ans += (b*2) * p;
if(r == 0) ans -= b;
a = b, b = r;
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long a,long long b){
return b ? gcd(b, a%b) : a;
}
int main(){
long long N, X; cin >> N >> X;
if(X>N/2){
X=N-X;
}
long long ans=gcd(X, N)*(N/gcd(X, N)-1)*3;
cout << ans << endl;
} | 1 | 87,659,382 |
#include <bits/stdc++.h>
using namespace std;
#define point pair<int ,int>
#define x first
#define y second
int n;
vector <point> vs;
double ang(point p){
if(p.x >= 0 && p.y >= 0 || p.x <= 0 && p.y >= 0)
return acos(p.x/sqrt(1LL*p.x*p.x + 1LL*p.y*p.y));
return 7-acos(p.x/sqrt(1LL*p.x*p.x + 1LL*p.y*p.y));
}
long long sqr(long long num){
return num*num;
}
int main()
{
scanf("%d",&n);
for(int a,b,i=0; i<n; i++){
scanf("%d%d",&a,&b);
if(a||b)
vs.push_back({a ,b});
}
n = vs.size();
sort(vs.begin() ,vs.end() ,[](point p1 ,point p2){
return ang(p1) < ang(p2);
});
vs.insert(vs.end() ,vs.begin() ,vs.end());
long long ans = 0LL ,sx = 0LL ,sy = 0LL;
for(int i=0,j=0; i<n; i++){
while(j-i+1<=n && j < vs.size() && sqr(sx+vs[j].x)+sqr(sy+vs[j].y) > sqr(sx)+sqr(sy))
sx += vs[j].x ,sy += vs[j].y ,j++;
ans = max(ans ,sqr(sx)+sqr(sy));
sx -= vs[i].x ,sy -= vs[i].y;
}
printf("%.10f\n",sqrt(ans));
} | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
#define fix10 cout << fixed << setprecision(20);
#define rep(i,n) for(int i=0; i<(int)(n);i++)
int main(){
fix10;
double PI = acos(-1);
int n;
cin >> n;
vector<tuple<double,long,long>> engine(n);
rep(i,n){
long x,y;
cin >> x >> y;
engine.at(i) = make_tuple(atan2(y,x),x,y);
}
sort(engine.begin(),engine.end());
double maxi = 0;
rep(i,n){
double shita = get<0>(engine.at(i));
long X = 0;
long Y = 0;
int count = 0;
for(int j = i; count < n ; j = (j+1)%n){
if(get<0>(engine.at(j)) >= shita + PI) break;
X += get<1>(engine.at(j));
Y += get<2>(engine.at(j));
count++;
double dis0 = sqrt(X*X+Y*Y);
maxi = max(maxi,dis0);
}
double dis = sqrt(X*X+Y*Y);
maxi = max(maxi,dis);
get<0>(engine.at(i)) = shita + 2*PI;
}
cout << maxi << endl;
} | 1 | 78,525,345 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using pll = pair<long long, long long>;
int main() {
int N;
long long M;
cin >> N >> M;
vector<pll> v(N);
for (int i = 0; i < N; ++i) cin >> v[i].first >> v[i].second;
sort(v.begin(), v.end());
long long res = 0;
for (int i = 0; i < N && M > 0; ++i) {
res += v[i].first * min(M, v[i].second);
M -= min(M, v[i].second);
}
cout << res << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
int64_t n,m,a,b,i,ans=0,c=0;
map<int64_t,int64_t> mp;
cin>>n>>m;
for(i=0;i<n;i++){
cin>>a>>b;
if(mp.count(a)) mp.at(a)+=b;
else mp[a]=b;
}
for(auto z:mp){
ans+=z.first*z.second;
c+=z.second;
if(c>=m){
ans-=z.first*(c-m);
break;
}
}
cout<<ans<<endl;
} | 1 | 49,203,239 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if (C >= A && C <= B ) {
cout << "Yes" << endl;
}
if (!( C >= A && C <= B )) {
cout << "No" << endl;
}
} | #include<bits/stdc++.h>
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;
typedef pair<int, int> P;
const ll MOD = 1e9+7, INF = 1e9;
int main()
{
int a, b, c; cin >> a >> b >> c;
if(a <= c && c <= b){
cout << "Yes" << endl;
}
else cout << "No" << endl;
system("pause");
} | 1 | 98,318,127 |
#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>
#include <math.h>
#include <cmath>
#include <stdlib.h>
using namespace std;
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define fir first
#define sec second
#define m_p make_pair
#define m_t make_tuple
#define rep(i,n) for(int i=0; i<(int) (n); i++)
const double pai = 3.1415926535897;
const int mod = 1000000007;
const int INF = 1000000021;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
int b_s(vector<int>& vec, int xx) {
return lower_bound(all(vec), xx) - vec.begin();
}
template<typename T>void vecout(vector<T>& vec) { for (T t : vec) cout << t << " "; cout << endl; }
template<typename TT>void vecin(vector<TT>& vec) {
for (int i = 0; i < vec.size(); i++) {
cin >> vec[i];
}
}
template<class tt> struct counter {
map<tt, int>mp;
bool add(tt t, int xx) {
if (!mp.count(t)) {
mp[t] = xx;
return true;
}
mp[t] += xx;
if (!mp[t]) {
mp.erase(t);
}
return false;
}
};
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
long long modpow(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
bool chmax(int& xx, int yy) {
if (xx < yy) {
xx = yy;
return true;
}
return false;
}
bool chmin(int& xx, int yy) {
if (xx > yy) {
xx = yy;
return true;
}
return false;
}
int gcd(int xx, int yy) {
int p = xx;
int q = yy;
if (q > p)swap(p, q);
while (p % q != 0) {
p %= q;
swap(p, q);
}
return q;
}
int lcm(int xx, int yy) {
return xx * yy / gcd(xx, yy);
}
bool prime(int xx) {
if (xx <= 1) {
return 0;
}
for (int i = 2; i * i <= xx; i++) {
if (xx % i == 0) {
return 0;
}
}
return 1;
}
signed main() {
int n,a,ans=0;
cin >> n;
vector<bitset<60>>vec(n);
rep(i, n) {
cin >> a;
vec[i] = (bitset<60>)a;
}
rep(i, 60) {
int c=0, d=0;
for (auto b : vec) {
if (b[i]) c++;
else d++;
}
ans += modpow(2, i) * ((c * d) % mod);
ans %= mod;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int inf = 10e17;
#define mod 1000000007
int32_t main()
{
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
{
cin >> arr[i];
}
vector<int> vec;
int carry = 0;
for (int i = 0; i <= 100; i++)
{
int one = 0;
for (int j = 0; j < n; j++)
{
if (arr[j] & 1)
one++;
arr[j] /= 2;
}
int p = one * (n - one);
int sum = p + carry;
vec.push_back(sum % 2);
carry = sum / 2;
}
int ans = 0;
int sum = 1;
for (int i = 0; i < vec.size(); i++)
{
ans = (ans + vec[i] * sum) % mod;
sum = (sum * 2) % mod;
}
cout << ans << "\n";
return 0;
} | 1 | 85,403,117 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define pa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
#define pb push_back
#define fi first
#define be begin()
#define en end()
#define se second
using ll = long long;
using namespace std;
using pint = pair<int,int>;
using pll = pair<ll,ll>;
const int INFint = 1e9;
const ll INFll = 1e18;
ll MOD=1e9+7;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a; }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
ll modpow(ll a, ll n) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
ll modinv(ll a) {
return modpow(a, MOD - 2);
}
int main(){
int a,b,c;
cin>>a>>b>>c;
if (a==b){
cout << c << endl;
}else if (a == c){
cout << b << endl;
}else{
cout << a << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> a(3);
for(int i = 0;i<3;i++){
cin >> a[i];
}
sort(a.begin(),a.end());
if(a[0] == a[1])cout << a[2] << endl;
else cout << a[0] << endl;
} | 1 | 12,688,238 |
#include<bits/stdc++.h>
#define ll long long
#define vl vector
#define pb push_back
using namespace std;
int main()
{
ll a,b,i,j,n,k;
string s;
cin>>n>>s;
ll flag=0;
for(i=0;i<1000;i++)
{
string t;
t=to_string(i);
a=t.size();
for(j=0;j<3-a;j++)
{
t="0"+t;
}
k=0;
for(j=0;j<s.size();j++)
{
if(s[j]==t[k]) k++;
if(k==3) break;
}
if(k==3) flag++;
}
cout<<flag;
} | #include <iostream>
#include <string>
bool Find(const std::string& S, const std::string& partial) {
int current_index = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == partial[current_index]) {
current_index++;
}
if (current_index == 3) {
return true;
}
}
return false;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int N;
std::string S;
std::cin >> N >> S;
int found = 0;
for (int i = 0; i < 1000; i++) {
if (i < 10) {
found += Find(S, std::string("00") + std::to_string(i))? 1: 0;
} else if (i < 100) {
found += Find(S, std::string("0") + std::to_string(i))? 1: 0;
} else {
found += Find(S, std::to_string(i))? 1: 0;
}
}
std::cout << found << std::endl;
return 0;
} | 1 | 29,665,254 |
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<stack>
#include<map>
using namespace std;
#define int long long
#define REP(i,n) for(int i=0;(i)<(n);(i)++)
#define ll long long
map<pair<int,int>, int> mp;
signed main() {
int H, W, N;
cin >> H >> W >> N;
int a, b;
pair<int, int> p;
REP(i, N) {
cin >> a >> b;
for (int i = -1;i <= 1;i++) {
for (int j = -1;j <= 1;j++) {
p.first = a + i;
p.second = b + j;
if (p.first<2 || p.first > H - 1 || p.second < 2 || p.second > W - 1) continue;
mp[p]++;
}
}
}
ll ans[10];
ans[0] = (H - 2)*(W - 2);
for (int i = 1;i <= 9;i++) {
ans[i] = 0;
for (auto m : mp) {
if (m.second == i) ans[i]++;
}
ans[0] -= ans[i];
}
REP(i, 10) cout << ans[i] << endl;
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 1000005
#define ll long long
using namespace std;
ll map[maxn];
int dx[9]={0,-1,-2,0,0,-1,-1,-2,-2};
int dy[9]={0,0,0,-1,-2,-1,-2,-1,-2};
ll ans;
ll h,w;
ll result[20];
int n;
int sum;
int main()
{ while(~scanf("%lld%lld%d",&h,&w,&n))
{ll x,y;
sum=0;
ans=(h-2)*(w-2);
memset(map,0,sizeof(map));
memset(result,0,sizeof(result));
for(int i=1;i<=n;i++)
{scanf("%lld%lld",&x,&y);
for(int j=0;j<9;j++)
{
ll xx=x+dx[j];
ll yy=y+dy[j];
if(xx>=1&&xx<=h-2&&yy>=1&&yy<=w-2)
map[sum++]=(xx-1)*w+yy;
}
}
sort(map,map+sum);
int cnt=1;
map[sum]=-1;
for(int i=0;i<sum;i++)
{
if(map[i]==map[i+1])
{
cnt++;
}
else
{
result[cnt]++;
cnt=1;
ans-=1;
}
}
printf("%lld\n",ans);
for(int i=1;i<=9;i++)
printf("%lld\n",result[i]);
}
return 0;
} | 1 | 16,576,164 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
#include<functional>
#include<map>
#include<iomanip>
#include<limits>
#include<unordered_set>
#include<cmath>
#include <numeric>
#include <array>
#include<utility>
#include <complex>
#define M_PI 3.141592653589793238
using namespace std;
long long p = 1000000007;
#define upperbound(v,val) upper_bound(v.begin(),v.end(),val)-v.begin()
#define lowerbound(v,val) lower_bound(v.begin(),v.end(),val)-v.begin()
#define int long long
#define ll long long
#define vel vector<ll>
#define vvel vector<vel>
#define rep(i,n) for(int i=0;i<n;i++)
#define sor(v) sort(v.begin(),v.end())
#define mmax(a,b) a=max(a,b)
#define mmin(a,b) a=min(a,b)
#define mkp(a,b) make_pair(a,b)
#define pin pair<ll,ll>
#define qin pair<pin,int>
#define V vector
#define Endl endl
#define veb vector<bool>
#define fcout cout << fixed << setprecision(15)
#define rev(s) reverse(s.begin(),s.end())
#define lower(h,val) (lower_bound(h.begin(),h.end(),val)-h.begin())
#define upper(h,val) (upper_bound(h.begin(),h.end(),val)-h.begin())
#define vveb V<veb>
#define omajinai cin.tie(0);ios::sync_with_stdio(false);
#define endl "\n"
#define pb push_back
vel kai;
vel inv_kai;
int root(int x, vel& pa) {
if (pa[x] == -1) { return x; }
int ans = root(pa[x], pa); pa[x] = ans;
return ans;
}
bool mar(int x, int y, vel& pa) {
x = root(x, pa);
y = root(y, pa);
if (x != y) { pa[x] = y; }
return (x != y);
}
int gcd(int x, int y) {
if (x < y) { return gcd(y, x); }
if (y == 0) { return x; }
return gcd(y, x % y);
}
int lcm(ll x, ll y) {
x = abs(x); y = abs(y);
return x * (y / gcd(x, y));
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
void make_kai(int max_kai,int p) {
kai = vel(max_kai, 1);
inv_kai = kai;
rep(i, max_kai - 1) {
kai[i + 1] = kai[i] * (i + 1); kai[i + 1] %= p;
inv_kai[i + 1] = modinv(kai[i + 1], p);
}
}
int com(int n, int r) {
if ((n < 0) || (r < 0) || (r > n)) { return 0; }
int ans = (kai[n] * inv_kai[r]) % p;
return (ans * inv_kai[n - r]) % p;
}
vel uni(vel x) {
if (x.size() == 0) { return x; }
sor(x);
int n = x.size();
vel ans(1, x[0]);
for (int j = 1; j < n; j++) {
if (x[j - 1] != x[j]) { ans.push_back(x[j]); }
}
x = ans;
return x;
}
vel dijk(V<V<pin>>& way, int st, int inf) {
int n = way.size();
vel dist(n, inf); dist[st] = 0;
priority_queue<pin, vector<pin>, greater<pin>> pq;
pq.push(mkp(0, st));
veb is_checked(n, false);
while (!pq.empty()) {
pin x = pq.top(); pq.pop();
int pot = x.second;
if (!is_checked[pot]) {
is_checked[pot] = true;
for (auto y : way[pot]) {
int nex_dist = x.first + y.second;
int nex_pot = y.first;
if (dist[nex_pot] > nex_dist) {
dist[nex_pot] = nex_dist;
pq.push(mkp(nex_dist, y.first));
}
}
}
}
return dist;
}
void make_tree(vvel& chi, vel& par,int n) {
V<V<pin>> way(n);
rep(i, n - 1) {
int a, b; cin >> a >> b; a--; b--;
way[a].push_back(mkp(b, 1));
way[b].push_back(mkp(a, 1));
}
vel dist = dijk(way, 0, n + 1);
par = vel(n,-1);
chi = vvel(n);
rep(i, n) {
for (auto nex : way[i]) {
int pot = nex.first;
if (dist[pot] > dist[i]) { chi[i].push_back(pot); }
else { par[i] = pot; }
}
}
}
void pri(vel& v) {
if (v.size() == 0) { return; }
cout << v[0];
rep(i, v.size() - 1) { cout << " " << v[i + 1]; }
cout << endl;
return;
}
int modpow(int a, int n, int p) {
if (n == 0) { return 1; }
int m = n / 2;
int x = modpow(a, n / 2, p);
x *= x; x %= p;
if (n % 2 == 1) { x *= a; x %= p; }
return x;
}
int solve(int n, int x, vel& a,vel&b) {
if (n == 0) {
return x;
}
if (x == 0) { return 0; }
if (x <= a[n-1] + 1) { return solve(n - 1, x - 1, a, b); }
return b[n-1] + 1 + solve(n - 1, min(x - a[n - 1] - 2, a[n - 1]), a,b);
}
signed main() {
int n, x; cin >> n >> x;
vel a(n + 1, 1);
vel b(n + 1, 1);
rep(i, n) { a[i + 1] = 2 * a[i] + 3; b[i + 1] = 2 * b[i] + 1; }
cout << solve(n, x,a,b) << endl;
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
long long patty_num(const int l,
const long long x,
const vector<long long>& patty,
const vector<long long>& bun,
const vector<long long>& all){
if(l == 0){
if(x <= 0){
return 0;
}else{
return 1;
}
}
if(x <= 1){
return 0;
}
if(x >= all[l]){
return patty[l];
}
long long ret =
patty_num(l - 1, x - 1, patty, bun, all) +
patty_num(l - 1, x - (1 + all[l - 1] + 1), patty, bun, all);
if(x >= 1 + all[l - 1] + 1){
ret += 1;
}
return ret;
}
int main(){
int N;
long long X;
cin >> N >> X;
vector<long long> all(N + 1), patty(N + 1), bun(N + 1);
patty[0] = 1;
all[0] = 1;
for(int n = 1; n <= N; n++){
patty[n] = 2 * patty[n - 1] + 1;
bun[n] = 2 * bun[n - 1] + 2;
all[n] = patty[n] + bun[n];
}
long long ans = patty_num(N, X, patty, bun, all);
cout << ans << endl;
} | 1 | 14,569,062 |
#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, long long M, std::vector<long long> a, std::vector<long long> b, std::vector<long long> c,
std::vector<long long> d) {
rep(i, N) {
ll min_distance = 1e10;
ll ans = 0;
rep(j, M) {
ll distance = abs(c[j] - a[i]) + abs(d[j] - b[i]);
if (distance < min_distance) {
ans = j + 1;
min_distance = distance;
}
}
cout << ans << endl;
}
}
int main() {
long long N;
scanf("%lld", &N);
long long M;
scanf("%lld", &M);
std::vector<long long> a(N);
std::vector<long long> b(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &a[i]);
scanf("%lld", &b[i]);
}
std::vector<long long> c(M);
std::vector<long long> d(M);
for (int i = 0; i < M; i++) {
scanf("%lld", &c[i]);
scanf("%lld", &d[i]);
}
solve(N, M, std::move(a), std::move(b), std::move(c), std::move(d));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main(){
int n, m; cin >> n >> m;
vector<P> pos, check;
vector<int> ans;
rep(i,n){
int a, b; cin >> a >> b;
pos.push_back(P(a,b));
}
rep(i,m){
int c, d; cin >> c >> d;
check.push_back(P(c,d));
}
rep(i,n){
int min_d = INF;
int index = -1;
rep(j,m){
int tmp = abs(pos[i].first - check[j].first) + abs(pos[i].second - check[j].second);
if(min_d > tmp){
index = j;
min_d = tmp;
}
}
ans.push_back(index+1);
}
for(auto e : ans){
cout << e << endl;
}
} | 1 | 77,985,473 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int anser(string s) {
if (s == "Male") {
return 0;
}
if (s == "Female") {
return 1;
}
if (s == "Vacant") {
exit(0);
}
exit(-1);
}
int query(int p) {
cout << p << endl;
string s;
cin >> s;
return anser(s);
}
bool bingo(int d, int v1, int v2) {
if (d % 2 == 0) {
return v1 != v2;
} else {
return v1 == v2;
}
}
int main() {
int n;
cin >> n;
int from = 0;
int to = n - 1;
int from_q = query(from);
int to_q = query(to);
while(true) {
int mid = from + (to - from) / 2;
int mid_q = query(mid);
if (bingo(mid - from,from_q, mid_q)) {
to = mid;
to_q = mid_q;
} else if (bingo(to - mid, mid_q, to_q)) {
from = mid;
from_q = mid_q;
} else {
int a[0];
a[-10000000] = 0;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define rep(i,N) for(int i=0;i<N;i++)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin>>N;
string s;
cout<<0<<endl;
cout<<flush;
cin>>s;
int a;
if(s=="Male")a=1;
else if(s=="Female")a=0;
else return 0;
int l=0,r=N,m;
for(int i=0;i<19;i++){
m=(l+r)/2;
cout<<m<<endl;
cout<<flush;
string S;
cin>>S;
int c;
if(S=="Male")c=1;
else if(S=="Female")c=0;
else return 0;
if(m%2){
if(c==a)r=m;
else l=m;
}
else{
if(c==a)l=m;
else r=m;
}
}
return 0;
} | 1 | 87,698,011 |
#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>
const ll MOD=998244353;
const int INF=1e9;
const double PI=acos(-1);
int main() {
ios_base::sync_with_stdio(false);
char a,b;
cin >> a >> b;
if (a<b) cout << '<' << endl;
else if (a==b) cout << '=' << endl;
else cout << '>' << endl;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
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 PI 3.141592653589793238
#define INF 1050000000
using vi = vector<int>;
int main() {
char X, Y;
cin >> X >> Y;
if (X < Y)
{
cout << '<' << endl;
}
else if (X > Y)
{
cout << '>' << endl;
}
else {
cout << '=' << endl;
}
return 0;
} | 1 | 97,717,983 |
#include <iostream>
#include <iomanip>
#include <vector>
using namespace std;
int main(){
int n,buf;
int min = 1000000, max = -1000000;
long sum = 0;
vector <int> a;
cin >> n;
for (int i = 0; i < n; i++){
cin >> buf;
a.push_back(buf);
}
for (int i = 0; i < a.size(); i++){
if (a[i] < min) min = a[i];
if (a[i] > max) max = a[i];
sum += a[i];
}
cout << min << " " << max << " " << sum << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(){
int a=0,n=0,c=1000000,b=-1000000;
long long d=0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a;
if(a<c)
{
c=a;
}
if(b<a){
b=a;
}
d=d+a;
}
cout<<c<<" "<<b<<" "<<d<<endl;
return 0;
} | 1 | 22,051,265 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pllll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef priority_queue<ll, vector<ll>, greater<ll> > gpq;
typedef priority_queue<ll> pq;
const int MOD=1000000007;
const long double PI=3.1415926535897932;
int main(){
ll A,B,C;cin>>A>>B>>C;
cout<<max(0LL,C-(A-B))<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define start ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define f(i, a, n) for( i=a; i<n;i++)
#define rr return 0 ;
const int N = (int)(1*1e6+10);
int fen[N];
typedef long long ss;
int main()
{
ss a,b,c,i,j,m,n;
cin>>a>>b>>c;
m=a-b;
if(m>=c) cout<<0<<endl;
else
{
cout<<c-m<<endl;
}
rr;
} | 1 | 62,951,126 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) ASC((x)); REV((x))
#define pb push_back
#define eb emplace_back
int main()
{
ll N;
cin >> N;
vec A(N+1);
REP(i,1,N+1) cin >> A[i];
ll k = 1, cnt = 0;
REP(i,0,N+1) {
k = A[k];
++cnt;
if(k == 2) break;
}
if(cnt == N+1) PR(-1);
else PR(cnt);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> box(n);
for(int i = 0; i < n; i++){
cin >> box.at(i);
}
int cnt = 0, j = 0;
for(int i = 0; i < n; i++){
cnt++;
if(box.at(j) == 2){
break;
}
if(cnt == n){
cout << -1 << endl;
return 0;
}
j = box.at(j)-1;
}
cout << cnt << endl;
} | 1 | 2,367,192 |
#include <bits/stdc++.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<string.h>
using namespace std;
#define pb push_back
#define all(v) v. begin(),v. end()
#define rep(i,n,v) for(i=n;i<v;i++)
#define per(i,n,v) for(i=n;i>v;i--)
#define ff first
#define ss second
#define pp pair<ll,ll>
#define ll long long
#define endl '\n'
void solve()
{
ll n, a,m=0,b=1, c,k=0, i, j,l=1e9+7;
string s, r, y;
cin>>n>>s;
if(n%2) {cout<<"No";return;}
sort(s.begin(),s. end());
rep(i,0,s.length())
{
if(s[i]==s[i+1] && i+1<n){i++;continue ;}
else if(i+1<n)
{
cout<<"No";return;
}
}
cout<<"Yes";
}
int main()
{
ios_base::sync_with_stdio(false);
cin. tie(0);cout. tie(0);
ll t=1;
while(t--)
{
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
string S="";
string T="";
cin >> N >> S;
if(N%2 == 0){
for (int i=0;i<N/2;++i){
T += S[i];
}
if(S == (T+T)){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
}else{
cout << "No" << endl;
}
return 0;
} | 1 | 77,788,451 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int X1,Y1,X2,Y2;
cin >> X1 >> Y1 >> X2 >> Y2;
int dx=X2-X1;
int dy=Y2-Y1;
int X=X2;
int Y=Y2;
for(int i=0;i<2;i++){
swap(dx,dy);
dx=-dx;
X+=dx;
Y+=dy;
cout << X << " " << Y;
if(i==0){
cout << " ";
}
else{
cout << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
template <typename T> using vec = vector<T>;
template <typename T> using vvec = vector<vector<T>>;
constexpr int64_t mpow(int64_t a, int64_t b, int64_t mod = 1000000007) {
if (b <= 0) { return 1; } if (b == 1) { return a % mod; } if (b == 2) { return (a * a) % mod; }
return (max(a * (b & 1), (int64_t)1) * mpow(mpow(a, b / 2, mod), 2, mod)) % mod;
}
constexpr int64_t mdiv(int64_t a, int64_t b, int64_t mod = 1000000007) {
return (a * mpow(b, mod - 2, mod)) % mod;
}
int main() {
int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;
int x3, y3, x4, y4;
x3 = x2 - (y2 - y1);
y3 = y2 + (x2 - x1);
x4 = x1 - (y2 - y1);
y4 = y1 + (x2 - x1);
cout << x3 << ' ' << y3 << ' ' << x4 << ' ' << y4 << endl;
} | 1 | 89,274,849 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for(int i=0; i<n; i++) cin >> v[i];
sort(v.rbegin(), v.rend());
int ans = 0;
for(int i=0; i<k; i++) ans += v[i];
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long i,n,c=0,k;
cin>>n>>k;
long long A[n];
for(i=0;i<n;i++)
cin>>A[i];
sort(A,A+n);
for(i=n-1;i>=(n-k);i--)
{
c+=A[i];
}
cout<<c<<endl;
return 0;
} | 1 | 1,047,767 |
#include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<bitset>
#include<string>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<complex>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn = 52;
ll K,k;
ll a[maxn];
int main()
{
scanf("%lld",&K); k=K%50ll;
for(int i=50;i>50-k;i--) a[i]=50;
for(int i=50-k;i>=1;i--) a[i]=50-k-1;
k=K/50ll;
for(int i=1;i<=50;i++) a[i]+=k;
printf("50\n");
for(int i=1;i<=50;i++) printf("%lld ",a[i]);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
ll a[52];
int main() {
ll n;
cin>>n;
for(ll i=0;i<50;i++){
a[i]=i;
}
ll s=n/50;
for(ll i=0;i<50;i++){
a[i]+=s;
}
s=n%50;
for(ll i=0;i<s;i++){
a[49-i]++;
}
cout << 50<<endl;
for(ll i=0;i<50;i++){
cout <<a[i]<< " ";
}
return 0;
} | 1 | 23,229,761 |
#include <bits/stdc++.h>
#include <vector>
#include <math.h>
using namespace std;
int main(){
long long x,y;
cin>>x>>y;
if(x*y < 0) cout<<abs(abs(x) - abs(y))+1<<endl;
else if(x*y == 0){
if(x<y) cout<<y-x<<endl;
else cout<<x-y+1<<endl;
}
else {
if(x<y) cout<<y-x<<endl;
else
cout<<x-y+2<<endl;
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <math.h>
#include <cstdint>
#include <vector>
#include <sstream>
#include <unordered_map>
using namespace std;
typedef long long ll;
ll ans, mx, mn, flag, sum, cnt;
int main(){
ll x,y;
cin>>x>>y;
if(x>=0 && y>=0){
if(y>=x) cout<<y-x;
else if(y>0)cout<<(x-y)+2;
else cout<<x+1;
}
else if(x>=0 && y<0){
if(abs(y)>=x) cout<<(abs(y)-x)+1;
else cout<<(x-abs(y))+1;
}
else if(x<0 && y>=0){
if(y>=abs(x)) cout<<(y-abs(x))+1;
else if(y>0) cout<<(abs(x)-y)+1;
else if(y==0) cout<<abs(x);
}
else if(x<0 && y<0){
if(abs(x)>=abs(y)) cout<<abs(x)-abs(y);
else cout<<(abs(y)-abs(x))+2;
}
} | 1 | 39,508,664 |
#include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int a, b, c, d;
d=0;
cin >> a >> b >> c;
for(int i =a; i<=b; i++){
if(c%i ==0){
d = d +1;
}
}
cout << d <<endl;
return 0;
} | #include <iostream>
int main(int argc, char const* argv[])
{
int a, b, c;
int count = 0;
std::cin >> a >> b >> c;
for (size_t i = a; i < b + 1; i++)
if( c % i == 0)
count++;
std::cout << count << std::endl;
return 0;
} | 1 | 33,328,394 |
#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 all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
long long GCD(long long a, long long b) {
if (b == 0) return a;
else return GCD(b, a % b);
}
int main()
{
int a, b, k;
cin >> a >> b >> k;
int c = 0;
rep(i, min(a, b)) {
int n = min(a, b) - i;
if (a % n == 0 && b % n == 0) {
c++;
if (c >= k) {
put(n);
return 0;
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int A,B,K;
cin >> A >> B >> K;
vector<int> n;
for(int i = 1 ; i <= 100 ; i++){
if(A % i == 0 && B % i == 0){
n.push_back(i);
}
}
sort(n.begin(),n.end(),greater<int>());
cout << n[K-1] << endl;
return 0;
} | 1 | 89,526,605 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
using namespace std;
typedef long long ll;
int main(){
string taro[1000], hanako[1000];
int n, score_t=0, score_h=0;
cin>>n;
for(int i=0; i<n; ++i){
cin>>taro[i]>>hanako[i];
if(taro[i] > hanako[i]){
score_t += 3;
}else if(taro[i] < hanako[i]){
score_h += 3;
}else{
score_t += 1;
score_h += 1;
}
}
cout<<score_t<<" "<<score_h<<endl;
} | #include <iostream>
#include <string>
using namespace std;
int main()
{
string player1, player2;
int i, n;
int point1 = 0, point2 = 0;
cin >> n;
for (i = 0; i < n; i++){
cin >> player1 >> player2;
if (player1 > player2)
point1 += 3;
else if (player1 < player2)
point2 += 3;
else{
point1 += 1;
point2 += 1;
}
}
cout << point1 << " " << point2 << endl;
return 0;
} | 1 | 10,264,419 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi = vector<int>;
int main(){
int n,h,w;cin>>n>>h>>w;
int ans = 0;
int a,b;
rep(i,n){
cin>>a>>b;
if(a>=h&&b>=w)ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int dx[] = { 0, 1, -1, 0, 1, -1, 1, -1 };
int dy[] = { 1, 0, 0, -1, 1, -1, -1, 1 };
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n,h,w;
cin >> n >> h >> w;
int ans = 0;
rep(i,n){
int a,b;
cin >> a >> b;
if(a>=h && b>=w)ans++;
}
cout << ans << endl;
} | 1 | 96,589,421 |
#include <stdio.h>
int main(){
int n,i,counter,l,r;
char s[3];
while(1){
l=2;
r=2;
counter=0;
scanf("%d",&n);
if(n==0)break;
for(i=0;i<n;i++){
scanf("%s",s);
if(s[1]=='u'){
if(l==0||r==0){
l=2;
r=2;
}
if(s[0]=='l')l=1;
else if(s[0]=='r')r=1;
if(l==1&&r==1){
counter++;
l=2;
r=2;
}
}else if(s[1]=='d'){
if(l==1||r==1){
l=2;
r=2;
}
if(s[0]=='l')l=0;
else if(s[0]=='r')r=0;
if(l==0&&r==0){
counter++;
l=2;
r=2;
}
}
}
printf("%d\n",counter);
}
return 0;
} | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <functional>
#include <complex>
#include <stack>
#include <tuple>
#include <array>
using namespace std;
#define rep(i,n) for (int i=0; i < (n); i++)
typedef long long int ll;
typedef double D;
typedef complex<D> P;
typedef pair<P, P> L;
typedef vector<P> VP;
const int INF = (1<<30) - 1;
const D EPS = 1e-9;
#define X real()
#define Y imag()
#define LE(n,m) ((n) < (m) + EPS)
#define GE(n,m) ((n) + EPS > (m))
#define EQ(n,m) (abs((n)-(m)) < EPS)
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N;
while(cin>>N, N){
bool ldown = false, rdown = false;
string s;
vector<string> command(N);
for(int i=0; i<N; i++)
cin >> command[i];
int ans = 0;
for(int i=1; i<N; i++){
if((command[i]=="lu" && command[i-1]=="ru")||
(command[i]=="ru" && command[i-1]=="lu")||
(command[i]=="ld" && command[i-1]=="rd")||
(command[i]=="rd" && command[i-1]=="ld"))
ans++;
}
cout << ans << endl;
}
return 0;
} | 1 | 77,512,020 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[a[i]] == i) ans++;
}
cout << ans / 2 << endl;
return 0;
} | #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>
#include <random>
#include <cassert>
#include <numeric>
#define ll long long int
#define LL unsigned long long
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
using namespace std;
int mx8[] = {0,0,1,-1,-1,1,-1,1};
int my8[] = {-1,1,0,0,-1,-1,1,1};
int mx4[] = {1,-1,0,0};
int my4[] = {0,0,-1,1};
const int MOD = 1000000007;
int main() {
int n; cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
int ans = 0;
rep(i,n){
if(a[a[i]-1] == i+1) ans++;
}
cout << ans / 2 << endl;
} | 1 | 17,839,493 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int i,j,cur=0,t,k,a,b,c=0;
string s;
getline(cin,s);
for(i=0;i<s.size();i++)
{
if(s[i]==',')
s[i]=' ';
}
cout<<s<<"\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
ll MOD=1e9+7;
void solve()
{
string s;
cin>>s;
for(ll i=0;i<s.size();i++)
{
if(s[i]==',')
cout<<" ";
else
cout<<s[i];
}
return;
return;
}
int main()
{
fast;
ll q;
q=1;
while(q--)
solve();
return 0;
} | 1 | 19,927,388 |
#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;
int main(){
map<string, ll> memo;
cin >> N;
ll ans = 0;
rep(i, N) {
string S;
cin >> S;
sort(S.begin(), S.end());
ans += memo[S];
memo[S]++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long combination(int n,int r){
if(r==0 || r==n)return 1;
else if (r==1)return n;
return (combination(n-1,r-1)+combination(n-1,r));
}
int main(){
int n;
cin>>n;
map<string,int> moji;
for(int i=0;i<n;i++){
string s;
cin>>s;
sort(s.begin(),s.end());
moji[s]++;
}
long long ans=0;
for(auto x:moji){
int p=x.second;
if(p==1)continue;
ans+=combination(p,2);
}
cout<<ans<<endl;
return 0;
} | 1 | 15,064,497 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(v) v.begin(), v.end()
int main() {
int N, K;
cin >> N >> K;
vector<int> sunuke(N,0);
rep(i, K) {
int d;
cin >> d;
rep(j, d) {
int a;
cin >> a;
sunuke[a-1]++;
}
}
int ans = 0;
rep(i, N) {
if (sunuke[i] == 0) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <unordered_set>
#include <vector>
#include <list>
#include <string>
#include <iterator>
#include <deque>
#include <array>
#include <forward_list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
#include <climits>
#include <bitset>
using namespace std;
#define N 100
#define EPS 1e-9
#define PI 3.14159265358979323846264338327950
bool arr[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m, k, e;
cin >> n >> k;
for (int i = 0; i < k; ++i) {
cin >> m;
for (int j = 0; j < m; ++j) {
cin >> e;
arr[e - 1] = true;
}
}
int ans = 0;
for (int i = 0; i < n; ++i) {
ans += arr[i] == false;
}
cout << ans << '\n';
} | 1 | 20,486,762 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
using namespace std;
#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second
#define PI acos(-1.0)
#define INF 1000000007
#define EPS 1e-10
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;
int n, ans, k;
string s, t, a;
void solve(char c){
if (c >= '2'&&c <= '9'){
k = c - '0';
}
else{
if (c == 'm'){
k *= 1000;
}
else if (c == 'c'){
k *= 100;
}
else if (c == 'x'){
k *= 10;
}
ans += k;
k = 1;
}
}
string changes(int num){
string res;
stringstream ss;
ss << num;
ss >> res;
return res;
}
int main(){
cin >> n;
REP(i, n){
cin >> s >> t;
ans = 0;
k = 1;
REP(i, s.size()){
solve(s[i]);
}
REP(i, t.size()){
solve(t[i]);
}
string f[4] = { "", "", "", "" };
a = changes(ans);
REP(i, a.size()){
char c = a[a.size() - 1 - i];
if (c != '0'){
if (c != '1')f[i] += c;
if (i == 0)f[i] += 'i';
if (i == 1)f[i] += 'x';
if (i == 2)f[i] += 'c';
if (i == 3)f[i] += 'm';
}
}
string q = f[3] + f[2] + f[1] + f[0];
cout << q << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i,n) for(int i=0; i<(int)n; ++i)
#define REP(i,x,n) for(int i=x; i<(int)n; ++i)
#define repi(i,n) for(int i=0; i<=(int)n; ++i)
#define REPI(i,x,n) for(int i=x; i<=(int)n; ++i)
#define ILP while(true)
#define FOR(i,c) for(__typeof((c).begin())!=(c).begin(); i!=(c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define mp make_pair
#pragma endregion
#pragma region TYPE_DEF
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef vector<long> vl;
typedef vector<long long> vll;
typedef vector<string> vs;
#pragma endregion
#pragma region ESTD
template<typename C, typename T> int count(C& c, T t) { return count(ALL(c), t); }
template<typename C, typename F> int count_if(C& c, F f) { return count_if(ALL(c), f); }
template<typename C, typename T> void erase(C& c, T t) { remove(ALL(c), t), c.end(); }
template<typename C> void remove(vector<C>& c, unsigned int index) { c.erase(c.begin()+index); }
template<typename C, typename T, typename U> void replace(C& c, T t, U u) { replace(ALL(c), t, u); }
template<typename C, typename F, typename U> void replace_if(C& c, F f, U u) { (ALL(c), f, u); }
template<typename C> void reverse(C& c) { reverse(ALL(c)); }
template<typename C> void sort(C& c) { sort(ALL(c)); }
template<typename C, typename Pred> void sort(C& c, Pred p) { sort(ALL(c), p); }
#pragma endregion
#pragma region CONST_VAL
constexpr int PI = (2*acos(0.0));
constexpr int EPS = (1e-9);
constexpr int MOD = (int)(1e9+7);
constexpr int INF = 100000000;
#pragma endregion
int solve(string s) {
int res = 0;
for(int i=0; i<s.size(); ++i) {
if(s[i]=='m') {
if(i==0||!isdigit(s[i-1])) res += 1000;
else res += 1000 * (s[i-1]-'0');
}
else if(s[i]=='c') {
if(i==0||!isdigit(s[i-1])) res += 100;
else res += 100 * (s[i-1]-'0');
}
else if(s[i]=='x') {
if(i==0||!isdigit(s[i-1])) res += 10;
else res += 10 * (s[i-1]-'0');
}
else if(s[i]=='i') {
if(i==0||!isdigit(s[i-1])) res += 1;
else res += 1 * (s[i-1]-'0');
}
}
return res;
}
string to_mcxi(int n) {
string res = "";
if(n>=1000) {
if(n/1000==1) res += "m";
else res += to_string(n/1000) + "m";
n %= 1000;
}
if(n>=100) {
if(n/100==1) res += "c";
else res += to_string(n/100) + "c";
n %= 100;
}
if(n>=10) {
if(n/10==1) res += "x";
else res += to_string(n/10) + "x";
n %= 10;
}
if(n>=1) {
if(n==1) res += "i";
else res += to_string(n) + "i";
}
return res;
}
int main()
{
int n;
cin >> n;
for(int i=0; i<n; ++i) {
string s1, s2;
cin >> s1 >> s2;
cout << to_mcxi(solve(s1) + solve(s2)) << endl;
}
return 0;
} | 1 | 84,468,685 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string N;
int ans = 0;
cin >> N;
for(int i=1; i<N.size(); i++){
if(N[i-1] == N[i] && N[i-1] == '1'){
N[i] = '0';
ans++;
}
else if(N[i-1] == N[i] && N[i-1] == '0'){
N[i] = '1';
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define ll signed long long int
ll a[MAXX];
multiset<ll> ms;
multiset<ll>::iterator it;
signed main()
{
FAST;
string s;
cin >> s;
ll ans= 0, br = 0, zer = 0;
for(ll i = 0; i < s.size(); i++){
zer = 0;
br = 0;
if(s[i] == s[i+1]) {
if(s[i+1] == '1'){
s[i+1] = '0';
}
else{
s[i+1] = '1';
}
ans ++;
}
}
if(s.size() == 1){
cout << 0;
return 0;
}
cout << ans;
} | 1 | 90,512,716 |
#include <iostream>
#include <ctype.h>
using namespace std;
int main() {
string s = "abcdefghijklmnopqrstuvwxyz";
string d;
int k[26] = {};
while(getline(cin, d)) {
for(int i=0;i<d.size();i++) {
d[i] = tolower(d[i]);
}
for(int i=0;i<s.size();i++) {
for(int j=0;j<d.size();j++) {
if(s[i] == d[j]) {
k[i]++;
}
}
}
}
for(int i=0;i<s.size();i++) {
cout << s[i] << " : " << k[i] << endl;
}
return 0;
} | #include <cstdio>
#include <cstring>
#include <cctype>
int main(){
char c;
int list[50] = {0};
while (scanf("%c", &c) != EOF) {
if (isalpha(c)) {
c = tolower(c);
list[c - 'a']++;
}
}
for (int i = 0; i < 26; i++) {
printf("%c : %d\n", i + 'a', list[i]);
}
return 0;
} | 1 | 26,703,320 |
#include <iostream>
using namespace std;
int main()
{
int a,b;
char x;
cin >> a >> x >> b;
if(x=='+')
{
cout << a+b;
}
else
{
cout << a-b;
}
} | #include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int main()
{
int a,b;
char ch;
scanf("%d %c %d",&a,&ch,&b);
if(ch=='+') printf("%d\n",a+b);
else printf("%d\n",a-b);
} | 1 | 71,735,854 |
#include<cstdio>
#include<math.h>
int main(){
double a, b, c, d;
scanf("%lf %lf %lf", &a, &b, &c);
c = M_PI * c / 180;
d = sqrt(a * a + b * b - 2 * a * b * cos(c));
printf("%lf\n", a * b * sin(c) / 2);
printf("%lf\n", a + b + d);
printf("%lf\n", b * sin(c));
return 0;
} | #include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
class triangle
{
private:
double a, b, C, S, L, h;
public:
triangle(double edge1, double edge2, double angle);
~triangle(){;}
void calc_area();
void calc_around();
void calc_height();
void print_();
};
triangle::triangle(double edge1, double edge2, double angle)
{
a = edge1;
b = edge2;
C = angle;
}
void triangle::calc_area()
{
S = (a * b * sin(C)) / 2;
}
void triangle::calc_around()
{
L = a + b + sqrt(pow(a, 2.0) + pow(b, 2.0) - 2 * a * b * cos(C));
}
void triangle::calc_height()
{
h = b * sin(C);
}
void triangle::print_()
{
printf("%lf\n", S);
printf("%lf\n", L);
printf("%lf\n", h);
}
int main(int argc, char const *argv[])
{
int count = 3;
double input[3];
for (int i = 0; i < count; ++i)
{
cin >> input[i];
}
triangle abc(input[0], input[1], M_PI * input[2] / 180);
abc.calc_area();
abc.calc_around();
abc.calc_height();
abc.print_();
return 0;
} | 1 | 9,126,168 |
#include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_N = 100010;
const ll mod = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B){
if(B == 0)return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B){
return A * B / gcd(A, B);
}
using Graph = vector<vector<int>>;
vector<bool> seen;
vector<int> depth;
vector<int> score;
vector<int> p, x;
void search_depth(const Graph &G, int v, int parent, int dep){
depth[v] = dep;
for(auto next_v : G[v]){
if(next_v == parent) continue;
search_depth(G, next_v, v, dep + 1);
}
}
void dfs(const Graph &G, int v, int parent){
seen[v] = true;
score[v] += score[parent];
for(auto next_v : G[v]){
if(seen[next_v]) continue;
dfs(G, next_v, v);
}
}
int main(){
int n, q; cin >> n >> q;
Graph G(n);
depth.resize(n);
seen.resize(n);
p.resize(q);
x.resize(q);
score.resize(n);
rep(i, n) score[i] = 0;
rep(i, n - 1){
int a, b; cin >> a >> b;
a--, b--;
G[a].push_back(b);
G[b].push_back(a);
}
rep(i, q){
cin >> p[i] >> x[i];
p[i]--;
}
depth.assign(n, 0);
search_depth(G, 0, -1, 0);
rep(i, q) score[p[i]] += x[i];
dfs(G, 0, -1);
rep(i, n){
if(i == n - 1){
cout << score[i] << endl;
return 0;
}
cout << score[i] << " ";
}
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define debug(s, param) std::cerr << s << param << std::endl;
using namespace std;
using ll = long long;
void dfs(const vector<vector<int>>& vertices, vector<int>& points, int v, int p) {
if (p != -1) points[v] += points[p];
for (auto vertice : vertices[v]) {
if (vertice == p) continue;
dfs(vertices, points, vertice, v);
}
}
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> vertices(n+1);
rep (i, n-1) {
int v1, v2;
cin >> v1 >> v2;
vertices[v1].emplace_back(v2);
vertices[v2].emplace_back(v1);
}
vector<int> points(n+1, 0);
rep (i, q) {
int v, p;
cin >> v >> p;
points[v] += p;
}
dfs(vertices, points, 1, -1);
for (int i = 1; i <= n; ++i) cout << points[i] << " "; cout << endl;
return 0;
} | 1 | 97,922,984 |
#include <bits/stdc++.h>
#include <math.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;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int INF_32 = 1LL << 30;
const int64_t INF_64 = 1LL << 60;
const int MAX_N = 110000;
int main()
{
int N;
ll K;
cin >> N >> K;
vector<pair<ll, ll>> v(N);
for (int i = 0; i < N; i++)
cin >> v[i].first >> v[i].second;
sort(v.begin(), v.end());
ll res = 0;
ll sum = 0;
for (int i = 0; i < N; i++) {
sum += v[i].second;
if (sum >= K) {
res = v[i].first;
break;
}
}
cout << res << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n,k,c,d,sum = 0,ans;
cin >> n >> k;
map<long long,int> a;
for(int i = 0;i < n;i++){
cin >> c >> d;
a[c] += d;
}
for(auto m : a){
ans = m.first;
sum += m.second;
if(sum >= k)break;
}
cout << ans << endl;
} | 1 | 19,637,562 |
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
long long a,b,c,d,ac,ad,bc,bd;
cin>>a>>b>>c>>d;
ac=a*c;
ad=a*d;
bc=b*c;
bd=b*d;
cout<<(ac>(ad>(bc>bd?bc:bd)?ad:(bc>bd?bc:bd))?ac:(ad>(bc>bd?bc:bd)?ad:(bc>bd?bc:bd)));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
#define _GLIBCXX_DEBUG
#define rep(i, n) for(int i = 0; i < (n); ++i)
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
ll ac, ad, bc, bd;
ac = a * c;
ad = a * d;
bc = b * c;
bd = b * d;
cout << max(bc ,max(bd, max(ac, ad))) << endl;
return 0;
} | 1 | 39,024,804 |
#include <iostream>
#include <cctype>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n;
cin >> n;
rep(i,n){
string s1,s2;
cin >> s1;
int ans=0;
rep(j,s1.size()){
if(isdigit(s1[j])){
if(s1[j+1]=='m') ans+=(s1[j]-'0')*1000;
if(s1[j+1]=='c') ans+=(s1[j]-'0')*100;
if(s1[j+1]=='x') ans+=(s1[j]-'0')*10;
if(s1[j+1]=='i') ans+=(s1[j]-'0')*1;
j++;
}else{
if(s1[j]=='m') ans+=1000;
if(s1[j]=='c') ans+=100;
if(s1[j]=='x') ans+=10;
if(s1[j]=='i') ans+=1;
}
}
cin >> s1;
rep(j,s1.size()){
if(isdigit(s1[j])){
if(s1[j+1]=='m') ans+=(s1[j]-'0')*1000;
if(s1[j+1]=='c') ans+=(s1[j]-'0')*100;
if(s1[j+1]=='x') ans+=(s1[j]-'0')*10;
if(s1[j+1]=='i') ans+=(s1[j]-'0')*1;
j++;
}else{
if(s1[j]=='m') ans+=1000;
if(s1[j]=='c') ans+=100;
if(s1[j]=='x') ans+=10;
if(s1[j]=='i') ans+=1;
}
}
if(ans/1000>=2) cout << ans/1000;
if(ans/1000>=1) cout << "m";
ans%=1000;
if(ans/100>=2) cout << ans/100;
if(ans/100>=1) cout << "c";
ans%=100;
if(ans/10>=2) cout << ans/10;
if(ans/10>=1) cout << "x";
ans%=10;
if(ans>=2) cout << ans;
if(ans>=1) cout << "i";
cout << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int n;
int mcxi2int(string str,int pt)
{
if( pt >= str.size() )
return 0;
if( str[pt] >= '2' && str[pt] <= '9' )
pt++;
int d;
if(str[pt] == 'm')
d = 1000;
else if(str[pt] == 'c')
d = 100;
else if(str[pt] == 'x')
d = 10;
else
d = 1;
if( pt-1 >= 0 && str[pt-1] >= '2' && str[pt-1] <= '9')
return d*(str[pt-1]-'0') + mcxi2int(str, pt+1);
else
return d + mcxi2int(str, pt+1);
}
string int2mcxi(int k)
{
int i = k;
string str = "";
if( i >= 1000 )
{
if( i/1000 >= 2)
str += '0' + i/1000;
str += 'm';
}
i = i%1000;
if( i >= 100 )
{
if( i/100 >= 2)
str += '0' + i/100;
str += 'c';
}
i = i%100;
if( i >= 10 )
{
if( i/10 >= 2)
str += '0' + i/10;
str += 'x';
}
i = i%10;
if( i >= 1 )
{
if( i >= 2)
str += '0' + i;
str += 'i';
}
return str;
}
int main()
{
cin >> n;
for( int i = 0; i < n; i++)
{
string mcxi1, mcxi2;
cin >> mcxi1 >> mcxi2;
string out = int2mcxi(mcxi2int(mcxi1, 0) + mcxi2int(mcxi2, 0));
cout << out << endl;
}
return 0;
} | 1 | 1,328,696 |
#include<bits/stdc++.h>
using namespace std;
char s[10005],t[10005];
int main(int argc, char * argv[])
{
cin>>s>>t;
int lens = strlen(s);
int lent = strlen(t);
int ans = 10000;
for(int i=0;(i+lent-1)<lens;i++){
int sum = 0;
for(int j=0;j<lent;j++)
if(s[i+j]!=t[j])
sum++;
ans = min(ans,sum);
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
char a[1001], b[1001];
scanf("%s%s", a, b);
int aL = strlen(a), bL = strlen(b);
int res = aL;
for(int i = 0; i <= aL - bL; i++){
int dif = 0;
for(int j = 0; j < bL; j++){
if(b[j] != a[i + j])
dif++;
}
res = min(res, dif);
}
printf("%d\n", res);
return 0;
} | 1 | 76,771,883 |
#include <iostream>
using namespace std;
int main(){
int ary[3];
int i, j, tmp;
cin>>ary[0]>>ary[1]>>ary[2];
for(j = 0; j < 2; j++){
for(i = 0; i < 2; i++){
if(ary[i] > ary[i+1]){
tmp = ary[i];
ary[i] = ary[i+1];
ary[i+1] = tmp;
}
}
}
cout<<ary[0]<<" "<<ary[1]<<" "<<ary[2]<<endl;
} | #include <stdio.h>
int main(void)
{
int a,b,c;
int tmp;
scanf("%d%d%d", &a,&b,&c);
if(a > b){
tmp = a;
a = b;
b = tmp;
}
if (b > c){
tmp = b;
b = c;
c = tmp;
}
if (a > b){
tmp = a;
a = b;
b = tmp;
}
printf("%d %d %d\n", a,b,c);
return 0;
} | 1 | 92,177,400 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int h, w; cin >> h >> w;
string grid[h][w];
char l; int c;
for(int y=0; y<h; y++){
for(int x=0; x<w; x++){
cin >> grid[y][x];
if(grid[y][x] == "snuke"){
l = x + 'A';
c = y + 1;
}
}
}
cout << l << c << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int INF = 1000000000;
int main() {
int H, W;
cin >> H >> W;
string abc = "ABCDEFGHIJKLMNOPQRSTUVWZXYZ";
for (int i=0; i<H; i++){
for (int j=0; j<W; j++){
string s;
cin >> s;
if (s == "snuke"){
cout <<abc[j] << i+1 << endl;
exit(0);
}
}
}
} | 1 | 27,055,961 |
#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<string,int>;
const double PI = acos(-1);
int main() {
int a,b,c;
cin >> a >> b >> c;
if(a==b&&b==c)cout <<"Yes"<< endl;
else cout <<"No"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define ll long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define pd pair<double,double>
#define ld long double
#define pld pair<ld,ld>
#define lg length()
#define sz size()
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pi>
#define vpl vector<pl>
#define pb push_back
#define INF 1000000005
#define LINF 1000000000000000005
int a,b,c;
int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
cin >> a >> b >> c;
if(a==b && b==c) cout << "Yes";
else cout << "No";
} | 1 | 88,312,326 |
#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 a, b, c, d;
cin >> a >> b >> c >> d;
bool p = min(abs(a - c), max(abs(a - b), (abs(b - c)))) <= d;
if(p) {
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define intt long long
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int N = 1005;
int n;
int a[N];
int main() {
FAST;
int a, b, c, d;
cin >> a >> b >> c >> d;
if (abs(a - c) <= d || (abs(b - a) <= d && abs(c - b) <= d)) {
cout << "Yes\n";
}
else {
cout << "No\n";
}
return 0;
} | 1 | 3,403,077 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main()
{
int n, m;
cin >> n >> m;
vector<string> N(n), M(m);
rep(i, n) cin >> N[i];
rep(i, m) cin >> M[i];
for (int i = 0; i <= n - m; i++)
{
for (int j = 0; j <= n - m; j++)
{
int ok = 1;
rep(k, m)
{
string tmp = N[i + k].substr(j, m);
if (tmp != M[k])
ok = 0;
}
if (ok)
{
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int N, M;
cin >> N >> M;
vector<string> A(N);
vector<string> B(M);
rep(i, N) cin >> A.at(i);
rep(i, M) cin >> B.at(i);
bool ans = false;
for (int i = 0; i <= N - M; i++)
{
for (int j = 0; j <= N - M; j++)
{
ans = true;
for (int k = 0; k < M; k++)
{
if (A.at(i + k).substr(j, M) != B.at(k))
{
ans = false;
break;
}
}
if (ans)
{
break;
}
}
if (ans)
{
break;
}
}
cout << (ans ? "Yes" : "No") << endl;
return 0;
} | 1 | 16,071,434 |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
typedef unsigned int uint;
using namespace std;
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
ll x, y;
cin >> x >> y;
if (abs(x-y) <= 1LL) {
cout << "Brown\n";
} else {
cout << "Alice\n";
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <bitset>
#include <string>
#include <cctype>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <ctime>
using namespace std;
#define scd(a) scanf("%d", &a)
#define scdd(a,b) scanf("%d%d", &a, &b)
#define scddd(a,b,c) scanf("%d%d%d", &a, &b, &c)
#define X first
#define Y second
#define lowbit(x) ((x) & (-x))
#define IOS ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
const int N = 1e5 + 10, INF = 0x3f3f3f3f;
const ll mod = 998244353, LINF = 0x3f3f3f3f3f3f3f3f;;
const double eps = 1e-10, Pi = 2*acos(0);
int n, m;
int dp[110][110];
int deal(int x, int y){
if(dp[x][y] != -1) return dp[x][y];
for(int i = 1; 2*i <= x; i++) {
if(!deal(x - 2*i, y + i)) return dp[x][y] = 1;
}
for(int i = 1; 2*i <= y; i++){
if(!deal(x + i, y - 2*i)) return dp[x][y] = 1;
}
return dp[x][y] = 0;
}
void init(){
memset(dp, -1, sizeof(dp));
for(int i = 0; i <= 100; i++){
for(int j = 0; j <= 100; j++){
int cur = deal(i, j);
if(!cur) printf("%d %d %d\n", cur, i, j);
}
}
}
void solve(){
ll x, y;
scanf("%lld%lld", &x, &y);
if(abs(x - y) <= 1) printf("Brown\n");
else printf("Alice\n");
}
int main()
{
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif
int ce, c = 1, flag = 1;
solve();
return 0;
} | 1 | 53,329,576 |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define p push_back
#define endl "\n"
#define l long long int
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
l n,stock=0,rs=1000 ;
cin>>n;
vector<l>v;
for(l i=0;i<n;i++){
l s;
cin>>s;
v.p(s);
}
vector<l>::iterator start;
start = unique(v.begin(), v.begin() + v.size());
v.resize(std::distance(v.begin(), start));
for(l i=0;i<v.size()-1;i++){
if(v[i]<v[i+1]){
if(rs>v[i]){
stock+=rs/v[i];
rs-=stock*v[i];
}
}
else{
rs+=stock*v[i];
stock=0;
}
}
if(stock!=0){
rs+=v[v.size()-1]*stock;
stock=0;
}
cout<<rs;
return 0;
} | #include <bits/stdc++.h>
int main(){
int N;
std::cin >> N;
std::vector< int > A(N);
for(int i=0; i<N; i++){
std::cin >> A[i];
}
std::vector< bool > b(N, false);
std::vector< bool > s(N, false);
int best = 1e9;
bool up = false;
for(int i=0; i<N; i++){
if(!up && best > A[i]){
best = A[i];
}else if(!up && best < A[i]){
b[i-1] = true;
up = true;
best = A[i];
}else if(up && best < A[i]){
best = A[i];
}else if(up && best > A[i]){
s[i-1] = true;
up = false;
best = A[i];
}
}
if(up){
s[N-1] = true;
}
int buy;
long long money = 1000;
for(int i=0; i<N; i++){
if(b[i]){
buy = A[i];
}else if(s[i]){
money = (money / buy) * A[i] + (money % buy);
}
}
std::cout << money << std::endl;
return 0;
} | 1 | 65,913,114 |
#include <iostream>
using namespace std;
int main() {
int a,b;
cin >>a>>b;
if (a<b){
string s="a < b";
cout<<s<<endl;
}else{
if(a==b){
string s="a == b";
cout<<s<<endl;
}else{
string s="a > b";
cout<<s<<endl;
}
}
} | #include <stdio.h>
int main(){
int a,b;
scanf("%d%d",&a,&b);
if(a < b){
printf("a < b\n");
}else if(a==b){
printf("a == b\n");
}else{
printf("a > b\n");
}
return 0;
} | 1 | 80,055,927 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int m,n_min,n_max;
while(cin>>m>>n_min>>n_max,m){
int pre;
for(int i=0;i<n_min;++i){
cin>>pre;
}
int buf1=0,ans;
for(int i=n_min;i<=n_max;++i){
int p;cin>>p;
if(buf1<=pre-p){
buf1=pre-p;
ans=i;
}
pre=p;
}
for(int i=n_max+1;i<m;++i)cin>>pre;
cout<<ans<<endl;
}
} | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int m,nmin,nmax;
int p[100001];
int main(void){
while(1){
scanf("%d%d%d",&m,&nmin,&nmax);
if(m==0 && nmin==0 && nmax==0)break;
for(int i=1;i<=m;i++){
scanf("%d",&p[i]);
}
sort(p,p+m+1);
int val=-1,res=-1;
for(int i=nmin;i<=nmax;i++){
if(p[m-i+1]-p[m-i]>=val){
res=i;
val=p[m-i+1]-p[m-i];
}
}
printf("%d\n",res);
}
return 0;
} | 1 | 38,073,896 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; 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 ll;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VP = vector<P>;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }
int main(){
int n;
cin >> n;
ll ans = 0;
for(int a = 1; a < n; a++){
ans += (n-1) /a;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,n,num=0;
cin >> n;
for(a=1;a<n;a++){
num += (n-1)/a;
}
cout << num << endl;
} | 1 | 5,886,498 |
#include <iostream>
#include <cmath>
using namespace std;
#define NUM 600
int main(){
long n;
while(cin >> n){
long a = NUM/n;
long b = 0;
for(long i=1;i<a;i++) b += n*n*n*i*i;
cout << b << endl;
}
} | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <string.h>
#include <stack>
using namespace std;
#define ISEQ(c) (c).begin(), (c).end()
typedef long long ll;
int main() {
int d;
while (cin >> d) {
int ans = 0;
for (int i = d; i < 600; i += d) {
ans += i * i;
}
cout << ans * d << endl;
}
} | 1 | 38,372,754 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool ask(ll x){
printf("? %lld\n",x);
fflush(stdout);
char res;scanf(" %c",&res);
if(res=='Y')return true;
else return false;
}
int p[11];
int main(){
p[1]=1;
for(int i=2;i<=10;i++)p[i]=p[i-1]*10;
ll ans;
if(ask(1000000000)){
int l=1,r=10;
int mid,res;
while(l<=r){
mid=l+r>>1;
if(ask(p[mid]*2))res=mid,r=mid-1;
else l=mid+1;
}
ans=p[res];
}
else{
int l=1,r=9;
int mid,res;
while(l<=r){
mid=l+r>>1;
if(ask(p[mid]))res=mid,l=mid+1;
else r=mid-1;
}
l=p[res],r=p[res+1]-1;
while(l<=r){
mid=l+r>>1;
if(ask(1ll*mid*10))res=mid,r=mid-1;
else l=mid+1;
}
ans=res;
}
printf("! %lld\n",ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define FORD(i,a,b) for (int i = (a); i >= (b); i--)
#define REP(i,a) FOR(i,0,(int)(a)-1)
#define reset(a,b) memset(a,b,sizeof(a))
#define all(x) x.begin(), x.end()
#define uni(x) x.erase(unique(all(x)), x.end());
#define BUG(x) cout << #x << " = " << x << endl
#define BUGP(x) cout << #x << " = " << x._1 << ", " << x._2 << endl
#define PR(x,a,b) {cout << #x << " = "; FOR (_,a,b) cout << x[_] << ' '; cout << endl;}
#define CON(x) {cout << #x << " = "; for(auto i:x) cout << i << ' '; cout << endl;}
#define mod 1000000007
#define pi acos(-1)
#define eps 1e-6
#define pb push_back
#define sqr(x) (x) * (x)
#define _1 first
#define _2 second
int high, low, ori;
string pre, sys, big;
int main() {
ios::sync_with_stdio(false);
big = "999999999";
string notsobig = "999999";
while (1) {
high = 10;
if (pre.size()) low = 0;
else low = 1;
ori = low;
while (low < high) {
int mid = (low + high) / 2;
if (pre.size() > 7) cout << "? " << pre << mid << notsobig << endl;
else cout << "? " << pre << mid << big << endl;
cout.flush();
cin >> sys;
if (sys == "N") low = mid + 1;
else high = mid;
}
int cur = high;
bool term = false;
if (cur != ori) {
cout << "? " << pre << ori << 0 << endl;
cout.flush();
cin >> sys;
if (sys == "N") term = true;
} else {
cout << "? " << pre << 9 << endl;
cout.flush();
cin >> sys;
if (sys == "Y") term = true;
}
pre += (char)('0' + cur);
if (term) {
cout << "! " << pre << endl;
return 0;
}
}
} | 1 | 15,758,171 |
#include <bits/stdc++.h>
#define pii pair<int, int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define sz(v) int(v.size())
#define all(v) v.begin(), v.end()
#define y1 what
using namespace std;
const int N = (int) 4e5 + 10;
const int M = (int) 1e6 + 10;
const ll LINF = (ll) 2e18;
const int INF = (int) 1e9 + 7;
const double EPS = (double) 1e-9;
const double PI = 3.14159265359;
int n;
vector<int> v[N];
int sz[N];
int dfs(int x, int p = -1) {
int ans = 0;
for (auto it : v[x]) {
if (it != p) {
ans ^= dfs(it, x) + 1;
}
}
return ans;
}
int main() {
#define fn "euler"
#ifdef witch
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
#endif
cin >> n;
for (int i = 1, x, y; i < n; i++) {
cin >> x >> y;
v[x].pb(y);
v[y].pb(x);
}
if (dfs(1)) cout << "Alice";
else cout << "Bob";
return 0;
} | #include<iostream>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdio>
using namespace std;
const int N=100005;
const int inf=2000000000;
struct E{
int to,next;
}mem[N<<1];
int n,x,y,num;
int head[N],dp[N];
void add(int x,int y){
num++;
mem[num].to=y; mem[num].next=head[x];
head[x]=num;
}
void dfs(int k,int pre){
int j,u;
for (j=head[k];j;j=mem[j].next){
u=mem[j].to;
if (u==pre) continue;
dfs(u,k);
dp[k]^=dp[u]+1;
}
}
int main(){
int i;
scanf("%d",&n);
for (i=1;i<n;i++){
scanf("%d%d",&x,&y);
add(x,y); add(y,x);
}
dfs(1,0);
if (dp[1]) printf("Alice\n");
else printf("Bob\n");
return 0;
} | 1 | 13,251,158 |
#include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <numeric>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()
#define END(x) x.end()
#define ALL(x) BEGIN(x), END(x)
#define PAIR make_pair
#define VEC(type) vector<type >
#define endl '\n'
#define FOR(i, A, B) for(auto i = (A);i != (B); i++)
#define FORD(i, A, B) for(auto i = (A);i != (B); i--)
#define READRANGE(begin, end) FOR(it, begin, end) cin >> *it
#define READVEC(V) READRANGE(BEGIN(V), END(V))
using namespace std;
typedef long long lint;
typedef pair<int, int> Pii;
typedef pair<int, lint> Pil;
typedef pair<lint, lint> Pll;
typedef pair<lint, int> Pli;
void io_init()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
};
int main(int argc, char **argv)
{
io_init();
string S, T;
cin >> S >> T;
int ret = 0;
FOR(i, 0, 3)
if (S[i] == T[i])
ret++;
cout << ret << endl;
return 0;
}; | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define repr(i,n) for(ll i=(n-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define br cout << "\n";
using namespace std;
const long long INF = 1e10;
const long long MOD = 1e9+7;
using Graph = vector<vector<ll>>;
using pll = pair<ll, 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;}
int main() {
std::cout << std::fixed << std::setprecision(15);
string s; cin >> s;
string t; cin >> t;
ll ans = 0;
rep(i, 3){
if(s[i] == t[i]){
ans++;
}
}
cout << ans << endl;
} | 1 | 61,684,842 |
#include<bits/stdc++.h>
using namespace std;
int gcd(int a, int b)
{
if (a%b == 0){return(b);}else{return(gcd(b, a%b));}
}
int lcm(int a, int b)
{
return a * b / gcd(a, b);
}
int main(){
long long i, A, B, C, D, Ca, Da, CD, CDa;
cin >> A >> B >> C >> D;
Ca = B/C - (A/C + 1 - (A%C==0)) + 1;
Da = B/D - (A/D + 1 - (A%D==0)) + 1;
CD = lcm(C, D);
CDa = B/CD - (A/CD + 1 - (A%CD==0)) + 1;
cout << B - A + 1 - (Ca + Da - CDa) << endl;
return 0;
} | #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() {
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll ans=0;
ll cc=max(c,d),dd=min(c,d),r=cc%dd;
while(r>0){
cc=dd;
dd=r;
r=cc%dd;
}
ans+=b/c+b/d-b/(c*d/dd);
ans-=(a-1)/c+(a-1)/d-(a-1)/(c*d/dd);
cout<<b-a+1-ans;
} | 1 | 57,839,601 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define arr array
using namespace std;
const int e = 2e6 + 69;
const ll mod = 1e9 + 7;
ll v[e];
int n, k;
ll ans = -1e18;
void solve(int l, int r)
{
vector<ll>cur;
for(int i=1; i<=l; i++){
cur.pb(v[i]);
}
for(int i=r; i<=n; i++){
cur.pb(v[i]);
}
ll can = k - 1LL*cur.size();
if(can < 0) return ;
ll sum = 0;
sort(cur.begin(), cur.end());
for(int i=0; i<cur.size(); i++){
if(can > 0 && cur[i] < 0){
can --;
}
else{
sum += cur[i];
}
}
if(sum > ans){
ans = sum;
}
return ;
}
int main()
{
cin >> n >> k;
for(int i=1; i<=n; i++){
cin >> v[i];
}
for(int i=0; i<=n; i++){
for(int j=i+1; j<=n+1; j++){
solve(i, j);
}
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N,K;
cin >> N >> K;
int V[N];
for (int i = 0; i < N; i++) cin >> V[i];
int ans = 0;
for (int i = 0; i <= N; i++) {
for (int j = 0; j + i <= N; j++) {
int res = 0;
if (i + j > K) {
continue;
}
vector<int> minus;
for (int k = 0; k < N; k++) {
if (k < i || k >= N - j) {
res += V[k];
if (V[k] < 0) {
minus.push_back(V[k]);
}
}
}
sort(minus.begin(),minus.end());
for (int k = 0; k < min(K - (i + j),(int)minus.size()); k++) {
res -= minus[k];
}
ans = max(ans,res);
}
}
cout << ans << endl;
return 0;
} | 1 | 98,731,977 |
#include "bits/stdc++.h"
using namespace std;
int main() {
long long N,K;
cin >> N >> K;
vector<int>A(N);
vector<int>SUM(N + 1);
long long sum = 0;
SUM[0] = 0;
for (long long n = 0;n<N;++n) {
cin >> A[n];
sum += A[n];
SUM[n + 1] = (sum - (n + 1))%K;
}
map<int,int>mp;
for (int n = 1;n < K;++n) {
if (n<=N) {
mp[SUM[n]]++;
}
}
long long ans = 0;
for (long long n = 0; n <= N; ++n) {
ans += mp[SUM[n]];
mp[SUM[n + 1]]--;
if ((n + K) <= N) {
mp[SUM[n + K]]++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORX(i, a, b, x) for (int i = (a); i <= (b); i+=x)
#define debug(x) cerr << #x << " is= " << x << endl;
#define read(a) int a; cin >> a;
#define reads(s) string s; cin >> s;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) int a, b, c; cin >> a >> b >> c;
#define readarr(a, n) int a[(n) + 5] = {}; FOR(i, 1, (n)) {cin >> a[i];}
#define readmat(a, n, m) int a[n + 1][m + 1] = {}; FOR(i, 1, n) {FOR(j, 1, m) cin >> a[i][j];}
#define printarr(a, n) FOR (i, 1, n) cout << a[i] << " "; cout << endl;
#define printv(v) for (int i: v) cout << i << " "; cout << endl;
#define printmat(a, n, m) FOR (i, 1, n) {FOR (j, 1, m) cout << a[i][j] << " "; cout << endl;}
#define FORD(i, a, b) for(int i = (a); i >= (b); i--)
#define pb(a) push_back(a)
#define pf(a) push_front(a)
#define mp(a,b) make_pair(a,b)
#define fast_io ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vov vector<vector<int>>
#define pr pair<ll,ll>
#define vpll vector<pair<ll,ll>>
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define sz(container) int((container).size())
#define cut(x) {cout<<x<<"\n"; return;}
#define setprec(x) cout << fixed << showpoint << setprecision(8)<<x<<endl;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a*b/__gcd(a,b)
#define time cout << clock() / double(CLOCKS_PER_SEC) << endl;
#define endl "\n"
#define mod 1000000007
using namespace std;
using namespace __gnu_pbds;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
const int N=2e5+5;
ll n,k,a[N],ans=0;
void solve()
{
map<ll,ll>m;
m[0]++;
FOR(i,1,n)
{
a[i]--;
a[i]=a[i-1]+a[i];
a[i]%=k;
}
cout<<endl;
FOR(i,1,n)
{
if(i-k>=0) m[a[i-k]]--;
ans+=m[a[i]];
m[a[i]]++;
}
cout<<ans;
}
int main()
{
fast_io;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cin>>n>>k;
FOR(i,1,n) cin>>a[i];
solve();
} | 1 | 40,474,931 |
#include <deque>
#include <cstdio>
using namespace std;
#define ll long long
int main(){
ll N;
scanf("%lld", &N);
ll a[N], ps = 0, ns = 0;
deque<ll> p, n;
for (ll i = 0; i < N; i++){
scanf("%lld", &a[i]);
if (a[i] > 0){
p.emplace_back(a[i]);
ps += a[i];
}else if (a[i] <= 0){
n.emplace_back(a[i]);
ns += a[i];
}
}
if (p.empty()){
ll ma = -2147483648, pos;
for (ll i = 0; i < n.size(); i++){
if (n[i] > ma){
ma = n[i];
pos = i;
}
}
p.emplace_back(ma);
n.erase(n.begin() + pos);
ps += ma;
ns -= ma;
}
if (n.empty()){
ll mi = 2147483647, pos;
for (ll i = 0; i < p.size(); i++){
if (p[i] < mi){
mi = p[i];
pos = i;
}
}
n.emplace_back(mi);
p.erase(p.begin() + pos);
ns += mi;
ps -= mi;
}
printf("%lld\n", ps - ns);
while (true){
if (p.size() == 1 && n.size() == 1){
printf("%lld %lld\n", p[0], n[0]);
return 0;
}
if (n.size() == 1){
printf("%lld %lld\n", n[0], p[0]);
n.emplace_back(n[0] - p[0]);
p.erase(p.begin());
n.erase(n.begin());
}else{
printf("%lld %lld\n", p[0], n[0]);
p.emplace_back(p[0] - n[0]);
p.erase(p.begin());
n.erase(n.begin());
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
inline ll toLL(string s) {
ll v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
void solve(VLL &p, VLL &m) {
FOR(i, 1, p.size()) {
cout << m.back() << " " << p[i] << endl;
m.back() -= p[i];
}
rep(i, m.size()) {
cout << p[0] << " " << m[i] << endl;
p[0] -= m[i];
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
VLL a(n);
rep(i, n) cin >> a[i];
VLL m, p;
ll sum = 0;
if(n == 2) {
sort(all(a));
cout << a[1] - a[0] << endl;
cout << a[1] << " " << a[0] << endl;
return 0;
}
rep(i, n) {
if(a[i] >= 0)
p.push_back(a[i]);
else
m.push_back(a[i]);
sum += abs(a[i]);
}
if(p.size() > 0 && m.size() > 0) {
cout << sum << endl;
solve(p, m);
return 0;
}
if(p.size() > 0) {
sort(all(p));
cout << sum - 2 * p[0] << endl;
m.push_back(p[0] - p[1]);
cout << p[0] << " " << p[1] << endl;
VLL pp;
FOR(i, 2, p.size()) pp.push_back(p[i]);
solve(pp, m);
} else {
sort(all(m));
cout << sum + 2 * m.back() << endl;
ll mSize = m.size();
p.push_back(m[mSize - 1] - m[mSize - 2]);
cout << m[mSize - 1] << " " << m[mSize - 2] << endl;
VLL mm;
rep(i, mSize - 2) mm.push_back(m[i]);
solve(p, mm);
}
return 0;
} | 1 | 666,643 |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#include<iomanip>
#include<set>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;index++)
#define brep(index,num) for(int index=num-1;index>=0;index--)
#define brep1(index,num) for(int index=num;index>0;index--)
#define scan(argument) cin>>argument
#define prin(argument) cout<<argument<<endl
#define kaigyo cout<<endl
#define eps 1e-7
#define mp(a1,a2) make_pair(a1,a2)
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef long long ll;
typedef long double ld;
using namespace std;
typedef pair<ll,ll> pll;
typedef pair<int,int> pint;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<pint> vpint;
typedef vector<pll> vpll;
ll INFl=1e+18+1;
int INF=1e+9+1;
int main(){
int N,K;
ll H[303]={};
scan(N>>K);
rep(i,N){
scan(H[i+1]);
}
ll dp[303][303];
fill(dp[0],dp[303],INFl);
dp[0][0]=0;
rep1(x,N){
rep1(y,N){
ll tmp=INFl;
rep(i,x){
tmp=min(tmp,dp[i][y-1]+max(0LL,H[x]-H[i]));
}
dp[x][y]=tmp;
}
}
ll ans=INFl;
rep(i,N+1) ans=min(ans,dp[i][N-K]);
prin(ans);
return 0;
} | #include <bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
#define int int64_t
using namespace std;
typedef pair<int, int> pii;
const int N = 303;
const int inf = (int)1e15;
int n, k, h[N], f[N][N];
int Cost(int i, int j) {
if(h[i] >= h[j]) return 0;
return h[j] - h[i];
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
#define Task "test"
if(fopen(Task".inp", "r")) {
freopen(Task".inp", "r", stdin);
freopen(Task".out", "w", stdout);
}
cin >> n >> k;
for(int i = 1; i <= n; ++i) cin >> h[i];
fill_n(&f[0][0], N * N, inf);
++n; f[1][0] = h[1]; f[0][0] = 0;
for(int i = 2; i <= n; ++i) {
for(int j = 0; j <= k; ++j) {
f[i][j] = f[i - 1][j] + Cost(i - 1, i);
for(int t = i - 2; t >= 0; --t) {
if(i - t - 1 > j) break;
f[i][j] = min(f[i][j], f[t][j - i + t + 1] + Cost(t, i));
}
}
}
int res = inf;
for(int i = 0; i <= k; ++i) res = min(res, f[n][i]);
cout << res;
} | 1 | 7,414,901 |
#include <iostream>
#include <string>
#include <stack>
using namespace std;
int main(void) {
string s;
while (1) {
bool flag = false;
getline(cin, s);
if (s == ".") break;
stack<char> sc;
char tmp;
for (auto i : s) {
switch (i) {
case '(':
sc.push('(');
break;
case '[':
sc.push('[');
break;
case ')':
if (sc.size() == 0) {
flag = true;
break;
}
tmp = sc.top();
if (tmp == '(') {
sc.pop();
} else {
flag = true;
}
break;
case ']':
if (sc.size() == 0) {
flag = true;
break;
}
tmp = sc.top();
if (tmp == '[') {
sc.pop();
} else {
flag = true;
}
break;
}
if (flag) break;
}
if (flag || sc.size() != 0) {
cout << "no" << endl;
} else {
cout << "yes" << endl;
}
}
return 0;
} | #include <iostream>
#include <stack>
using namespace std;
bool issame(char a,char b){
if(a=='(')return b==')';
if(a=='[')return b==']';
}
int main(){
while(1){
char in;
in=cin.peek();
if(in=='.')return 0;
stack<char> sta;
bool iscorrect=true;
while(cin.get(in),in!='.'){
if(cin.eof())return 0;
if(in=='('||in=='['){
sta.push(in);
}else if(in==')'||in==']'){
if(sta.empty()||!issame(sta.top(),in)){
iscorrect=false;
break;
}
sta.pop();
}
}
cout<<((iscorrect&&sta.empty())? "yes":"no")<<endl;
cin.ignore(100,'\n');
}
} | 1 | 72,831,924 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define EPS 1e-9
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template < typename T >
ostream &operator<<(ostream &os, const vector< T > &A) {
for (int i = 0; i < A.size(); i++)
os << A[i] << " ";
os << endl;
return os;
}
template <>
ostream &operator<<(ostream &os, const vector< vector< int > > &A) {
int N = A.size();
int M;
if (N > 0)
M = A[0].size();
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++)
os << A[i][j] << " ";
os << endl;
}
return os;
}
typedef pair< int, int > pii;
typedef long long ll;
struct edge {
int from, to, d, c;
edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
from = _from;
to = _to;
d = _d;
c = _c;
}
bool operator<(const edge &rhs) const {
return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
}
};
struct aabb {
int x1, y1, x2, y2;
aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};
typedef vector< edge > edges;
typedef vector< edges > graph;
struct flow {
int to, cap, rev, cost;
flow(int to = 0, int cap = 0, int rev = 0, int cost = 0) : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector< vector< flow > > flows;
const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);
int pow2(int n) { return 1LL << n; }
template < typename T, typename U >
bool chmin(T &x, const U &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template < typename T, typename U >
bool chmax(T &x, const U &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
struct initializer {
initializer() {
cout << fixed << setprecision(20);
}
};
initializer _____;
int N, M, K, T, Q, H, W;
signed main() {
cin >> N >> K;
M = (N - 1) * (N - 2) / 2;
if (M < K) {
cout << -1 << endl;
return 0;
}
vector< pii > G;
rep(i, N - 1) {
G.emplace_back(i + 1, N);
}
int i = 0, j = 1;
while (K < M) {
K++;
G.emplace_back(i + 1, j + 1);
if (j < N - 2) {
j++;
} else {
i++;
j = i + 1;
}
}
cout << G.size() << endl;
rep(i, G.size()) {
cout << G[i].first << " " << G[i].second << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
int main()
{
int n, k;
cin >> n >> k;
int m = ((n-1)*(n-2))/2;
if(k > m)
{
cout << "-1" << endl;
return 0;
}
vector<P> res;
rep(i, n-1) res.emplace_back(P(i, n-1));
int num = -1;
while((int)res.size()-n+1+k < m)
{
num++;
int a = num/(n-1), b = num%(n-1);
if(a >= b) continue;
res.emplace_back(P(a, b));
}
cout << (int)res.size() << endl;
for(auto x : res) cout << x.first+1 << " " << x.second+1 << "\n";
return 0;
} | 1 | 27,354,937 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(ll i=((ll)(n)); i>0; i--)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
template<class T>bool chmax(T &a, const T &b){ if(a<b){ a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b){ if(b<a){ a=b; return 1; } return 0; }
using namespace std;
ll rp = 0;
vector<pair<char, long long>> rle(string s){
vector<pair<char, long long>> ret;
long long i = 0, n = s.size();
while(i<n){
char tmp = s[i];
long long cnt = 1;
while(i<n){
i++;
if(tmp == s[i]) cnt++;
else break;
}
if(tmp == '0') rp++;
ret.push_back(make_pair(tmp, cnt));
}
return ret;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
ll n, k, ans = 0; string s; cin >> n >> k >> s;
auto rlev = rle(s);
if(k >= rp){ cout << n << endl; return 0; }
ll rcnt, sum, cur, prev_sum = 0;
rep(i, rlev.size()){
if(i == 0) rcnt = 0, sum = 0, cur = i;
else{
if(rlev[i-1].first == '0') rcnt--;
sum -= rlev[i-1].second;
}
while(cur<rlev.size()){
if(rlev[cur].first == '0' && rcnt >= k) break;
else{
sum += rlev[cur].second;
if(rlev[cur].first == '0') rcnt++;
cur++;
}
}
chmax(ans, sum);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, k;
string s;
cin >> n >> k >> s;
vector<pair<char, int>> vec(1, P(s[0], 0));
rep(i, n) {
if (vec.back().first == s[i]) {
vec.back().second++;
} else {
vec.emplace_back(s[i], 1);
}
}
int m = vec.size();
vector<ll> d(m + 1, 0);
rep(i, m) d[i + 1] = d[i] + vec[i].second;
ll ans = 0;
rep(i, m) {
int j = i + 2 * k;
if (vec[i].first == '1') j++;
j = min(j, m);
ll tmp = d[j] - d[i];
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | 1 | 24,377,636 |
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<a/b<<" "<<a%b<<" ";
printf("%.5lf\n",1.0*a/b);
} | #include <iostream>
#include <iomanip>
int main() {
int a, b;
std::cin >> a >> b;
int d = a/b;
int r = a%b;
double f = (double)a / (double)b;
std::cout << d << " " << r << " " << std::fixed << std::setprecision(10) << f << std::endl;
return 0;
} | 1 | 68,571,707 |
#include <bits/stdc++.h>
using namespace std;
#define forloop(n) for(int i = 0; i < n; i++)
#define ll long long
#define mod 998244353
long long exp(long long taban, long long us) {
long long carpan = taban;
long long temp = us;
long long res = 1;
for(int i = 0;;i++){
if(temp % 2) res = (res*carpan) % mod;
temp /= 2;
carpan = (carpan*carpan) % mod;
if(temp == 0) break;
}
return res;
}
int main(){
int n; cin>>n;
ll arr[100005] = {};
int maks = 0;
forloop(n){
int sayi; cin>>sayi;
if( (i == 0 && sayi != 0) || arr[0] > 1){
cout<<0;
return 0;
}
arr[sayi]++;
maks = max(maks, sayi);
}
ll res = 1;
for(int i = 1; i <= maks; i++){
res = (res * exp(arr[i-1], arr[i])) % mod;
}
cout<<res;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int64_t MOD = 998244353;
int main()
{
int64_t N, d, maxd = 0, ans = 1;
cin >> N;
vector<int64_t> D(N + 1), Count(N + 1, 0);
for (int64_t i = 1; i <= N; i++)
{
cin >> d;
D.at(i) = d;
Count.at(d)++;
if (d > maxd)
maxd = d;
}
for (int64_t i = 1; i <= N; i++)
{
if ((i == 1 && D.at(i) != 0) || (D.at(i) == 0 && i != 1))
{
cout << 0 << endl;
return 0;
}
}
for (int64_t i = 1; i <= maxd; i++)
{
if (Count.at(i) == 0)
{
cout << 0 << endl;
return 0;
}
int64_t p = 1;
for (int64_t j = 0; j < Count.at(i); j++)
p = (p * Count.at(i - 1)) % MOD;
ans = (ans * p) % MOD;
}
cout << (ans % MOD) << endl;
} | 1 | 49,608,360 |
#include <iostream>
using namespace std;
int main() {
int x,y;
do {
cin >> x >> y;
if(0 == x && 0 == y) {
break;
}
if(x < y) {
cout << x << " " << y << endl;
}else {
cout << y << " " << x << endl;
}
}while(!(0 == x && 0 == y));
return 0;
} | #include <iostream>
#include <fstream>
#include <string>
using namespace std;
int main(){
#ifdef CIN
ifstream cin("input.txt");
ofstream cout("output.txt");
#endif
int i, j;
while (true)
{
cin >> i >> j;
if (i == 0 && j == 0)
break;
if (i > j)
i ^= j ^= i ^= j;
cout << i<< " " << j << endl;
}
return 0;
} | 1 | 58,689,041 |
#include<cstdio>
#include<cstdlib>
#include<string>
using namespace std;
struct node{
unsigned int key;
struct node *next;
struct node *prev;
};
typedef struct node* NodePointer;
NodePointer nil;
void init(){
nil = new struct node;
nil->next = nil;
nil->prev = nil;
}
void insert(int key){
NodePointer x;
x = new struct node;
x->key = key;
x->next = nil->next ;
nil->next->prev = x ;
nil->next = x ;
x->prev = nil;
}
void deleteFirst(){
NodePointer z = nil->next;
if ( z == nil ) return;
NodePointer y = z->next ;
nil->next = y ;
y->prev = nil ;
delete[] z;
}
void deleteLast(){
NodePointer x = nil->prev;
if ( x == nil ) return;
NodePointer y = x->prev;
y->next = nil ;
nil->prev = y;
delete[] x;
}
void del(int key){
NodePointer y = nil->next ;
while(1){
if (y == nil) break;
if (y->key == key) {
NodePointer z = y->prev;
NodePointer x = y->next;
z->next = x;
x->prev = z;
delete[] y;
break;
}
else {
NodePointer t = y->next;
y = t;
}
}
}
void printList(){
NodePointer cur = nil->next;
while(1){
if (cur->next == nil){
printf("%d\n", cur->key );
break;
}
printf("%d ", cur->key );
cur = cur->next;
}
}
int main(){
int key, n, i;
char com[10];
scanf("%d", &n);
init();
for ( i = 0; i < n; i++ ){
scanf("%s", &com);
if ( com[0] == 'i' ) {
scanf("%d", &key) ;
insert(key);
}
else if ( com[6] == 'F' ) deleteFirst();
else if ( com[6] == 'L' ) deleteLast();
else {
scanf("%d", &key) ;
del(key) ;
}
}
printList();
return 0;
} | #include <bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define clr(a) memset(a, 0x00, sizeof(a))
#define Error(x) cout << #x << " = " << x << endl
#define iDEBUG freopen("in.txt", "r", stdin)
#define oDEBUG freopen("out.txt","w",stdout)
#define pb push_back
#define pp pop_back
#define x first
#define y second
#define all(x) x.begin(),x.end()
#define hi cout << "hi" << endl
typedef long long ll;
using namespace std;
int main()
{_
list<int> l;
list<int>::iterator iter;
int n, x;
cin >> n;
for(int i=0; i<n; i++)
{
string str;
cin >> str;
if(str == "deleteFirst")
l.pop_front();
else if(str == "deleteLast")
l.pop_back();
else if(str == "insert")
{
cin >> x;
l.push_front(x);
}
else
{
cin >> x;
for(iter=l.begin(); iter!=l.end(); iter++)
if(*iter == x)
{
l.erase(iter);
break;
}
}
}
for(iter=l.begin(); iter!=l.end(); iter++)
{
if(iter != l.begin())
cout << " ";
cout << *iter;
}
cout << endl;
return 0;
} | 1 | 65,493,691 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int w, h, x, y, r;
cin >> w >> h >> x >> y >> r;
string ans;
if(x + r > w || y + r > h) ans = "No";
else if(x < r || y < r) ans = "No";
else ans = "Yes";
cout << ans << endl;
} | #include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
int W,H,x,y,r;
cin>>W>>H>>x>>y>>r;
if(x<W&&y<H&&0<x&&0<y)
if(r<=(W-x)&&r<=(H-y))
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
else
cout<<"No"<<endl;
return 0;
} | 1 | 50,359,457 |
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef pair<double, double> pdd;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
int main() {
std::ios::sync_with_stdio(false); std::cin.tie(0);
int n;
cin >> n;
for (int k = 1; k <= 1000; ++k) {
if (k * (k - 1) / 2 == n) {
cout << "Yes\n" << k << endl;
vvi s(k);
int t = 1;
for (int i = 0; i < k; ++i) for (int j = i + 1; j < k; ++j) {
s[i].push_back(t);
s[j].push_back(t);
++t;
}
for (int i = 0; i < k; ++i) {
cout << s[i].size();
for (int x : s[i]) cout << ' ' << x;
cout << endl;
}
return 0;
}
}
cout << "No\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os, const map<T,U>& mp){ os << "{"; for(auto& p : mp){ os << p << ","; } os << "}"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
constexpr double eps = 1e-10;
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
int main(){
ll n; cin >> n;
ll k=1;
while(k*(k-1)<2*n) k++;
if(k*(k-1) > 2*n){
cout << "No" << endl;
return 0;
}
int edge=0;
vector<set<int>> st(k);
rep(i,k) st[k].clear();
for(int i=0;i<k;i++){
for(int j=i+1;j<k;j++){
st[i].insert(edge);
st[j].insert(edge);
edge++;
}
}
cout << "Yes" << endl;
cout << k << endl;
rep(i,k){
cout << st[i].size();
for(auto e : st[i]){
cout << " " << e+1;
}
cout << endl;
}
} | 1 | 65,233,278 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
int main() {
int n;
cin >> n;
int mn = INF;
int ans = 0;
while ( n-- > 0 ) {
int p;
cin >> p;
if ( p <= mn ) {
mn = p;
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <cmath>
#include <iomanip>
#include <utility>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
using namespace std;
long long gcd(int x, int y){
if ( x == 0 ) return y;
return gcd(y%x, x);
}
long long lcm(int x, int y){
if ( y == 0 ){
return x;
}
return x*y/gcd(x, y);
}
int min(int a, int b){
return a > b ? b : a;
}
int max(int a, int b){
return a > b ? a : b;
}
int n;
vector <int> tree(400005, 0);
int query(int a){
int res = 0;
for (;a>0;a-=a&-a){
res+=tree[a];
}
return res;
}
void update(int a){
for (;a<=200000;a+=a&-a){
tree[a]++;
}
}
int main()
{
cin.sync_with_stdio( false );
cin>>n;
int res = 0;
for (int i=0;i<n;i++){
int a;
cin>>a;
if ( i == 0 ){
update(a);
res++;
}else{
update(a);
if ( query(a) - 1 == 0 ){
res++;
}
}
}
cout<<res<<endl;
} | 1 | 84,904,264 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int cnt = 0, a_cnt = 0, b_cnt = 0, double_cnt = 0;
string s;
for (int i = 0;i < N;i++) {
cin >> s;
for (int j = 0;j < s.length()-1;j++) {
if (s[j] == 'A') {
if (s[j+1] == 'B') cnt++;
}
}
if (s[0] == 'B') b_cnt++;
if (s[s.length() - 1] == 'A') a_cnt++;
if (s[0] == 'B' && s[s.length() - 1] == 'A') double_cnt++;
}
if (double_cnt == a_cnt && a_cnt == b_cnt) {
a_cnt = max(0, a_cnt-1);
b_cnt = max(0, b_cnt-1);
}
cout << cnt + min(a_cnt, b_cnt) << endl;
} | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <deque>
int main(){
int N;
scanf("%d", &N);
int Acount=0;
int Bcount=0;
int ABcount=0;
int originalcount = 0;
for (int i=0; i<N; i++){
std::string S;
std::cin >> S;
char next='A';
int index=0;
while(index<S.length()){
if (S[index]==next){
if (next=='B'){
originalcount++;
next='A';
} else if (next=='A'){
next='B';
}
} else if (S[index]=='A'){
next='B';
} else {
next='A';
}
index++;
}
if (S[0]=='B' && S[S.length()-1]=='A'){
ABcount++;
}
if (S[0]=='B'){
Bcount++;
}
if (S[S.length()-1]=='A'){
Acount++;
}
}
if (ABcount==Acount && ABcount==Bcount){
printf("%d\n", originalcount+std::max(0, ABcount-1));
} else {
printf("%d\n", originalcount+std::min(Acount, Bcount));
}
return 0;
} | 1 | 23,852,579 |
#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>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
ll gcd(ll a,ll b){
if (a%b == 0) return(b);
else return(gcd(b, a%b));
}
ll lcm(ll a, ll b){
return a/gcd(a, b) * b;
}
int main()
{
cout << fixed << setprecision(15);
string S;
cin >> S;
ll N = S.length();
ll ans = 0;
char now;
REP(i, N){
if(i==0){
now = S[0];
continue;
}
if(now != S[i]){
ans++;
now = S[i];
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
int main()
{
std::string str;
std::cin >> str;
char current = str[0];
int count = 0;
for (const char c : str)
{
if (c != current)
{
++count;
current = c;
}
}
std::cout << count << std::endl;
return 0;
} | 1 | 3,550,983 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI 3.14159265358979323846
#define ifYN(x) cout<<(x?"Yes":"No")<<"\n"
ll fac[MAX], finv[MAX], inv[MAX];
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;
}
bool palindrome(string s){
bool flag=true;
rep(i,(ll)s.size()) if(s[i]!=s[s.size()-1-i]) flag=false;
return flag;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll n) {
ll ans=0;
while(n!=0) ans+=n%10,n/=10;
return ans;
}
ll Svec(vector<ll> v){
ll n=0;
rep(i,(ll)v.size()) n+=v[i];
return n;
}
ll GCD(ll a,ll b) {
return b ? GCD(b,a%b) : a;
}
ll LCM(ll a,ll b){
return a/GCD(a,b)*b;
}
ll Factorial(ll n){
ll m=1;
while(n>=1) m*=n,n--;
return m;
}
void runlength(string s,vector<pair<char,ll>> &p){
ll x=1;
if(s.size()==1){
p.push_back(pair<char,ll>(s[0],1));
}
rep(i,(ll)s.size()-1){
if(s[i]==s[i+1]){
x++;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[i],x));
}
}else{
p.push_back(pair<char,ll>(s[i],x));
x=1;
if(i==(ll)s.size()-2){
p.push_back(pair<char,ll>(s[s.size()-1],x));
}
}
}
}
ll COM(ll n,ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
string Toupper(string s){
string ans="";
rep(i,s.size()){
if('a'<=s[i] && s[i]<='z') ans+=(char)s[i]-32;
else ans+=s[i];
}
return ans;
}
string Tolower(string s){
string ans="";
rep(i,s.size()){
if('A'<=s[i] && s[i]<='Z') ans+=(char)s[i]+32;
else ans+=s[i];
}
return ans;
}
void dis(vector<ll> v){ rep(i,v.size()) cout<<v[i]<<"\n"; }
void dis2(vector<vector<ll>> v){
rep(i,v.size()){
rep(j,v[0].size()) cout<<v[i][j]<<' ';
cout<<endl;
}
}
const int MAX_N=1000010;
vector<ll> sieve_of_eratosthenes(){
vector<ll> isPrime(MAX_N+1,0);
isPrime[1]=1;
for(int i=2;i<=MAX_N;i++){
if(!isPrime[i]){
for(int j=i;j<=MAX_N;j+=i){
isPrime[j]=i;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n){
vector<pint> ans;
for(ll p=2;p<=sqrt(n);p++){
if(n%p!=0) continue;
ll cnt=0;
while(n%p==0){
n/=p;
cnt++;
}
ans.push_back(make_pair(p,cnt));
}
if(n!=1) ans.push_back(make_pair(n,1));
return ans;
}
int main() {
IOS;
ll n;
cin>>n;
vector<ll> a(n);
rep(i,n) cin>>a[i];
vector<ll> v=sieve_of_eratosthenes();
ll tmp=0;
rep(i,n){
tmp=GCD(tmp,a[i]);
}
if(tmp>=2){
cout<<"not coprime"<<endl;
return 0;
}
bool flag=false;
map<ll,ll> mp;
rep(i,n){
mp[v[a[i]]]++;
}
for(auto c:mp){
if(c.first==1) continue;
if(c.second>=2) flag=true;
}
if(flag) cout<<"setwise coprime"<<endl;
else cout<<"pairwise coprime"<<endl;
} | #include<bits/stdc++.h>
using namespace std;
const int N=1e6;
int p[N/2];
bool vis[N+10];
int f[N+10];
int main(){
int m=0;
for(int i=2;i<=N;i++){
if(!vis[i])p[++m]=i,f[i]=i;
for(int j=1;j<=m&&p[j]*i<=N;j++){
vis[p[j]*i]=true;
f[p[j]*i]=p[j];
if(i%p[j]==0)break;
}
}
int n;
cin>>n;
bool pa=true;
int d=0;
for(int i=1;i<=n;i++){
int a;
cin>>a;
d=__gcd(d,a);
while(a>1){
int j=f[a];
if(vis[j])pa=false;
vis[j]=true;
for(a/=j;a%j==0;a/=j);
}
}
puts(pa?"pairwise coprime":(d==1)?"setwise coprime":"not coprime");
} | 1 | 29,354,440 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A, B;
string op;
cin >> A >> op >> B;
if(op == "+")
cout << A + B << endl;
if(op == "-")
cout << A - B << endl;
} | #include <bits/stdc++.h>
#include<iostream>
using namespace std;
int main() {
int a,b;
string s;
cin >> a >> s >> b;
if(s == "+"){
cout << a+b;
}else{
cout << a- b;
}
} | 1 | 60,007,254 |
Subsets and Splits