code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
#define lli long long int
using namespace std;
using P = pair<int,int>;
int main(){
int N, b;
cin >> N;
int ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
int n;
cin >> n;
vector<int> a(n), b(n-1);
rep(i,n-1) cin >> b[i];
rep(i,n){
if(i == 0){
a[0] = b[0];
continue;... | 1 | 54,636,102 |
#include <bits/stdc++.h>
using namespace std ;
#define ll long long
map<pair<int,int>,int>mp;
int h , w , n , cnt[ 10 ] ;
int main(){
scanf( "%d%d%d" , &h , &w , &n ) ;
while( n -- ) {
int x , y ;
scanf( "%d%d" , &x , &y ) ;
for( int i = max( 1 , x - 2 ) ; i <= min( h - 2 , x ) ; i ++ ) {
for( int j = max( 1... | #include <bits/stdc++.h>
#define ll long long
#define rep2(i,a,b) for(int i=a;i<=b;++i)
#define rep(i,n) for(int i=0;i<n;i++)
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
const int N=1e6+10;
ll a[N];
int sum[11];
main(){
ios
int h,w,n;scanf("%d%d%d",&h,&w,&n);
h-=2,w... | 1 | 3,675,037 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll i,j,k,n,m,c,t;
scanf("%lld",&n);
ll a[n+4];
for(i=0;i<n;i++){
scanf("%lld",&a[i]);
} ll g=a[0];
for(i=1;i<n;i++){
g=__gcd(g,a[i]);
} printf("%lld\n",g);
} | #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... | 1 | 3,820,213 |
#include<iostream>
#include<map>
#include<cstring>
#include<stack>
using namespace std;
int main(){
int max_c = 0;
map<string, int> cnt;
stack<string> words;
string word, freq, max_l;
while(cin >> word) {
if(word.length() > max_l.length()) max_l = word;
if(cnt[word] == 0) words.push(word);
cnt[wor... | #include <iostream>
#include <string>
#include <map>
#include <algorithm>
using namespace std;
int main() {
string s;
map<string, int> word;
while(cin >> s) {
if(word.find(s) == word.end()) {
word.insert(make_pair(s, 1));
} else {
word[s]++;
}
}
string longs, manys;
int longn = 0, ma... | 1 | 12,918,280 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 5LL << 60;
const ll mod = 1e9 + 7;
int main() {
int ans[32] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int K;
cin >> K;
cout << ans[K - 1];
ret... | #include<cstdio>
#define ri register int
#define rc register char
#define ll long long int
#define rl register long long int
#define in inline
#define gc getchar
in int read()
{
ri x=0,p=1;
rc ch=gc();
while(ch<'0' || ch>'9')
{
if(ch=='-')
{
p=-1;
}
ch=gc();
}
while(ch>='0' && ch<='9')
{
x=x*10+ch-'... | 1 | 51,097,960 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
using namespace std;
#define fori(x) for (int i = 0; i < x; ++i)
#define forj(x) for (int j = 0; j < x; ++j)
typedef long long ll;
const int INF = 2e9 + 5;
const int alength=... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int n, k;
cin >> n >> k;
cout << (n % k != 0) << '\n';
}
signed ... | 1 | 6,440,061 |
#include<cstdio>
#include<iostream>
using namespace std;
int main(void){
int n, b, f, r, v, ko[4][3][10];
for(int i = 0; i < 4; ++i){
for(int j = 0; j < 3; ++j){
for(int k = 0; k < 10; ++k){
ko[i][j][k] = 0;
}
}
}
cin >> n;
for(int i = 0; i < n; ++i){
cin >> b >> f >> r >> v;
ko[b-1][f-1][r-1] +=... | #include<iostream>
#include<vector>
using std::cout;
using std::cin;
using std::endl;
using std::vector;
void printVector(vector<vector<int> > v) {
for (int i = 0; i < v.size(); i++) {
if (i % 3 == 0 && i != 0) {
cout << "####################" << endl;
}
for (int j = 0; j < v.fr... | 1 | 8,936,079 |
#include <iostream>
using namespace std;
int main() {
int n, k, x, y;
int cost;
cin >> n >> k >> x >> y;
if (n > k)
cost = x * k + y * (n - k);
else
cost = x * n;
cout << cost << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k, x, y;
cin >> n;
cin >> k;
cin >> x;
cin >> y;
int sum = 0;
for (int i = 0; i < n; i++)
{
sum += i < k ? x : y;
}
cout << sum << endl;
} | 1 | 90,428,649 |
#include <bits/stdc++.h>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using ull= unsigned long long;
const ll K_MAX=1e5+5;
const ll Lmax=ll(1e18);
const ll INF=1e6;
const int Nmax=2e5+1... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using ll=long long;
using namespace std;
int main(){
int a,b;
cin>>a>>b;
string A="";
string B="";
rep(i,b)
A+=to_string(a);
rep(i,a)
B+=to_string(b);
if(A>B) cout<<B<<endl;
else cout<<A<<endl;
return 0;
... | 1 | 72,806,287 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int count = 0;
for(int i=n; i <= m; i++) {
if(i / 10000 == i % 10 && i / 1000 % 10 == i % 100 / 10) {
count++;
}
}
cout << count << endl;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i, n)for(int i=0; i<n; i++)
int main(){
int A, B;
cin >> A >> B;
int ans = 0;
for(int i = A; i<=B; i++){
string str = to_string(i), rev = str;
reverse(rev.begin(), rev.end() );
if(str == rev... | 1 | 43,774,689 |
#include<iostream>
using namespace std;
typedef unsigned long long ull;
ull fact(int n){return n>1?n*fact(n-1):1;}
int main(){
int n;
cin>>n;
cout<<fact(n)<<endl;
} | #include<stdio.h>
int main(void)
{
long long int i,n,x=1;
scanf("%lld",&n);
for(i=1;i<=n;i++){
x=x*i;
}
printf("%lld\n",x);
return 0;
} | 1 | 49,468,236 |
#include <iostream>
using namespace std;
using ll = long long;
int main() {
string S;
string T;
cin >> S >> T;
int s = S.length(), t = T.length();
if (s >= t) {
for (int i = s-t; i >= 0; --i) {
bool flag = true;
for (int j = 0; j != t; ++j) {
if (S[i+j] != '?' && S[i+j] != T[j]) {
... | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using P = pair<int, int>;
int main(){
string s, t;
cin >> s >> t;
bool can = false;
int index = 0;
re... | 1 | 95,250,883 |
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<iomanip>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#... | #include<iostream>
using namespace std;
bool check(char x){
char a[12]="yuiophjklnm";
for(int i=0;i<11;i++)if(a[i]==x)return true;
return false;
}
int main(){
string s;
while(cin>>s,s!="#"){
bool now = check(s[0]);
int ans = 0;
for(int i=1;i<s.size();i++){
if(chec... | 1 | 7,490,855 |
#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#i... | #include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <cassert>
using namespace std; typedef long long ll; const int MINF=-1e9; typedef pair<int,int> P;
int main() {
int n,k; cin>>n>>k;
ll a[n]; for(int i=0;i<n;i++) cin>>a[i];
ll b1[n], b2[n]; b1[0]=max(0LL,a[0]); b2[n-1]=max(0LL,a[n... | 1 | 63,943,904 |
#include <iostream>
using namespace std;
#define MAX 100005
#define NIL -1
struct node{
int parent;
int left;
int right;
};
node T[MAX];
int depth[MAX];
int n;
void print(int u){
cout<<"node "<<u<<": ";
cout<<"parent = "<<T[u].parent<<", ";
cout<<"depth = "<<depth[u]<<", ";
if(T[u].parent ==... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<vector<int>> e;
vector<int> pa;
vector<int> d;
void dfs(int id, int depth) {
d[id] = depth;
for ( int i = 0; i < e[id].size(); i++ ) {
dfs(e[id][i], depth + 1);
}
}
int main() {
int N;
cin >> N;
e.resize(N, vector... | 1 | 78,427,322 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef pair<int,int> ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n;
int a[200010];
int b[200010];
signed main(){
cin >> n;
int sum = 0;
bool tmp = true;
for(int i = 0;i < n;i++){
cin >> a[i] >> b[i];
sum += a[i];
tmp = tmp && a[i] == b[i];
}
if(tmp){
cout <... | 1 | 94,842,431 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
string s;
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 1 | 98,188,593 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int,int> pii;
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
#define per(i,a,b) for(int i=(b)-1; i>=(a); --i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).si... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<cassert>
#include<numeric>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(i... | 1 | 28,639,549 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M);
rep(i,M) cin >> a[... | #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
cer... | 1 | 1,892,498 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int32_t main()
{
string s;
cin>>s;
int res=1;
for(int i=0;i<s.size()-1;i++){
if(s[i]!=s[i+1])res++;
}
cout<<res-1<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
string s;
cin>>s;
char lst = 0;
int changes = 0;
for (auto i:s){
if(lst != i){
changes++;
lst = i;
}
}
cout<<changes-1;
return 0;
} | 1 | 95,207,242 |
#include <iostream>
#include <string>
using namespace std;
class DICE{
private:
int D[6];
public:
DICE(int*);
int get();
void roll(char);
void set(int, int);
};
DICE::DICE(int* number){
for(int i = 0; i < 6; ++i){
D[i] = number[i];
}
}
int DICE::get(){
return D[0];
}
void DICE::roll(char order){
int exchange... | #include<bits/stdc++.h>
using namespace std;
vector<int> dice(7);
vector<int> tmp(7);
void change_dice(char c){
for(int i=1; i<=6; i++){
tmp[i]=dice[i];
}
if(c=='E'){
dice[1]=tmp[4];
dice[3]=tmp[1];
dice[4]=tmp[6];
dice[6]=tmp[3];
}
else if(c=='N'){
di... | 1 | 71,401,284 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,m,v,p;
int a[100005],b[100005],sum[100005];
map<int,int> tr[100005];
void upt(int x,int v,int c){
while(x<=n) tr[x][v]+=c,x+=(x&-x);
}
int query(int x,int v){
int res=0;
while(x) res+=tr[x][v],x-=(x&-x);
return res;
}
signed main(){
cin>>n>>m... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, V, P;
int64_t M;
cin >> N >> M >> V >> P;
vector<int> A(N);
for (int i = 0; i < N; i++)
{
cin >> A.at(i);
}
sort(A.rbegin(), A.rend());
int Ab = A.at(P - 1);
int64_t acc = 0;
vector<int64_t> diff(N);
... | 1 | 21,766,312 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
ll gcd(ll a, ll b)
{
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
return gcd(a % b, b);
}
int main()
{
ll n, k;
cin >> n >> k;
... | #include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#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_... | 1 | 95,408,253 |
#include <bits/stdc++.h>
using namespace std;
map<int, int> primeFactor(int n){
map<int, int> ret;
for (int i = 2; i*i <= n; i++){
while(n%i==0) {
ret[i]++;
n /= i;
}
}
if (n !=1 ) ret[n]++;
return ret;
}
map<int, int> factorialPrimes(int n){
if (n==1) {
map<int, int> blank;
re... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#inclu... | 1 | 92,896,127 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
retu... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
const long long MOD = 998244353;
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;... | 1 | 50,485,947 |
#include <bits/stdc++.h>
#define ll long long
#define ls id << 1
#define rs id << 1 | 1
#define mem(array, value, size, type) memset(array, value, ((size) + 5) * sizeof(type))
#define memarray(array, value) memset(array, value, sizeof(array))
#define pb(x) push_back(x)
#define st(x) (1LL << (x))
#define pii pair<int, i... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
#define max(a, b) ((a>b)?a:b)
#define min(a,b) ((a<b)?a:b)
#define fori(i, n) for(ll i=0; i<n; ++i)
typedef long long ll;
ll n, d, a, x, h;
int main(){
scanf("%lli%lli%lli", &n, &d, &a);
d = 2*d;
vector... | 1 | 15,347,431 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << a/b <<' '<< a%b <<' ';
printf("%.16f",(double)a/(double)b);
} | #include <iostream>
#include <iomanip>
using namespace std;
int main() {
long a, b;
cin >> a >> b;
long d = a / b;
long r = a % b;
double f = a * 100000 / b / 100000.0;
cout << d << " ";
cout << r << " ";
cout << fixed << setprecision(5) << f << " " << endl;
return 0;
} | 1 | 42,458,774 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int n ;
cin>>n ;
vector<ll> v(n) ;
rep(i,n){
cin>>v[i] ;
}
rep(i,n){
if(v[i]==0){
cout<<0 ;
return ;
}
}
ll prod=1 ;
rep(i,n){
if(v[i]<=1... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long int> vec(n);
for (int i = 0; i < n; i++){
long int a;
cin >> a;
vec.at(i) = a;
if(vec.at(i) == 0){
cout << 0 << endl;
return 0;
}
}
sort(vec.begin(),vec.end());
reverse(vec.begin(),vec.end... | 1 | 44,463,980 |
#include<cstdio>
using namespace std;
const int MAXN = 110;
int a[MAXN], c[MAXN];
int main(){
int N, d = 0;
scanf("%d", &N);
for (int i = 1; i <= N; ++i){
scanf("%d", &a[i]), ++c[a[i]];
if (a[i] > d)
d = a[i];
}
bool flag = 0;
if (d & 1){
if (c[d + 1 >> 1] != 2)
flag = 1;
for (int i = d + 1 >> 1; i ... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#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(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) f... | 1 | 35,640,469 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <cassert>
typedef long long ll;
using namespace std;
#define mod 1000000007... | #include <iostream>
#include <set>
#include <map>
using namespace std;
int main(){
int n,a,b,c,x;
while(cin >> n >> a >> b >> c >> x && n){
int key[100];
for(int i = 0 ; i < n ; i++) cin >> key[i];
int t = 0 , T = 0;
if(x == key[0]) t++;
while(t < n && ++T <= 10000){
x = (a * x + b) % c;
if(x==key[t])... | 1 | 83,570,219 |
#include <iostream>
#include <algorithm>
#include <sstream>
using namespace std;
string itos(int n){
stringstream ss;
ss << n;
return ss.str();
}
string table = "mcxi";
int value[] = {1000,100,10,1};
int from(string s){
int num = 0;
int ans = 0;
for(int i = 0 ; i < s.size() ; i++){
if(~table.find(s[i])){
int... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#ifdef DEBUG
#define line() cout << "[... | 1 | 50,773,895 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
int r;
cin >> r;
if(r < 1200) cout << "ABC" << endl;
if(1200 <= r && r < 2800) cout << "ARC" << endl;
if(2800 <= r) cout << "AGC" << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
ll exp... | 1 | 80,533,158 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int n ;
cin>>n ;
vector<int> a(n+1) ;
vector<int> b(n) ;
rep(i,n+1){
cin>>a[i] ;
}
rep(i,n){
cin>>b[i] ;
}
ll ans=0 ;
rep(i,n){
int x=min(a[i],b[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N+1);
vector<ll> B(N);
for (ll i=0; i<N+1; i++) {
cin >> A.at(i);
}
for (ll i=0; i<N; i++) {
cin >> B.at(i);
}
ll count = 0;
for ... | 1 | 40,256,470 |
#include <iostream>
using namespace std;
struct Card
{
char suit;
char value;
};
int N;
Card t,t1;
void print(struct Card A[], int N);
void bubble(struct Card A[], int N);
void selection(struct Card A[], int N);
bool isStable(struct Card A[], struct Card B[], int N);
int main()
{
Card A[100], B[100];
cin >> N;
for... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
struct Card
{
string val;
size_t order;
};
bool is_smaller(Card a, Card b)
{
if (stoi(a.val.substr(1,1)) < stoi(b.val.substr(1,1)))
return true;
else
return false;
}
void bubble_sort(vector<Card> *cards, size_t n)
{
for (size_t i=0; i... | 1 | 37,430,264 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << e... | #include <bits/stdc++.h>
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int iy[]={0, 0, 1, -1};
int ix... | 1 | 45,305,347 |
#include <bits/stdc++.h>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rp(i,n) for (int i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define all_acc(x) (x).begin(), (x).end(), 0LL
#define int long long
#define absSort(v) sort(a.begin(), a.end(), [](int i, int j... | #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 int MOD = 1000000007;
const ll INF = 1LL<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retur... | 1 | 64,456,269 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,i;
cin >> n >> i;
int ans = n%i;
if(ans==0) cout << 0 << endl;
else cout << 1 << endl;
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#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 pcnt(bit) __builtin_popcountll(bit)
#define mod 1000000007
#define pi acos(-1.0)
using namesp... | 1 | 45,009,916 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s; cin >> s;
int sn = s.size();
int a1 = 0,a2 = 0;
rep(i,sn) {
if ( i % 2 != s[i] - '0') a1+... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int dp[N],dp1[N];
int main(){
string s;
cin>>s;
int n = s.size();
for(int i=1;i<=n;i++){
dp[i] = dp[i-1]^1;
}
dp1[1] = 0;
for(int i=2;i<=n;i++){
dp1[i] = dp1[i-1]^1;
}
int cnt = 0;
for(int i=0;i<n;i++){
if(s[i]-'0... | 1 | 66,094,271 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi = 3.14159265358979323846;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define MOD 1000000007LL
#define PS(p) cout << setprecision(15) << fixed << p << endl;
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
#define A... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 1 | 80,728,473 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if(a == 1 && b != 1)cout << "Alice" << endl;
else if(a != 1 && b == 1)cout << "Bob" << endl;
else if(a < b)cout << "Bob" << endl;
else if(a == b)cout << "Draw" << endl;
else cout << "Alice" << endl;
} | 1 | 77,473,267 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
ll a,b,k;
cin >> a >> b >> k;
rep(i,k/2){
if(a%2==1)a--;
b+=a/2;
a/=2;
if(b... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | 1 | 69,204,194 |
#include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++ )
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
int main(){
string s;
cin >> s;
if(s.at(0) == 'A' && s.at(s.size()-1) !... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
string s;
... | 1 | 85,672,040 |
#include<bits/stdc++.h>
#define ll long long
#define int ll
#define fi first
#define si second
#define ... | #include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
using ll=long long;
#define fi first
#define se second
#define pb push_back
#define rep(i,n) for(int i=0; i<(int)(n); i++)
ll dp0[110][5], dp1[110][5];
int main() {
string s;
cin >> s;
int K;
cin >> K;
int t = s.length();
int q = s[0] - '0';
... | 1 | 75,356,551 |
#include<iostream>
using namespace std;
int main(){
int h, w;
while(1){cin >> h >> w;
if(h==0&&w==0)break;
for(int j=1; j<=h; j++){
if(j==1||j==h){
for(int i=1;i<=w;i++){
cout<<"#";
}
}else{
for(int i=1; i<=w; i++){
if(i==1||i==w){
cout<<"#";
}else{
cout<<".";
}
}
}cout<<"\n";
}cout<<"\n";
}
} | #include<stdio.h>
int main(void)
{
int a,s,d,f,g,h,j,i;
while(1){
scanf("%d %d",&a,&s);
if(a==0&&s==0)
break;
for(i=0;i<s;i++)
printf("#");
printf("\n");
for(i=1;i<a-1;i++){
printf("#");
for(j=1;j<s-1;j++)
printf(".");
printf("#\n");
}
if(a!=1){
for(i=0;i<s;i++)
printf("#");
... | 1 | 51,830,318 |
#include <bits/stdc++.h>
#include <limits>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
#define fi(i, n) for( int i=0 ; i<n ; i++ )
#define f(i, a, b) for( int i=a ; i<b ; i++ )
#define vi vector<int>
#define pb push_back
#define MOD 1000000007
int gcd(int a, int b)
{
if (b == ... | #include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{
long long int a,b,k,m,n;
cin>>a>>b>>k;
if (a>=k)
{
m=a-k;
n=b;
cout<<m<<" "<<n<<endl;
}
else if(a+b<=k)
{
m=0;
n=0;
cout<<m<<" "<... | 1 | 57,549,738 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
for(int i=0;i<s.size();i++) {
if(s[i] == '1') s[i] = '9';
else if(s[i] == '9') s[i] = '1';
}
cout << s << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#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
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using nam... | 1 | 62,640,297 |
#include <iostream>
#include <iomanip>
#include <string>
#include <map>
#include <unordered_map>
#include <cmath>
#include <algorithm>
typedef long long ll;
typedef long double ld;
using namespace std;
int main()
{
string a, b;
cin >> a >> b;
cout << b << a << endl;
} | #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;
int euqlid (int a, int b){
int temp;
temp = a % b;
if(temp == 0)return b;
return euqlid(b,temp);
}
ll conbination(ll a,ll b){
ll u = 1;
ll d = 1;
while(b != 0){
u *... | 1 | 13,654,977 |
#include <iostream>
int main(void)
{
int x, y, W, H, r;
std::cin >> W >> H >> x >> y >> r;
if((r <= x && x <= W-r) && (r <= y && y <= H-r)) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
return 0;
} | #include <iostream>
using namespace std;
const string YES = "Yes";
const string NO = "No";
int main(void)
{
int W, H, x, y, r;
string answer = YES;
cin >> W >> H >> x >> y >> r;
if(x - r < 0) answer = NO;
if(y - r < 0) answer = NO;
if(W < x + r) answer = NO;
if(H < y + r) answer = NO;
co... | 1 | 34,805,156 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <queue>
#include <vector>
#include <math.h>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
#include <cctype>
#include <cstdlib>
using namespace std;
#define INF (1 << 20)
#define EPS (1e-10)
#define EQ(a,b) (fabs((a)-(b)) < EPS)
int main... | #include<iostream>
using namespace std;
int main(){
int n;
cin >>n;
while(n--){
double a[2],b[2],c[2],d[2];
cin >>a[0]>>a[1]>>b[0]>>b[1]>>c[0]>>c[1]>>d[0]>>d[1];
b[0]-=a[0];
b[1]-=a[1];
d[0]-=c[0];
d[1]-=c[1];
if(b[0]*d[1] == b[1]*d[0]){cout <<"YES"<<endl;}
else{cout <<"NO"<<endl;}... | 1 | 4,228,718 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main(){
int h,w,a,b;
cin >> h >> w >> a >> b;
rep(i,h){
bool rev_fl = i<b;
rep(j,w){
if(j<a){
if(rev_fl) cout << 1;
else cou... | #include<cstring>
#include<algorithm>
#include<string>
#include<cstdio>
#include<iostream>
#include<queue>
using namespace std;
int T,n,m;
int a[2010][2010];
int read()
{
int f=1,x=0;
char ch=getchar();
while(ch>'9'||ch<'0')
{
if(ch=='-')
f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9')
{
x=x*10+ch-'0';
... | 1 | 36,812,107 |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
vector<ll> A(N), B(N);
rep(i,0,N-1) cin >> A[i] >> B[i];
ll p = 0;
for (ll i = N-1; 0 <= i; --i)
{
ll d = A[i] + p;
if (d % B[i] != 0)
{
p += B[i] -... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
long long modpow(long long a, long long n, long long m)
{
long long ans = 1;
while (n)
{
if (n & 1)
{
ans = (ans * a) % m;
}
a ... | 1 | 53,913,705 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for(int i = s;i < (int)(n);i++)
typedef long long ll;
int main(){
ll n,m;
priority_queue <int> PQ;
pair <int,int> a[100006];
scanf("%lld %lld", &n ,&m);
int i;
for(i = 0;i < n;i++){
scanf("%d %d", &a[i].first, &a[i].second);
}
sort(a,a... | #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 INF (1ll<<55)
#define mod 1000000007
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return true;} return false;}
template<class T> inline bool ... | 1 | 94,135,290 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
const ll MOD = 1e9 + 7;
int n;
cin >> n;
ll a[n];
rep(i, n) cin >> a[i];
ll ans = 0;
rep(bit, 61) {
int one = 0, zero = 0;
rep(i, n) {
if... | #include<bits/stdc++.h>
using namespace std;
long long unit = 1;
long long moder = 1000000007;
int main(){
int n;
cin>>n;
long long bit[61]={0};
for(int i=0; i<n; i++){
long long num;
cin>>num;
for(int j=0; j<=60; j++){
if((unit<<j)&num) bit[j]++;
}
}
long long ret = 0;
for(int i=0; i<=60; i++){
lon... | 1 | 93,914,077 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define endl '\n'
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define al... | #include <bits/stdc++.h>
using namespace std;
int main() {
int Hs, Ms, Hg, Mg, K;
cin >> Hs >> Ms >> Hg >> Mg >> K;
int S, G;
S = 60 * Hs + Ms;
G = 60 * Hg + Mg;
cout << G - K - S << endl;
} | 1 | 89,550,135 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,k;
cin >> n >> k;
double res = 0.0;
for(int i=1; i<=n; i++){
double prob = 1.0/n;
int temp = i;
while(temp<k){
temp*=2;
prob/=2;
}
res += prob;
}
cout << fixed << setprecision(10) << res;
return ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i,a,n) for(ll i=a;i<(ll)(n);i++)
int main(){
long N,K; cin>>N>>K;
double sum = 0;
rep(i, N){
long s = i+1;
int j=0;
while(s < K){
... | 1 | 45,954,070 |
# include <bits/stdc++.h>
# define A first
# define B second
# define PII pair<int,int>
using namespace std;
const int maxn = 1<<18;
int a[maxn+3];
PII imax[maxn];
void fun(int x, PII &y)
{
if(x == y.A || x == y.B) return;
if(a[x] > a[y.A]) y.B = y.A,y.A = x;
else if(a[x] > a[y.B]) y.B=x;
}
int main()
{
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN... | 1 | 15,528,311 |
#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;
const ll inf = 2e18;
int n;
ll a[maxn];
ll racc[maxn];
ll mul(ll x, ll y) {
if... | #include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int main(){
long long n;
cin >> n;
long long a[n+1], b[n+1];
for(long long i = 0; i <= n; i++){
cin >> a[i];
}
if(n == 0){
if(a[0] == 1){
cout << 1 << endl;
return 0;
}
... | 1 | 54,078,085 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int len, goal;
cin >> len >> goal;
cout << len * len - goal;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n,a;
cin>>n>>a;
cout<<n*n-a<<endl;
} | 1 | 23,941,457 |
#include <iostream>
using namespace std;
int main(){
string S;
cin >> S;
int N = S.length();
int cnt = 0;
for(int i = 0; i < N; i++){
if(S[i] == 'o')cnt++;
}
int win = 15 - N + cnt;
cout << ((win >= 8) ? "YES" : "NO") << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int N=s.size();
int a=15-N;
for(int i=0;i<N;i++)
if(s.at(i)=='o')a++;
if(8<=a)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
return 0;
} | 1 | 39,175,470 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector <int> a(n);
vector <int> dp(n);
for(int i = 0; i < n; i++){
cin >> a[i];
dp[a[i]-1]=i+1;
}
for(int i = 0; i < n; i++){
cout << dp[i] << " ";
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<pair<int,int>> A(N);
for(int i=0;i<N;i++){
int a;
cin>>a;
A.at(i)=make_pair(a,i);
}
sort(A.begin(),A.end());
for(int i=0;i<N;i++){
int a;
tie(ignore,a)=A.at(i);
cout<<a+1<<" ";
}
cout<<endl;
} | 1 | 77,557,915 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
string s;
cin >> s;
rep(i,3){
if(s.at(i) =='1') s.at(i) = '9';
else s.at(i) = '1';
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;cin>>S;
for(int X=0;X<3;X++){
if(S[X]=='1')
S[X]='9';
else
S[X]='1';
}
cout<<S<<endl;
} | 1 | 5,026,945 |
#include <iostream>
#include <queue>
using namespace std;
int D[110]={0};
void bfs(int src,int n,int g[110][110]){
queue<int> Q;
Q.push(src);
D[src]=0;
while (! Q.empty()){
int cur =Q.front();
Q.pop();
for(int r=0;r<n;r++){
if (g[cur][r]==1&&D[r]==0){
D[r]=D[cur]+1;
Q.push(r);
}
}
}
}
int main() {
int n,g... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
using P = pair<int, int>;
const int MAX = 101;
vector<int> G[MAX];
int d[MAX];
int main() {
int n;
cin >> n;
fill(d, d + MAX, -1);
for (int i = 0; i < n; i++) {
int u, k;
cin >> u >> k;
for (int j = 0; j ... | 1 | 79,826,211 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww
{
cww()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long ... | # include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
int main() {
lint x,y,ans; cin >> x >> y;
if(abs(x) == abs(y)) {
ans = 1;
} else if(abs(x) < abs(y)) {
... | 1 | 6,802,515 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
template <typename T>
constexpr T INF = numeric_limits<T>::max() / 10;
template <typename T>
int LongestIncreasingSubsequence(const vector<T>& a)
{
const int n = a.size();
vector<T> dp(n, INF<T>);
for (int ... | #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 ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int N_MAX = 100000;
int N;
vector<int> A(N_MAX);
vec... | 1 | 94,970,737 |
#include <iostream>
#include <time.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
int num = 1;
int ans = 0;
for(int i = 0; i < n; i++){
cin >> a[i];
if(a[i] != num){
ans++;
}else num++;
}
if(num == 1) ans = -1;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)x.size();
using namespace std;
const int maxN=2e5+5;
int n,a[maxN];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
int cur=1;
for(int i=0;i<n;i++){
if(a[i]==cur)cur++;
}
cout<<(cur... | 1 | 16,592,236 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, l, q, a[100005] = {}, h[18][100005] = {}, x, y;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
cin >> l >> q;
for (int... | #include<iostream>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<algorithm>
#include<cstdio>
#include<iomanip>
#include<queue>
#include<stack>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const ll inf = 1LL << 60;
int main(){
cin.tie... | 1 | 55,746,380 |
#include <iostream>
#include <string.h>
using namespace std;
int main(){
int n,i,lr[2],flag=0,count;
string data;
lr[0]=1;
lr[1]=1;
while(1){
count=0;
flag=0;
cin >> n;
if(n==0) break;
for(i=0;i<n;i++){
cin >> data;
if(data=="lu") lr[0]=2;
if(data=="ld") lr[0]=1;
if... | #include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<queue>
#include<algorithm>
#include<complex>
#include<cstdlib>
#include<cctype>
#define REP(i,n) for(int i = 0;i < (n);i++)
#define PB push_back
#define MP make_pair
#define SHOW1d(v,n) {for(int i = 0;i < (n);i++)cout << v[i] << ' ';cout << ... | 1 | 11,622,362 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,x;
cin>>a>>b>>x;
bool ok=false;
if(x>=a){
if(x-a<=b){
ok=true;
}
}
if(ok){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
}
return 0;
} | #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;
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)
#define inf 1000000000000000LL
#define F... | 1 | 94,327,152 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, s;
while (cin >> n >> s && !(n == 0 && s == 0)) {
vector<bool> arr(10, true);
for (int i = 0; i < n; i++) {
arr[i] = false;
}
int ans = 0;
do {
int m = 0;
for (int i = 0; i < 10;... | #include <iostream>
#include <cstring>
#include <stack>
using namespace std;
struct set { int next, sum, depth; };
int n, s, cnt;
void dfs(int next, int sum, int depth) {
stack<set> S;
set tmp;
tmp.next = next; tmp.sum = sum; tmp.depth = depth;
S.push(tmp);
while (!S.empty()) {
set u = S.top... | 1 | 40,983,848 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<iomanip>
#include<sstream>
#include<cmath>
#include<bitset>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <= n; i++)
#define rrep(i,n) fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const int N = 1e5;
ll cnt[N+100];
ll bigmod(ll a,ll b)
{
if(b==0){
return 1;
}
ll x = bigmod(a,b/2);
x = (x*x)%mod;
if(b%2){
x = (x*a)%mod;
}
return x;
}
int main()
{
int n,k;
ll ans = 0;
scanf("%d%d",&n,&k);
for(in... | 1 | 62,906,559 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,sum=0;
cin >> A >> B >> C;
bool a=false;
for(int i=A;i<B*A+1;i+=A){
sum+=A;
if(sum%B==C){
a=true;
break;
}
}
if(a){
cout << "YES" << endl;
}
else{
cout << "NO" << endl;
}
} | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int a, b, c;
cin >> a >> b >> c;
for(int i = 0; i <= 1e4; ... | 1 | 87,538,545 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n;
cin >> n;
vector<ll> a(n+1),b(n);
rep(i,n+1){
cin >> a.at(i);
}
rep(i,n){
cin >> b.at(i);
}
ll ans=0,q=0;
rep(i,n){
if(a.at(i)+a.at(i+1)<=b.at(i)){
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(int i=0;i<N;i++)
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(right - left > 1)... | 1 | 100,167,450 |
#include <stdio.h>
int main(){
int W = 0;
int H = 0;
int x = 0;
int y = 0;
int r = 0;
bool judge = true;
scanf("%d %d %d %d %d", &W, &H, &x, &y, &r);
if ((x - r) < 0 || (x + r) > W){
judge = false;
}
if ((y - r) < 0 || (y + r) > H){
judge = false;
}
printf("%s\n", (judge ? "Yes" : "No"))... | #include <bits/stdc++.h>
using namespace std;
int main() {
int W, H, x, y, r;
cin >> W >> H >> x >> y >> r;
bool judge = true;
if (x-r < 0 || x+r > W) {
judge = false;
}
if (y-r < 0 || y+r > H) {
judge = false;
}
if (judge) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | 1 | 9,099,235 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(){
int a,b;
std::cin >> a>>b;
if(a>b){
std::cout << "a > b" << '\n';
}else if(a<b){
std::cout << "a < b" << '\n';
}else {
std::cout << "a == b" << '\n';
}
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
printf("a %s b\n", (a == b ? "==" : (a > b ? ">" : "<")));
return 0;
} | 1 | 25,454,482 |
#include <cstdio>
int main()
{
int a,b;
scanf("%d %d",&a,&b);
if((a+b)%2 == 0)
{
printf("%d",(a+b)/2);
}
else if((a+b)%2 != 0)
{
printf("%d",((a+b)/2)+1);
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double a, b, mean;
int ans;
cin >> a >> b;
mean = (a + b) / 2;
mean += 0.5;
ans = int(mean);
cout << ans << endl;
} | 1 | 98,337,592 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using edge = pair<int, ll>;
using Graph = vector<vector<int>>;
using WeightedGraph = vector<vector<edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
vector<int> ans(10);
rep(i,4){
int n;cin>>n;
ans[n]++;
}
if(ans[1]==1&&ans[7]==1&&ans[9]==1&&ans[4]==1)cout<<"YES"<<endl;
else cout<<"NO"<... | 1 | 90,710,899 |
#include <iostream>
#include<vector>
#include<algorithm>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
int main() {
vector<int>demand(5);
rep(i,5)cin>>demand[i];
rep(i,4){
if(demand[i]%10){
if(demand[i+1]%10==0)swap(demand[i],demand[i+1]);
else if(demand[... | #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() {
vector<int> time(5);
rep(i,5) cin >> time[i];
vector<int> nexttime(5);
rep(i,5) {
nexttime[i] = 10*((time[i]+9)/10);
}
int ans = 10010010... | 1 | 4,846,862 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
int main() {
string s, a, b;
cin >> s;
while (1) {
s.erase(s.begin() + s.size() - 1);
a = s.substr(0, s.size() / 2);
b = s.substr(s.size() / 2, s... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
string S;
cin >> S;
int N = S.size();
if (N%2 == 0) S = S.substr(0,N-2);
else S = S.substr(0,1);
while (1) {
N = S.size();
string sl = S.substr(0, N/2);
string sr = S.substr(N/2, N/2... | 1 | 94,439,020 |
#include<cstdio>
const int MAX = 2e5 + 5;
int a[MAX];
int main() {
int n;
long long sum = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", a + i);
sum += a[i];
}
long long left,right,temp;
left = sum - a[n - 1];
right = a[n - 1];
long long min = left > right ? left - right : right - left;
le... | #include<iostream>
#include<iomanip>
#include<math.h>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<set>
#include<vector>
using namespace std;
#define INF 1<<21
#define MAX 100005
#define MOD 10e9+7
int main(){
int N;
int a[200005];
long long x=0,y=0;
long long ans=0;
cin>>N;
... | 1 | 20,352,293 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <bitset>
using namespace std;
typedef long long ll;
int ma... | #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... | 1 | 88,473,293 |
#include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <numeric>
#include <climits>
#include <cassert>
using namespace std;
typedef unsigned int uint... | #if 0
はじめ、cを0~N-1で解いていたが、途中で0~Nで解くべきことに気が付いた。
また、c-C[i]>=0の時の、最小値の比較対象をc-C[j] (j <= i)の時も考えていたため解けなかったが、日を置いたら誤りに気が付いて解くことができた。
#endif
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int N, M;
int C[25];
int cnt[25][50010];
int main() {
cin >> N >> M;
for (int i = 0; i < M; i++) cin >> C[i];... | 1 | 22,235,972 |
# include <bits/stdc++.h>
# define rep(i, n) for (ll i = 0; i < (n); i++)
# define reps(i, n) for (ll i = 1; i <= (n); i++)
# define foreps(i, m, n) for (ll i = (m); i < (n); i++)
# define len(x) ((int)(x).size())
# define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 1 | 63,954,159 |
#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... | #include<bits/stdc++.h>
using namespace std;
string s;
int n, pos;
bool vis[27];
int main() {
cin>>s;
n = s.size();
if(s == "zyxwvutsrqponmlkjihgfedcba") {
cout<<-1<<endl;
return 0;
}
if(n < 26) {
for(int i = 0; i < n; i++)
vis[s[i] - 'a' + 1] = 1;
cout<<s;
for(int i = 1; i <= 26; i++)
if(!vis[i])... | 1 | 11,383,825 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,A) for(int i = 0;i < A;i++)
int main() {
int A;
cin >> A;
int B[100100];
int C = A / 2;
int D = A / 2 - 1;
rep(i,A){
cin >> B[i];
}
sort(B,B + A);
int Ans = B[C] - B[D];
cout << Ans << endl;
} | 1 | 28,468,913 |
#include <bits/stdc++.h>
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
#define ll long long
#define fr first
#define sc second
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
const ll mod = 1e9 + 7;
ll cache[2200];
ll solve(int n) {
if (n <= 2) return 0;
ll& ret =... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 8;
const ll MOD = 1e9 + 7;
const ll LLINF = 1e... | 1 | 87,065,624 |
#include <iostream>
#include <vector>
using namespace std;
int a[1000000]={};
int main(){
int n,ans=0;
vector<int> v;
for(int i = 2; i*i < 1000000; i++){
for(int j = 0; j < 1000000; j+=i){
if(i!=j) a[j]=1;
}
}
while(cin >> n){
for(int j = 2; j <= n; j++){
if(a[j]==0) ans++;
}
cout << ans << endl;
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<cstdio>
#include<string>
#include<cmath>
typedef long long int ll;
using namespace std;
bool priN[1000000]={};
bool pri[1000000]={};
bool isPrime(int n){
if(priN[n]==true)return pri[n];
for(int i=3;i<=sqrt((double)n);i++){
if(n%i==0){
... | 1 | 25,465,829 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
int main(){
int n; cin >> n;
ll H[n];
rep(i,n) cin >> H[i];
if(n==1){
cout << 0 << endl;
return 0;
}
int ans(0),sum(0);
for(i... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector <int> H(N);
int cnt=0;
int cntmax=0;
cin>>H[0];
for (int i=1;i<N;i++){
cin>>H[i];
if(H[i]<=H[i-1]){
cnt++;
cntmax=max(cntmax,cnt);
continue;
}
cnt=0;
}
cout<<cntmax<<endl;
return 0;
} | 1 | 97,686,878 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | #include <iostream>
#include <map>
#include <algorithm>
#include <queue>
#include <list>
#include <string>
#include <cmath>
#include <stack>
#include <cstdio>
#include <fstream>
#include <climits>
#include <set>
#include <vector>
#include <tuple>
#include <cstring>
#include <functional>
#include <utility>
#include <iom... | 1 | 24,669,533 |
#include <bits/stdc++.h>
#define mem(i,a) memset(i,a,sizeof(i))
#define PI acos(-1.0)
#define DMAX 200000+5
#define MOD 20190823
#define eps 1e-8
#define mp make_pair
#define INF 1000000000+9
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
template<class T> inline void read... | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a;
int b;
int ans;
cin >> a >> b;
if(a*b%2 ==1){
cout << "Odd"<<endl;
}else{
cout << "Even"<< endl;
}
} | 1 | 93,599,297 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int> l(N);
for (int i = 0; i < N; ++i) {
cin >> l.at(i);
}
sort(l.rbegin(), l.rend());
int ans = 0;
for (int i = 0; i < K; ++i) {
ans += l.at(i);
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
int ans = 0;
int tmp;
int n, k;
cin >> n >> k;
vector<int> le(n);
REP(i, n) cin >> le[i];
sort(le.begin... | 1 | 28,725,738 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <iomanip>
#define intt long long
#define PI 3.14159265358979323846
using namespace std;
int main() {
double a, b, x; std::cin >> a >> b >> x;
double s = x / a;
double a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#defi... | 1 | 67,019,241 |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define pb push_back
#define mp make_pair
#define s second
#define f first
#define mod 998244353
#define sz(v) (int)(v).size()
#define pii pair<int, int>
#define vi vector<int>
#define ll long long
#define fastio ios_base::sync_with_stdio(false);cin.tie... | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<int> a(n+1, 0);
int num = 1;
for(int i = 1; i<= n; i++){
... | 1 | 28,207,476 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define long long long
int main(void) {
ll n;
cin >> n;
vector<ll> a(n);
for(auto &e: a) cin >> e;
ll r = 0, t = 0;
for(ll i=0; i<n; i++) {
ll s = max(0ll, (a[i]-(t+1) + t) / (t+1));
r += s;
if(a[i] == t+1... | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <tuple>
using namespace std;
using LL = long long;
using ULL = ... | 1 | 81,037,142 |
#include <stdio.h>
int main()
{
char C;
scanf("%c",&C);
printf("%c",++C);
return 0;
} | #include <iostream>
#include <string.h>
using namespace std;
int main(void)
{
string str;
cin >> str;
cout << char(str[0]+1) << endl;
} | 1 | 64,765,600 |
#include <iostream>
#include <vector>
#include <map>
#include <stack>
#include <list>
#include <queue>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <math.h>
using namespace std;
int combi(int n, int s, vector<int> usedNum){
int combiCount = 0;
int tmp;
bool usedFlag;
n--;
fo... | #include<iostream>
#include<algorithm>
using namespace std;
void dfs(int, int, int);
int coun=0,go;
int main()
{
int n;
while (1){
coun = 0;
cin >> n >> go;
if (n + go == 0)break;
for (int i = 0; i < 9; i++){
dfs(n, i, i);
}
cout << coun << endl;
}
}
void dfs(int n, int sum, int to){
if (n == 1 && su... | 1 | 25,454,690 |
#include <bits/stdc++.h>
#define si(v) int(v.size())
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (m); --i)
template<class T, class U> void chmax(T &a, U b) { if (a < b) a = b; }
template<cl... | #include <bits/stdc++.h>
using namespace std;;
int main(){
int w,h,n;
cin >> w >> h >> n;
int maxx=0,minx=w,maxy=0,miny=h;
int x,y,a;
for (int i = 0; i < n; i++){
cin >> x >> y >> a;
if (a==2){
minx = min(x,minx);
}else if (a==1){
maxx = max(maxx,x);
... | 1 | 54,767,608 |
#include <iostream>
#include <algorithm>
#include <stack>
#include <string>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <list>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
struct node{ int parent, left, right;};
node t[100000];
int n, NIL = -1... | #include <iostream>
#include <vector>
struct Node
{
int num_of_child;
std::vector<int> child;
int parent;
int depth;
std::string type;
};
void init(Node tree[], int id, int parent, int parent_depth)
{
tree[id].parent = parent;
tree[id].depth = parent_depth + 1;
if (tree[id].parent == -1)
{
tree[id... | 1 | 47,166,624 |
#include <iostream>
#include <cmath>
#include <iomanip>
struct Point{
double x;
double y;
void print();
};
void koch(int n,Point p1,Point p2){
if(n==0){
return;
}
Point s,t,u;
s.x = (2*p1.x + 1*p2.x) / 3.0;
s.y = (2*p1.y + 1*p2.y) / 3.0;
t.x = (1*p1.x + 2*p2.x) / 3.0;
t.y... | #include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
typedef struct point{
double x,y;
} P;
void show(P p)
{
cout<<fixed<<setprecision(5);
cout<<p.x<<' '<<p.y<<endl;
}
void work(P p1,P p2,int n)
{
if(n==0)
return;
P p3,p4,p5;
double dx,dy,a,b;
p3.x = 2./3*p1.x... | 1 | 97,675,310 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
cin.tie(NULL); cout.tie(NULL);
ios_base:: sync_with_stdio(false);
ll n,as=0,bs=0;cin>>n;
ll a[n];for(ll i=0;i<n;i++)cin>>a[i],as+=a[i];
ll b[n];for(ll i=0;i<n;i++)cin>>b[i],bs+=b[i];
if(as>bs)return cout<<"No" , 0;
... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
int n;
cin >> n;
... | 1 | 16,682,918 |
#include<stdio.h>
int main(void)
{
int a,d;
scanf("%d %d",&a,&d);
printf("%d %d %lf",a/d,a%d,(double)a/d);
return 0;
} | #include<iostream>
#include<iomanip>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
int d = a / b;
int r = a%b;
double f = a*1.000000 / b*1.000000;
cout << d << " " << r << " " << fixed << setprecision(5) << f << endl;
return 0;
} | 1 | 66,119,221 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.