code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 2 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <stdio.h>
int main(void){
int h1,m1,h2,m2,t,k;
std::cin >>h1>>m1>>h2>>m2>>k;
t=(h2-h1)*60+(m2-m1);
if(t==k){
std::cout << "0";
}else{
std::cout << t-k;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typed... | 0 | 38,665,118 |
#include <iostream>
#include <vector>
#include <cassert>
#include <cmath>
#include <map>
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 20000;
int main() {
int x, y;
std::cin >> x >> y;
if(0 <= x && x <= y)
std::cout << y - x;
e... | #include<iostream>
#include<vector>
using namespace std;
using ll=long long;
int main(){
int n;
cin>>n;
ll now=1;
ll MAX=1e18;
vector<ll> a(n);
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]==0){
cout<<0<<endl;
return 0;
}
}
for(int i=0;i<n;i++){
if(MAX/now<a[i]){
cout<<-1<<e... | 0 | 36,250,976 |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define ld long double
#define vi vector<int>
#define vl vector<ll>
#define v2i vector<vector<int>>
#define v2l vector<vector<ll>>
#define ppi pair<int,int>
#define ppl pair<ll,ll>
#de... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout)... | 0 | 40,398,263 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int f(int n) {
int ret = 0;
while (n >= 1) {
ret += n % 10;
n /= 10;
}
return ret;
}
int main() {
int n;
cin >> n;
if (n % f(n) == 0) {
cout << "Yes" << endl;
} ... | #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 h, w;
cin >> h >> w;
vector<string> field(h);
rep(i, h) cin >> field[i];
vector<vector<int>> yoko(h, vector<int>(w, 0));
vector<vector<int... | 0 | 74,131,171 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 1e5 + 5;
const int INF = 1001001001;
const int MOD = 1e9 + 7;
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N);
rep(i, N) cin >> A[i];
vec... | #include<bits/stdc++.h>
#include<math.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define MOD 1000000007
bool isvowel(char c)
{
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
return true;
return false;
}
ll isprime(ll n)
{
ll ans=1;
for(ll i=2;i<=sq... | 0 | 80,666,563 |
#include <bits/stdc++.h>
using namespace std;
#define MAXN 300*1000 + 5
using ll = long long;
ll freq[MAXN], freq_freq[MAXN];
ll f(int x) {
ll res = x * (freq_freq[MAXN-1] - freq_freq[x]) + freq[x];
return res / x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for(int i = 0; i < n... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d;
cin >> n >> d;
vector<vector<double>> p(n, vector<double>(d));
for (int i = 0; i < n; i++) {
for (int j = 0; j < d; j++) {
cin >> p[i][j];
}
}
int ans = 0;
for (int i = 0; i < n-1; i++) {
... | 0 | 29,951,126 |
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... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,i,k,l;
cin>>n;
vector<long long>a(n);
for(i=0;i<n;i++)
cin>>a[i];
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
queue<long long >q;
for(i=0;i<n-1;i++)
{
if(a[i]==a[i+1])
{
... | 0 | 63,305,304 |
#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 <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 | 38,783,626 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>m>>n;
if(n*m==15)cout<<"*";
else if(n+m==15)cout<<"+";
else cout<<'x';
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i = (a); i <= (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main(){
int a, b;
cin >> a >> b;
int count = 0;
rep(i,a,b){
auto isP = [](int n){
ostringstream sout;
sout << n;
string s = sout.str();
... | 0 | 46,118,799 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = (1<<30);
int main() {
int n,k,h[110000];
cin >> n >> k;
for(int... | #include <bits/stdc++.h>
using namespace std;
long long N, A[100100], kotak, kotak2;
int main() {
cin >> N;
for(int i=1; i<=N; i++) {
cin >> A[i];
}
sort(A+1, A+N+1);
for (int i=N; i>=2; i--){
if(A[i]==A[i-1]){
kotak=i;
break;
}
}
for (int i=ko... | 0 | 94,085,416 |
#include<iostream>
#include<complex>
#include<cmath>
using namespace std;
typedef complex<double> xy_t;
xy_t P[4];
double cross(xy_t p,xy_t q){
return (conj(p)*q).imag();
}
int main(){
int n;
double eps=pow(10,-11);
cin>>n;
for(int i=0;i<n;++i){
for(int j=0;j<4;++j){
double x,y;
... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#def... | 0 | 51,238,433 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define ld long double
#define mem(a, b) memset(a, (b), sizeof(a))
#define rep(i, j, k) for (int i = j ; i < k ; ++i)
#define rrep(i, j, k) for (int i = j; i > k; --i)
#define all(cont) cont.begin(), cont.end()
#define ra... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | 0 | 8,477,770 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<sstream>
#include<complex>
#include<random>
#include<cmath>
#include<math.h>
#include<stack>
#include<queue>
#include<map>
#include<iomanip>
#include<locale>
#define rt "\n"
#define rep(i,n) for(int i=0;i<n... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 0 | 38,123,595 |
#pragma GCC optimization ("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#incl... | #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>;
const int mx = 100005;
vector<int> p;
vector<int> e[mx];
int visited[mx] ={0};
void rec(vector<int> *pos,vector<int> *val,int cur) {
visited[cur] = 1;
pos->push_back(cur); val->p... | 0 | 29,637,820 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i, begin, end) for (int i = begin; i >= end; i--)
templa... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
A--;
B--;
char a[100][100];
for (int i = 0; i < 50; i++) {
for (int j = 0; j < 100; j++) {
a[i][j] = '#';
}
}
for (int i = 50; i < 100; i++) {
for (int j = 0; j < 100; j++) {
... | 0 | 100,788,866 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
int main(int argc, char* argv[]){
cin.tie(0);... | #include <iostream>
#include <vector>
#include <algorithm>
#define MAXVALUE 10000
#define rep(i,a) for(i=0;i<a;i++)
using namespace std;
void CountingSort(vector<int> &A, vector<int> &B, int k){
int i,j;
vector<int> C(k+1,0);
for(j=0; j<A.size(); j++) {
C[A[j]]++;
}
for(i=1; i<=k; i++) {
... | 0 | 36,272,703 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
ll f(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define In_The_Name_Of_Allah_The_Merciful ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define Alhamdulillah return 0;
#define debug(n) cerr << "[" << #n << " = " << n << "]" << endl
void Suhaib_Sawalha (){
int a , b , c;
c... | 0 | 31,703,249 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int m,f,r,s;
char G;
while(1){
cin>>m>>f>>r;
if(m==-1&&f==-1&&r==-1)break;
s=m+f;
if((m==-1)||(f==-1)){
G='F';
}else if(s>=80){
G='A';
}else if((s>=65)&&(s<80)){
G='B'... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> A(N);
for(int i = 0; i < N; i++) {
cin >> A[i];
}
int ok[1000001] = {0};
int cnt[1000001] = {0};
for(int i = 0; i < N; i++) {
cnt[A[i]]++;
}
for(int i = 1; i <= 1000000; i++) {
i... | 0 | 43,962,981 |
#include<iostream>
using namespace std;
#define ll long long
int main()
{
ll n,i,j,c=1,d,mini;
cin>>n;
ll a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
if(i>0)
{
if(a[i]<=mini)
{
c++;
mini=a[i];
}
}
els... | #include "bits/stdc++.h"
using namespace std;
const int mx = 2e5 + 9;
int ans[mx];
bitset <mx> mark;
vector <int> adj[mx];
void bfs(int s) {
mark[s] = 1;
queue <int> q;
q.push(s);
while (!q.empty()) {
auto u = q.front();
q.pop();
for (auto v : adj[u]) {
if (mark[v]) c... | 0 | 5,756,041 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int MOD = 1e9 + 7;
void add(int &a, int b)
{
a = (a + b) % MOD;
}
int main()
{
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
vector<vector<int>> dp(n+1, vector<int>(k+1, 0));
dp[0][0] = 1... | 0 | 19,865,402 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iomanip>
#include <functional>
#include <bitset>
#include <complex>
#define rep(i, n) for(int i = 0; i < (i... | 0 | 3,868,589 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
int... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int n;
cin >> n;
int _A = 0,B_ = 0,BA = 0;
ll res = 0;
rep(i,n){
... | 0 | 21,264,923 |
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a >= b){
cout<<"10";
}
else{
cout<<"0";
}
return 0;
} | #include <stdio.h>
int main() {
long long int n;
long long int t;
scanf("%lld", &t);
long long int num[t];
long long int sum = 1;
for(long long int i = 0; i<t; i++){
scanf("%lld", &n);
num[i] = n;
}
for(long long int i = 0; i<t; i++){
if(num[i]==0){
printf("0\n");
return 0;
}
}
for(long long int i = 0; i<t; i++... | 0 | 89,359,857 |
#include <stdio.h>
#include <string>
#include <stdlib.h>
#include<vector>
#include<iostream>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
long long int divide(long long int h,long long w){
if(h %2 == 0){
return (h/2)*w;
}
if(w %2 == 0){
return (w/2)*h;
}
long long int mi = min(h,w);
lo... | #pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = 1'000'000'007LL;
#define pb push_back
#define mp make_pair
#define all(x) ... | 0 | 99,084,301 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 10000... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 0 | 20,157,178 |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
#include <math.h>
using namespace std;
double condition = 0.0;
bool kaibun(string S, int start, int length)
{
string tmp1, tmp2;
tmp1 = S.substr(start, length);
tmp2 = tmp1;
reverse(tmp2.begin(), tmp2.end(... | #include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;
lli calc(lli a, lli b)
{
if (a % b == 0) {
return a / b - 1;
} else {
return a / b;
}
}
int main()
{
int n;
cin... | 0 | 86,339,011 |
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cfloat>
#include<climits>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utilit... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class... | 0 | 20,455,524 |
#include<bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(),(a).end()
typedef long long ll;
const ll mod=1000000007;
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
int main() {
int a,b,c,k;cin>>a>>b>>c>>k;
int out;
if(k<=a){
out =k;
} else if(k<=a+b){
out = a;
} else {
out = 2*a + b - k;
}
co... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
long long longpow(long long n, long long a, long long mod) {
if (a == 0) return 1;
if (a == 1) return n % mod;
if (a % ... | 0 | 23,710,220 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define pb push_back
#define pob pop_back
#define mp make_pair
#define fi first
#define se second
#define endl '\n'
#define Ptest(x) return cout << x << endl, 0;
typedef vector <int> vi;
typedef pair <int, int> ii;
typedef vec... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main(){
string s;cin>>s;
int result=0;
int l=0, r = s.size()-1;
while(r>l){
if(s[l]==s[r]){
l++;
r--;
continue;
}
if(s[l]!=s[r]){
if(s[l]=='x'){
l++;
... | 0 | 75,267,392 |
#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#def... | #include "bits/stdc++.h"
#include <unordered_set>
#include <numeric>
#define rep(i,n) for(int i = 0; i < n; i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define vll vector<vector<long long>>
#define vl vector<long long>
#define vi vector<int>
#define vii vector<vector<int>>
#define pb... | 0 | 99,719,327 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N - 1; i >= 0; i--)
const ll INF = 1000000000;
const ll mod = 1000000007;
#define PI 3.1415926535
using Graph = vector<vector<int>>;
template<class T> in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 1e9 + 7;
ll fast_pow(ll a, ll b) {
ll ans = 1;
while(b) {
if(b&1) ans = ans * a % M;
b >>= 1;
a = a * a % M;
}
return ans;
}
ll f(int n, int k, int x) {
return fast_pow(k/x, n);
}
const int N = 2e5 + 7;
ll F[N];
int main() {
i... | 0 | 93,687,984 |
#include <iostream>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int c = 1;
int i;
for(i=0;i<n;i++){
if(c<=k) c*=2;
else c+=k;
}
cout << c << "\n";
return 0;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <boost/sort/spreadsort/spreadsort.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>
#include <ext/pb_ds/assoc_cont... | 0 | 46,255,283 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge{
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w){}
};
using graph = vector<vector<l... | #include <bits/stdc++.h>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) begin(r),end(r)
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define s... | 0 | 68,631,769 |
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1000000010
#define EPS 1e-9
#define fst first
#define scd second
#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define lp(i,n) repi(i,0,n)
#define repn(i,n) for(int i=n;i>=0;i--)
#defi... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define st first
#define nd second
typedef pair < int , int > pp;
const int mod = 1e9 + 7;
const int N = 2e5 + 5;
vector < pp > V[N];
int T[N],H[N],n,m,i,x,y,z;
void f(int x){
H[x] = 1;
for(int y, i=0; i<V[x].size(); i++){
... | 0 | 30,642,126 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i ++)
using namespace std;
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long long MOD = 1000000007;
constexpr double EPS = 1e-4;
constexpr d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,... | 0 | 98,708,211 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | #include<iostream>
#include<vector>
using namespace std;
const long long MOD = 1000000007LL;
int main() {
long long n, k; cin >> n >> k;
vector<long long> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
long long ans = 0;
for (int i = n-1; i >= 0; --i) {
long long num = 0;
... | 0 | 21,435,904 |
#define _GIBCXX_DEBUG
#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()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double EPS = 1e-10;
int main(void) {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#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... | 0 | 100,129,762 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int MAX =1002;
const int MOD =1000000007;
signed main(){
int ... | #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 V = vector<ll>;
using P = pair<ll,ll>;
int main(){
ll n,m;cin >>n>>m;
vector<ll>co(n,0);
for (int i = 0; i < m; ++i) {
l... | 0 | 14,917,059 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
void solve() {
int n; cin >> n;
int ans = 0;
int a = 0, b = 0, ba = 0;
for (int i = 0... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 0 | 32,656,727 |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main(){
double a,b,c,cr,S,L,h;
cin >> a >> b >> c;
cr = c*3.1415926535/180;
h = b*sin(cr);
S = a/2.0*b*sin(cr);
L = a+b+sqrt(a*a+b*b-2.0*a*b*cos(cr));
printf("%f\n",S);
printf("%f\n",L);
printf("%f\n",h);
return 0;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<... | 0 | 16,926,512 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,a,b) for (int (i)=a;(i)<(b);(i)++)
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using graph = vector<vector<ll>>;
const ll nmax = 100001;
ll n, m;
ll notop[nmax];
ll h[nmax];
bool dfs(ll v, const graph &G){
for(auto nv : G[v]){
if(h[v]<=h[nv]){
notop[v]++; return false;
}
}
return true;
}
int... | 0 | 40,045,046 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | #include <bits/stdc++.h>
#define load ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
#define ll long long
#define ull unsigned long long
#define fori(i,n) for (int i=0; i<int(n);i++)
#define srt(v) sort(v.begin(), v.end())
#define MOD 1000000007
const int INF = 1e9;
const double PI... | 0 | 5,042,061 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<functional>
#include<vector>
#include<queue>
using namespace std;
#define f(i,n) for(int i=0;i<(int)n;i++)
#define MOD 1000000009
int main(void){
char a[201];
f(i, 201)a[i] = 0;
int k, s;
int n, m;
int x, y, z;
int a... | #include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <limits.h>
#include <cmath>
#include <queue>
#include <map>
#include <iomanip>
#include <random>
#include <fstream>
#include <cassert>
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.141592653589793238... | 0 | 46,011,658 |
#include <bits/stdc++.h>
#define ll long long
#define PI 3.14159265358979323846
using namespace std;
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int a,b,k;
cin>>k>>a>>b;
for(int i=a;i<=b;i++){
if((i%k)==0)
return cout << "OK" << endl,0;
}
cout << "NG" << endl;
return 0... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX_N = 51;
int mp[MAX_N][MAX_N];
ll X[MAX_N], Y[MAX_N];
pair<ll, ll> dot[MAX_N];
int N, K;
int minmp(int i, int j) {
if(i >= 0 && j >= 0) return mp[i][j];
else return 0;
}
int main()
{
cin >> N >> K;
for(int i = 0; i < N; ++i)... | 0 | 18,254,519 |
#include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | #include <bits/stdc++.h>
#define rep(l, r) for (int i = (l); i < (r); i++)
typedef long long ll;
using namespace std;
int main() {
char b;
cin >> b;
switch (b) {
case 'A':
cout << 'T';
break;
case 'C':
cout << 'G';
break;
case 'G':
... | 0 | 5,682,557 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K, X;
cin >> K >> X;
if (K * 500 < X){
cout << "No";
}
else{
cout << "Yes";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
# define REP(i,n) for (int i=0;i<(n);++i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define p(s) std::cout << s ;
# define pl(s) std::cout << s << endl;
# define printIf(j,s1,s2) cout << (j ? s1 : s2) << endl;
# define YES(j) cout << (j ? "YES" : "NO") << endl;
# define ... | 0 | 96,286,795 |
#include <bits/stdc++.h>
using namespace std;
# define C continue;
# define R return
# define D double
# define I insert
# define ll long long
# define ld long double
# define ull unsigned long long
# define ui unsigned int
# define pb push_back
# define pf push_front
# define vi vector < int >
# define vc vector < cha... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, N) for (ll i = 0; i < (N); i++)
#define For(i, a, b) for (ll i = (a); i < (b); i++)
#define all(A) (A).begin(), (A).end()
const ll MOD = 1000000007;
ll modpow(ll n, ll r) {
ll... | 0 | 100,231,814 |
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <limits>
#include <queue>
#include <unordered_map>
#include <list>
#include <set>
using namespace std;
using ll = long long;
#define rep_init(i, init, n) for(in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(x) x.begin(), x.end()
#define mod 1000000007
typedef long long ll;
int main(){
int h, w;
cin >> h >> w;
vector<string> mp;
rep(i, h){
string str;
cin >> str;
mp.push_back(str);
}
vector<vec... | 0 | 77,710,674 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD=1e9+7;
const long double Pi=acos(-1);
int main(){
ll dp[100020];
ll x;
cin>>x;
dp[0]=1;
for(ll i=100;i<=x;i++){
if(dp[i]==0 && dp[max((ll)0,i-100)]==1)dp[i]=dp[max((ll)0,i-100)];
if(dp[i]==0 && dp[max((ll)0,i-101)]==1)dp[... | #include<bits/stdc++.h>
using namespace std;
int main() {
int H, W; cin >> H >> W;
vector<vector<int>> grid(H, vector<int> (W, -1));
queue<pair<int, int>> black;
for(int i = 0; i < H; i++) {
for(int j = 0; j < W; j++) {
char c; cin >> c;
if(c == '#') {
grid.at(i).at(j) = 0;
black... | 0 | 87,784,125 |
#include <iostream>
using namespace std;
int F[50];
int main() {
int n;
cin >> n;
F[0] = 1;
F[1] = 1;
for (int i = 2; i < 45; i++) {
F[i] = F[i-1] + F[i-2];
}
cout << F[n] << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<string>data_a(n);
vector<string>data_b(m);
for(int i=0;i<n;i++){
cin >> data_a.at(i);
}
for(int i=0;i<m;i++){
cin >> data_b.at(i);
}
bool exist=false;
for(int li=0;li<n;li++){
for(int lj=0;lj<n;lj++)... | 0 | 3,450,024 |
#include<stdio.h>
int main(){
int C=0;
for(int i=1;i<1000;i++)
{if(i%3==0)C+=200;else C+=195;}
int n,y,m,d;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d%d%d",&y,&m,&d);
if(y==0&&m==0&&d==0)break;
int c=0;
for(int i=1;i<y;i++)
{if(i%3==0)c+=200;else c+=195;}
for(int i=1;i<m;i++){
if(y%3==0)c+=20;
else if(i%2==0)c+=1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
if (k == 1||k == 2||k == 3||k == 5||k == 7||k == 11||k == 13||k == 15||k == 17||k == 19||k == 23||k == 29||k == 31){
cout << 1 << endl;
}
else if (k == 28||k == 30){
cout << 4 << endl;
}
else if (k == 8||k == 12||k == 18... | 0 | 65,483,124 |
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
string S;
cin >> S;
int N = S.size();
string T;
for (int i = 0; i < N; i += 2) {
T += S[i];
}
cout << T << endl;
return 0;
} | #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 | 32,042,573 |
#include <bits/stdc++.h>
#include<cstring>
using namespace std;
int main()
{
int i,k=0;
string s,t;
cin>>s>>t;
for(i=0;i<s.size();i++)
{
if(s[i]!=t[i])
k++;
}
if(k>0)
cout<<"No"<<endl;
else
cout<<"Yes"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int n;
vector<int> G[maxn];
int main() {
scanf("%d", &n);
for (int i = 1, u, v; i < n; i++) {
scanf("%d %d", &u, &v);
G[u].push_back(v), G[v].push_back(u);
}
function<int(int, int)> solve = [&](int v, int fa) {
... | 0 | 62,833,331 |
#include<iostream>
#include<algorithm>
using namespace std;
pair<int,int> A[100005];
long long Fr[100005];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>A[i].first;
A[i].second=i;
}
sort(A+1,A+n+1);
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | 0 | 89,480,548 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <climits>
#in... | #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 | 231,831 |
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=1000000... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int h,w;
cin >> h >> w;
char s[h][w];
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
cin >> s[i][j];
}
}
int flag = 0;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if(s[i][j] == '#'){
if(s[i-1][... | 0 | 46,314,709 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int sum = 0, rui = 0;
for(int i = 0; i < 3; i++) {
if(s[i] == 'R') rui++;
else rui = 0;
if(sum <= rui) sum = rui;
}
cout << sum << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define REP(i,x,n) for(int i = (x); i < (n); ++i)
#define ll long long
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF ... | 0 | 93,759,034 |
#include <iostream>
using namespace std;
int fiboArray[44] = {0};
int fibonacci(int anySection) {
if (anySection == 0 || anySection == 1)
return (fiboArray[anySection] = 1);
if (fiboArray[anySection] == 0) {
fiboArray[anySection] = fibonacci(anySection - 1) + fibonacci(anySection - 2);
return fiboArray[anySect... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | 0 | 94,591,692 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+5;
ll a[maxn], num[maxn];
int main()
{
ll n,p;
scanf("%lld%lld",&n,&p);
for(int i=1;i<=n;i++)
{
scanf("%1d",&a[i]);
}
ll ans=0;
if(p==2 || p==5)
{
for(int i=1;i<=n;i++)
{
if(a[i]%p == 0) ans+=i;
}
}
else
{
num... | #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 X=0;X<N+1;X++){
cin>>A[X];
}
for(int X=0;X<N;X++){
cin>>B[X];
}
long long K=0;
for(int X=0;X<N;X++){
if(B[X]<=A[X]){
K+=B[X];
A[X]-=B[X];
}
... | 0 | 7,709,957 |
#include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <functional>
using namespace st... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <cmath>
#include <queue>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
#define MAX... | 0 | 14,539,477 |
#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... | #include<bits/stdc++.h>
#define ASORT(arr, n) sort(arr,arr+n)
#define SORT(v) sort(v.begin(), v.end())
#define REV(v) reverse(v.begin(), v.end())
#define FOR(i, n) for (int i=0; i<n; i++)
#define fastIO() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PI ... | 0 | 3,191,314 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No... | 0 | 78,492,508 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define COUT(x) cout<<(x)<<endl
#define dump(x) cout << #x << " = " << (x) << endl;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
using M = map<int,int>;
using PQ = priority_queue<int>;
using ... | #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>;
#define chmax(x,y) x = max(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
int n, k;
cin >> n >> k;
vecto... | 0 | 72,992,343 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll,ll> P;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define EFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i, n) FOR(i,0,n)
#define IINF 1e9
int DFS(Graph& q, vector<bool>& vis, int x, int n){
bo... | #include <iostream>
using namespace std;
int main (int argc, const char * argv[])
{
int x,y;
while(1){
cin >>x>>y;
if(x==0&&y==0)break;
else if (x<y){
cout << x <<" "<<y<<endl;
}else{
cout << y <<" "<<x<<endl;
}
}
return 0;
} | 0 | 91,470,455 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i=0; i<n; ++i)
#define MAX_N 200000
vector<int> V;
int a[MAX_N];
int main() {
int n, k;
cin >> n >> k;
rep(i, n) cin >> a[i];
sort(a, a+n);
int num = a[0];
int cnt = 1;
for(int i=1; i<n; ++i) {
if(num==a[i]) ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;cin>>n;
vector<int> a(n);
rep(i,n)cin>>a[i];
int maxi=0,mini=1e9+7,tmp=1e9+7;
rep(i,n)maxi=max(maxi,a[i]);
rep(i,n)if(a... | 0 | 14,369,925 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define mp make_pair
#define PI pair<int,int>
#define poly vector<ll>
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(r);i>=(int)(l);i--)
#define pb push_b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(){
ll n;
string s;
cin>>n>>s;
ll x=s.size()-1;
string ans[4]={"SS","SW","WS","WW"};
for(int i=0;i<4;i++){
for(int j=1;j<x;j++){
if(s[j]=='o'){
if(ans[i][j]=='S')ans[i]+=ans[i][j-1];
else ans[i]+=(ans[i... | 0 | 88,205,973 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
usi... | #include<iostream>
using namespace std;
int main(){
int number;
int i=1;
while(1<3){
cin >> number;
if(number == 0){
break;
}
cout << "Case " << i << ": " << number << endl;
i++;
}
return 0;
} | 0 | 61,626,650 |
#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, k;
cin >> n >> k;
int m = (n-1) * (n-2) / 2 - k;
if (m < 0) {
cout << -1 << endl;
return 0;
}
cout << n-1+m << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n,m,a[200005],b[200005],c[200005]={};
cin>>n>>m;
for(int i=0;i<m;i++){
cin>>a[i]>>b[i];
if(b[i]==n){
c[a[i]]=1;
}
}
for(int i=0;i<m;i++){
if(a[i]==1){
if(c[b[i]]==1){
cout<<"P... | 0 | 30,474,527 |
#include <cstdio>
#include <cmath>
int main()
{
double a, b, C, c;
double pi = 4*atan(1), theta;
double S, L, h;
scanf("%lf %lf %lf", &a, &b, &C);
theta = C * pi / 180.;
h = b * fabs(sin(theta));
S = 0.5 * a * h;
c = sqrt(a*a + b*b - 2*a*b*cos(theta));
L = a + b + c;
printf("%lf ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < a)... | 0 | 61,921,876 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
const int mod=1e9+7;
int32_t main()
{
int n,k;
cin>>n>>k;
int x=n,y=0;
int make=0,last_make=0;
for(int i=0;i<k;i++)
{
make+=y;
y++;
last_make+=x;
x--;
}
int ans=(last_make-make+1)%mod;... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <tuple>
using namespace std;
using ll = long long;
#define rep(i, j, n) for(int i = j; i < (int)n; ++i)
#define rrep(i, j, n) for(int i = (int)n - 1; j <= i; -... | 0 | 55,604,019 |
#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<vector<ll>> VV;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define EPS (1e-7)
#define INF 1e9
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
int vx[]={0,1,0,-1};
int vy[]={1,0,-1,0};
int d... | 0 | 8,193,518 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll H, W;
cin >> H >> W;
vector<string> ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
#define INF 1000000000
#define all(x) (x).begin(), (x).end()
vector<int> dp;
vector<int> h;
int k;
int dfs(int i){
if(i <= 0){
return 0;
}
... | 0 | 19,497,877 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int> >;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define brep(n) for(int bit=0;bit<(1<<n);bit++)
#define erep(i,container) for (auto i : container)
#define irep(i, n) for(int i = n-1; i >= (int)0; i--)
#define ... | #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++)
ll gcd(ll a, ll b){
if(a < b) return gcd(b, a);
ll r = a % b;
while(r != 0){
a = b;
b = r;
r = a % b;
}
return b;
}
ll lcm(ll a, l... | 0 | 92,478,182 |
#include<iostream>
using namespace std;
int main()
{
int n; cin>>n;
if(n >= 400 && n <= 599)
cout<<8<<endl;
else if(n >= 600 && n <= 799)
cout<<7<<endl;
else if(n >= 800 && n <= 999)
cout<<6<<endl;
else if(n >= 1000 && n <= 1199)
cout<<5<<e... | #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>;
const int dx[] = {0, 1};
const int dy[] = {1, 0};
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector<vector<int>> d(h, vector<int>(w... | 0 | 53,312,191 |
#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>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const int INF = 1e9 + 10;
int main() {
string s;
cin >> s;
int n = s.size();
int ans = 0;
rep(i,... | #include <vector>
#include <cstdio>
#include <bitset>
#include <utility>
#include <cstdlib>
#include <sstream>
#include <fstream>
#include <set>
#include <map>
#include <deque>
#include <cmath>
#include <ctime>
#include <queue>
#include <stack>
#include <string>
#include <iostream>
#include <algorithm>
#include <functi... | 0 | 47,742,722 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long N;
unsigned long long ans = 1;
cin >> N;
bool zero = false;
bool ng = false;
for(long long i = 0; i < N; i++) {
unsigned long long tmp;
cin >> tmp;
if(tmp == 0) {
zero = true;
}
if(!zero && 1000000000000000000/ans < tmp) {
ng = tru... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define pb push_back
#define ff first
#define ss second
#define INF int(3e9)
#define BIG_INF ll(9e18)
#define SIZE 100001
#defin... | 0 | 94,996,347 |
#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); (... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iterator>
#include <numeric>
#include <bit... | 0 | 77,386,879 |
#include <iostream>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int64_t N, M;
cin >> N >> M;
unordered_map<int64_t, int64_t> count;
int64_t sum = 0;
count[sum]++;
rep(i, N) {
int a;
ci... | #include <iostream>
#include <string>
using std::cin;
using std::cout;
using std::endl;
using std::string;
int main(void) {
int n;
while (cin >> n) {
if (n == 0) {
break;
}
int times = 0;
bool status = 0;
bool left = 0;
bool right = 0;
for (in... | 0 | 22,135,689 |
#include<stdio.h>
int main(){
char str[20];
scanf("%[^\n]",&str);
str[5]= ' ';
str[13]= ' ';
printf("%s", str);
return 0;
} | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
double pi=acos(-1);
#define ll long long
#d... | 0 | 85,383,968 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=... | 0 | 9,710,195 |
#include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloa... | #include<iostream>
#include<stdio.h>
#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;}
voi... | 0 | 81,020,631 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll n, a, b;
cin >> n >> a >> b;
ll res = n / (a+b)*a;
ll r = n % (a+b);
res += min(r, a);
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#de... | 0 | 49,838,178 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | 0 | 31,844,112 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int w;
cin >> s >> w;
string ans;
for (int i = 0; i < s.length(); i++) {
if (i % w == 0) ans += s[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
const long long MOD=1e09+7;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define pb push_back
ll factorial(int n){
if (n==0){
r... | 0 | 11,626,793 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n, m;
cin >> n >> m;
vector<pair<int,int>> a(n), b(m);
for(int i = 0; i < n; i++)cin >> a[i].first >> a[i].second;
for(int i = 0; i < m; i++)cin >> b[i].first >> b[i].second;
for(int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
char s[30005];
bool dp[1005][4];
int main(){
int n;
scanf("%d%s", &n, s+1);
dp[0][0] = 1;
for(int i=1;i<=n;i++){
s[i] -= '0';
for(int j=999;j>=0;j--){
for(int k=2;k>=0;k--){
if(dp[j][k]){
dp[... | 0 | 90,659,015 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
long double a,b;
cin >> a >> b;
cout << (ll) (a * b + 1e-4) << endl;
} | #include<bits/stdc++.h>
using namespace std;
inline int rd(char c[]){
int i, sz=0;
for(;;){
i = getchar_unlocked();
if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
break;
}
}
c[sz++] = i;
for(;;){
i = getchar_unlocked();
if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF){
break;
... | 0 | 18,428,604 |
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
#define MAX(x,y) (x>y?x:y)
#define MIN(x,y) (x<y?x:y)
#define ABS(x) (x>0?x:-(x))
#define INF 2147483647
#define LLINF ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,ll> P;
const ll INF = 10010010010;
void warshall_floyd(int n, vector<vector<ll> > &D) {
rep(k,n) rep(i,n) rep(j,n) D[i][j]... | 0 | 41,452,798 |
#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <func... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
string b;
int cnt = 0;
cin >> s;
cin >> b;
rep(i, s.size()) {
if(s[i] != b[i]) {
cnt++;
}
... | 0 | 91,375,123 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define mod 1000000007
int main() {
int h, n, a, b;
cin >> h >> n;
vector<P> magic;
vector<ll> cost(h + 1, pow(10, 17... | #include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
void solve(std::string O, std::string E){
if (O.size() == E.size()) {
REP(i, O.size())
cout << O[i] << E[i];
cout << '\n';
} else {
char c = O[O.size() - 1];
REP(i, O.size() - 1)
... | 0 | 67,811,513 |
#include <bits/stdc++.h>
#define rep2(i,m,n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i,n) rep2(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
template <typename T>
T sq(T x){
return x * x;
}
signed main (){
char a,b;
cin >> a >> b;... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdint>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
template<int64_t Prime>
struct mod_int {
int64_t v_;
mod_int(int64_t x=0) : v_(x) { normalize(); }
void normalize() { ((v_ %= Prime) += Pri... | 0 | 33,443,769 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<queue>
#include<map>
#include<math.h>
#include<string>
#include <cctype>
#include <cstdlib>
#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++)
#define out(x) cout << x << endl
#defin... | #include <iostream>
int main(){
int a,b;
std::cin >> a >> b;
std::cout << "a ";
if(a==b){
std::cout << "==";
}
else if(a<b){
std::cout << "<";
}
else{
std::cout << ">";
}
std::cout << " b" << std::endl;
return 0;
} | 0 | 94,858,120 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #ifdef ARYANC403
#include "/home/aryan/codes/PastCodes/template/header.h"
#else
#pragma GCC optimize ("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize ("-ffloat-store")
#include<iostream>
#include<bits/stdc++.h>
#define dbg(args...)
#endif
usin... | 0 | 97,029,594 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int s, w;
cin >> s >> w;
if (w >= s)
{
printf("unsafe");
}
else
{
printf("safe");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (ll i = ((ll)(x)-1); i >= 0; i--)
#define RREPS(i, x) for... | 0 | 62,719,494 |
#include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG_OUTPUT
#define DEBUG_LOG(s) cout << s << endl;
#else
#define DEBUG_LOG(s) void();
#endif
int main(){
int n;
cin >> n;
vector<map<int, int>> v(2);
for (auto i = 0; i < n; i++) {
int a; cin >> a;
if (i % 2 == 0) v[0][a]++;
... | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | 0 | 93,293,313 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> n(3);
cin >> n[0] >> n[1] >> n[2];
sort(n.begin(), n.end(), greater<int>());
cout << n[0] * 10 + n[1] + n[2];
} | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n, m;
cin >> n >> m;
vector<in... | 0 | 28,943,285 |
#include<iostream>
#include<vector>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main()
{
vector<int> q(3);
rep(i,3) cin>>q[i];
int choose=2;
int min=1<<23;
for (int bit = 0; bit < (1<<3); bit++)
{
int cnt=0;
int buf=0;
for (int i = 0; i < 3; i++)
... | #pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>... | 0 | 3,199,935 |
#include <iostream>
#include<algorithm>
using namespace std;
int main() {
int n;
cin>>n;
int arr[n];
for (int i=0; i<n; i++){
cin>>arr[i];
}
sort(arr, arr+n);
int z = 0;
for (int i=0; i<n; i++){
int cnt = 0;
for (int j=0; j<n; j++){
if (arr[j]==arr[i]) cnt++;
else if (arr[j] ==arr[i]-1) cnt++;
el... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n{0};
cin>>n;
ll arr[n];
for(ll i=0;i<n;i++)
cin>>arr[i];
ll money=1000;
ll start{0};
for(ll i=0;i<n-1;i++){
if(arr[i+1]>ar... | 0 | 36,325,570 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;
typedef p... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
using llong = long long;
llong k;
llong a[100005];
llong res(ll... | 0 | 13,591,528 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvd = vector... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a,b;
int main()
{
int q;scanf("%d",&q);
while(q--)
{
scanf("%lld%lld",&a,&b);
ll s=a*b,ans;
ll t=sqrt(s);
if(t*(t+1)<s) ans=2*(t-1)+1;
else ans=2*(t-1);
if(t*t==s&&a!=b) ans--;
if(a*... | 0 | 6,483,059 |
#include<stdio.h>
#include<string.h>
char in[13];
int hash[10000000];
int n;
void insert(void);
void find(void);
int gethash(void);
int Getchar(char);
int main(){
char ins[7];
scanf("%d",&n);
while(n--){
scanf("%s%s",ins,in);
if(ins[0]=='i'){
insert();
}else{
find();
}
}
return 0;
}
void insert(){
h... | #include <stdio.h>
#define maxn 100010
struct node{
int to,next;
}e[maxn<<1];
int h[maxn],head[maxn],tot,cnt;
void add_edge(int u,int v){
tot++,e[tot].to=v,e[tot].next=head[u],head[u]=tot;
}
int main(){
int n,m,u,v,i,b,flag1,flag2;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)scanf("%d",&h[i]);
for(i=1;i<=m;i++){
scan... | 0 | 8,757,604 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.