code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
int a[5000], b[5000], c[5000];
int main(){
int n;
while(cin >> n && n){
for(int i = 0; i < n; i++){
cin >> a[i];
}
if(n == 1){
cout << a[0] << endl;
}else{
b[0] = a[0];
for(int i = 1; i < n; i++){
b[i] = b[i-1] + a[i];
}
c... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 0 | 45,966,003 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n;
cin >> n;
ll cnt = 0;
for(int i = 1; i <= n; i++) {
string s= to_string(i);
if(s.length() & 1 )
cnt++;
}
cout << cnt;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
solve();
return 0;
} | #include<stdio.h>
#include<iostream>
#include<string>
#include<memory>
#include<cmath>
#include<algorithm>
#include<vector>
double min_double(double a,double b){
if(a<b) return a;
else return b;
}
void swap(int *x,int *y){
int tmp;
tmp=*x;
*x=*y;
*y=tmp;
}
int gcd(int a,int b){
if(a<b) sw... | 0 | 47,125,006 |
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
int i=0, j, ar[11];
while( scanf("%d" , &j)!= EOF){
if(j!=0) ar[++i]=j;
else printf("%d\n",ar[i--]);
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
const long long MOD = 1000000007;
int N, K;
ll a[5001];
ll asum;
bool dp[5001];
bool isNoNeed(int x) {
if (asum < K) {
return true;
}
fill(dp, dp + K, false);
dp[0] = true;
if... | 0 | 82,420,542 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <climits>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
#include <new>
#include <cstdint>
#include <cctype>
using namespac... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(int argc, char* argv[]){
vector<string> result;
double x1,y1,x2,y2,x3,y3,x4,y4;
int N = 0;
cin >> N;
for (int i=0; i<N; ++i){
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
double inc1,inc2;
inc1 = (y1 - y2) / (x1 - x... | 0 | 6,231,724 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> ans(n+1);
rep(i,n) {
int a;
cin >> a;
ans[a] = i+1;
}
for(int i = 1; i < n; i++)
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N ;
vector<int> vec(N);
for (int i = 0; i < N; i++){
cin >> vec.at(i);
}
int a = 1, count = 0;
for (int i = 0; i < N; i++){
a = vec.at(a-1);
count++;
if (a == 2){
cout << coun... | 0 | 91,863,764 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
int n;
cin>>n;
ll a[n];
ll sum=0,mn=0;
for(int i=0;i<n;i++){
cin>>a[i];
mn=__gcd(mn,a[i]);
}
cout<<mn<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector <pii> vpii;
typedef vector <pll> vpll;
typedef map <str,int> mapsi;
typedef map <str,int> :: iterator mapsitr;
typedef... | 0 | 92,852,837 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <string>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(void)
{
int n, a[100], mode = 0;
rep(i, 100) {
a[i] = 0;
}
while (cin >> n)
a[n]++;
rep(i,100) {
if (mode < a[n]) ... | #ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <qu... | 0 | 44,822,946 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
if (N.at(0) == N.at(1) && (N.at(1) == N.at(2) && N.at(2) == N.at(3)) ){
cout << "Yes" <<endl;
}
else if (N.at(0) == N.at(1) && N.at(1) == N.at(2) ){
cout << "Yes" <<endl;
}
else if (N.at(1) == N.at(2) && N.at(2) == N.at... | #include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
using namespace std;
using ll... | 0 | 58,394,420 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
vector<int> mt;
for (int i = 0; i < 10; i++) {
int tmp;
cin >> tmp;
mt.push_back(tmp);
}
sort(mt.begin(), mt.end());
for (int i = mt.size()-1, j = 0; j < 3; i--, j++) {
cout << mt[i] << endl;
}
return 0;
} | #include <stdio.h>
#include <stack>
int main(){
std::stack<int> st;
int n;
while(scanf("%d", &n) != EOF){
if(n == 0){
printf("%d\n", st.top());
st.pop();
}
else{
st.push(n);
}
}
return 0;
} | 0 | 98,420,178 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<bool> > vvb;
typedef map<int, bool> mib;
typedef long long ll;
typedef vector<long long> vl;
typedef pair<long long,l... | #include <bits/stdc++.h>
using namespace std;
int n;
long long a[100055];
long long suff[100055];
int main() {
cin >> n;
for (int i = 0; i <= n; i++) {
scanf("%lld", &a[i]);
}
if (a[0] > 1 || (a[0] == 1 && n != 0)) {
puts("-1");
return 0;
}
for (int i = n; i >= 0; i--) {
... | 0 | 91,780,455 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define... | #include <bits/stdc++.h>
using namespace std;
#define printl(s) cout << s << endl;
#define print(s) cout << s << endl; return 0;
#define yes cout << "Yes" << endl; return 0;
#define no cout << "No" << endl; return 0;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,n) for (int i = 1; i < (n)+1; ++i)
using ... | 0 | 38,128,358 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include<iostream>
#include<cmath>
#include<vector>
using namespace std;
int gcd(int a,int b){
if(b==0)return a;
return gcd(b,a%b);
}
int kfactor(int a,int k){
vector<int>v1,v2;
for(int i=1;i<=sqrt(a);i++)
{
if(a%i==0)
{
v1.push_back(i);
v2.push_back(a/i);
... | 0 | 80,030,812 |
#include <bits/stdc++.h>
#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;
int main(){
int n; cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using P = pair<int,int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const int INF =1001001001;
template<class Abel> struct UnionFind {
vector<int> par;
vector<int> rank;
vector<Abel> diff_weight;
UnionFind(int n = 1, Abel SUM_UNITY = 0)... | 0 | 61,494,003 |
#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>
int main(){
ll N, M;
cin >> N >> M;
VS s(N);
rep(i, 0, N){
cin >> s[i];
}
rep(j, 0, N){
... | #include <iostream>
int main(int argc, const char * argv[]) {
std::string line;
int chars[26] = {};
for ( ; getline(std::cin, line); ) {
for (size_t i = 0; i < line.length(); i++) {
if ('a' <= line[i] && line[i] <= 'z') {
chars[line[i] - 'a']++;
} else if ('A'... | 0 | 78,727,238 |
#include<iostream>
using namespace std;
int main(){
for(;;){
int i,j,o;
cin >> i >> j;
if((i == 0) && (j == 0)){
break;
}
if(i > j){
o = i;
i = j;
j = o;
}
cout << i << " " << j << endl;
}
} | #include <iostream>
using namespace std;
int main(void){
string k_l = "qwertasdfgzxcvb";
string k_r = "yuiophjklnm";
while(1) {
string s;
cin >> s;
int result = 0;
int mode = -1;
if (s == "#") break;
for(int i=0; i<s.length(); i++) {
if ((int)k_r.f... | 0 | 65,453,161 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
t=1;
while(t--)
{
int n;
cin>>n;
int b;
int count=0;
for(int a=1;a<n;a++)
{
b=floor((n-1)/a);
count+=b;
}
cout<<count<<endl;
}
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<bool> a(n+1);
vector<int>w(n+1,0);
int acnt=0,wcnt=0;
for(int i=0;i<m;i++){
string s;
int tmp;
cin>>tmp>>s;
if(s=... | 0 | 9,398,432 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main()
{
int a, b, c;
cin >> a >> b >> c;
bool flg = false;
int n = abs(a - b);
int d = abs(a - b);
while (n != 0)
{
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long>a(n + 1);
vector<long long>b(n);
for(int i = 0;i < n + 1;i++){
cin >> a[i];
}
for(int i = 0;i < n;i++){
cin >> b[i];
}
long long count = 0;
for(int i = 0;i < a.size();i++)... | 0 | 48,387,265 |
#include <iostream>
using namespace std;
int main()
{
int f[100];
int n;
cin >> n;
f[0] = 1;
f[1] = 1;
for(int i = 0; i < n; i++)
{
f[i+2] = f[i+1] + f[i];
}
cout << f[n] << endl;
return 0;
} | #include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA... | 0 | 19,950,305 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldouble = long double;
const ll inf = 1ll << 60;
const ll mod = (ll)1e9 + 7;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define print(s) cout << s;
#define println(s) cout << s << endl;
... | #include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
const double PI = acos(-1);
struct Point
{
double x, y;
};
void koch(int n, int i, Point p1, Point p2)
{
if(i == n) return;
Point s, t, u, p;
s.x = (2 * p1.x + p2.x) / 3;
s.y = (2 * p1.y + p2.y) / 3;
koch(n, i+1, p1, s);... | 0 | 86,838,530 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
int main()
{
string L; cin >> L;
int len = L.size();
vector<int> x3(len);
x3[0] = 1;
for (int i = 1; i < x3.size(); i++) {
x3[i] = (ll)x3[i-1] * 3 % MOD;
}
ll ans_eq = 1, ans_lt = 0;
for (i... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using P = pair<int,int>;
int main(){
int n;
while(cin>>n,n){
vector<P> V;
V.clear();
for(int i=0;i<n;i++){
int hh,mm,ss;
cin>>hh;
cin.ignore();
cin>>mm;
... | 0 | 29,520,860 |
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB push_back
#define II(a,b) make_pair(a,b)
#define FIR first
#define SEC second
#define FREO freopen("check.out","w",stdout)
#define rep(a,b) ... | #include <bits/stdc++.h>
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin()
#define UB(a,x) ub(all(a),x)-a.begin()
#define mod 1000000007
#def... | 0 | 7,708,675 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 5;
int n, x[N];
int calc(int p) {
int ans = 0;
for (int i = 1; i <= n; ++i)
ans += (x[i] - p) * (x[i] - p);
return ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int avg = 0;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin ... | #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 | 69,518,155 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int main() {
ll X, Y;
cin >> X >> Y;
if (X % Y == 0){
cout << -1 << "\n";
} else {
ll prod = 1;
ll val = X;
while (val <= 1e18) {
if (val % Y != 0){
cout << val << "\n";
return 0;
}
prod++;
... | bool DBG = false;
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i=(a);i<((a)+(b));++i)
#define IRPT(i,a,b) for(int i=((a)+(b)-1);i>=(a);--i)
#define ALL(x... | 0 | 14,783,204 |
#include <bits/stdc++.h>
#define int long long
#define f first
#define s second
using namespace std;
int32_t main(){
ios::sync_with_stdio(0),cin.tie(0);
int a,b,c;
cin >> a >> b >> c;
cout << max(0ll,b+c-a);
} | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
#include <string.h>
#include <numeric>
using namespace std;
#define reps(i,s,n) for(int (i)=(s);(i)<(n);++(i))
#define rep(... | 0 | 23,121,680 |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( co... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N,M;
cin >> N >> M;
vector<int>A(N);
int sum = 0;
for(int i = 0; i < N; i++) {
cin >> A[i];... | 0 | 94,039,458 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
struct combination {
ll operator()(int n, int r) {
ll num = 1;
for(int i = 1; i <= r; i++){
num = num * (n - i + 1) / i;
}
return num;
}
};
int main(){
int n,p;
... | #include<bits/stdc++.h>
using namespace std;
using lint = long long;
int main() {
string s;
lint K;
cin >> s >> K;
int n = s.size();
vector<lint> vt = {1};
for (int i = 1; i < n; i++) {
if (s[i] == s[i - 1]) vt.back()++;
else vt.push_back(1);
}
if (vt.size() == 1) {
... | 0 | 77,262,518 |
#include <bits/stdc++.h>
using namespace std;
string S; int N, cnt;
int main() {
string S,T;
cin >> S >> T;
int ans=0;
for(int i=0;i<3;i++){
if(S[i]==T[i])ans++;
}
cout << ans << endl;
} | #include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
while(1){
string str;
getline(cin,str);
if(str==".") break;
int i=0;
int sum = 0;
vector<int> inkakko;
while(1){
if(str[i]=='('){
in... | 0 | 1,026,743 |
#include<bits/stdc++.h>
#define lol long long
#define gcd(x,y) __gcd(x,y)
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second
#define fixed fixed<<setprecision(14)
using namespace std;
using pii=pair<int,int>;
template <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
char room[25][25] = {'#'};
int walk(int x, int y) {
int ret = 1;
room[y][x] = '#';
if (room[y-1][x] == '.') ret += walk(x, y-1);
if (room[y+1][x] == '.') ret += walk(x, y+1);
if (room[y][x-1] == '.') ret += walk(x-1, y);
... | 0 | 82,583,928 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n,a;
cin >> n;
cin >> a;
if(n%500-a<=0)cout << "Yes" <<endl;
else cout << "No" <<endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string a,b;
cin >> a >> b;
bool f = true;
for(int i = 0; i < 3; i++){
if(a[i] != b[2 - i]){
f = false;
break;
}
}
if(f) puts("YES");
else puts("NO");
} | 0 | 85,659,275 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
struct UnionFind {
vector<i... | #include <stdio.h>
using namespace std;
typedef long long llong;
#define MAX
const llong mod = 1000000000 + 7;
int main()
{
int A, B, C, K;
int ans = 0;
scanf("%d%d%d%d", &A, &B, &C, &K);
if (A > K)
{
ans += 1 * K;
printf("%d\n", ans);
return 0;
}
else
{
ans += 1 * A;
}
K -= A;
if ... | 0 | 7,653,235 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, tmp, ans;
cin >> N;
if (N == 1){
cout << 1;
return 0;
}
for (int i = 1; i <= 7; i++){
tmp = pow(2, i);
if(tmp > N){
cout << pow(2, i - 1);
return 0;
}
}
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 78,563,977 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
int x = a[1];
for (int i = 1; i <= n; i++)
{
if (x == 2)
{
cout << i << endl;
return 0;
}
... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
int n;
cin>>n>>s;
for(int i=0;i<2;i++)
for(int j=0;j<2;j++)
{
string t;
t+=(i+'0');
t+=(j+'0');
for(int k=1;k<n-1;k++)
{
if(t[k]=='0')
{
if(s[k]=='o')
t+=t[k-1];
else
t+=(t[k-1]=='0'?'1':'0');
}
else
{
... | 0 | 40,804,089 |
#include<stdio.h>
int main()
{
int n,x;
double r,y;
x=100000;
r=1.05;
scanf("%d",&n);
for(int i=0;i<n;i++){
x=r*x;
if(x%1000>0)x=x+1000-(x%1000);
}
printf("%d\n",x);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define rep(pos, len) for(int pos=0;pos<len;pos++)
#define repp(pos, len) for(int pos=1;pos<=len;pos++)
#define INF 987654321
#define IINF 2987654321987654321
#define MOD 998244353
const int MAXN = ... | 0 | 61,835,647 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <iostream>
#include <ctype.h>
#include <string>
typedef long long ll;
using namespace std;
int main(){
double n,m,ans=0;
cin>>n;
rep(i,n){
cin>>m;
m=1/m;
ans+=m;
}
cout<<fixed<<setprecision(8);
ans=1/ans;
co... | #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++)
int main(){
ll R, G, B, N;
cin >> R >> G >> B >> N;
ll ans = 0;
for(ll r = 0; r * R <= N; r++){
for(ll g = 0; g * G <= N; g++){
if(r * R +... | 0 | 52,356,746 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
d... | #include <bits/stdc++.h>
#include <bitset>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define ... | 0 | 4,281,045 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n;
cin >> n;
ll ans = 0;
for(i = 1;i <= sqrt(n)+1;++i){
if(n%i) continue;
j = n/i;
ll m = j-1;
if(i >=... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 1e9 + 7;
const ll INF = 1e14;
void solve(){
int x, n; cin >> x >> n;
unordered_set<int> set;
while(n--){
int num; cin >> num;
set.insert(num);
}
int pos = 0;
while(true){
... | 0 | 89,021,263 |
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define forn(i,a,b) for(ll i=a;i<=b;i++)
#define ft first
#define sd second
#define sz size()
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#define all(x) (x).be... | #include <iostream>
#include <iomanip>
using namespace std;
int main() {
int a, b, d, r;
double f;
cin >> a >> b;
d=a/b;
r=a%b;
f=(double)a/b;
cout << fixed << setprecision(5);
cout << d << " " << r << " " << f << endl;
return 0;
} | 0 | 23,011,580 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
int r;
cin >> r;
int g;
cin >> g;
cout << 2*g-r << endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
long long q,h,s,d;
long long n;
cin >> q >> h >> s >> d >> n;
if(n==1){
q*=4;
h*=2;
long long ans = min(q,min(h,s));
cout << n*ans << endl;
}else{
q*=8;
h*=4;
... | 0 | 34,259,110 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,M,ans=0;
cin >> A >> B >> M;
vector<int> a(A);
for (int i=0;i<A;i++){
cin >> a.at(i);
}
vector<int> b(B);
for (int i=0;i<B;i++){
cin >> b.at(i);
}
vector<vector<int>> c(M,vector<int>(3));
vector<int> d(M);
for (int i = 0; i <M... | #include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <ra... | 0 | 70,261,946 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string moji[]={".,!? ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
int i,j,n;
string figure;
cin >> n;
for(i = 0; i < n; i++){
cin >> figure;
int count=0;
for(j = 0; j < figure.size(); j++){
if(figure[j]-'0'==0){
c... | #include<stdio.h>
int main(){
int a;
while(~scanf("%d",&a)){
int ans=0;
for(int i=0;i<10;i++)
for(int j=0;j<10;j++)
for(int k=0;k<10;k++)
for(int l=0;l<10;l++)
if(i+j+k+l==a)ans++;
printf("%d\n",ans);
}
} | 0 | 26,483,341 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int m;
cin >> m;
vector<ll> d(m);
vector<ll> c(m);
ll ans = 0;
ll sum = 0;
for(int i = 0; i < m; i++)
{
cin >> d[i] >> c[i];
ans += c[i];
sum += d[i] * c[i];
}
cout << ans - 1... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define MOD 1000000007
#define P... | 0 | 2,794,515 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char** argv)
{
int num;
cin >> num;
cin.ignore();
vector<int64_t> array(num);
int64_t sum = 0;
for (int i = 0; i < num; i++) {
std::cin >> array[i];
sum += array[i];
}
int64_t sum2 = array[0];
sum -= array[0];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
const int mod=1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n;cin >> n;
vector<ll> a(n);
rep(i,n) cin >> a.at(i);
l... | 0 | 2,070,955 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int N,n,a[500000],id[500000][2],ans=0;
inline bool cmp(int x,int y){
return a[x]<a[y];
}
int main(){
scanf("%d",&N);
n=1<<N;
for(int i=0;i<n;i++) scanf("%d",&a[i]);
a[n]=0;
id[0][0]=0,id[0][1]=n;
for (int i=1;i<n;i+... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<list>
#include<queue>
#include<limits>
using namespace std;
const int maxn=100001;
const int Max_INF=numeric_limits<int>::max();
int n,m;
int indeg[maxn];
bool visited[maxn];
vector<int> G[maxn];
vector<in... | 0 | 2,183,726 |
#include <cstdio>
int main(){
int a, b, c;
scanf("%s %s %s", &a, &b, &c)+1;
if (a == b && b == c) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
} | #include "bits/stdc++.h"
#define ll long long
#define int ll
#define double long double
#define fi first
#define ... | 0 | 42,362,535 |
#include<iostream>
using namespace std;
long long factorial(long long n){
long long int ans;
if(n==0)
ans=1;
else
ans =n*factorial(n-1);
return ans;
}
int main(){
long long n=0;
cin>>n;
long long int ans=1;
ans=factorial(n);
cout<<ans<<endl;
} | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | 0 | 73,386,199 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, M;
cin >> H >> W >> M;
set<pair<int, int>> targets;
vector<int> hSum(H), wSum(W);
for(int i = 0; i < M; i++) {
int x, y;
cin >> x >> y;
targets.insert({x - 1, y - 1});
hSum[x - 1]++;
wSum[y -... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int main(){
int H, W;
cin >> H >> W;
vector<vector<char>> s(H, vector<char>(W));
rep(i,H) rep(j,W) {
cin >> s[i][j];
... | 0 | 23,870,414 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
LL N;
string S;
cin >> N >> S;
LL R = count(begin(S), end(S), 'R');
LL ans = 0;
for(auto g=0; g<N; ++g) {
for(auto b=0; b<N; ++b) {
if(S[g] != 'G') continue;
if(S[b] != 'B') continue;
ans += R;
auto d... | 0 | 46,045,421 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb(n) push_back(n)
#define GSORT(v) sort(v.begin(), v.end(), greater<int>())
#define SORT(v) ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define vlli vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vplli vector< pair< ll,ll> >
#define plli pair< ll,l... | 0 | 65,915,257 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using ll = unsigned long long int;
using namespace std;
int harshad(int n) {
int sum = 0;
while (n > 0) {
sum += n % ... | #pragma GCC optimize ("trapv")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
vector< string > ss(n);
map< vector<ll>, ll> mp1;
for (auto& e:ss) {
vector<ll> freq(26);
cin >> e;
for(auto& f:e) {
freq[(f-'a'... | 0 | 76,292,178 |
#include "bits/stdc++.h"
using namespace std;
int main() {
string s;
cin >> s;
s.erase(unique(s.begin(), s.end()), s.end());
cout << s.size()-1 << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,... | 0 | 30,731,456 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k; cin >> n >> k;
ll const mod = 1000000007;
ll ans = 0;
for (ll i = k; i <= n + 1; i++) {
ll ans1 = i * (2 * n - i + 1) / 2;
ll ans2 = (i - 1) * i / 2;
ll ans3 = ans1 - ans2 + 1;
ans = (ans + ans3) % mod;
}
cout << ans... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
using namespace std; using ll = long long; using pll = pair<ll, ll>;
using vl = vector<ll>; using vll = vector<vl>; using ... | 0 | 38,859,228 |
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for(int (i)=0; (i)< (n); ++i)
#define REPR(i, n) for(int (i)=(n); (i)>=0; --i)
#define FOR(i, n, m) for(int (i)=(n); (i)<(m); ++i)
constexpr ll INF = 1LL << 62;
constexpr int mod = 1e9+7;
int main(){
int K, N;
cin >> N >> K;
vec... | 0 | 41,272,750 |
#include<bits/stdc++.h>
using namespace std;
#define Q int t; scanf("%d", &t); for(int q=1; q<=t; q++)
typedef long long int lli;
typedef pair<lli, lli> pi;
int main()
{
int n, m;
cin >> n >> m;
priority_queue<lli>pq;
vector<pi> v;
for(int i=0; i<n; i++){
lli a, b;
cin >> a >> b;
... | #include <iostream>
#include <queue>
using namespace std;
int c[101][102],ch[101];
queue<int> q;
int main(){
int a,b,e,d,n,k;
cin>>a;
for(int i=1;i<=a;i++)ch[i]=-1;
for(int i=0;i<a;i++){
cin>>b>>e;
c[b][0]=e;
for(int j=1;j<=e;j++){
cin>>d;
c[b][j]=d;
}
}
q.push(1);
ch[1]=0;
w... | 0 | 85,480,231 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans=0, x, y;
cin >> n;
vector<long long> a(n);
for(int i=0; i<n; i++) cin >> a[i];
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
queue<long long> q;
for(int i=0; i<n-1; i++) {
if(a[i]==a[i+1]) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<string> s(N);
REP(i, N) cin >> s[i];
int ans = 0, ... | 0 | 72,294,677 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pint = pair<int,int>;
ll mod = 1000000007,mod2 = 998244353;
void chmin(long long &a, long long b) { if (a > b) a = b; }
void chmax(long long &a, long long b) { if (a < b) a = b; }
const long long INF = 1LL<<60;
ll gcd(ll a,ll b){
if(b == 0) r... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "... | 0 | 99,536,088 |
#include<bits/stdc++.h>
using namespace std;
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) {cerr << x;}
void ... | #include<bits/stdc++.h>
#define rep(i,m) for(long long i=0; i<m; i++)
#define per(i,m) for(long long i=m-1; i>=0; i--)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define ROF(i,n,m) for(long long i=m-1; i>=n; i--)
#define SORT(v,n) do{sort(v,v+n);reverse(v,v+n);}while(0)
#define all(x) (x).begin(),(x).end()
#define... | 0 | 42,770,612 |
#include <bits/stdc++.h>
using namespace std;
int isp(int x) {
for (int i = 2; i * i < x; i++) {
if (x % i == 0) {
return false;
}
}
return true;
}
int main() {
int n;
int d, x;
cin >> n >> d >> x;
for(int i = 0 ; i < n ; i++){
int a;
cin >> a;
... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int N,M,count=0;
cin>>N;
vector<string> s(N);
for(int i=0;i<N;++i)cin>>s[i];
cin>>M;
vector<string> t(M);
for(int i=0;i<M;++i)cin>>t[i];
auto calc=[&](string find){
i... | 0 | 13,480,279 |
#include<bits/stdc++.h>
#include<cstdlib>
using namespace std;
#define ll long long
#define in(x) scanf("%d",&x);
#define out(x) printf("%d",x);
#define ins(x) scanf("%s",x);
#define outs(x) printf("%s",x);
#define lin puts("");
#define _ putchar(' ');
int t;
ll i, j;
ll n, k , p, q, d, m, c, c1, c2, d1,x;... | #include <iostream>
using namespace std;
int s,x,z,a;
int main(){
cin>>x>>a>>z;
s=a+x;
if((a<=500)&&(a>=1)&&(x>=1)&&(x<=500)){
if(s>=z){
cout<<"Yes";
} else {
cout << "No";
}
}
else{
cout<<"you can't buy";
}
return 0;
} | 0 | 72,562,819 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; ++i){
cin >> a[i];
}
int mn = *min_element(a.begin(), a.end());
int mx = *max_element(a.begin(), a.end());
int ans = 99999999;
for(int i=mn; i<=mx; ++i){
... | #include<iostream>
#define ll long long
using namespace std;
ll n,y;
int main(){
cin >> n >> y;
bool f = false;
for(int a=0;a <= 2000;a++){
for(int b=0;b <= 2000;b++){
int c = n - a - b;
if(y == 10000*a + 5000*b + 1000*c && c >= 0){
cout << a << " " << b << " " << c << endl;
f = tr... | 0 | 56,313,622 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int count_1=0,count_2=0,count_3=0;
int i;
for(i=0;i<3;i++){
if(s.at(i)=='a'){
count_1++;
}
if(s.at(i)=='b'){
count_2++;
}
if(s.at(i)=='c'){
count_3++;
}
}
if(count_1==count_2 && count_1==... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 998244353;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> D(N);
for (int i=0;i<N;i++){
cin >> D[i];
}
if (D[0] != 0) {
cout << 0 << "\n";
return... | 0 | 53,804,261 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
if (N == 0){
cout << 2 <<endl;
return 0;
}else if (N == 1){
cout << 1 << endl;
return 0;
}
int64_t t0 = 2;
int64_t t1 = 1;
int64_t t2;
for (int i; i < N - 1; i++){
t2 = ... | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000000
#define LINF 1000000000000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
int main() {
int N;
cin >> N;
vector<P> red(... | 0 | 5,996,079 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
using namespace std;
using ll = long long;
typedef vector<int> vi;
signed main() {
ll q, h, s, d, n;
cin >> q >> h >> s >> d >> n;
ll ans = 0;
h = min(h, q*2);
s = min(s, 2... | #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, h[100001], ma[100001];
cin >> n >> m;
for(int i = 1; i <= n; i++) {
cin >> h[i];
ma[i] = 0;
}
for(int i = 0; i < m; i++) {... | 0 | 83,104,522 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
const double pi = acos(-1);
typedef long long ll;
int main()
{
ll a,b,x;
cin>>a... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, int num=0){
if(num == 0) num = (int)v.size();
if(is_reverse) for(int i=num-1; i>=0; i--){ cout<<v[i]; if(i!=0) cout<<" ";}
else for(int i=0; i<num; i++){ cout<<v[i]; ... | 0 | 63,430,219 |
#include<bits/stdc++.h>
#define INF 1e12
using namespace std;
typedef long long int ll;
int main()
{
int N,M; cin >> N >> M;
vector<vector<bool>>G(N,vector<bool>(N,false));
for(int i = 0; i < M; i++)
{
int a,b; cin >> a >> b;
G[a-1][b-1] = true;
G[b-1][a-1] = true;
}
vector<int>V(... | #include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <climits>
#include <algorithm>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
namespace BasicMath {
static Int Max(const Int a, const Int b);
Int Max(const In... | 0 | 38,337,302 |
#include "bits/stdc++.h"
using namespace std;
struct Solver {
Solver() {
ios::sync_with_stdio( false );
cout << fixed << setprecision( 10 );
}
void solve() {
int N, H, W;
cin >> N >> H >> W;
int ans = 0;
for( int i = 0; i < N; ++i ) {
int a, b;
cin >> a >> b;
ans += a >= H && b >= W;
}
cout ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define FORV(i,v) for(auto i=v.begin(); i!=v.end();i++)
#define ALL(v) (s).... | 0 | 47,089,861 |
#include<stdio.h>
int main(void){
double f=0.0;
int a = 0, b = 0,d = 0, r = 0;
scanf("%d", &a);
scanf("%d", &b);
d = a / b;
r = a%b;
f = double(a) / double(b);
printf("%d %d %.5f\n", d, r, f);
return 0;
} | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
#define rep(i, n)for(int i=0; i<n; i++)
int hy[] = {0, 1, 0, -1};
int wx[] = {1, 0, -1, 0};
int H, W;
bool closed(int x, int y){
bool flag = true;
if(x<0 || W<=x)
flag = false;
if(y<0 || H<=y)
flag = false;
... | 0 | 63,380,364 |
#include<iostream>
using namespace std;
int main() {
int N, M, X, Y; cin >> N >> M >> X >> Y;
int x[N];
for (int i = 0; i < N; i++) {
cin >> x[i];
}
int y[M];
for (int i = 0; i < M; i++) {
cin >> y[i];
}
for (int i = X + 1; i <= Y; i++) {
bool willStartWar = false... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll=vector<ll>;
using vvll=vector<vll>;
using vi=vector<int>;
using vvi=vector<vector<int>>;
using vb=vector<bool>;
using pii=pair<int,int>;
using vpii=vector<pair<int,int>>;
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;retur... | 0 | 33,031,164 |
#include<stdio.h>
#include<string.h>
int main(){
int A,B;
char S[15],T[15],U[15];
scanf("%s %s",&S,&T);
scanf("%d %d",&A,&B);
getchar();
scanf("%s",&U);
if( strcmp(S,U)==0){
A--;
}
else {
B--;
}
printf("%d %d",A,B);
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
typedef long long LL;
static const int MOD = 1000000007;
static const int MAXN = 100000 + 10;
LL factors[MAXN];
LL power(LL base, int n) {
LL cur = base;
LL ret = 1;
while (n) {
if (n & 1) {
ret *= cur;
ret %= MOD;
... | 0 | 39,364,019 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
ll cnt = 0;
for (ll i = k; i <= n + 1; i++) {
cnt += (i * (n - i + 1) + 1) % MOD;
}
cout << cnt % MOD << endl;
return 0;
} | #include <string>
#include <iostream>
using namespace std;
int main() {
int N; string S; bool t = true; cin >> N >> S;
if (N % 2 == 1) t = false;
else for (int i = 0; i < (N / 2); i++) {
if (S[i] != S[(N / 2) + i]) {
t = false;
break;
}
}
if (t) cout << "Yes";
else cout << "No";
cout << endl;
} | 0 | 31,056,872 |
#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;
constexpr char newl = '\n';
constexpr double eps =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, n_min, n_max;
while (cin >> m >> n_min >> n_max, m | n_min | n_max) {
vector<int> a(m);
for (int i = 0; i < m; ++i) {
cin >> a[i];
}
int ans = 0;
int gap = 0;
for (int k = n_min; k <= n_... | 0 | 44,162,919 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, Z, W;
cin >> N >> Z >> W;
vector<int> a(N);
vector<int> x(N, 1000000005);
vector<int> y(N);
for(int i = 0; i < N; i++) cin >> a[i];
for(int i = N - 2; i >= 0;... | #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... | 0 | 7,869,740 |
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <cfenv>
#include <cinttypes>
#include <cstdi... | #include <stdio.h>
#include <string.h>
#define MAX 512
int main(void){
char words[MAX][33];
int wcnt=0;
int f[MAX], len[MAX];
char word[33];
int longest, mostf;
while (scanf("%s", word)!=EOF){
int wid=-1;
for (int i=0; i<wcnt; i++){
if (strcmp(word, words[i])==0){
wid = i;
}
}
if (wid==-1){
s... | 0 | 31,633,211 |
# include <iostream>
# include <math.h>
using namespace std;
int main()
{
int N, M, sum = 0;
int* A;
cin >> N >> M;
A = new int[M];
for (int i = 0; i < M; i++)
{
cin >> A[i];
sum += A[i];
}
int rest = N - sum;
if (rest < 0)
cout << "-1";
else
cout << rest;
return 0;
} | #include <iostream>
#include <climits>
using namespace std;
int main() {
int coin[] = {1,5,10,50,100,500};
int dp[1000];
fill_n(dp, 1000, INT_MAX);
dp[0] = 0;
for (int i=1; i<1000; ++i) {
for (int j=0; j<6; ++j) {
if (i - coin[j] >= 0) {
dp[i] = min(dp[i], dp[i-co... | 0 | 15,321,936 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a<=c){
if(c<=b){
puts("Yes");
return 0;
}
}
puts("... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end())
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) if(a){cout<<"Yes"<<endl;}else cout<<"No"<<endl;
#define ld long double
... | 0 | 15,253,966 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
auto is_range = [&](int x, int y) {
return (0 <= x) && (x < h) && (0 <= y) && ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
static const int INF (1<<30);
ll get_min(ll h, ll w) {
ll y = INF;
for (int x = 1; x <= w-2; x++) {
ll s1 = x * h;
ll s2, s3;
if (w-x % 2 == 0) {
... | 0 | 50,770,703 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 1000000000
#define IOS ios_base::sync_with_stdio(0);cin.tie(0)
#define meM(y,a) memset(y,a,sizeof y)
#define sC(a) scanf("%d",&a)
#define alL(a) a.begin(),a.end()
#define prinT(a,sz) co... | #include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin >> n;
ll a[100002];
ll sum = 0;
for(int i = 0; i < n; i++){
cin >> a[i];
sum += a[i];
}
if(sum % (n * (n + 1) / 2) != 0){
cout << "NO" << endl;
return 0;
}
ll lar[100... | 0 | 77,204,634 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
long double ans = 0;
for(int i=0;i<n;i++){
long double x;
string u;
cin >> x >> u;
if(u=="JPY"){
ans += x;
}else if(u=="BTC"){
ans += x*380000;
}
}
printf("%.10Lf\n",ans);
} | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 1,157,444 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll N; cin >> N;
vector<string> S(... | #include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;
... | 0 | 2,944,142 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define LOOP(i,x,n) for(int i=x;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define MP make_pair
#define FIR first
#define SEC second
#define int long long
using namespace std;
const int MOD=1000000007;
const int INF=1000000009;
signed... | #include <bits/stdc++.h>
using namespace std;
string query(int n) {
cout << n << '\n';
fflush(stdout);
string s; cin >> s;
if (s == "Vacant") exit(0);
return s;
}
int main() {
int n; cin >> n;
int l = 0;
int r = n - 1;
string L = query(l);
string R = query(r);
while (l < r) {
int m = (l + r) / 2;
R = que... | 0 | 35,273,448 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using ll=long long;
using namespace std;
const long MOD=1e9+7;
template<class T>
T lcm(T a,T b){
return a/__gcd(a,b)*b;
}
int main(){
long n;cin >> n;
vector<long> a(n);
long ans=-1;
for(int i=0;i<n;i++){
cin >> a[i];
}
fo... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n, m, x, y, s = 0, _s, p;
vector<int> vx, vy;
cin >> n >> m;
for(int i = 0; i < n + m; i++){
cin >> x >> y;
vx.emplace_back(x);
vy.emplace_back(y);
}
for(int i = 0; i < n; i++){
for(int j = n... | 0 | 56,514,871 |
#include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debug cout<<"debugged\n";
#define minval... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int n;
cin>>n;
long int sum = 0;
long int before = 0;
cin>>before;
for(int i=0; i<n-1; i++){
long int a;
cin>>a;
if(before > a)
sum += before - a;
... | 0 | 69,102,604 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,i,sum;
sum=0;
cin >>a >>b >>c;
for(i=a;i<=b;i++){
if(c%i==0){
sum++;
}
else{
continue;
}
}
cout << sum <<endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
void solve(){
int n, m; cin >> n >> m;
string sn[n], sm[m];
for(int i = 0; i < n; ++i) cin >> sn[i];
for(int i = 0; i < m; ++i) cin >> sm[i];
for(int i = 0; i < n-m+1; i++){
for(int j = 0; j < n-m+1; j++){
int flag = 1;
int cnt = 0;
... | 0 | 98,883,393 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<map<int, int>> py(n+1);
vector<vector<int>> numm(m + 1, vector<int>(2));
int tmp1, tmp2;
for (int i = 1; i <= m; i++) {
cin >> tmp1 >> tmp2;
py[tmp1][tmp2]=0;
numm[i][0] = tmp1;
numm[i][1] = tmp2;
}
for (int i = 1... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi first... | 0 | 49,961,429 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#define pb push_back
#define mp make_pair
#define taskname "A"
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef tree <int,null_type,less<i... | #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;
constexpr char newl = '\n';
constexpr double eps =... | 0 | 35,210,041 |
#include <iostream>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using namespace std;
typedef long long LL;
int main(){
int N;
cin >> N;
cout << 800*N-200*(N/15) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int INF = 1000000000;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
rep(i, n) {
scanf("%d", &a[i]);
}
int len = 1;
vector<int> l(n+1, INF);
rep(i, n) {
if (i == 0) {
... | 0 | 95,524,741 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define Cout(s) cout << s << endl;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1ll << 60;
ll MOD = 1e9 + 7;
int main()
{
int a, b;
cin >> a >> b;
Cout(a * b - a - b + 1);
return 0;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl
typedef long long ll;
typedef unsigned long long ull;
t... | 0 | 14,649,801 |
#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 <bits/stdc++.h>
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define RFOR(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define rep(i,n) FOR(i,0,(n))
#define REPS(i,n) FOR(i,1,(n)+1)
#define RREP(i,n) RFOR(i,0,(n))
#define rng(x) (x).begin(),(x).end()
#define rrng(x) (x).rbegin(),(x).rend()
#define debug(x) ... | 0 | 73,568,034 |
#include "bits/stdc++.h"
using namespace std;
int main() {
string S; cin >> S;
vector<long long>Bigger(S.size() + 1, 0), Less(S.size() + 1, 0);
for (long long i = 0; i < S.size(); i++) {
if (S.at(i) == '<') {
Less.at(i + 1) = Less.at(i) + 1;
}
}
for (long long i = S.size() - 1; i >= 0; i--) {
if (S.at(i) ... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(void){
string str, x, y;
cin >> str;
int q;
cin >> q;
int a, b, p;
for(int i = 0; i < q; i++){
cin >> x >> a >> b;
p = b - a + 1;
if(x == "print"){
cout << str.substr(a, p... | 0 | 98,697,113 |
#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 len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using l... | #include <iostream>
#include <string>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll... | 0 | 54,073,255 |
#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 1001001001001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
int main(){
int x,a,b;cin>>x>>a>>b;
if(a-b>=0)cout<<"delicious"<<endl;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
ll mpow(ll x, ll n) {
ll ans=1;
while(n>0) {
if(n&1) {
ans=ans*x%mod;
}
x=x*x%mod;
n>>=1;
}
return ans;
}
i... | 0 | 78,235,052 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 2000000000000000000ll
#define fi first
#define sec second
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
ll inf = LLONG_MAX;
long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void NO() {cout << "NO"... | 0 | 59,265,399 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 1000000000;
typedef int64_t ll;
template<class T> inline bool chmax(T & a, T b) { if ... | #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)
... | 0 | 64,430,349 |
#include <iostream>
using namespace std;
int main(){
int n,i,j;
cin >> n >> i;
j=(n-i)+1;
cout << j;
return 0;
} | #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 ai, ao, bi, bo;
cin >> ai >> ao >> bi >> bo;
int a = 0;
int b = 0;
int ans = 0;
rep(i, 101){
if(ai == i) a = 1;
if(bi == i) ... | 0 | 5,533,447 |
#include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <math.h>
#include <algorithm>
#include <deque>
#include <queue>
#include <climits>
#include <set>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ve vector
#define umap unordered_map
#define iter i... | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<queue>
#define INF 2100000000
using namespace std;
typedef pair<int,int> P;
int glid[1001][1001];
char put[1001][1001];
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
char su[9]={'1','2','3','4','5','6... | 0 | 89,506,708 |
#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... | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define _repargs(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi... | 0 | 100,613,772 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
#define all(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);++i)
#define FOR(i,k,n) for(int i=(k);i<(n);++i)
int main() {
int N; cin >> N;
map<string,int> mp;
int sum = 0;
REP(i,N) {
string s; ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define SZ(x) ((int)(x).size())
#define rep(i,n) for(int i=0;i<(n);++i)
#define fore(i,a) for(auto &i:a)
#define min(...) min({__VA_ARGS__})
#define max(...) max({__VA_ARGS__})
#define Yes cout << "Yes" << endl;
#define No cou... | 0 | 81,802,814 |
#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 sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int ... | 0 | 41,628,715 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll N,K,ans=0; cin>>N>>K;
queue<ll> A,B,W;
vector<ll> C(N+1,0);
for(ll i=1; i<=N; i++) cin>>C[i];
for(ll i=1; i<=N; i++) C[i]=C[i-1]+C[i];
for(ll i=1; i<=N; i++) for(ll j=0; j<i; j++) A.emplace(C[i]-C[j]);
B=A;
for(ll i=50; i>=... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vll = vector<ll> ;
using vs = vector<string> ;
#define all(v) v.begin(),v.end()
const int MAX_V = 210;
const int INF = 1e5;
int V;
vll G[MAX_V];
int match[MAX_V];
bool used[MAX_V];
void add_edge... | 0 | 44,737,926 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
long long int ans=1000;
long long int counter=1000;
long long int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<n-1;i++)
{
if(a[i]<a[i+1])
{
counter=ans/a[i];
... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include ... | 0 | 100,002,693 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> B(N-1);
for(int i = 0; i < N-1; i++){
cin >> B.at(i);
}
long long score = B.at(0);
for(int i = 0; i < N-2; i++){
if(B.at(i) < B.at(i+1)){
score += B.at(i);
}else{
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N,K;
cin >> N >> K;
vector<ll> A(N);
for (int i=0;i<N;i++) cin >> A[i];
ll p = 0;
for (int i=0;i<N-1;i++){
... | 0 | 56,175,774 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.