code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
int main(){
map<int,int> path;
for(int i=0;i<4;i++){
path[i]=0;
}
for(int i=0;i<3;i++){
int a,b;cin>>a>>b;a--;b--;
path[a]++;
path[b]++;
}
for(int i=0;i<4;i++){
if(path[i]==3){
cout<<"NO"<<endl;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
string s, t;
cin >> s >> t;
if(s.size() != t.size()){
cout << "No\n";
return 0;
}
int n = s.size();
for(int i = 0; i < n; i++){
bool flag = true;
for(int j = 0; j < n; j++){
... | 0 | 3,686,425 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _overload3(_1,_2,_3,name... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
const int TopIndex = 1;
const int DummySize = 1;
void Exchange(vector<int>& Heap, int& InsertIndex, int& ParentIndex)
{
swap(Heap[InsertIndex], Heap[ParentIndex]);
InsertIndex = ParentIndex;
ParentIndex = InsertIndex / 2;
}
void Insert(vect... | 0 | 62,910,894 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REPS(i,n) for(ll (i)=1;(i)<=(n);(i)++)
#define RREP(i,n) for(ll (i)=(n-1);(i)>=0;(i)--)
#defi... | #include <iostream>
#include <string>
#include <vector>
#include <cstring>
#include <climits>
#include <algorithm>
#include <map>
using namespace std;
int main() {
int N, M, P;
while (cin >> N >> M >> P, N) {
vector<int> X(N);
int gold = 0;
for (int i=0; i<N; ++i) {
cin >> X[... | 0 | 25,769,214 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pll;
#define fu(i,a,b) for(ll i=a;i<b;i++)
#define fd(i,b,a) for(ll i=b;i>=a;i--)
#define ms(a,x) memset(a, x, sizeof a)
#define prec(n) fixed<<setprecision(n)
#define pb(i) push_back(... | 0 | 92,098,738 |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<utility>
#include<string>
#include<stack>
#include<queue>
#include<set>
#include<math.h>
#include <map>
using namespace std;
typedef long long int ll;
#define repi(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,a) repi(i,0,a)
#define all(u) u.... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
int n;
cin>>s>>t;
n=s.size();
if(t.substr(0,n)==s)
cout<<"Yes";
else
cout<<"No";
return 0;
} | 0 | 84,523,899 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B;
cin >> A >> B;
cout << (A*(A-1)/2)+(B*(B-1)/2) << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int arr[n][3];
for(int i=0;i<n;i++){
for(int j=0;j<3;j++){
cin>>arr[i][j];
}
}
int dp[n][3];
dp[0][0]=arr[0][0];
dp[0][1]=arr[0][1];
dp[0][2]=arr[0][2];
for(int i=1;i<n;i++){
dp[i][0]=max(dp[i-1][1],d... | 0 | 67,350,826 |
#include <bits/stdc++.h>
#define F first
#define S second
#define _sz(x) (int)x.size()
using namespace std ;
using ll = long long ;
using ld = long double ;
using pii = pair <int , int> ;
int const L = 18 , N = L + 2 , MASK = (1 << L) + 20 , inf = 1e9 + 20 ;
int n , a[MASK] ;
int mx1[N][MASK] , mx2[N][MASK] ;
int dp[N]... | #include<iostream>
#include<algorithm>
using namespace std;
int main(void){
long long l, r;
cin >> l >> r;
int mod_min = 2018;
r = min(r, l + 2019);
for(long long i = l; i < r; i++){
for(long long j = i + 1; j <= r; j++){
int mod = (i * j) % 2019;
mod_min = min(mod_mi... | 0 | 59,425,996 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll MOD = 1e9+7;
int main(){
ll A;
double B;
cin >> A >> B;
B *= 100.0;
ll nB = round(B);
cout << setprecision(20) << (A*nB)/100<< endl;
} | #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main() {
string s;
while(1){
getline(cin, s);
if(s == ".") break;
stack<char> st;
bool f = true;
rep(i, 0, s.size()){
if(s[i] == '(' || s[i] == '['){
... | 0 | 32,752,880 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int>L(2*N);
for(int i=0;i<2*N;i++)
cin>>L.at(i);
sort(L.begin(),L.end());
int ans=0;
for(int i=0;i<N;i++)
ans+=L.at(2*i);
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) FOR(i,0,n)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define PB push_back
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
const ll INF = (1ll << 60);
typedef pair<ll,ll> pii;
using namespace std;
struct UnionFind {
ll size,*par,*... | 0 | 42,561,905 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>
#include <string>
#include <string.h>
#include <bitset>
using namespace std;
const int mx=(1<<26);
int pos[mx],f[200010];
char s[200010];
bitset<26> x[200010];
int main() {
scanf("%s",s+1);
int n=strlen(s+1);
f[0]=0;
mem... | #include <bits/stdc++.h>
using namespace std;
int main () {
long long N,H;
cin >> N >> H;
vector<long long>a(N);
vector<long long>b(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i) >> b.at(i);
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
sort(b.begin(), b.end());
reverse(b.begin(), b... | 0 | 51,277,465 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF=1001001001;
long long int answ(long long int x){
if(x==1) return 1;
if(x>1) return 2*answ(x/2)+1;
}
int main() {
int r;
cin>>r;
cout<<r*r<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned un;
#define fastIO ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr)
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("ss... | 0 | 61,435,044 |
#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define MINF(a) memset(a,0x3f,sizeof(a))
#define POW(n) (1... | #include <bits/stdc++.h>
using namespace std;
#define Gene template< class
#define Rics printer& operator,
Gene c> struct rge{c b, e;};
Gene c> rge<c> range(c i, c j){ return {i, j};}
struct printer{
~printer(){cerr<<endl;}
Gene c >Rics(c x){ cerr<<boolalpha<<x; return *this;}
Rics(string x){cerr<<x;return ... | 0 | 48,900,193 |
#include<iostream>
using namespace std;
int main()
{
int N,M,P,X,S,i,m;
while(cin>>N>>M>>P,N||M||P){
S=0;
for(i=0;i<N;i++){
cin>>X;
S+=X*100;
if(i==M-1)m=X*100;
}
S*=100-P;
if(m)cout<<(int)((double)S/m)<<endl;
else puts("0");
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int main(){
int N;
cin >> N;
map<vec... | 0 | 95,315,666 |
#include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout <<"a ";
if(a<b)
cout <<"<";
if(a==b)
cout << "==";
if(a>b)
cout << ">";
cout <<" b"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi... | 0 | 208,798 |
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>
#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>
#include <cmath>
#include <algorithm>
using namespace std;
#define N 999999+1
int prime[N];
void sieve(int en) {
for(int i=2;i<=(int)sqrt(en);i++) {
for(int j=i*2;j<=en;j+=i) {
prime[j] = 1;
}
}
}
int main() {
int n;
int max_n = 2;
while(cin >> n) {
if(n > max_n) {
... | 0 | 48,423,617 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, p;
cin >> n >> p;
string s;
cin >> s;
if(p == 2 || p == 5){
int64_t ans = 0;
for(int i = 0; i < n; i++){
int x = s[n-1-i] - '0';
if(x % p == 0) ans += (n - i);
}
cout << ans ... | #include <bits/stdc++.h>
using namespace std;
#define SPEED ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define endl '\n'
#define vi vector<ll>
#define mii map<ll, ll>
#define pii pair<ll, ll>
#define pb push_back
#define fi first
#define se second
#define vvi vector<vi>
#define ... | 0 | 32,563,852 |
#include <cstdio>
#include<iostream>
using namespace std;
int main(){
int N, A, B; scanf("%d%d%d", &N, &A, &B);
if(A + B - 1 > N || N > 1LL * A * B){ puts("-1"); return 0; }
for(int l = 0, g = N - A, a = 1; a <= A; a++){
int t =(g > B - 1)? B - 1 : g;
for(int i = l + t + 1; i > l; i--)
printf("%d ", i... | #include <bits/stdc++.h>
#define rep(i, a, b) for(ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for(ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(ve... | 0 | 71,662,794 |
#define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#inclu... | #include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
int main()
{
string t, h;
int n, t_len, h_len, itr, t_score, h_score;
t_score = 0;
h_score = 0;
cin >> n;
for (int i=0; i<n; ++i){
cin >> t >> h;
itr = 0;
t_len = t.length();
h_len = h.l... | 0 | 54,293,247 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int count = 0;
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
for (int k = 0; k < 10; k++) {
int judge = 0;
for (int l = 0; l < N; l++) {
int A = S.at(l) - '0';
... | #include <stdio.h>
int main() {
int L;
scanf("%d", &L);
printf("%.12f\n", (double)L * L * L / 27);
} | 0 | 67,096,290 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | #include<iostream>
#include<cmath>
using namespace std;
bool judge( int x )
{
for( int i = 2; i <= sqrt(x); i++ )
{
if( x % i == 0)
return false;
}
return true;
}
int main()
{
int n;
while( cin >> n )
... | 0 | 98,070,831 |
#include "bits/stdc++.h"
#include <unordered_set>
#define rep(i,n) for(ull 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 push_back
#define ... | #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
string s;
while(1){
getline(cin, s);
if(s == ".") break;
stack<char> st;
bool f = true;
rep(i, 0, s.size()){
if(s[i] == '(') st.push(s[i]);
if... | 0 | 64,280,092 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
string s;
cin >> s;
int n = s.length();
string rev1 = s;
reverse(rev1.begin(), rev1.end());
if (s != rev1)
{
cout << "No" << endl;
return 0;
}
string s2 = s.substr(0, (n - 1) / 2);
string rev2 = s2;
reverse(re... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
int n = -1;
for(int i = 0; i < 1000000; i++){
if(N == i * (i - 1) / 2){
n = i;
break;
}
}
if(N == 1){
cout << "Yes" << endl;
cout << 2 << endl;
cout << 1 << " " <... | 0 | 9,138,860 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K,D;D=1;
cin >> N >> K ;
for (int i = 0 ; i < N ; i++){
if ( D * 2 <= D + K ){
D = D * 2;
}
else{
D = D + K ;
}
}
cout << D << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int K;
cin >> K;
vector<int64_t> A(K);
for (int i = 0; i < K; i++) {
cin >> A[i];
}
reverse(A.begin(), A.end());
int64_t lo = 2, hi = 2;
for (int i = 0; i < K; i++) {
if (lo % A[i] != 0 && lo ... | 0 | 58,790,775 |
#include<bits/stdc++.h>
#define lln long long int
#define llu unsigned lln
#define sc(n) scanf("%d",&n);
#define scl(n) scanf("%lld",&n);
#define scd(n) scanf("%lf",&n);
#define pf(res) printf("%d\n",res);
#define pfl(res) printf("%lld\n",res);
#define pfd(res) printf("%lf\n",res);
#define pb(n) push_back(n);
#define m... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,n) for(int i=1;i<=(n);++i)
#define repr(i,n) for(int i=(n);i>=0;--i)
#define cinv(n,v) VL v(n);rep(i,n)cin>>v[i]
#define int long long
#define itn int
#define pb push_back
#define eb emplace_back
#define m_p make_pair
#d... | 0 | 91,191,342 |
#include<bits/stdc++.h>
using namespace std;
long long l=2,r=2,n,ans[100005];
int main()
{
cin>>n;
for(int i=1; i<=n; i++)cin>>ans[i];
for(int i=n; i>=1; i--)l=((l-1)/ans[i]+1)*ans[i],r=r/ans[i]*ans[i]+ans[i]-1;
if(l>r)cout<<-1;else cout<<l<<" "<<r;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 1000000009
#define PI acos(-1)
#d... | 0 | 97,104,022 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
ll dp[105][100005], sum[100005];
ll add(ll u, ll v){
if ((u + v) >= mod) return u + v - mod;
else return u + v;
}
int main(){
ios_base::sync_with_stdio(false);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
int n;
cin >> ... | 0 | 21,275,584 |
#include <iostream>
using namespace std;
long long int f(int n)
{
long long int m=1;
for(long long int i=2; i<=n; i++)
m*=i;
return m;
}
int main()
{
long long int a;
cin>>a;
cout<<f(a)<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
using ll = long long;
int main(){
int n;cin>>n;
vector<int> h(n);
rep0(i,n){
cin>>h[i];
}
int ans=1;
... | 0 | 91,227,557 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> ... | 0 | 54,697,156 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s,t,u; cin>>s,t=s.substr(0,(s.size()-1)/2),u=s.substr((s.size()+1)/2);
cout<<(t==u?"Yes":"No");
} | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,x;
long long sm=0;
vector <int>v;
cin>>n>>k;
for(int i=0;i<n;i++){
cin>>x;
v.push_back(x);
}
sort(v.begin(),v.end());
for(int i=0;i<k;i++){
sm+=v[i];
}
cout << sm << endl... | 0 | 20,034,588 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
static const int INFTY = (1 << 30);
int N;
void func()
{
cin >> N;
vector<pair<int, int>> red, blue;
int a, b;
rep(i, 0, N)
{
cin >> a >> b;
red.... | #include <math.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rep(inc, bgn, end) for (int inc = bgn; inc < end; ++inc)
#define repe(inc, bgn, end) for (int inc = bgn; inc <= end; ++inc)
using ll = long long;
using namespace std;
int main() {
int n, k;
cin ... | 0 | 98,581,244 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s,t; cin >> s >> t;
for(int i = 0; i < s.size(); i++) {
if(s==t) {
cout << "Yes" << endl;
return 0;
} else {
s = s.back() + s.substr(0, s.size()-1);
}
}
cout << "No" << endl;
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const int INF = 1001001001;
const ll LINF = 1001001001001001001;
int main(){
ll n ; cin >> n;
cout << 0 << endl;
pair<... | 0 | 47,703,502 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
using namespace std;
#define FOR(i,a,b) for(lo... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef... | 0 | 56,931,889 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> weights(N);
vector<int> sums(N+1);
for (int n = 0; n < N; ++n) {
cin >> weights[n];
sums[n+1] = sums[n] + weights[n];
}
int res = sums.back();
for (int n = 1; n < N; ++n) {
int l = sums[n];
... | #include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define io std::ios::sync_with_stdio(false)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const double pi=acos(-1);
const int P = 1e9+7, INF = 0x3f3f3f3f;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll qpow(ll a,ll n){... | 0 | 3,338,677 |
#include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <iomanip>
#define typeof(x) __typeof__(x)
#define int long long int
#define mo... | #include <iostream>
#include <queue>
#define min(x,y) ((x)<(y)?(x):(y))
#define INFI 100000000
using namespace std;
typedef pair<int, int> P;
int Strength = 1;
char Maps[1010][1010];
int dist[1010][1010];
int H, W, N;
int hor[] = {1,0,-1,0};
int ver[] = {0,-1,0,1};
int ans;
void clear();
void show();
P bfs(int cheese,P... | 0 | 85,889,387 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<... | #include <bits/stdc++.h>
using namespace std;
const int64_t INF=10e9;
int main(){
int N,M,R;
cin>>N>>M>>R;
vector<vector<int64_t>> dp(N,vector<int64_t>(N,INF));
vector<int> r(R);
for(int i=0;i<R;++i){
cin>>r[i];
--r[i];
}
for(int i=0;i<M;++i){
int A,B;
int64_t C;
cin>>A>>B>>C;
--A,... | 0 | 57,525,843 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define repD(i, a, n) for (int i = a; i >= (n); --i)
#define tr(a, x) for (auto &a : x)
#define all(c) c.begin(), c.end()
#define lld long long
#define pb push_back
#define mp make_pair
#define ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | 0 | 84,532,292 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define I... | #include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si second
#define ... | 0 | 89,969,391 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
string s, t;
cin >> s >> t;
int ans = t.size();
for (int i = 0; i + t.size() <= (int)s.size(); ++i) {
int cur = 0;
for (int j = 0; j < (int)t.size(); ++j) {
if (s[i+j] != t[j]) ++cur;... | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
int main(){
int x,y,a,b,c;
cin >> x >> y >> a >> b >> c;
vecto... | 0 | 47,083,308 |
#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... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#defi... | 0 | 60,015,330 |
#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int, int>;
enum { END, START };
int time(string str) {
int h = stoi(str.substr(0, 2));
int m = stoi(str.substr(3, 2));
int s = stoi(str.substr(6, 2));
return 3600 * h + 60 * m + s;
}
void solve(int N) {
priority_queue<Pair, vector<Pair>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 61,617,255 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,m) for(int i = 0; i < m; i++)
using ll = long long;
int main(){
ll n,T;
cin >> n >> T;
vector<ll> t(n);
rep(i,n) cin >> t.at(i);
ll ans = 0;
rep(i,n-1){
ll dif = t.at(i+1)-t.at(i);
if(dif>=T){
ans+=T;
}else ans+=dif;
}
ans+=T;
... | #include <bits/stdc++.h>
using namespace std;
bool is_square(int n)
{
for (int i = 0; i <= n; i++)
{
if (i * i == n)
{
return true;
}
}
return false;
}
int main()
{
int h, w;
cin >> h >> w;
vector<char> c(w, 0);
for (size_t i = 0; i < h; i++)
{
... | 0 | 3,963,014 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
#define For(i,a,b) for(i=a;i<b;i++)
#defin... | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#def... | 0 | 100,164,586 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const int INF = 1e9;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
templa... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
int calc(vector<int> v, vector<int> l, int N, int A, int B, int C)
{
int mp = 0;
int ... | 0 | 17,265,677 |
#include <iostream>
using namespace std;
int main()
{
string w;
cin >> w;
int c = 0;
if (w == "RRR")
{
c = 3;
}
else if (w== "RRS" || w == "SRR")
{
c= 2;
}
else if (w == "SRS" || w == "RSR" || w == "SSR" || w == "RSS")
{
c = 1;
}
cout << c << e... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
d... | 0 | 72,122,374 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int gcd(int a, int b){
if (a < b) gcd(b,a);
if (b == 0) return a;
else gcd(b, a % b);
}
const string MINUSINF = "-";
int match[10] = {2,5,5,4,5,6,3,7,6};
string dp[11000];
void ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int64_t> height(n);
for (int i = 0; i < n; i++)cin >> height.at(i);
vector<int64_t> height_copy = height;
int64_t ans = 1000000000000000000;
for (int bit = 0; bit < (1 << n - 1); bit++) {
vector<int> want(n, 0);
want.a... | 0 | 42,141,227 |
#include <iostream>
using namespace std;
int main() {
int N; cin >> N;
int maxx, sum=0;
for(maxx=1; sum<N; ++maxx) sum += maxx;
int excu=sum-N;
for(int i=maxx-1; i>0; --i){
if(i!=excu) cout << i << endl;
}
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string str,fc,p;
int q,i=0,a,b;
cin>>str>>q;
for(;i<q;i++){
cin>>fc>>a>>b;
switch(fc[2]){
case 'i':
cout<<str.substr(a,b-a+1)<<endl;
... | 0 | 100,720,573 |
#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
#... | #include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <cassert>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#inc... | 0 | 76,647,302 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
int m;
bool ok=false;
cin >> n >> m;;
vector<vector<int>> ab(n);
int a;
int b;
for(int i=0; i<m; i++){
cin >> a >> b;
a--;
b--;
ab[a].push_back(b);
}
for(int i=0; i<ab[0]... | #include <iostream>
#include <string>
#include <string.h>
using namespace std;
int main(){
int n;
cin >> n;
for(int i=0;i<n;i++){
string str1, str2;
string ans;
cin >> str1 >> str2;
int str_i=0, str_x=0, str_c=0, str_m=0;
char c1[9],c2[9];
strcpy(c1, str1.c_str());
strcpy(c2, str2.c_st... | 0 | 89,309,556 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define vll vector<ll>
#define vllv vector<vector<ll>>
#define sz size()
#define pb push_back
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define fast ios_base::sync_with_stdio(0); cin.tie(... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
vector<int> a(5);
for(int i=0; i<5; i++){
cin >> a[i];
}
int p = 0;
int min = 10;
for(int i=0; i<5; i++){
if(a[i]%10 == 0){
p += a[i];
}
else{
if(a[i]%10 < min){
min = a[i]%10;
}
... | 0 | 63,796,864 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int r, g;
cin >> r >> g;
cout << 2*g - r << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using lli = long long;
lli pw[11];
int main() {
pw[0]=1;
for(int i=1;i<11;i++) pw[i]=pw[i-1]*10;
int arr[11]={0,};
for(int s=0;s<11;s++) {
int lo=(s==0 ? 0 : -1), up=9;
lli v=0;
for(int i=0;i<s;i++) v=v*10+arr[i];
while(up-lo>... | 0 | 25,689,179 |
#include <bits/stdc++.h>
using namespace std;
# define ll long long
const int NN = 1000004;
int primefactor[NN];
int arr[NN];int n;
void seive(){
for(int i=2;i<NN;i++){
primefactor[i]=i;
}
primefactor[0]=1;
primefactor[1]=1;
for(int i=2;i*i<NN;i++){
if(primefactor[i]==i){
for(int j=2*i;j<NN;j... | #include <bits/stdc++.h>
#define respa return 0
#define all(x) x.begin(), x.end()
#define sz size
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 2e5 + 17, M = N << 2, mod = 1e9 + 7;
int tt = 1, n;
string s, t;
void solve () {
cin >> n >> s... | 0 | 70,976,180 |
#include<iostream>
using namespace std;
typedef long long ll;
int main()
{
int n,i;
ll d[87];
cin >> n;
d[0]=2;
d[1]=1;
for(i=2;i<=n;i++)
d[i]=d[i-2]+d[i-1];
cout << d[n] << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
typedef vector<vector<int> > ivve;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb push... | 0 | 78,328,791 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
int n;
cin>>n;
int x,y;
cin>>x>>y;
int a[n];
int ans=n+y;
for(int i=0;i<n;i++)
{
cin>>a[i];
ans+=(x-1)/a[i];
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th... | 0 | 65,455,377 |
#include<iostream>
#include<cmath>
#include<cstdio>
#define PI 3.1415926535
using namespace std;
int main() {
double a,b,C,S,L,h;
cin >> a >> b >> C;
double radC = C / 180 * PI;
S = a * b * sin(radC) / 2;
L = a + b + sqrt( pow(a,2) + pow(b,2) - 2 * a *b * cos(radC) );
h =S / a * 2;
printf("%.5f\n",S);
printf... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 17,203,585 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <cstdlib>
#include <set>
#include <queue>
using namespace std;
#define X first
#define Y second
#define Mod 1000000007
#define N 100010
#define M 101
typedef long long ll;
const int I... | #include <iostream>
using namespace std;
long long MOD = 1000000000 + 7;
long long fctm(long long x) {
long long result = 1;
for (long long i = 1; i <= x; i++) {
result = result * i % MOD;
}
return result;
}
long long powm(long long x, long long p) {
if (p == 0) return 1;
long long tmp = x * x % MOD;
... | 0 | 16,815,205 |
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
map<int, int> m;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (m.count(x) == 0) {
m.emplace(x, 0);
}
m[x]++;
... | #include <iostream>
using namespace std;
int main() {
int n;
while(cin >> n) {
int count = 0;
for (int i = 0; i <= 9; ++i) {
if ((n - i) / 3.0 > 9) continue;
if ((n - i) < 0) continue;
for (int j = 0; j <= 9; ++j) {
if ((n - (i+j)) / 2.0 > 9) c... | 0 | 6,469,773 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p;
vector<bool> sieve(n + 1, 1);
for (int i = 2; i < n; i++) {
if (!sieve[i])
continue;
p.emplace_back(i);
for (int j = i * i; j < n; j += i)
sieve[j] = 0;
}
vector<int> b(p.size());
for (int i = 0, m; i < (int) ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <functional>
#include <iomanip>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <array>
#include <l... | 0 | 28,074,510 |
#include <cstdio>
int main (int argc, char const* argv[])
{
int S=0,T=0,P;
for(int i=0;i<4;i++) {
scanf("%d",&P);
S+=P;
}
for(int i=0;i<4;i++) {
scanf("%d",&P);
T+=P;
}
printf("%d\n",S>=T?S:T);
return 0;
} | #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... | 0 | 24,637,203 |
#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>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int INT_INF = 2147483646;
const ll LL_INF = 9223372036854775807;
const double PI=3.1415926535897932;
bool SecondCompare(const pair<int,int> &a,const pair<int,int> &b)
{
return a.second<b.s... | 0 | 93,456,260 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int k, s;
cin >> k >> s;
int ans = 0;
rep(i, k + 1){
rep(j, k + 1){
int z = s - i ... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | 0 | 70,287,768 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1000000007;
const int INF=1001001001;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
int MOD=1e9+7;
ll INF=1e18;
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
int main(){
int a, b; cin>>a>>b;
a--, b--;
char g[100][100];
for(int i=0; i<100; i++){
for(int ... | 0 | 43,020,867 |
#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long
ull cbs(int n, int p) {
vector<vector<ull>> v(n+1,vector<ull>(n+1,0));
for(int i = 0;i < n+1; i++) {
v[i][0]=1;
v[i][i]=1;
}
for(int i = 1;i < n+1;i++) {
for(int j = 1;j < i;j++) v[i][j]=(v[i-1][j-1]+v[i-1][j]);
}
ull su... | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(long long i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(long long i=int(n);i>0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | 0 | 79,687,369 |
#include <bits/stdc++.h>
using ll = long long;
#define mod 1000000007
#define REP(i, n) for (int i = 0; i < n; i++)
#define INF (1 << 29)
using namespace std;
int multiple(int k){
int mul = 0;
do {
mul += k % 10;
k /= 10;
} while(k != 0);
return mul;
}
void solve()
{
int k;
cin >... | #include<iostream>
#include<string>
using namespace std;
int main(){
while(1){
int n;
cin >>n;
if(n==0)break;
string s;
int l=0,r=0;
int ans=0;
bool f=0;
for(int i=0;i<n;i++){
cin>>s;
if(s=="lu"&&l==0)l++;
if(s==... | 0 | 44,973,568 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main() {
int W, H, x, y, r;
string str;
cin >> W >> H >> x >> y >> r;
if((x-r < 0 || y-r < 0)||(x+r > W || y+r > H)){
str = "No";
} else {
str = "Yes";
}
cout << str << endl;... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("-ffloat-store")
#define int long long
#define rep(i,begin,end) for(__typeof(end)i=(begin)-((begin)>(end));i!=(end)-((begin)>(end));i+=1-2*((begin)>(end)))
#defi... | 0 | 27,514,396 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
ll ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin>>N;
vector<int>X(N);
for (int i = 0; i < N; i++)
{
cin>>X[i];
}
priority_queue<int,vector<int>,greater<int>>Sum;
for (int P = 1; P < 101; ++P)
{
int cash=0;
for(int i=0;i<N;++i)
{
... | 0 | 18,344,629 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int in() {int x; cin>>x; return x;}
ll lin() {ll x; cin>>x; return x;}
string sin() {string x;cin>>x;return x;}
using graph = vector<vector<int>>;
using graph2 = vector<vector<pair<int, int>>>;
bool i... | #include <iostream>
#include <vector>
using namespace std;
vector<int> M[10000];
vector<int> m[10000];
int mark[10000]={0};
int main(){
int V;
int E;
int s,t;
cin >> V >> E;
for(int i=0;i<E;i++){
cin >> s >> t;
M[s].push_back(t);
m[t].push_back(s);
}
for(int i=0;i<V;i++){
for(int j=0;j<V;j... | 0 | 77,542,916 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define repr(i,n) for(ll i=(n-1);i>=0;i--)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define br cout << endl;
using namespace std;
const int INF = 1e9;
const int MOD = 1e9+7;
using Graph = vector<vecto... | 0 | 77,873,026 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int a, b;
cin >> a >> b;
int ans = 0;
if (a <= b) {
rep(i, b) {
ans *= 10;
ans += a;
}
} else {
re... | #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-1); i >= 0; --i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
... | 0 | 16,271,041 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include <iostream>
using namespace std;
typedef long long ll;
bool query (ll n) {
cout << "? " << n << endl;
char ans;
cin >> ans;
return (ans == 'Y');
}
void report (ll n) {
cout << "! " << n << endl;
exit(0);
}
void solve_powers () {
ll cur = 9;
while (true) {
if (query(cur)) {
report((cur ... | 0 | 26,800,348 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 1e9 + 7;
const int N = 1e5;
ll val[N + 5];
ll n, k;
ll fastexpo(ll a, ll b) {
ll res = 1;
while(b) {
if(b & 1) { res = (res * a) % MOD; }
a = a * a % MOD;
b >>= 1;
}
return res;
}
void solve() {... | #include <bits/stdc++.h>
#define ll long long
#define mk make_pair
#define pb push_back
#define ff first
#define sc second
#define all(x) x.begin(), x.end();
ll gcd(ll a, ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll sum(int n){
if(n == 0){
return n;
}else{
return sum(n/10) + n%10;
}... | 0 | 33,991,280 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int,int> ii;
vi a;
const int N = 1e6+1;
int o[N];
int main()
{
int n,i,j;
scanf("%d",&n);
for(i=0;i<N;i++) o[i] = 0;
int ans = 0;
for(i=0;i<n;i++)
{
scanf("%d",&j);
a.push_back(j);
}
sort(a.begin(),a... | #include<bits/stdc++.h>
#define int long long int
#define fr(i,x,y) for(int i=x;i<y;i++)
#define f(n) for(int i=0;i<n;i++)
#define ff(m) for(int j=0;j<m;j++)
#define F(x) for(auto it=x.begin();it!=x.end();it++)
#define in insert
#define pb push_back
#define pi pair<int,int>
#define si(x) x->second
#define fi(x) x->firs... | 0 | 80,267,221 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cctype>
using namespace std;
int main() {
string s, in;
while (cin >> in)
s += in;
for (char c = 'a'; c <= 'z'; c++)
cout << c << " : " << count(s.begin(), s.end(), c) + count(s.begin(), s.end(), toupper(c)) << endl;
} | #include <bits/stdc++.h>
#define fast \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define int long long
#define endl '\n'
#define all(a) (a).begin(),(a).end()
#define Unique(A) (A).resize(distance((A).begin(),unique(all(... | 0 | 17,284,665 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define Rep(i, a, b) for(ll i = a; i <= b; i++)
#define repr(i, a, b) for(ll i = b-1; i >= a; i--)
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
using ll = long long;
#define ALL(v) (v).begin... | #include <bits/stdc++.h>
int main(){
using namespace std;
unsigned long N;
cin >> N;
vector<unsigned long> A(N);
copy_n(istream_iterator<unsigned long>(cin), N, A.begin());
vector<unsigned long> pw;
unsigned long x{0}, o{0};
for(const auto& i : A){
x ^= i;
o |= i;
}
... | 0 | 37,535,373 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstring>
#include <utility>
#include <numeric>
#include <iomanip>
using namespace std;
int main(){
int T, X;
cin >> T >> X;
double ans = (double)T / X;
cout << setprecision(8) << ans << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, n;
cin >> h >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) {
h -= a[i];
if (h <= 0) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << e... | 0 | 100,129,644 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using i64 = int64_t;
using ll = long long;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
cin >> A.at(0);
ll ans = 0;
rep(i,N-1){
cin >> A.at(i+1);
if(A.at(i+1) < A.at(i)){
ans += A.at(i) - A.at(i+1);
... | #include <algorithm>
#include <array>
#include <bitset>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#includ... | 0 | 81,487,633 |
#include<cstdio>
int main(void) {
int map[100],in,i;
for(i=0;i<100;i++) { map[i]=0; }
while(scanf("%d",&in)!=EOF) { map[in-1]++; }
in=0;
for(i=0;i<100;i++) { if(in<map[i]) { in=map[i]; } }
for(i=0;i<100;i++) { if(in==map[i]) { printf("%d\n",i+1); } }
return 0;
} | #include <stdio.h>
#include <iostream>
#include <vector>
#include <string>
#include <tuple>
#include <map>
#include <math.h>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <numeric>
#include <limits>
#include <unordered_map>
#include <map>
#include <cmath>
#include <deque>
using namespace std;
... | 0 | 14,545,019 |
#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 ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 10) + 1;
}
ll gcd(lon... | 0 | 39,743,605 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const int N = 3e3+6;
const int mod = 1e9+7;
const ll inf = 1e18;
int a[N];
void solve(){
string s;
cin>>s;
for(auto x:s){
if(x==',')cout<<" ";
el... | #include <iostream>
#include <vector>
#include <stack>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
#define free freopen ("input.txt", "r", stdin);freopen ("output.txt", "w", stdout);
#define Fast ios::sync_with_stdio... | 0 | 10,781,506 |
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define P pair<ll, ll>
using ll = long long;
#define ALL(v) (v).begin(),(v).end()
#define endl ... | #include <iostream>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <functional>
#include <map>
#include <set>
#define Rep(i, n) for(int i=0;i<n;++i)
#define rep(i, n) for(int i=1;i<=n;++i)
#defin... | 0 | 94,729,414 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
bool ike =false;
for(int i=0;i<40;i++){
for(int j=0;j<20;j++){
if(4*i+7*j==N){
ike=true;
break;
}
}
}
if(ike) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <math.h>
#include <iomanip>
#include <queue>
#include <string.h>
#include <string>
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#de... | 0 | 75,791,407 |
#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,z,w;
cin >> n >> z >> w;
vector<ll> v(n);
rep(i,n)cin >> v[i];
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);++i)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);--i)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).b... | 0 | 73,018,083 |
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
#define PI 3.14159265358979323846264338327950L
using namespace std;
using P = pair<int,int>;
using ll = long long;
using namespace std;
int main(void){
ll n, m;
cin >> n >> m;
vector<int> a(m);
ll ans= 0;
rep(i, m){cin >> a[i]; ans += ... | #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> vec;
rep(i, h){
string str;
cin >> str;
vec.push_back(str);
}
rep(i, h... | 0 | 58,124,328 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll x, ll y) {
ll res = 1;
for (ll i = 0; i < y; i++) res... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define rep(i,a,n) for(int i=a;i<(int)n;++i)
#define SZ(x) ((int)(x).size())
#define descSort(a) sort(a.begin(),a.end(),std::greater<int>())
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
ll gcd(ll x,ll y){
if(x%y==0)return y;
return gcd(y,x... | 0 | 95,465,387 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { retur... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | 0 | 53,177,360 |
#include <vector>
#include <string>
#include <iostream>
#include <queue>
#include <algorithm>
#include <functional>
#include <map>
#include <array>
#include <cmath>
#include <set>
#include <numeric>
using namespace std;
template <typename T>
using TABLE = vector<vector<T>>;
long long PRIME = 1e9 + 7;
long long PRIME2 =... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<pair<string, int>> card;
for(int i = 0; i < n; i++){
string s; cin >> s;
bool flag = true;
for(int j = 0; j < card.size(); j++){
if(card.at(j).first == s){
card.at(j).second++;
flag = false;
... | 0 | 86,290,001 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; i++)
{
cin >> a[i];
}
while (1)
{
sort(a.begin(), a.end());
for (ll i = 1; i < a.size(); i++)
{
a[i] %= a[0];
if (a[i] == 0)
{
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
long long nPk_modp(long long n... | 0 | 68,542,998 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,e;
cin>>a>>b>>c;
d=a-b;
if(d<c)
{
e=c-d;
cout<<e<<endl;
}
else
{
cout<<"0"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int x,y;
string s;
cin >> s>>x>>y;
vector<int> w0,w1;
int p=0,q=0;
int i0=0;
while(i0<s.length()&&s[i0]=='F'){
i0++;
p++;
}
w0.push_back(abs(x-p));
w1.push_back(abs(y));
int max... | 0 | 41,304,169 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll H,W;
cin >> H >> W;
if (H % 3 == 0 || W % 3 == 0){
cout << 0 << endl;
}
... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | 0 | 74,982,221 |
#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
void debug_impl() { std::cer... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<pair<int, int>> R(N), B(N);
for (int i = 0; i < N; i++)
{
cin >> R[i].first >> R[i].second;
}
for (int i = 0; i < N; i++)
{
cin >> B[i].first >> B[i].second;
}
sort(R.begin(), R.end());
sort(B.begin(), B.end... | 0 | 94,867,441 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include<iostream>
using namespace std;
using ll=long long;
int main(){
int n;cin>>n;
ll a[1000010];
ll ans=0;
for(int i=0;i<n;++i)cin>>a[i];
for(int i=1;i<n;++i){
if(a[i-1]>a[i]){
ans+=a[i-1]-a[i];
a[i]=a[i-1];
}
}
cout<<ans<<endl;
return 0;
} | 0 | 2,394,897 |
#include <bits/stdc++.h>
using namespace std;
int my_max(int x, int y) {
if (x > y) {
return x;
}else{
return y;
}
}
int main() {
int N, M;
int ans=0;
cin >> N;
vector<string> vec_blue(N);
for (int i=0;i<N;i++){
cin >> vec_blue.at(i);
}
cin >> M;
vector<string> vec_red(M);
for (i... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define all(c) (c).begin(), (c).end()
template<typename T> inline void chmax(T& t, T f){if(t < f)t = f;}
int main(){
int n;
while(cin >> n, n){
vector<pair<int, int> > events;
... | 0 | 72,245,547 |
#include <iostream>
using namespace std;
int main(){
int a[10];
int n=0;
while (!cin.eof()){
int t;
cin>>t;
if (t) a[n++]=t;
else if (n) cout<<a[--n]<<endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
vll a, p;
ll... | 0 | 96,400,422 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n&&n!=0){
vector<int> score(n);
for(int i=0;i<n;++i)
cin>>score[i];
sort(score.begin(), score.end());
cout<<accumulate(score.begin()+1,score.end()-1,0)/(score.size()-2)<<endl;
}
return EXIT_SUCCESS;
} | #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 | 8,912,010 |
#pragma GCC optimize("O2,unroll-loops")
#pragma GCC target("avx,popcnt")
#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
const int maxn = 1<<17, mod = 1e9 + 7, i2 = (mod+1)/2;
ll solve(vector<int> a) {
ll sm = 0, t;
sort... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, C, K;
cin >> N >> C >> K;
vector<int> time(N);
rep(i, N) cin >> time[i];
sort(time.begin(), time.end())... | 0 | 13,176,828 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <math.h>
using namespace std;
int main() {
double a, b, c;
cin >> a >> b >> c;
cout << fixed << a*(b*sin((c*M_PI)/180)) /2.0<< endl;
cout << fixed << a+b+sqrt(a*a+b*b-2*a*b*cos((c*M_PI) / 180)) << endl;
cout << fixed << b*sin((c*M_PI) / 180) << endl;
return 0... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ALL(x) (x).begin(),(x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef pair<int, int> PI;
typedef pair<int, pair<int, int>> PII;
static const int INF = 1010000000000000017LL;
static const double eps = 1e-12;... | 0 | 16,775,232 |
#include <bits/stdc++.h>
using namespace std;
#define all(n) begin(n), end(n)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
template <clas... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typename T>... | 0 | 92,870,637 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long int x,c,d,n,a,b;
cin>>n>>a>>b;
c=n%(a+b);
x=n/(a+b);
if(c>a)
{
d=(x*a)+a;
}
else
{
d=(x*a)+c;
}
cout<<d<<endl;
} | #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 INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)pr... | 0 | 91,134,991 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep_n(_1, _2, _3, NAME, ...) NAME
#define rep_2(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define rep_3(i, initial, n) for (int(i) = (int)(initial); (i) < (int)(n); ++(i))
#define rep(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep_1)(__VA_ARGS_... | #include <iostream>
using namespace std;
int main(){
int room[4][3][10]={};
int n,bld,flr,num,psn;
cin>>n;
for(int i=0;i<n;i++){
cin>>bld>>flr>>num>>psn;
room[bld-1][flr-1][num-1]+=psn;
}
for(int x=0;x<4;x++){
for(int y=0;y<3;y++){
for(int z=0;z<10;z++){
... | 0 | 61,244,208 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
using P = pair<int,int>;
typedef long long ll;
#define pi 3;
int main()
{
int r;
cin >> r;
int x = 1;
int area = r*r*pi;
int xarea = x*x*pi;
cout << area / xar... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MOD 1000000007
#define MAX 510000
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll x, ll y) {
if (x == 0) return y;
return gcd(y%x, x);
}
ll lcm(ll x, ll y) { return x *... | 0 | 85,751,095 |
#include <iostream>
#include <vector>
#include <string>
#include <queue>
using namespace std;
struct state{
int y, x, d;
};
vector< string > field;
int x, y, d = 0;
void bfs(int H, int W, int n ) {
vector< vector< int > > visited( H, vector< int >( W, 0 ) );
int gx, gy;
for( int i = 0; i < H; i++ ) {
for( int j =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
#define ALL(a) (a).begin(),(a).end()
const ll INF = 1e18+18;
const ll MAX = 200000;
const ll M... | 0 | 69,623,600 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.