code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d,e;
cin>>a>>b>>c>>d>>e;
vector<int > vec(5);
vec[0]=a;vec[1]=b;vec[2]=c;vec[3]=d;vec[4]=e;int k=0;int l=100;
for(int i=0;i<5;i++){
if(vec[i]%10 == 0){k += vec[i];}
else{k+= (vec[i]/10 + 1 ) * 10;
l =min(l,vec[i]%10);
}... | #include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
set<int> p, q;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
if (a == 1)p.insert(b);
if (b == n)q.insert(a);
}
bool ret = ... | 0 | 69,537,539 |
#include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const int MAX = 100000;
static const int NIL = -1;
using namespace std;
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*b / gcd... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) for (int i = (n); i >= (k); i--);
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
templat... | 0 | 93,053,575 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 5LL << 60;
const ll mod = 1e9 + 7;
int main() {
ll H, W;
cin >> H >> W;
if(H == 1 || W == 1)
cout << 1;
else
cout << (H * W + 1) / 2;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main() {
ll n, k; cin >> n >> k;
vector<ll> cnt(k, 0);
for (ll i = 1; i <= n; ++i) {
cnt[i % k]++;
}
ll ans = 0;
for (ll a = 0; a < k; ++a) {
... | 0 | 91,966,838 |
#include <iostream>
#include <string>
#include <stack>
using namespace std;
int main(){
string s;
while(getline(cin, s), s != ".") {
stack<char> st;
st.push('$');
bool valid = true;
for (int i = 0; i < s.size() && valid; i++) {
if (s[i] == '(' || s[i] == '[') {
st.push(s[i]);
} els... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=mod*mod;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
struct node{ll x, y, cost;};
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_... | 0 | 34,917,637 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
string s,t;
cin>>s;cin>>t;
if(s.size()<t.size()) cout<<"LESS"<<endl;
else if(s.size()>t.size()) cout<<"GREATER"<<endl;
else{
rep(i,(int)s.size()){
if(s[i]>t[i]){
... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
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; }
lli n, k;
int main(void){
cin >> n... | 0 | 53,154,252 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main()
{
int n, count = 0;
float m, sum = 0;
vector<int> a(300);
cin >> n >> m;
rep(i, n){
cin >> a.at(i);
sum += a.at(i);
}
rep(i, n){
if (a.at(i) >=... | #include <iostream>
#include <queue>
using namespace std;
#define MAX 110
int num;
int matrix[MAX][MAX];
int dst[MAX];
void input(){
for(int i=0;i<MAX;i++){
dst[i] = -1;
for(int j=0;j<MAX;j++){
matrix[i][j] = 0;
}
}
for(int i=1;i<=num;i++){
int v; cin >> v;
... | 0 | 50,505,344 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = 1e9 + 1;
int main() {
double n,a[200];
cin >> n;
double sum = 0... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)... | 0 | 33,569,979 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; }... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll dis(ll x1, ll y1, ll x2, ll y2){
return abs(x1 - x2) + abs(y1 - y2);
}
int main()
{
ll h, w;
cin >> h >> w;
vector<string> a(h);
set<ll> ban_h;
set<ll> ban_w;
rep(i, h){
... | 0 | 268,930 |
#include<iostream>
using namespace std;
int main(){
int n,u,k,v;
int A[101][101];
cin>>n;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++) A[i][j]=0;
}
for(int i=0;i<n;i++){
cin>>u;
cin>>k;
for(int j=0;j<k;j++){
cin>>v;
A[u-1][v-1]=1;
}
}
for(int i=0;i<n;i++){
for(int j=0;j... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | 0 | 63,021,588 |
#include<iostream>
#include<algorithm>
using namespace std;
int a[100][100],memo[100][100];
int solve(int n,int m){
if(memo[n][m] != 0) return memo[n][m];
if(n == 1 && m == 1) return 1;
if(n == 0 || m == 0) return 0;
if(a[n][m] == -1) return 0;
return memo[n][m] = solve(n-1,m) + solve(n,m-1);
}
int main(){
... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | 0 | 88,944,554 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define cyes cout<<"YES"<<endl
#define cno cout<<"NO"<<endl
#define sp <<" "<<
#define cst(x) cout<<fixed<<setprecision(x)
#define pi 3.14159265359
#define mod 1000000007
struct edge {
int to;
int weight;
ed... | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
typedef long long ll;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const long doubl... | 0 | 2,138,622 |
#include<stdio.h>
void func(int,int);
int n,m,cnt,sum;
int main(void)
{
while(1){
int i,j;
scanf("%d %d",&n,&m);
if(n==0&&m==0) break;
cnt=0; sum=0;
func(0,0);
printf("%d\n",cnt);
}
return 0;
}
void func(int nn,int x)
{
int i;
if(nn==n&&sum==m) cnt++;
else{
for(i=x;i<10;i++){
sum+=i; func(nn+1,i+... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define yesno(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define vi vector<int>
#define pb push_back
#define i197 1000000007
#define MAX_N 200002
using namespace ... | 0 | 37,478,297 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int s, w;
cin >> s >> w;
if (w>=s){std::cout << "unsafe" << std::endl;}
else{std::cout << "safe" << std::endl;}
return 0;
} | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n, a, b;
cin >> n;
vector<vector<int>> red;
vector<vector<int>> blue... | 0 | 28,408,709 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef pair<int,int> PII;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
const int MOD = 1000000007;
int N, K;
vector<int> A;
int main() {
while (cin >> N >> K) {
A.resize(N);
for (int i = 0; i < N; ++i) cin >> A[i];
int res = 0;... | 0 | 51,940,509 |
#include <stdio.h>
int main(void)
{
double x1,y1,x2,y2,x3,y3,xp,yp;
double a,b,c;
while(scanf("%lf %lf %lf %lf %lf %lf %lf %lf", &x1, &y1, &x2, &y2, &x3, &y3, &xp, &yp)!=EOF){
a = (x1-xp)*(y2-yp)-(x2-xp)*(y1-yp);
b = (x2-xp)*(y3-yp)-(x3-xp)*(y2-yp);
c = (x3-xp)*(y1-yp)-(x1-xp)*(y3-yp);
if( (a>0&&b... | #include <bits/stdc++.h>
using namespace std;
#define modulo 998244353
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000
int main(){
int H,W,d;
cin>>H>>W>>d;
int K = 500;
vector<string> S(2000,string(2000,'.'));
for(int i=0;i<2000;i++){
for(int j=0;j<2000;j++){
int a = ((i%(2*d))<... | 0 | 7,165,913 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <functional>
#include <queue>
#include <cmath>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define rep1(i,n) for(int i=1;i<=(int)n;++i)
int N, K;
int Sum[200010];
map<int, int>... | #include <iostream>
using namespace std;
int ca(int c){
int x = 0;
for(int i=1; i<=c; i++){
if(c<i) break;
c-=i;
x++;
}
return x;
}
int main(void){
long long N;
int c, ans = 0;
cin >> N;
for(long long z=2; z*z<=N; z++){
c = 0;
while(true){
if(N%z==0){
N = N / z;
... | 0 | 52,679,545 |
#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>;
using VVI = vector<vector<int>>;
const int INF = 1001001001;
const int MOD = 1000000007;
template <typename T>
void print(const T &v);
int main()
{
int n;
string s;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int l;
cin >> l;
double d = l/3.0;
printf("%.10lf",d*d*d);
} | 0 | 96,042,692 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main () {
int N , H , W;
cin >> N >> H >> W;
int answer = 0;
rep(i, N){
int A , B;
cin >> A >> B;
if(A >= H && B >= W){
answer++;
}
}
cout << answer << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main() {
int h, w;
cin >> h >> w;
vector<string> a(h);
for (int i = 0; i < h; ++i) {
cin >> a[i... | 0 | 15,108,492 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int MOD = (int)1e9 + 7;
const double PI = 3.14159265358979323846;
template <class T, class U>
void chmin(T& t, const U& u) {
if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const ... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, _s, n) for(int i = _s, i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
#define repi(itr, ds) for(auto itr = ds.begin(); itr != ds.end(); itr++)
template <typename T>
ist... | 0 | 100,210,095 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int n, a[maxn], b[maxn];
int main() {
scanf("%d", &n);
long long s = 0, mn = 1e18;
bool flag = 1;
for (int i = 1; i <= n; i++) {
scanf("%d %d", &a[i], &b[i]);
flag &= (a[i] == b[i]), s += a[i];
if (a[i] > b[i]... | #include <bits/stdc++.h>
#define int long long
#define INT_MAX INT64_MAX
#define INT_MIN INT64_MIN
#define PI 3.14159265358979323846
#define CLK clock_t clk = clock();
#define OCLK cerr << "Time (in ms): " << (double)(clock() - clk) * 1000.0 / CLOCKS_PER_SEC << '\n';
#define MOD 1000000007
#define pln cout << "========... | 0 | 58,040,488 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define v2(v,n,m,init) vector<vector<i... | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
deque<int> b;
if(n % 2 == 0) {
rep(i, n) {
int a;
... | 0 | 20,452,735 |
#include<iostream>
#include<cstring>
using namespace std;
#define MAX 10000000
long long divisors[MAX + 1] = { 0, };
int n;
long long sum = 0;
int main() {
cin >> n;
memset(divisors, 0, sizeof(divisors));
for (int i = 1; i <= MAX; i++) {
for (int j = 1; j <= MAX/i; j++) {
divisors[i*j]++;
}
}
for (int i = 1... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Map = map<string,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF=1LL<<60;
ll MOD=1000000007;
ll N;
int main(){
ll A;
cin >> A;
ll B;
cin >> B;
vector<ll> Acount(50,0LL);
vector<ll> ... | 0 | 88,859,844 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, K, ans = 0;
cin >> N >> K;
map<int, int> mp;
vector<pair<int64_t, int64_t>> vp(N);
vector<int64_t> v1, v2, s1(N + 1, 0), s2(N + 1, 0);
for (int i = 0; i < N; i++)
{
cin >> vp[i].second >> vp[i].first;
}
sort(vp.begin(), vp.end()... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int m... | 0 | 50,021,377 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | #include <algorithm>
#include <array>
#include <cstddef>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
int main()
{
int n;
cin >> n;
array<int, 3> counter{};
int a, b;
cin >> a >> b;
for (int i = 0; i < n; i++)
... | 0 | 3,128,295 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
char c;
cin >> c;
if (c <= 'Z') {
cout << "A";
}
else {
cout << "a";
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
ll n;
ll x,m;
cin>>n>>x>>m;
ll a[m+1];
a[0]=x;
rep(i,0,m){
a[i+1]=a[i]*a[i]%m;
}
if(n<m){
ll ans=0;
rep... | 0 | 43,484,973 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a,b,x;
cin >> a >> b >> x;
bool ans = false;
if (a <= x && a+b > x) ans = true;
cout << ((ans) ? "YES" : "NO") << endl;
} | #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include... | 0 | 32,229,554 |
#define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
int n, m, v, p;
vector <int> a;
bool check(int idx){
int tar = a[idx] + m;
if(tar < a.back()) return 0;
ll sum = 0;
for(int i = idx + 1 ; i < n ; i++){
sum += tar - a[i];
}
if... | 0 | 76,181,331 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char c=getchar();
cout<<(char)(c+1)<<"\n";
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define lin "\n"
#define fast_io ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(0)
int a[105], b[105], c[105];
void solve() {
int m, n;
cin >> m >> n;
ll cnt = 0;
for (int i = m;... | 0 | 39,580,161 |
#include "bits/stdc++.h"
using namespace std;
string l("qwertasdfgzxcvb");
int main() {
while (1) {
string st; cin >> st;
if (st == "#") {
break;
}
else {
bool a = true;
int ans = 0;
for (int i = 0; i < st.size(); ++i) {
if ((l.find(st[i]) != string::npos) != a&&i != 0) {
ans++;
}
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | 0 | 73,416,086 |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define pii pair<int,int>
#define pll pair<lli, lli>
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vll vector<lli>
#define pb push_back
#define mpr make_pair
#define ss second
#define ff first
#define INF 1000000001
#define i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x... | 0 | 77,374,773 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main()
{
string s;
int k;
cin>>s>>k;
int m=s.length();
vector<vector<int> > dp(k+1,vector<int>(2));
dp[0][0]=1;
for(int i=1;i<=m;i++)
{
vector<vector<int> > new_dp(k+1,vector<int>(2));
... | #include <bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
int N;
cin >> N;
vector<string> s(N);
REP(i, N){
cin >> s[i];
}
int M;
cin >> M;
vector<string> t(M);
REP(i, M){
cin >> t[i];
}
int max_point = 0;
REP(i, N){
string selected = s[i];
int point = 0;
... | 0 | 11,915,177 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main(){
char s;
cin>>s;
if(s == 'A'){
cout<<"T"<<endl;
} else if(s == 'T'){
cout<<'A'<<endl;
}else if(s == 'G'){
cout<<"C"<<endl;
}else{
cout<<"G"<<endl;
}
return 0;
} | #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_st... | 0 | 53,361,391 |
#include<bits/stdc++.h>
#define godspeed ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define rep(i,n) for(ll i=1; i<=n; i++)
#define rep1(i,a,b) for(ll i=a; i<=b; i++)
#define repVect(i,n) for(l... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#include <cassert>
#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()
using namespace std;
using ll = long long;
usin... | 0 | 49,297,459 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=105,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
PII a[N],b... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 5,879,000 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | 0 | 100,357,918 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
signed main()
{
int x,t; cin >> x >> t;
if(x<t){
cout << "0" << "\n";
return 0;
}
else{
cout << (x-t) << "\n";
}
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
vector <int> G[N];
int used[N], rec[N];
int cnt1, cnt2, cnt3;
queue <int> q;
void bfs(int x){
int cnt = 0, flag = 1;
while (!q.empty()) q.pop();
q.push(x);
rec[x] = 1;
while (!q.empty()){
int u = q.front(); q.pop();
cnt++;
for (int i = 0; ... | 0 | 41,921,910 |
#include <iostream>
#include <utility>
#include <vector>
#include <algorithm>
#include <limits>
#include <cmath>
#include <map>
#include <set>
using namespace std;
#define ll long long int
#define rep(i,k,n) for(int i = k; n > i; i++)
#define REP(i,n) rep(i,0,n)
int main(){
int n;
long double Pi4 = atan((long d... | #include<iostream>
#include<string>
using namespace std;
int main() {
int N;
cin>>N;
string resultl, resultr, resultmiddle;;
int l=0, r=N;
int middle;
cout<<l<<endl<<flush;
cin>>resultl;
while((resultl != "Vacant") & (resultr != "Vacant")){
middle = (l+r)/2;
cout<<middle<... | 0 | 83,408,561 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
int main(){
ll x, y;
cin >> x >> y;
ll res = 1;
while(x * 2 <= y){
x *= 2;
res++;
}
cout << res << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> x(n);
int ans=1000000007;
for(int j=0;j<n;j++){
cin >> x.at(j);
}
for(int i=1;i<101;i++){
int tmp=0;
for(int j=0;j<n;j++){
tmp+=(x.at(j)-i)*(x.at(j)-i);
}
... | 0 | 81,204,784 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
unsigned long long int are = 0;
unsigned long long int sore = 0;
for (int i = 1; i <= n; ++i)
{
if (i % k == 0)
{
++are;
}
if(k % 2 == 0 && i % k == k / 2)
{
++sore;
}
}
cout << (unsigned long long int)(sore*so... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | 0 | 90,724,096 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <cstdlib>
#include <cctype>
#define ll long long
#define PI 3.14159265358979323846
using namespace std;
const int maxn = 1e6+7;
int main() {
int n;
cin>>n;
ll *a=new ll[n];
fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<")" << "\n";
#define DEB... | 0 | 56,962,209 |
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,x,tot,cnt,sum;
int a[N],b[N],c[N];
int main(){
scanf("%d",&n);
for (register int i=1; i<=n; ++i)
{
scanf("%d",&x);
if (i&1) a[++tot]=x;
else b[++cnt]=x;
c[i]=x;
}
sort(a+1,a+tot+1); sort(b+1,b+cnt+1);
sort(c+1,c+n+1);
for (register ... | #include <bits/stdc++.h>
using namespace std;
void main_sub(void);
int main(int argc, char* argv[]) {
cout << std::fixed << std::setprecision(10);
main_sub();
return 0;
}
using i64 = int64_t;
#ifndef USE_STRICT_INT
#define int i64
#endif
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x... | 0 | 46,910,742 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | 0 | 54,765,304 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 0 | 82,484,300 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
ll k;
int main(){
cin>>k;
ll x=k/50,y=k%50;
cout<<50<<endl;
rep(i,50){
if(i)cout<<" ";
cout<<(i<y?i+x-y+51:i+x-y);
}
cout<<endl;
} | #pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <cstdlib>
using namespace std;
typedef ... | 0 | 44,452,010 |
#define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
string b;
cin >> b;
string out = "";
if(b=="A") out = "T";... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
bool flg=0;
while(n!=0)
{
if(n%10==7)
{
flg=1;
cout << "Yes" << endl;
break;
}
n=n/10;
}
if(flg==0)
{
cout << "No" <<endl;
}
retu... | 0 | 60,017,006 |
#include "iostream"
#include "string.h"
using namespace std;
int L[1001][1001];
int lcs( char s1[], char s2[], int l1, int l2 ) {
if (L[l1][l2] != 0)return L[l1][l2];
if (l1 == 0 || l2 == 0) return 0;
else if (s1[l1-1] == s2[l2-1]) L[l1][l2] = lcs(s1, s2, l1 - 1, l2 - 1) + 1;
else {
int lsc1 = lcs(s1, s2, l1 - 1,... | #include <bits/stdc++.h>
using namespace std;
#define int long long
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; }
bool isOK(string &s){
int n = s.size()/2;
for(int i = 0;i < n;i++){
if(s... | 0 | 36,004,602 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%lld", &(n))
#define nai(a, n) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long l... | 0 | 65,218,806 |
#include<iostream>
#include<cstdio>
#include<cstring>
template<typename T>inline void read(T &x)
{
char c=x=0;
for(c=getchar();!isdigit(c);c=getchar());
for(;isdigit(c);c=getchar())x=(x<<3)+(x<<1)+(c^48);
}
namespace Good_problem
{
typedef long long ll;
const int N=101000,M=N*4;
int begin[N],next[M],to[M];
int n... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < int(n); i++)
typedef long long ll;
using namespace std;
int selection(vector<int>&a) {
int mini;
int cnt = 0;
for (int i = 0; i<int(a.size()); i++) {
mini = i;
for (int j = i; j<int(a.size()); j++)
if (a[j] < a[mini])
mini = j;
if (i != mini)... | 0 | 54,511,657 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 1000000007
#define TE 2e5
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
int N, M; cin >> N >> M;
int L = -1,... | #include<iostream>
#include<climits>
using namespace std;
int g[12][12];
const int INF = INT_MAX/2;
int main(){
while(true){
int n;
cin >> n;
if(n == 0)break;
fill(*g,*(g+12),INF);
for(int i = 0;i < 12;i++)g[i][i] = 0;
for(int i = 0;i < n;i++){
int a,b,c;
cin >> a >> b >> c;
... | 0 | 21,262,392 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
constexpr ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
int main() {
int n; cin >> n;
map<int,int> mp;
for (int i = 0; i < n; i++){
int a; cin >> a;
mp[a]++;
}
int ans = 0, even = 0;
for (auto m: mp) {
if (m.second % 2) {
m.second = 1;
... | 0 | 41,526,387 |
#include<bits/stdc++.h>
using namespace std;
#define fi(a) scanf("%d",&a);
#define fli(a) scanf("%ld",&a);
#define fll(a) scanf("%lld",&a);
#define pi(a) printf("%d\n",a);
#define ppi(i,a) printf("Case %d: %d\n",i,a);
#define ll long long
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
voi... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
string s;
cin >> n >> s;
stack<int> l;
int r = 0;
for(int i = 0;i < n;i++){
if(s[i] == '(')l.push(1);
if(s[i] == ')'){
if(!l.empty())l.pop();
else r++;
}
}
for(int i = 0;i < r;... | 0 | 68,037,040 |
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mod 1000000007ll
const ll maxn = 9e18;
using namespace std;
const ll maxsize = 100000009;
void solve() {
int n;
cin >> n;
string s, t, new_s = "";
cin >> s >> t;
for(int i = 0; i < n; ++i) {
new_s += (s[i]);
new_s += t[i];
}
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define prec(n) fixed << setprecision(n)
#define maxpq priority_queue<ll>
#define minpq priority_queue<int, vector<int>, greater<int>>
#define PI 3.14159265
#define pb push_back
#define bits(n) __builtin_popcount(n)
void solve()
{
int n;
cin... | 0 | 82,014,825 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long a, long long b){
if (a % 2 == 0 || b % 2 == 0) cout << "Even" << endl; else cout << "Odd" << endl;
}
int main(){
long long a;
scanf("%lld",&a);
long long b;
scanf("%lld",&b);
solve(a, b);
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
const long long INF = 1LL<<60;
#define rev(s) (string((s).rbegin(), (s).rend()))
int main () {
int n;cin>>n;
int a[200010];
rep(i,n) {
cin>>a[i];
}
ll ans=0;
... | 0 | 24,713,335 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N, M;
cin >> N >> M;
vector<pair<ll, int>> AB(N);
for (int i = 0; i < N; i++)
{
cin >> AB[i].first >> AB[i].second;
}
sort(AB.begin(), AB.end());... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 0 | 54,867,145 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include <stdio.h>
int main(void)
{
int n,x;
int i,j,k;
int co;
do{
co = 0;
scanf("%d%d",&n,&x);
if(n == 0 && x == 0)
break;
else{
for(i=1; i<=n; i++){
for(j=1; j<=n; j++){
for(k=1; k<=n; k++){
if((i + j + k) == x){
if(i == j || j == k || k ==i)
co = co;
else... | 0 | 55,278,050 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <numeric>
#include <array>
#include <cmath>
#include <memory>
using namespace std;
#define DEB(variable) cout << #variable << '=' << variable << endl
#define FOR(LoopVariable,numberOFbegin,numberOFend) for (long lon... | #include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
using namespace std;
void fastio()
{
#ifndef ONLINE_JUDGE
freopen("INPUT.txt","r",stdin);
freopen("OUTPUT.txt","w",s... | 0 | 53,476,833 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
using namespace std;
signed main() {
ll N;
cin >> N;
vector<ull> a(N);
ull Z = 0;
rep(i,N){
cin >> a[i];
... | #include <bits/stdc++.h>
using namespace std;
template< class t>
long long int gcd( t g,t h )
{
return ( h==0 ? g : gcd(h,g%h) );
}
int main()
{
#ifdef Saiyan
freopen("inp.txt","r",stdin) ;
freopen("out.txt","w",stdout) ;
#endif
ios_base::sync_with_stdio(false) ; cin.tie(0) ;
long long int t,i,j,a[100... | 0 | 61,728,455 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define eb emplace_back
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define rep(i,n) FOR(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define ve vector
#def... | 0 | 83,246,155 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
... | #include <iostream>
using namespace std;
int main()
{
int n;
do {
cin >> n;
} while (n <= 0 || n > 10000);
long* a = new long[n];
long sum = 0;
long max = -1000001;
long min = 1000001;
for (int i = 0; i < n; i++) {
do {
cin >> a[i];
} while (a[i] < ... | 0 | 24,140,595 |
#include <bits/stdc++.h>
using namespace std;
vector<int> to[1000000];
vector<int> ans;
void dfs(int v, int p=-1){
for(int u : to[v]){
if(u == p) continue;
ans[u] += ans[v];
dfs(u, v);
}
}
int main(){
int n, q;
cin >> n >> q;
for(int i = 0; i < n - 1; ++i){
int a, b;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
const ll mod = 1000000007;
ll modpow(ll x, ll n){
if(n == 0) return (ll)1;
if(n % 2 ... | 0 | 36,777,690 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=... | #include <stdio.h>
#include <iostream>
using namespace std;
long long a[100010];
long long mask[61];
int main()
{
int n;scanf("%d",&n);
for (int i=0;i<n;++i)
scanf("%lld",&a[i]);
long long ans=0;
long long tmp=0;
for (int i=0;i<n;++i)
tmp^= a[i];
ans=tmp;
tmp= (1LL << 61)-1-t... | 0 | 20,929,255 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=s;i<n;i++)
#define all(a) (a).begin(),(a).end()
struct dice {
int d[6];
void rotation(char com){
if(com == 'E'){
int tmp = d[0];
d[0] = d[3];
d[3] = d[5];
... | #include<bits/stdc++.h>
using namespace std;
#define INF 1e9
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}... | 0 | 65,629,334 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[10];
for(int i=1;i<5;i++)
cin>>a[i];
sort(a+1,a+5,greater<int> ());
swap(a[0],a[4]);
const int cnt[10]={1,9,7,4};
for(int i=0;i<4;i++)
if(a[i]!=cnt[i]){
cout<<"NO"<<endl;
return 0;
}
cout<<"YES"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | 0 | 11,591,035 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int n; scanf("%d", &n);
for(int k = 1; k * (k + 1) / 2 <= n; k++) if(k * (k + 1) / 2 == n){
int s[500][500] = {};
for(int i = 0, p = 1; i < k; i++){
for(int j = 0; j < k - i; j++) s[i][j + i] = p++;
}
int t[500][500] = {};
for(int i = ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 0 | 6,878,273 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
int main() {
int n; cin >> n;
int cur = 1;
int ans = 0;
vector<int> a(n+1);
vector<bool> l(n+1);
rep(i,n) cin >> a[i+1];
rep(i,n) l[i+1] = false;
while(1){
if(l... | #include <iostream>
using namespace std;
struct Card{char suit,value;};
void show_array(struct Card a[],int n){
for(int i=0;i<n;i++){
if(i>0) cout << " ";
cout << a[i].suit << a[i].value;
}
cout << endl;
}
void BubbleSort(struct Card a[],int n){
for(int i=0;i<n;i++){
for(int j=n-1;j>i;j--){
if... | 0 | 95,928,681 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999999999
#define rep(i,m,n) for(lli i = m;i < n;i++)
#define rrep(i,m,n) for(lli i=m-1;i>=n;i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(),N.end()),N.end());
#define S... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 64,394,797 |
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
#define INF 2e9
using namespace std;
const int N=1e6+1;
const int mod=1e9+7;
ll fastexp(ll base,ll exp){
base%=mod;
ll ans=1;
while(exp>0){
if(exp&1){
ans*=base;
ans%=mod;
}
base*=base;
base%=mod;
exp/=2;
}
return ans;
}
ll gcd(ll a,ll... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | 0 | 49,348,407 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double value = v[0];
for (int i = 1; i < n; i++) {
value = ... | #include <iostream>
#include <string>
#include <fstream>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>
#include <queue>
#include <map>
#include <cmath>
#include <numeric>
#include <tuple>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const long long mod = 1e9 + 7;
int mai... | 0 | 69,991,511 |
#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
const int maxn=1005;
int n,m,k,dx[]={-1,1,0,0},dy[]={0,0,1,-1},vis[maxn][maxn];
char map[maxn][maxn];
struct maze
{
maze(int xx=0,int yy=0,int tt=0):x(xx),y(yy),time(tt){}
int x,y,time;
};
maze bfs(int bx,int by,char ch)
{
memset(vis,0,size... | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main(){
int w, h, n;
cin >> w >> h >> n;
int x1 = w, y1 = h;
int x0 = 0, y0 = 0;
int ans = 0;
rep(i,n){
... | 0 | 82,505,601 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define mt make_tuple
#define MOD 1000000007
#define fo(i,a,b) for(i=a;i<b;i++)
#define foe(i,a,b) for(i=a;i<=b;i++)
#define all(x) x.begin(), x.end... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define mem(a,b) memset(a,b,sizeof(a))
#define eb emplace_back
#define mp make_pair
using namespace std;
const int MAX_N=1e5+10;
const int mod=998244353;
int n,x,d[MAX_N];
ll quick_mod(ll x,ll y){
ll res=1;
while(y){
if(y&1) (res*=x... | 0 | 58,468,262 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int n,i;
cin >>n >>i;
cout << (n-1)*(i-1) << endl;
return 0;
} | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 28,933,000 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using st = string;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using pcc = pair<char, char>;... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,sum=0; cin>>N;
vector<ll>A(N,1);
stack<ll>S;
for(int i=2; i<=N; i++){
A[i-1]=A[i-2]+i;
}
while(sum!=N){
if(sum<N){
auto IT=lower_bound(A.begin(), A.end(), N-sum);
ll z=IT-A.begin();
sum+=A[z];
... | 0 | 70,471,798 |
#include <bits/stdc++.h>
#include <vector>
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
int N = S.length() + 1;
vector<int> a(N, -1);
for (int i = 0; i < N; i++) {
if (i == 0 && S[0] == '<') {
a[0] = 0;
int j = i + 1;
while (... | #include<bits/stdc++.h>
using namespace std;
#define cinsc ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOR(i,k,n) for(int64 i=k;i<(int64)n;i++)
#define FORr(i,k,n) for(int64 i=(int64)k;i>=n;i--)
#define FORE... | 0 | 68,381,153 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
const int inf = 1e9;
const int MAX = 1 << 26;
int dp[MAX];
int main() {
string s;
cin >> s;
int n = s.size();
vector<int> a(n);
a[0] = (1 << (s[0] - 'a'));
rep(i, n - 1) {
a[i + 1] += a[i] ^ (1 << (s[i... | #include <cstdio>
#include <queue>
using namespace std;
#define MAX_N 100
int g[MAX_N+1][MAX_N+1];
int d[MAX_N+1];
bool visited[MAX_N+1];
queue<int> que;
int n;
int t = 1;
void bfs(int id) {
visited[id]=true;
que.push(id);
queue<int> next_que;
while(!que.empty()) {
int v = que.front(); que.pop();
for(in... | 0 | 53,094,999 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N, M; cin >> N >> M;
vector<int> A(N, 0), B(N, 0);
for (int i = 0; i < N; i++) cin >> A[i] >> B[i];
vector<int> C(M, 0), D(M, 0), I(M, 0);
for (int i = 0; i < M; i++) {
cin >> C[... | 0 | 85,015,019 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1e9;
const int mod = 1000000007;
int ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i,n) for (int i = 0; i < (n); ++i)
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; }
const ... | 0 | 17,092,523 |
#include <iostream>
#define ll long long
#include <cstring>
using namespace std;
int arr[500005];
int main() {
string s;
cin >> s;
memset(arr, 0, sizeof(arr));
ll ans = 0;
int cntr = 0;
for (int i = 0; i < s.length(); i++){
if (s[i] == '<'){
arr[i+1] = arr[i]+1;
}
}
for (int i = s.length()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int a,b;
cin>>a>>b;
char c[100][100];
rep(i,0,50){
rep(j,0,100){
c[i][j]='.';
}
}
rep(i,50,100){
rep(j,0,100){
c[i][j]='#';
... | 0 | 36,049,157 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int A = 1;
for (int i = 0; i < M; i++) {
A *= 2;
}
int B = 1900 * M + 100 * (N - M);
cout << A * B << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll,ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll,ll>>>
... | 0 | 43,658,009 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
for(int i=111;i<=999;i+=111){
if(i-n<=110&&n<=i){
cout<<i;
return 0;
}
}
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
int main(){
int a,b,m;
cin >> a >> b >> m;
vector<int> A(a,0);
vector<int> B(b,0);
int a_min = 1000000;
int b_min = 1000000;
for(int i=0;i<a;i++){
cin >> A[i];
if(a_min>A[i]) a_min = A[i];
}
for(int i=0;i<b;i++){
ci... | 0 | 93,284,087 |
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define RREP(i, n) for(int (i)=(n)-... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define EPS (1e-15)
#define rep(i, n)... | 0 | 45,777,526 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
int main(){
int n,a,b;
cin >> n >> a >> b;
if(abs(a-b)%2==1)
cout << "Borys" << endl;
else
cout << "Alice" << endl;
return 0;
} | #include <stdio.h>
int main() {
int i, k, v,scan,an;
int MAX_V = 999999;
int count[MAX_V+1];
int prime[MAX_V+1];
for(i = 2; i <= MAX_V; i++) {
prime[i] = 1;
}
for(i = 2; i*i <= MAX_V; i++) {
if(prime[i]) {
for(k = 2 * i; k <= MAX_V; k += i) {
prime... | 0 | 88,294,401 |
#include <iostream>
#include <cstdio>
using namespace std;
#define MAXN 10001
int n, A[MAXN], Rank[MAXN];
void init()
{
for (int i = 0; i < n; i++) {
A[i] = i;
Rank[i] = 0;
}
}
int findSet(int x)
{
if (x != A[x]) {
x = findSet(A[x]);
}
return x;
}
void link(int x, int y)
{
if (Rank[x] > Rank[y]) {
A[y] = ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
#define PB push_back
... | 0 | 60,239,605 |
# include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string a, b;
cin >> a >> b;
if(a.size() < b.size()){
cout << "LESS" << endl;
} else if(a.size() > b.size()){
cout << "GREATER" << endl;
} else {
int i;
for(i = 0; i < a.size(); i++){
... | 0 | 97,379,247 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define vl vector
#define pb push_back
#define ff first
#define ss second
using namespace std;
int main()
{
ll n,m,i,a=0,b=0,k,t,j;
cin>>n;
if(n%2) cout<<"0";
else
{
a=5*2;
ll ans=0;
while(a<=n)
{
... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int count = 0;
TRAVEL:
for (int i = 0; i < (int)s.size() - 1; i++)
{
if (s[i] != s[i + 1])
{
s.erase(i, 2);
count += 2;
goto TRAVEL;
}
}
cout << count;
} | 0 | 29,166,281 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb(a) push_back(a)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vv = vector<vi>;
using P = pair<int,int>;
using vP = vector<P>;
const int INF = 1001001001;
int main(){
int n;
cin>>n;
vi a(n);
map<int,... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define FOR(i,l,r) for( li i = l-(l>r); i != r-(l>r); i += 1-2*(l>r) )
int main() {
li m,k; cin>>m>>k;
li u = (1ll<<m)-1;
if( k > u || ( k == 1 && m <= 1 ) ) {
cout<<"-1\n";
return 0;
}
if( k == 0 ) {
FOR(... | 0 | 90,054,631 |
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | #include <bits/stdc++.h>
using namespace std;
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; }
const long long INF = 1e12;
int V, E;
vector< vector<long long> > graph(11... | 0 | 55,681,766 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
vector<int> A(3);
int result = 0;
ci... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(long long i=0; i<(int)n; i++)
#define rep2(i,a,n) for(long long i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using vll = vector<ll>;
using... | 0 | 80,795,292 |
#include <bits/stdc++.h>
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FILL0(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
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... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)x.size())
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> b... | 0 | 79,875,580 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
string ans = "None";
char c='a', cc;
int ff=0;
for (int i=0; i<26; i++) {
ff=0;
cc=(char)(c+i);
for (int j=0; j<S.size(); j++) {
if (S[j]==cc) {
ff=1;
break;
}
}
if (ff==0) {
... | #include <bits/stdc++.h>
namespace Suhaib_Templates {
using namespace std;
#define In_The_Name_Of_Allah_The_Merciful ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define Alhamdulillah return 0;
#define debug(n) cerr << "[" << #n << " = " << n << "]" << '\n'
#define all(v) v.begin()... | 0 | 98,146,318 |
#include<bits/stdc++.h>
namespace imzzy{
#define endl '\n'
#define ccf std::cout<<"f**k"<<endl
#define rgi int
#define ll long long
class fastin{private:int _ch,_f;
public:inline fastin&operator>>(char&c){c=getchar();return*this;}
template<typename _Tp>inline fastin&operator>>(_Tp&_x){
_x=0;while(!isdigit(_ch))... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
vector<pair<long long, long long>>A(M);
vector<long long>Tree(N, 0);
for (long long i = 0; i < M; i++) {
cin >> A.at(i).first >> A.at(i).second;
Tree.at(A.at(i).first - 1) += 1;
Tree.at(A.at(i).second - 1) += -1;
}
if... | 0 | 9,029,980 |
#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <iostream>
#include <cstdio>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#in... | #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
long x, y;
cin >> x >> y;
int ans = 0;
while (y >= x) {
y >>= 1;
ans++;
}
cout << ans << endl;
} | 0 | 11,643,681 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) cout<<(ans?"Yes":"No")<<endl
#define YN(ans) cout<<(ans?"YES":"NO")<<endl
#define umap unordered_map
#def... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <iostream>
#include <cmath>
#include <map>
#include <set>
#include <queue>
int main(void)
{
long long n;
scanf("%lld",&n);
long long sum = 0;
long long tmp = 0;
for (long long i=1;i<=n;i++)
{
tmp+=i;
... | 0 | 48,594,114 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int mai... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 0 | 94,713,190 |
#include <iostream>
using namespace std;
typedef long long ll;
int main(void)
{
int N, A[200005];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll ans = 0;
for (int i = 0; i < N; i++) {
ll d = 0;
if (i > 0) {
if (A[i - 1] >= A[i]) {
d ... | #include <stdio.h>
#include <algorithm>
void trace(int a[], int size) {
for (int i = 0; i < size; ++i) {
if (i > 0) {
printf(" ");
}
printf("%d", a[i]);
}
printf("\n");
}
void SelectionSort(int A[], int N) {
int count = 0;
for (int i = 0; i < N; ++i) {
in... | 0 | 29,394,624 |
#include <iostream>
#include <string>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
for (int i = 0; i < 3; ++i) {
if (s[i] == '1') cout << '9';
else cout << '1';
}
cout << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1003;
int n, m, t, s;
int a[N][N];
void rec(int x, int y)
{
if (x == n)
{
for (int i = 0; i < n; ++i)
{
int q[2] = {};
for (int j = 0; j < m; ++j)
{
q[a[i][j]]++;
}
... | 0 | 86,347,678 |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define mod 1000000007
#define pb push_back
#define csl ios_base::sync_with_stdio(false); cin.tie(NULL)
#define reps(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) for(int i=0;i<int(b);i++)
#define first ff
#define second ss
typedef long long ll;
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cstdio>
#include<numeric>
using namespace std;
using ll = long long;
int main(){
int n, m;
cin >> n >> m;
vector<ll> x(n), y(n), z(n);
... | 0 | 87,485,262 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long N;
long sum=0;
long max=0;
cin>>N;
vector <int>a(N);
for(int i=0;i<N;i++){
cin>>a.at(i);
}
for(int i=0;i<N;i++){
if(a.at(i)>max){
max=a.at(i);
}
else{
sum+=max-a.at(i);
}
}
cout<<sum<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<long long , long long>
#define pb push_back
#define ll long long
#define ld long double
#define precision(x,d) cout<<fixed<<setprecision(d)<<x
#define fill(a,b) memset((a),(b),sizeof((a)))
#define... | 0 | 42,887,758 |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s; cin>>s;
int x, y; cin>>x>>y;
vector<int> a;
for(int i=0; i<s.size(); ) {
int c=0;
for(; i<s.size() && s[i]=='F'; ++i) ++c;
a.push_back(c);
if (!c) ++i;
}
if (a[0]>0) { x-=a[0]; a.erase(a.begin())... | 0 | 45,493,274 |
#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... | #include<bits/stdc++.h>
using namespace std;
#define mx 105
#define ll long long
int ar[mx][mx];
char ch[mx][mx];
int n,m,k,ii;
void solve()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)scanf("%s",ch[i]+1);
if(ch[1][1]=='#')ar[1][1]=1;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
... | 0 | 90,511,426 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int r,d,f;
cin >> r >> d >> f;
long long p = r * f - d;
cout << p << endl;
for(int i = 1; i < 10; i++){
p = r * p - d;
cout << p << endl;
}
} | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define debug(x) cerr<<#x<<" "<<x<<endl
#define cina(a,n) for(ll i = 0;i<n;i++) cin>>a[i];
#define couta(a,n) for(ll i = 0;i<n;i++) cout<<a[i]<<" ";
#define fauto(ar)... | 0 | 57,843,495 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.