code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
main() {
string s;
cin>>s;
int sum=0;
for (char c:s) {
sum=(sum+(int)(c-'0'))%9;
}
if (sum==0) {
cout<<"Yes\n";
} else {
cout<<"No\n";
}
} | #include <iostream>
#include <math.h>
#include <vector>
using namespace std;
float distance(vector<int> a, vector<int> b, int d) {
float res = 0.0;
for (size_t i=0; i<d; i++) {
res += (a[i] - b[i]) * (a[i] - b[i]);
}
return sqrt(res);
}
int main() {
int n, d;
cin >> n >> d;
vector<ve... | 0 | 79,191,501 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <iostream>
#include <vector>
using namespace std;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
int main() {
int N;
while(cin >> N && N) {
vector<int> in(N), v(N);
rep(i, N) cin >> in[i];
int ans = -1<<29;
rep(i, N) {
if(i-1 >= 0 && v[i-1] >= 0) {
v[i] += ... | 0 | 78,540,589 |
#include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) ((a) / gcd(a,b)) * (b)
#define all(x) x.begin(),x.end()
#define ll long long
#define ull unsigned long long
#define VI vector<int>
#define VLL vector<ll>
#define VS vector<string>
#define MPII map<int, int>
#define SET set<int>
#... | #include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
static const ll MOD = 998244353;
int main... | 0 | 47,316,941 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int inf = 1e9;
const ll linf = 1e18;
template<typename T = int>
class WeightedUnionFind
{
public:
WeightedUnionFind(int n = 0, T unity = 0) : m_data(n, -1), m_weight(n, unity), m_count(n) {}
int find(int x)
{
if (m_data[x] < 0... | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
int gcd(int a, int b) {
if(a % b == 0) return b;
else return(gcd(b, a % b));
}
int main()
{
int a, b... | 0 | 39,001,178 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector< vector<ll> > vvint;
typedef vector< vector< vector<ll> > > vvvint;
typedef vector<string> vstring;
typedef vector< vector<string> > vvstring;
typedef vec... | #include <bits/stdc++.h>
#include<chrono>
#define ll long long
#define db double
#define deb(x) cout<<#x<<": "<<x<<"\n"
#define all(x) x.begin(),x.end()
#define fo(i, n) for(i=0 ; i<n ; i++)
#define Fo(i, k, n) for(i=k ; i<n ; i++)
using namespace std;
using namespace chrono;
const ll MOD = 1000000007;
const ll N = 300... | 0 | 48,439,016 |
#include <iostream>
using namespace std;
int main()
{
int n, k;
long long ans;
cin >> n >> k;
ans = n / k;
ans = ans * ans * ans;
long long t;
if (k % 2 == 0)t = (n + k / 2) / k, t = t * t * t;
cout << ans + t;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(void){
string line;
int count[26];
for (int i = 0; i < 26; i++) {
count[i] = 0;
}
for (; getline(cin, line); ) {
for (int i = 0; i < line.length(); i++) {
if (isupper(line[i])) {
count[lin... | 0 | 95,643,484 |
#include <iostream>
using namespace std;
void _swap(int *x, int *y) {
int tmp;
tmp = *x;
*x = *y;
*y = tmp;
return;
}
int main(int argc, char const *argv[]) {
int x, y;
while (true) {
cin >> x >> y;
if (x == 0 && y == 0) {
break;
}
else if (x > y) {
_swap(&x, &y);
}
cout << x << " " << y << end... | #include<iostream>
#include<vector>
using namespace std;
void print_f(vector< vector<int> > v,int h){
for(int i=0;i<h;i++){
cout << "node " << v[i][0] << ": key = " << v[i][1] << ", ";
if(v[i][2]!=0)cout << "parent key = " << v[v[i][2]-1][1] << ", ";
if(v[i][3]<=h) cout << "left key = " << v[v[i][3]-1][1]... | 0 | 56,493,186 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
long long ai,t,n,a,A,sum=0,b,B,c=0,k,e,f,g;
cin >> a >> b;
for(long long i=0;i<b;i++)
{
cin >> n;
sum+=n;
}
if(sum == a)
cout << "0";
else if(sum > a)
cout << "-1";
else
{
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
i... | 0 | 19,583,464 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long int;
int main() {
int N, K, R, S, P;
string T, U;
cin >> N >> K >> R >> S >> P >> T;
ll score = 0;
for (int i = 0; i < N; i++) {
if (i - K >= 0 && T[i - K] == T[i]) {
if (T[i] == '... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a; cin >> a;
if(a>=2000){
cout << 1 << endl;
exit(0);
}
else{
for(int x=0; x<20; x++){
for(int y=0; y<20; y++){
for(int z=0; z<20; z++){
for(int t=0; t<20; t++){
for(int u=0; u<20; u++){
... | 0 | 40,333,342 |
#include<bits/stdc++.h>
using namespace std;
int main(){
map<string, int> mp;
string word_before = "";
int n;
cin >> n;
for(int i = 0; i < n; i++){
string s;
cin >> s;
mp[s]++;
if(i == 0){
word_before = s;
reverse(word_before.begin(), word_before.end());
continue;
}
i... | #include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define For(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
void solve(int N) {
int M;
map<char, char> v;
REP(i, N) {
char a, b;
... | 0 | 44,286,889 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, K;
string S;
cin >> N >> K;
cin >> S;
vector<int> one;
vector<int> zero;
bool counting_one = true;
int cnt = 0;
for (int i=0; i<N; i++) {
if (counting_one) {
if (S[i] == '1') {
cnt++;
} else {
one.push_back(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 100000000... | 0 | 99,120,497 |
#include<bits/stdc++.h>
using namespace std;
int items[7] = {0, 100, 101, 102, 103, 104, 105};
int main() {
int x;
cin >> x;
int first = x / 100;
int diff = 5 * first;
int hundred = first * 100;
if (x >= hundred && x <= hundred + diff) cout << 1 << '\n';
else cout << 0 << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
vector<ll>Sieve(long long n){
vector<ll>table(n+1,1);
for(long long i = 2;i <= n;i++){
if(table[i] == 1){
for(ll j = i;j <= n;j += i){
ll k = j,cnt = 1;
... | 0 | 54,466,303 |
#include<cstdio>
int main(){
int r;scanf("%d",&r);
printf("%s",(r<1200?"ABC":r<2800?"ARC":"AGC"));
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define RFOR(i, s, n) for (int i = (n) - 1; i >= (s); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(a) a.begin(), a.end()
const long long MOD = 1e9 + 7, INF = 1e18;... | 0 | 2,491,576 |
#include <iostream>
#include <string>
using namespace std;
int main(int argc, char const *argv[])
{
string S;
cin >> S;
string k = "keyence";
string str1, str2;
int find1, find2, find3;
for (int i = 1; i <= 6; i++)
{
str1 = k.substr(0, i);
str2 = k.substr(i, 7 - i);
f... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
priority_queue<ll>xa;
priority_queue<ll>yb;
priority_queue<ll>cc;
ll x, y, a, b, c;
cin>>x>>y>>a>>b>>c;
ll val;
for(int i=0;i<a;i++)
{
cin>>val;
xa.push(val);
}
for(int i=0;i<b;i++... | 0 | 27,502,028 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
int Ans=0;
int h;
for(int i=0;i<N;i++){
cin >> h;
if(h >= K) Ans++;
}
cout << Ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 2000000000
typedef long long ll;
bool compare(pair<int, int> a, pair<int, int> b) {
if(a... | 0 | 94,278,398 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll inf =1e9+7;
#define pi 3.14159265358979323846L
bool isprime(ll a)
{
ll cnt=0;
for(ll i=1;i*i<a;i++)
{
if(a%i==0)
{
cnt+=2;
}
}
if(cnt==2)
return true;
else
return false;
}
ll mod(ll a)
{
if(a<inf)return a;
else
retu... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, a[200000];
cin >> N;
for(int i = 0; i < N; i++)
{
cin >> a[i];
}
int block = 0;
int number = 1;
for(int i = 0; i < N; i++)
{
if(a[i] == number)
{
number++;
}
else
{
block++;
}
}
if (number == ... | 0 | 85,891,477 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
using in = int64_t;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
const double PI=3.14159265358979323846;
const in MOD = 1000000007;
const in INF=1<<30;
usi... | 0 | 14,729,161 |
#include<cstdio>
#include<iostream>
#include<string>
using namespace std;
int main(void) {
bool br = false;
char tmp;
int h, w;
string s;
cin >> h >> w;
for (int k = 0; k < h; k++) {
if (br == true)break;
for (int l = 0; l < w; l++) {
cin >> s;
tmp = l+65;
if (s == "snuke") {
cout << tmp << k + 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<pair<ll, ll>> sushi(n);
rep(i, n) cin >> sushi[i].second >> sushi[i].first;
sort(sushi.begin(), sushi.end());
vector<bool> type_set(n +... | 0 | 66,775,149 |
#include <iostream>
#include <map>
#include <algorithm>
#include <string>
#include <vector>
#include <numeric>
#include <cmath>
#include <queue>
#include <iomanip>
#include <functional>
#define CHMAX(a,b) a = std::max(a,b)
#define CHMIN(a,b) a = std::min(a,b)
#define MAXMIN(a,b,c) std::max(a,min(b,c))
#define CHABS(a)... | #include <bits/stdc++.h>
#include <vector>
#include <numeric>
#define PI 3.14159265358979323846
#define MAXINF 1e18L
#define INF 1e9L
#define EPS 1e-9
#define REP(i, n) for(int i=0;i<int(n);++i)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define ALL(v) v.begin(),v.end()
... | 0 | 99,793,441 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <algorithm>
#include <fstream>
#include <set>
#define mp make_pair
#define Debug(...) fprintf(stdout, __VA_ARGS__)
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, int> pli;
typedef set<pli>::reve... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 0 | 93,333,885 |
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const double PI = atan(1.0) * 4;
const int di[4] = { -1, 0, 1, 0} ;
const int dj[4] = {0, -1, 0, 1} ;
const ll INF = (ll)2e18 + 50;
const int maximum = numeric_limits<int>::min();
const int minimum = numeric_limits<int>::max... | #include <bits/stdc++.h>
#define fto(i,a,b) for(int i=a; i<=b; ++i)
#define fdto(i,a,b) for(int i=a; i>=b; --i)
#define pb push_back
#define ll long long
#define pii pair<int,int>
#define st first
#define nd second
#define maxn 200005
#define Ntu ""
using namespace std;
const int base = 1e9+7;
int n;
char s[maxn];
ll d... | 0 | 80,455,742 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long deadline,konyu,eat;
cin >> deadline >> konyu >> eat;
if(konyu - eat >= 0){
cout << "delicious";
}else if(deadline - (eat - konyu) >= 0){
cout << "safe";
}else{
cout << "dangerous";
}
} | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;
long long MOD = 1000000007;
int main() {
int Q;
cin ... | 0 | 82,177,305 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pii=pair<int,int>;
#define For(i,a,b) for(int i=a;i<=b;i++)
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
#define MOD (ll)(1e9+7)
#define INF (9e18)
#define EPS (1e-6)
#define debug(...) do{\
cerr<... | #include<bits/stdc++.h>
#define ll long long int
#define vl vector<ll>
#define pl pair<ll,ll>
#define pb push_back
#define F first
#define S second
using namespace std;
int main()
{
ll n,i,j,k;
cin >> n;
vl v(n+1,0);
for(i=0;i<n;i++)
cin >> v[i];
ll mn=10000000000;
for(i=1;i<=100;i++)
{ll s=0;
... | 0 | 12,049,977 |
#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()
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; }
tem... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
ll gcd(ll x, ll y) { return (x % y)? gcd(y, x % y): y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
using Graph = vector<vector<ll>>;
int inf=100000000;
const double PI = 3.1415926535897... | 0 | 67,010,137 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(ll i=(n);i<(k);i++)
void Main(){
int S;cin>>S;
cout<<(S<1200?"ABC":"ARC")<<endl;
}
int main(){
Main();
return 0;
} | #include <bits/stdc++.h>
#define inf 1000000005
#define mod 1000000007
#define eps 1e-10
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define each(a,b) for(auto& (a): (b))... | 0 | 19,370,604 |
#include <bits/stdc++.h>
using namespace std;
int64_t M = 1e9 + 7;
int main()
{int N; cin >> N;
vector<int64_t> A(N); for (auto &a : A) cin >> a;
auto ans = 0LL, p = 1LL;
for (int k = 0; k < 60; ++k)
{auto z = 0LL; for (auto a : A) if (!(a >> k & 1)) ++z;
ans = (ans + z * (N - z) % M * p % M) % M;
p... | #include <bits/stdc++.h>
#include <math.h>
#include <stdlib.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T &a, T b) { if(a > b){ a = b; return true; } return false; }
template<class T> inline bool chmax(T &a, T b) { if(a < b){ a = b; re... | 0 | 91,658,857 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) for (int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define deg2rad(de... | 0 | 88,133,755 |
#include<bits/stdc++.h>
using namespace std;
string s;
int a[101000],p[101000],n;
int main(){
cin>>n>>s;
for(int i=0;s[i];i++)
{
if(s[i]=='o')
{
p[i+1]=0;
}
else
{
p[i+1]=1;
}
}
p[n+1]=p[1];
for(int i=0;i<8;i++)
{
a[0]=i&1,a[1]=(i>>1)&1,a[2]=(i>>2)&1;
for(int j=2;j<=n+1;j++)
{
a[j+1]=p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,K;
ll x[55];
ll y[55];
int main(){
cin >> n >> K;
vector<ll> dx;
vector<ll> dy;
for(ll i=0;i<n;i++){
cin >> x[i] >> y[i];
dx.push_back(x[i]);
dy.push_back(y[i]);
}
sort(dx.begin(),dx.end());
sort... | 0 | 99,896,371 |
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include<algorithm>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, ... | #include <bits/stdc++.h>
#include <cstdio>
#include <cmath>
#include <set>
#define S scanf
#define P printf
#define D double
#define ll long long
#define ull unsigned long long
#define S1(a) scanf("%d",&a)
#define S2(a,b) scanf("%d%d",&a,&b)
#define S3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define SL1(a) scan... | 0 | 25,214,175 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
int x = A + B - C - D;
if (x > 0)cout << "Left" << endl;
else if (x < 0)cout << "Right" << endl;
else cout << "Balanced" << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
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; }
int m... | 0 | 40,448,240 |
#include<iostream>
#include<cmath>
#include<limits.h>
using namespace std;
long long int getmaxdigit(long long int a,long long int b){
long long int count1=0,count2=0;
while(a!=0){
a/=10;
count1++;
}
while(b!=0){
b/=10;
count2++;
}
return max(count2,count1);
}
int... | #include<bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long power(long long x, long long y)
{
long long ret = 1;
while(y > 0)
{
if (y & 1)
{
ret = (ret * x) % mod;
}
x = (x * x) % mod;
y >>= 1;
}
return ret;
}
long long combi... | 0 | 22,988,858 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
const int64_t MAXN = 100010;
int64_t dp[MAXN][2];
int main()
{
string L;
cin >> L;
dp[0][0] = 1;
int64_t n = L.size();
for (int i = 0; i < n; i++)
{
if (L[i] == '0')
{
dp[i + 1][0] = dp[i][0];
dp[i + 1][1] = ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<(n);i++)
#define rep2(i,a,n) for(int i=a;i<n;i++)
#define been(ix) (ix).begin(),(ix).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
const ll INFL = 1e18;
const int INF = 1001001001;
typedef pair<int,int> ... | 0 | 71,983,405 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int x = 111;
while (1){
if(x >= n) {cout << x << endl; break;}
x += 111;
}
} | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
string s;cin >>s;
ll k;cin >>k;
ll n=s.size();
ll now=0;
for (int i = ... | 0 | 70,899,550 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define in insert
#define F first
#define S second
#define mod 1000000007
#define endl '\n'
#define all(x) x.begin(),x.end()
#define w(x) int x;cin>>x; while(x-->0)
#define memset(a,b) memset(a,b,sizeof(a))
#define debug(x) cout <... | #include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<map>
#include<math.h>
#include<string>
#include <cctype>
#include <cstdlib>
#include<bitset>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#defin... | 0 | 5,047,667 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
ll calc(ll n) {
if(n <= 0) return 0;
if(n % 4 == 0) {
return n;
}else if(n % 4 == 1) {
return 1;
}else if(n % 4 == 2) {
return 1 ^ n;
}else {
return 0;
... | #include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,h,nh=0,ans1=0,ans=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>h;
if(nh>=h){
ans1++;
nh=h;
}
else{
ans... | 0 | 3,466,951 |
#include <stdio.h>
int main(){
int A;
int F;
scanf("%d%d", &A, &F);
F = (F + 3 * A)/2;
printf("%d", F);
return 0;
} | #include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | 0 | 13,446,431 |
#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 mn[26],c[60][26];
int main(){
int n;
cin>>n;
rep(i,n){
string s;
cin>>s;
rep(j,s.size()){
c[i][s[j]-'a']++;
}
}
stri... | #include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define mod 1000000007
#define qmod 998244353
#define M 10000001
#define endl "\n"
#define all(a) (a).begin(),(a).end()
#define rep(i,a,b) for(int i=a;i<b;++i)
#de... | 0 | 19,227,743 |
#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... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" <... | 0 | 81,585,735 |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include... | #include <bits/stdc++.h>
typedef long long ll;
const ll mod = 1e9+7;
#define fo(i, n) for (int i = 0; i < n; i++)
#define sc(n) scanf("%d", &n)
using namespace std;
int n, k;
void solve() {
cin >> n >> k;
int additional = ((n-1)*(n-2))/2-k;
if (additional < 0) {
cout << -1;
return;
}
... | 0 | 21,461,061 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define pie 3.14159265358979323846264338... | #include<iostream>
#include<vector>
#include<string>
using namespace std;
class Dictionary{
const int MAX = 1000003;
vector<int> D;
int get_key(char c) {
if (c == 'A') return 1;
if (c == 'C') return 2;
if (c == 'G') return 3;
return 4;
}
int keta(int N) {
int ... | 0 | 37,631,714 |
#include <stdio.h>
using namespace std;
typedef long long llong;
#define MAX 10001
const llong mod = 1000000000 + 7;
int main()
{
int N, M;
int A;
scanf("%d%d", &N, &M);
for (int i = 0; i < M; i++)
{
scanf("%d", &A);
N -= A;
}
if (N >= 0)
printf("%d\n", N);
if (N < 0)
printf("-1");
ret... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;
#define REP(i,m,n) for(LL i=(m);i<(n);i++)
int main()... | 0 | 64,418,556 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int p,q,r,k;
cin>>p>>q>>r>>k;
if(k<=p)
cout<<k<<endl;
else if(k<=(p+q))
cout<<p<<endl;
else
cout<<p-(k-p-q)<<endl;
return 0;
} | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
int n, k;
vector<int> h;
int dp[31... | 0 | 61,254,458 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using pii = pair<int, int>;
int main(){
int n,m; cin>>n>>m;
vector<pii> a(n),c(m);
rep(i,n)cin>>a.at(i).first>>a.at(i).second;
rep(i,m)cin>>c.at(i).first>>c.at(i).second;
int x,y;
rep(i,n){
rep(j,m){
... | 0 | 34,578,651 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000;
int main(){
int n;
ci... | #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 | 23,405,077 |
# include <bits/stdc++.h>
# define long long long
# define all(vc) vc.begin(),vc.end()
# define allr(vc) vc.rbegin(),vc.rend()
# define pb push_back
# define fi first
# define se second
# define pi pair <long, long>
# define lcm(a, b) (a *... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <bitset>
#include <unordered_map>
#include <cmath>
#include <functional>
#include <map>
#include <cstdlib>
#include <stack>
#include <cassert>
using namespace std;
using ll = long lon... | 0 | 98,809,761 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> h(n);
int full=0;
for(int i=0; i<n; i++){
cin >> h.at(i);
full += h.at(i);
}
int count=0;
int total=0;
while(total<full){
int l,r;
l=0;r=n;
... | 0 | 96,207,225 |
#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(){
ll n;
cin >> n;
vector<pair<ll, int>> vec;
for (ll i=2; i*i<=n; i++){
int x = 0;
while (n % i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;... | 0 | 50,189,162 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <set>
using namespace std;
typedef long long int ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define Yes cout << "Yes"... | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | 0 | 85,992,911 |
#include<bits/stdc++.h>
using namespace std;
int main () {
int n; cin >> n;
int a[100000];
bool b[100000] = {false};
for (int i=0; i<n; i++) {
cin >> a[i];
}
int x=0;
int c=0;
while (a[x]!=2 && b[x]==false) {
b[x] = true;
x=a[x]-1;
c++;
}
if (b[x]==true) cout << -1; else cout << c+1;
return 0;
} | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl "\n"
#define pb push_back
#define PI 3.1415926535897932384626433832795l
#define F first
#define S second
#define mp make_p... | 0 | 15,030,388 |
#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 ... | #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 | 40,407,740 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define VL vector<lol>
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
typedef long long ll;
int mod = 1000000007;
int pow(int a, int b){
long long c=1;
rep(i,b){
c*=a;
c=c%mod;
}
return c;
}
int main() {
int N,K;
cin>>N>>K;
ll ans = 0;
vector<ll> kazu(K+1... | 0 | 58,921,676 |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
#include <set>
#include <queue>
#include <utility>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n, m, x, y;
cin >> n >> m >> x >> y;
vector<int>X(n+1);
vector<int>Y(m+1);
for(int i=0; i<n; i++){
cin >> X[i];
}
X[n]=x;
for(int i=0; i<m; i++){
cin >> Y[i];
}
Y[m]=y;... | 0 | 15,245,135 |
#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... | #include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
using namespace std;
#define INF 100000000
typedef... | 0 | 58,634,784 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse... | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(... | 0 | 50,276,980 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
string t;
for(int i=0;i<s.length();i+=2)
{
t.push_back(s[i]);
}
cout<<t;
} | #include <atcoder/dsu>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N, Q;
cin >> N >> Q;
atcoder::dsu d(N);
for (int z = 0; z < Q; z++) {
int t, u, v;
cin >> t >> u >> v;
if (t == 0) {
d.merge(u, v);
}else {
c... | 0 | 95,872,729 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for(ll i=(a); i<(b)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
signed main() {
int n, m, k;
... | 0 | 78,152,773 |
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <set>
#include <stdio.h>
#include <math.h>
using namespace std;
typedef long long int lli;
const long long int MaxN=200005;
const lli mod=1e9+7;
#define fst first
#define snd second
#define mp make_pair
const float pi=3.14159265358979323... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000007
int main() {
int n;cin >> n;
vector<int> t(n+1),x(n+1),y(n+1);
t[0]=0;
x[0]=0;
y[0]=0;
for(int i = 0; i < n; i++) {
int p,q,r;cin >> p >> q >> r;
t[i+1]=p;
... | 0 | 14,522,561 |
#pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = '\n'... | #include<bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> P;
#define REP(i, x, n) for(lint i = x ; i < n ; i++)
#define rep(i, n) REP(i, 0, n)
#define repr(i, n) for(lint i = n - 1 ; i >= 0 ; i--)
#define SORT(c) sort((c).begin(), (c).end())
const int IINF = 1e9 + 10;
const lint LLINF ... | 0 | 90,624,601 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S; cin >> S;
long long result=0;
long long l=0, r=0;
for(int i=0; i<S.size(); i++){
(S[i]=='>'?l:r)++;
if(i==S.size()-1){
if(S[i]=='<'){
result+=(r*(r+1)/2);
}else{
result+=(l*(l+1)/2);
result-=min(l,r);... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in, n) for(int i=0; i<n; i++) cin>>in[i]
#define forout(out) for(int i=0; i<(int)out.size(); i++) cout<<out[i]<<" "
#define rep(i, n) for(int i=0; i<(n); i++)
int main(){
int n, m; cin>> n >> m;
ll ac=0, wa=0;
vector<ll> isac(n... | 0 | 44,802,904 |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define ll l... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = long long ;
using P = pair<ll,ll>;
ll INF = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;... | 0 | 26,662,361 |
#include<bits/stdc++.h>
#define int long long
#define REP(i,a,n) for(int i=a;i<(n);i++)
#define REP_sz(i,s) for(int i=0;i<s.size();i++)
#define RE return
#define FILL(a,b) memset(a,b,sizeof(a))
#define SO(a) sort(all(a))
#define pb push_back
#define sz(a) a.size()
#define V vector
#define ld long double
#define viit(a)... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;cin>>N;
long long sum=0;
vector<long long>A(N);
for(int i=0;i<N;i++){
cin>>A.at(i);
A.at(i)=A.at(i)-(i+1);
}
sort(A.begin(),A.end());
long long b=0;
if(N%2==1){
if(N==1){
b=A.at(0);
}
else{
b=A.at(N/2);
}
... | 0 | 74,917,578 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define M_PI 3.14159265358979323846
void solve(){
ll n;
cin>>n;
if(n%2)
cout<<0;
else{
long long total=0;
lo... | #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,ll>P;
const int MOD=1000000007;
const int INF=0x3f3f3f3f;
const ll INFL=0x3f3f3f3f3f3f3f3f;
#include <atcoder/dsu>
using namespace atcoder;
int main(){
int n,q;cin>>n>>q;
dsu uf(n);
rep(i,q){
... | 0 | 80,638,359 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cstdio>
#include<cmath>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end()
#define debug(output) cout<<#output<<"= "<<output<<endl
using lint... | #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;ind... | 0 | 80,691,733 |
#include<bits/stdc++.h>
using namespace std;
int n,v;
int main(){
scanf("%d%d",&n,&v);
for (int i=0;i<=n;i++)
for (int j=0;j+i<=n;j++)
if (i*10000+j*5000+(n-i-j)*1000==v)
return printf("%d %d %d",i,j,n-i-j),0;
puts("-1 -1 -1");
} | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
const int MAX_K = 1e3;
int main(){
int N; scanf("%d", &N);
if( N == 1){
printf("%s\n", "Yes");
printf("%d\n", 2);
printf("%d %d\n", 1, 1);
printf("%d %d\n", 1, 1); return 0;
}
int k = 0;
for(i... | 0 | 39,903,812 |
#include <bits/stdc++.h>
typedef long long ll;
const int maxn = int(1e5) + 7, mod = int(1e9) + 7;
ll power_mod(ll p, ll q) {
ll ret = 1;
while (q) {
if (q & 1) ret = ret * p % mod;
p = p * p % mod;
q >>= 1;
}
return ret;
}
struct Combination {
ll fac[maxn], inv[maxn];
Com... | #include <bits/stdc++.h>
using namespace std;
#define popcnt(a) __builtin_popcount(a)
#define FastIO() ios::sync_with_stdio(false), cin.tie(0);
#define IO() freopen("palindrome.in","rw",stdin)
#define error(args...) \
{ \
cerr<<"LINE "<<__LINE__; ... | 0 | 44,401,798 |
#include<bits/stdc++.h>
using namespace std;
long long int dp[200005];
long long int n,k;
vector< int > arr(200005);
long long int mini=1e5;
int gen(long long int i)
{
if(i>=n-1)
return 0;
if(dp[i]!=-1)
return dp[i];
int ans=INT_MAX;
for(int j=1;j<=k;j++)
... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
const long long INF = 1e18;
const int num[10] = {
1000000000, 2, 5, 5, 4, 5, 6, 3, 7, 6
};
int main(){
int N, M;
cin >> N >> M;
int A[M];
for (int i = 0; i < M; i++){
cin >> A[i];
}
sort(A, A + M, greater<int>());
long long dp[N +... | 0 | 100,784,805 |
#include <iostream>
using namespace std;
int main() {
bool check_prime[1000000] = {false};
int n;
for (int i=2; i < 1000; i++) {
if (!check_prime[i]) {
for (int j = i*i; j < 1000000; j+=i) {
check_prime[j] = true;
}
}
}
while (cin >> n) {
int answer = 0;
for (int i = 2; i <... | #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
int n,m,i,j,k,xmax;
while(1){
xmax=0;
cin >> n >> m;
if(n == 0 && m == 0)break;
int MP[m+1][n+1];
for(i=0;i<=m;i++){
for(j=0;j<=n;j++){
MP[i][j]=0;
}
}
MP[1][1]=1;
cin >> k;
in... | 0 | 21,795,599 |
#include <bits/stdc++.h>
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll; typedef vector<int> VI; typedef pair<int,int> pii;... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
ll rep_pow(ll a, ll b){
if(b==0) return 1;
else if(b%2==0){
ll memo = rep_pow(a, b/2... | 0 | 16,676,641 |
#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;
cin>>n;
vector<pair<string,int>>p(n);
rep(i,n){
string s; int t;
cin>>s>>t;
p[i]=make_pair(s,t);
}
string ss; cin>>ss;
int x;
rep(i,n){
... | #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
cer... | 0 | 99,787,608 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define ii pair<int,int>
#define Max 100000+5
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define f first
#define s second
#define pb push_back
int mo... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n,m;
cin>>n>>m;
vector<P> p(m);
rep(i,m) ... | 0 | 41,580,396 |
#include <cstdio>
using namespace std;
int main() {
int n;
long long a = 1;
scanf("%d", &n);
for (int i = 2; i <= n; ++i) {
a *= i;
}
printf("%lld\n", a);
} | #include <iostream>
#include <cstdio>
#define PI 3.14159267
using namespace std;
int main() {
int x,h,max,num=1;
cin>>x;
cin>>h;
max=h;
for(int i=1;i<x;++i)
{
cin>>h;
if(h>=max)
{
++num;
max=h;
}
}
cout<<num<<endl;
} | 0 | 45,837,672 |
#include <stdio.h>
#include <math.h>
#define pi 3.14159265358979
int main(void) {
double a, b, c, d, s;
scanf("%lf%lf%lf", &a, &b, &c);
c = c / 180 * pi;
d = sqrt(a * a + b * b - 2 * a * b * cos(c));
s = a * b / 2 * sin(c);
printf("%f\n%f\n%f\n", s, a + b + d, s * 2 / a);
return 0;
} | #include<iostream>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<cmath>
#include<bitset>
#include<cassert>
#include<algorithm>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<iomanip>
#include<fstream>... | 0 | 67,467,282 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int N;
cin >> N;
vector<long long int> A(N), B(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
for (int i = 0; i < N; i++) cin >> B.at(i);
long long int SA = 0, SB = 0;
for (int i = 0; i < N; i++) {
SA += A.at(i);
SB += B.at(i);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL<<60;
ll solve() {
ll N, a, b;
cin >> N;
ll sum = 0, mn = INF;
for ( int i = 0; i < N; i++ ) {
cin >> a >> b;
sum += a;
if ( a > b ) {
mn = min(mn, b);
}
}
ll ans = s... | 0 | 7,361,281 |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define rep1(i,a,b) for(int i=a;i<=(b);++i)
#define per(i,a,b) for(int i=a;i>(b);--i)
#define per1(i,a,b) for(int i=a;i>=(b);--i)
#define LL long long
#define inf 0x7f7f7f7f
#define N 35
using namespace std;
struct Node
{
int key;
Node *prev,*next;
};
... | 0 | 406,937 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <t... | #include <bits/stdc++.h>
#define int long long
#define rng(i, l, r) for (size_t i = (l); i < (r); ++i)
#define rep(i, n) rng(i, 0, n)
#define gnr(i, l, r) for (size_t i = (r)-1; i >= (l); i--)
#define per(i, b) gnr(i, 0, b)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
... | 0 | 85,390,434 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<VVLL> VVVLL;
typedef pair<LL, LL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for (ll i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)
void solve()
{
int n;cin>>n;
string s;int ab=0,a=0,b=0,ans=0;
REP(i,n){
cin>>s;
REP(i,s.size()-2){
if(s[i]=='A'&&s[i+1]=='B')ans++;
... | 0 | 89,392,342 |
#include <iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<utility>
#include<cstdio>
#define vii vector< pair<int,int> >
#define vi vector<int>
#define INF 1000000007
#define ff first
#define ss second
#define lli long long int
#define ulli unsigned long long ... | #include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
#include <iomanip>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(int i=(a); i<(b); i++)
#define YES cout << "YES" << endl;
#define NO cout << "NO" << en... | 0 | 36,699,720 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
using namespace std;
int main(){
int N; cin >> N;
vector<long long> a(N);
for(int i=0; i < N; ++i){
cin >> a[i];
}
map<long long, long long> delta_cnt;
vector<long long> delta_array(N);
for(int... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 82,893,093 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll h, w;
cin >> h >> w;
vector < string > s(h);
for(int i = 0; i < h; i++) cin >> s[i];
vector < vector < ll > > d(h, vector < ll > (w, 1e18));
queue < pair < ll, ... | #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=1001001001;
vector<pair<int64_t,int64... | 0 | 26,553,996 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
int n;
long T;
cin>>n>>T;
vector<long> t(n);
for(int i=0;i<n;i++) cin>>t[i];
long sum=0;
for(int i=0;i<=n-2;i++){
sum+=min(T,t[i+1]-t[i]);
}
sum+=T;
cou... | #ifdef LOCAL
#include "libs/debug/print_list.hpp"
#define D(x) (cout << # x ": " << x << endl)
#define dev(v, m, n) for(int i=0;i<n;++i){for(int j=0;j<m;++j){cout<<"|"<<v[j][i];}cout<<"|"<<endl;}
#else
#define D(x) ;
#define dev(v, m, n) ;
#endif
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>... | 0 | 94,861,872 |
#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 A, B, X;
cin >> A >> B >> X;
string ans = "NO";
if (A <= X && X <= A + B) ans ="YES";
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
#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(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typed... | 0 | 60,627,067 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intll int long long
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
char x ;
cin >> x ;
if((int)x < 95 ) cout << 'A' ;
else cout << 'a' ;
} | #include <bits/stdc++.h>
using namespace std;
struct Dice {
int s1, s2, s3, s4, s5, s6;
void turnN() {
int tmp = s1;
s1 = s2; s2 = s6; s6 = s5; s5 = tmp;
}
void turnS() {
int tmp = s1;
s1 = s5; s5 = s6; s6 = s2; s2 = tmp;
}
void turnW() {
int tmp = s1;
s1 = s3; s3 = s6; s6 = s4; s4 =... | 0 | 100,369,930 |
#include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
#include<stdio.h>
#include<locale.h>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
int main()
{
string s,t;
cin>>s; cin>>t;
int inx=0;
for(int i=0;i<s.size();i++)
{
int flg=1;
for(int j=0;j<t.size();j++... | #include <bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
bool f(const pair<UL, UL> &l, const pair<UL, UL> &r) {
return make_pair(~l.first, l.second) < make_pair(~r.first, r.second);
}
struct P... | 0 | 8,708,078 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <numeric>
#include <bitset>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(ll i = (a); i < (b); i++ )
#define REP(i, n) FOR(i,0,n)
typedef pair... | #include <stdio.h>
struct trump{
char moji;
int num;
};
void bubble(struct trump *,int);
void insertion(struct trump *,int);
int judge(struct trump *,struct trump *,int);
void bubble(struct trump k1[],int n){
int i,j;
struct trump tmp;
for(i=0;i<n;i++){
for(j=n-1;j>i;j--){
if(k1[j].num < k1[j-1].num... | 0 | 97,074,174 |
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<algorithm>
#include<map>
#include<set>
#include<cmath>
#include<iomanip>
#include<stack>
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define sz(a) (int)a.size()
using namespace std;
int main() {
char x,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
string S, T;
int main() {
cin >> S >> T;
vector<string> v;
for (int i = 0; i < S.size(); i++) {
bool jud... | 0 | 2,398,618 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#define fore(i,x,y) for(ll i=(x);i<(y);i++)
#define disp(a) cout << a << endl;
typedef long long ll;
using namespace std;
int main(... | #include <iostream>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = 0, i#... | 0 | 60,136,204 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ar array
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
signed main(void) {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef LOCAL
freopen("A.... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
#define INF 1e9
#define rep(... | 0 | 5,204,284 |
#include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
const double EPS = 1e-10;
int main(void)
{
int A, B, C;
cin >> A >> B >> C;
if (A == B)
{
cout << C << endl;
}
else... | #include<bits/stdc++.h>
#define ll long long
#define llu unsigned long long
#define mod 1000000007
#define pi ((2.0)*acos(0.0))
#define pb push_back
#define pf push_front
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x... | 0 | 5,267,271 |
#include <bits/stdc++.h>
using namespace std;
int sum1toN(const int n) { return n * (n + 1) / 2; }
int main() {
int N;
cin >> N;
cout << sum1toN(N) << endl;
getchar();
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N1,N2,N3,Ntot;
cin >> N1 >> N2 >> N3 >> Ntot;
int ans= 0;
for(int n1=0; n1<= Ntot/N1; n1++){
for(int n2=0; n2<= Ntot/N2; n2++){
int remain= Ntot- (N1*n1+ N2*n2);
if(remain < 0){ break; }
else{
if(remain % N3==0){ ans++; ... | 0 | 74,153,090 |
#include <iostream>
using namespace std ;
int main()
{
int n , b , f , r , v , a[5][4][11] , y , c = 1 , l , o , i , h , w ;
for ( i = 1 ; i < 5 ; i ++ ){
for ( h = 1 ; h < 4 ; h ++ ){
for ( w = 1 ; w < 11 ; w ++ ){
a[i][h][w] = 0 ;
}
}
}
cin >> n ;
while ( c <= n ){
cin >> b >> f >> r >> v ;
... | #include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
struct PriorityQueue
{
int heap[2000001];
int size = 0;
void maxHeapify(int i)
{
int left = i * 2;
int right = i * 2 + 1;
int largest;
if (left <= size && heap[left] > heap[i])
largest = left;
else
larges... | 0 | 1,082,732 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size())cout << a[i] << " ";cout << "\n"
#define vecvec(a) vector<vector<(... | #include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<cstring>
#include<queue>
#include<stack>
#include<numeric>
using namespace std;
#define INF (1 << 30) - 1
#define LINF 1LL << 60
const int MOD = 1000000007;
using ll = long long;
using P = pair<int, int>;
map<l... | 0 | 22,953,423 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
string s, t;
cin >> s >> t;
int cnt = 0;
vector<string> items;
rep(i, s.size()) {
... | #include<iostream>
#define int long long
using namespace std;
bool compare(int u){
char c;
cout<<"? "<<u<<endl;
cin>>c;
return c=='Y';
}
int nibutan(int l,int r){
while(r-l){
int m=(l+r)/2;
if(!compare(m*10))
l=m+1;
else
r=m;
}
return l;
}
signed main(){
bool f,g;
f=compare(9);
if(f){
if(!compa... | 0 | 85,501,964 |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=1e7+5;
int ans[maxn]={0};
int main(){
long long n;
scanf("%lld",&n);
long long cnt=0;
for(int i=1;i<n;i++){
if(ans[i]==0&&ans[n-i]==0&&i!=n-i){
ans[i]=ans[n-i]=1;
cnt++;
}
}
printf("%lld",cnt);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using P = pair<int, int>;
int main(){
int n,m,x;
cin >> n >> m >> x;
vector<int> c(n);
vector<vector<int>> a(n,vector<int>(m));
rep(i,n){
cin >> c[i];
rep(j,m) cin >> a[i... | 0 | 75,334,319 |
#include <iostream>
#include <map>
#include <algorithm>
#include <string>
#include <vector>
#include <numeric>
#include <cmath>
#include <queue>
#include <iomanip>
#include <functional>
#define CHMAX(a,b) a = std::max(a,b)
#define CHMIN(a,b) a = std::min(a,b)
#define MAXMIN(a,b,c) std::max(a,min(b,c))
#define CHABS(a)... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (... | 0 | 1,844,682 |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
freopen("out.o", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
if (n % 2 != 0) {
cout << "No";
}
else {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> map (h,vector<char>(w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
cin >> map.at(i).at(j);
}
}
vector<bool> line(h,false);
vector<bool> column(w,false);
for (int i = 0... | 0 | 41,026,177 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
vector<ll> A(N), B(N);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
ll ans = 0;
for (int i = N-1; i >= 0; i--) {
if ((A[i]+ans) % B[i]) {
ans += B[i] - ((A[i]+ans) % B[i]);
}
}
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll LongINF=1e13+7;
const int INF=1e9+7;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template... | 0 | 15,034,351 |
#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
#include<numeric>
#include<iostream>
#include<array>
#include<string>
#include<sstream>
#include<stack>
#include<queue>
#include<list>
#define _USE_MATH_DEFINES
#include<math.h>
#include<map>
#define SENTINEL 1000000001
#define min(a,b) (a)>(b)?(b)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
template<typename T>
void printv(const vector<T>& s) {
for(int i=0;i<(int)(s.size());++i) {
cout << s[i];
if(i == (int)(s.size())-1) co... | 0 | 3,643,369 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
using namespace std;
int main()
{
int d;
while(cin>>d)
{
int s=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 n;
cin >> n;
vector<int> p(n);
rep(i,n) {
cin >> p[i];
p[i]--;
}
vector<int> idx(n);
rep(i,n) idx[p[i]] = i;
set<int> bigidx;
ll res = 0;
for(int i = n-1; i >= 0; i--){
bigi... | 0 | 68,620,891 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=1; i<(n); ++i)
using namespace std;
int main(){
int a, b;
cin >> a >> b;
rep(i,10100){
int x=i*8/100, y=i*10/100;
if(a==x && b==y){
cout << i << endl;
return 0;
}
}
cout << -1 << endl;
return 0;
} | #include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <vector>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#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)
#d... | 0 | 60,337,481 |
#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[100... | #include <bits/stdc++.h>
using namespace std;
#pragma region
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {c... | 0 | 16,974,587 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.