code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define PI 3.141592653589
#define setbits(n) __builtin_popcountll(n)
const ll mod=1e9+7;
const ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b)... | 0 |
#include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll n,a,b,c;
cin >> n;
a=n/3;
b=n/5;
c=n/15;
if(n%2==0){
n=n/2*(n+1);
}else{
n=(n+1)/2*n;
}
a=a*(a+1)/2;
b=b*(b+1)/2;
c=c*(c+1)/2;... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << ", " << #y << "=" << y << endl
void solve() {
ll n;
cin >> n;
ll sm = 0;
for (int i = 1; i <= n; i++) {
if (i % 3 == 0 || i % 5 == 0)
continue;... | 1 |
#include <bits/stdc++.h>
#include <string>
//#define local
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#define ll long long
#define pi (acos(-1))
#define rep(i, n) for (unsigned long long i = 0; i < (unsigned long long)(n); ++i)
using namespace std;
std::vector<unsigned ll> genprimevec(const unsigned ll N);
int ma... | /***
coded by adarsh
***/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vec;
typedef vector<vector<ll>> vec2;
typedef pair<ll,ll> pair1;
typedef pair<string,ll> pair2;
typedef pair<ll,string> pair3;
typedef pair<string,string> pair4;
#define fl(i,a,b) ... | 1 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#define PI 3.141592653589793
using namespace std;
int main(){
int n;
string str;
cin>>n;
for(int i=0;i<n;i++){
int cnt=0,num=0;
int rui[5]={0};
while(cin>>str){
if(str=="HIT"){
rui[4]=rui[3];
rui[3]=rui[2];
rui[2]=rui[1];
... | #include<iostream>
#include<string>
using namespace std;
int main(){
int n;
cin>>n;
string event;
getline(cin,event,'\n');
int i=0,out,b,score;
while(n>0){
out = 0;
b = 0;
score=0;
while(out<3){
getline(cin,event,'\n');
if(event=="HIT"){
b*=2;
b+=1;
if(b>8){
b-=8;
score+... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
void darts();
void longest_dis();
void sum_of_three_integers();
void otoshidama();
int main()
{
//darts();
//longest_dis();
//sum_of_three_integers();
otoshidama();
}
void darts()
{
while (true)
{
... | #include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
templat... | 1 |
#include <iostream>
#include <cctype>
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#include <queue>
#include <cstdio>
inline int getInt(){ int s; scanf("%d", &s); return s; }
#include <set>
using namespace std;
char encode(int n){
if(n < 26) return 'a' + n;
return 'A' + n - 26;
}
int decode(char c){
if(isl... | #include <iostream>
#include <set>
using namespace std;
int main()
{
int n, k, a[11], b[11];
while(1)
{
set<int> s;
cin >> n >> k;
if(n==0 && k==0) break;
else
{
for(int i=0; i<n; i++)
{
cin >> a[i];
if(a[i]>9) b[i]=2;
else b[i]=1;
}
for(int i=0; i<n; i++)
{
int x=0;
x=... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define MP make_pair
#define pb push_back
#define ff first
#define ss second
#define sz(x) x.size()
#define all(c) c.begin(),c.end()
#define int long long
#define fr(i,j,x) for(int i=j;i<x;i++)
#define rep(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
const int mod=1000000007;
string k;
int d;
cin >> k >> d;
int n=k.size();
vector<int> now(d,0);
int val=0;
for(int i=0;i<n;i++)
{
vector<int> nxt(d,... | 1 |
#include <iostream>
using namespace std;
int main(){
char c[21];
int n = 0;
while(cin >> c[n]){n++;}
for(int i=n-1;i>=0;i--) cout << c[i];
cout << endl;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
#define all(x) (x).begin(),(x).end()
#define re... | 0 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
ll a[1005][1005];
int n;
int pri[10005],tot;
bool mk[10005];
ll lcm(ll a,ll b) {
if((!a)||(!b)) return a+b;
return 1ll*a/__gcd(a,b)*b;
}
int main() {
scanf("%d",&n);
if(n==2) {
printf("4 7\n23 10");... | #include <bits/stdc++.h>
using namespace std;
using vi=vector<int>;
using vvi=vector<vi>;
using vs=vector<string>;
using msi=map<string,int>;
using mii=map<int,int>;
using pii=pair<int,int>;
using vlai=valarray<int>;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define range(i,s,n) for(int i=s;i<n;i++)
#de... | 0 |
#include <cstdio>
#include <algorithm>
using namespace std;
int w, h;
int map[20][20];
int ans = 11;
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
int dfs(int x, int y, int move){
// printf("x:%d y:%d move:%d\n", x, y, move);
if(move == 11) return 0;
for(int i=0; i<4; i++){
// printf(" direction:%d\n", i);... | #include <iostream>
#include <utility>
#include <string>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <stack>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
const int INF = 1 << 28;
int w, h;
int field[32][32];
int sx, sy;
int gx, gy;
int ofs[4][2] = {... | 1 |
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<queue>
#include<set>
#include<map>
using namespace std;
int main() {
string s;
cin >> s;
vector<pair<char, int>> v;
char last = s[0];
int cnt = 1;
for (int i = 1; i < s.size(); i++) {
if (s[i] == last) {
cnt++;
}
else ... | #include<bits/stdc++.h>
#define endl enjoy_codeforces
int main(){
std::string s;std::cin>>s;
std::cout<<s.substr(0,s.length()-8)<<'\n';
}
| 0 |
#include<stdio.h>
#include<iostream>
#include<string.h>
using namespace std;
typedef long long ll;
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define FORR(i,a,b) for(int i=(int)(b)-1;i>=(int... | #include<bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
int ad(int x,int y) { x+=y; return x>=mod?x-mod:x; }
int sb(int x,int y) { x-=y; return x<0?x+mod:x; }
int mu(int x,int y) { return 1ll*x*y%mod; }
int ksm(int a,int b) {
int ans = 1;
for(;b;b>>=1,a=mu(a,a))
if(b&1) ans = mu(ans,a);
return ans;
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
vector<int>p(N);
for (int i = 0; i < N; i++) {
cin >> p.at(i);
}
vector<int>sum1(N,0);
for (int i = 0; i < N; i++) {
if (i == 0){
sum1.at(i) = p.at(i);
}
else {
sum1.at(i) = sum1.at(i-1) + p.at... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937 mrand(random_device{}());
#define rep(i , l , r) for (int i = (l); i < (r); ++i)
const int N = 2e6 + 5;
const int mod = 998244353;
int n , m;
int fac[N] , ifac[N];
templ... | 0 |
//
// Created by hide on 2020/05/15.
//
//参考：http://ehafib.hatenablog.com/entry/2015/12/23/164517
//インクルード(アルファベット順,bits/stdc++.hは使わない派閥)
#include<algorithm>//sort,二分探索,など
#include<bitset>//固定長bit集合
#include<cmath>//pow,logなど
#include<complex>//複素数
#include<deque>//両端アクセスのキュー
#include<functional>//sortのgreater
#includ... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
#define inf 1e+9
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define rep_rev(i, n) for (int i = n-1; i >= 0; --i)
#define all(x) (x).begin()... | 1 |
#include <bits/stdc++.h>
using namespace std;
void solve () {
long long n;
cin >> n;
long long mn = 1e15 + 1;
long long pos = 0;
for (int i = 0; i < 5; i++) {
long long x;
cin >> x;
if (mn > x) {
pos = i;
mn = x;
}
}
cout << (n % mn > ... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int hour;
int min;
int t1, t2, t3;
t3 = h2 * 60 + m2;
t2 = t3 ... | 0 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <cstring>
using namespace std;
#define ref goto refrain
int main(){
char str[1000];
cin>>str;
int q;
cin>>q;
string order;
int a,b;
char rep[1000];
for(int i=0;i<q;i++){
cin>>order;
cin>>a;
cin>>b;
if(order=="replace"){
... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int a,b;
string s;
vector<char> lst(10);
cin>>a>>b>>s;
bool ans=true;
// for(int i=0;i<s.size();i++){
// cin>>lst.at(i);
// {
for(int i=0;i<s.size();i++){
if (i!=a && ... | 0 |
// 2020-09-14 20:57:26
// clang-format off
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
constexpr ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll N; cin >> N;
ll MAX = 1;
ll WOM = 2;
vecto... | 0 |
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long int llint;
llint v[1000005],dp[1000005],n;
int x[25][25];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for(int i=0;i<n;i++) {
for(int j=0;j<n;j++) {
cin >> x[i][j];
}
}
for(int i=0;i<(1 << n)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
const ll MAXN = 303;
ll dp[MAXN][MAXN*MAXN];
main(){
int n;
cin >> n;
ll arr[n];
int S = 0;
for(int i=0;i<n;++i){
cin >> arr[i];
S += arr[i];
}
fill(&dp[0][0], &dp[0][0] + MAXN*MAXN*MAXN, 0);
dp[0][0] = 1;
f... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<string>vst;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
#define fastio ios_bas... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
int N, K;
cin >> N >> K;
int ans = 0;
for(int i = 1; i <= N - K + 1; ++i) {
ans++;
}
cout << ans << endl;
}
| #include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <list>
#include <numeric>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
//================================================
int... | 1 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int H, W;
vector<string> fi;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
cin >> H >> W;
fi.resize(H);
for (int i = 0; i < H; ++i) cin >> fi[i];
// 多点をスタートとして扱う
vector<vector<int> > dist(H, vector<i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,w;
cin >> h >> w;
vector<bool> a(h*w,false);
queue<int> que;
for(int i = 0; i < h; i++) ... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long r = 1e9 + 7;
long long fac[200001];
long long f(long long a, long long p) {
if (p == 1)
return a;
long long ret = f(a, p / 2);
ret = ret * ret % r;
if (p % 2 == 1)
ret = ret * a % r;
return ret;
}
long long c(int n, int m) {
return fac[n] * ... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
c... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
ll n;
cin>>n;
ll k,p,x,ans;
ans = (n*(n+1))/2;
k = n/3;
p = n/5;
x = n/15;
ans = ans - 3*(k*(k+1)/2) - 5*(p*(p+1))/2 + 15*(x*(x+1))/2;
cout<<ans<<endl;
}
int main()
{
solve();
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
const long long inf=0x3f3f3f3f;
long long bs[maxn];
long long d,dx1[maxn],dx2[maxn];
long long a[maxn],an,ans;
void dfs(long long x,long long v,long long c)
{
if(x==an)
{
ans+=(v==d)*c;
return ;
}
if(abs(v-d)>a[x]*20)
return ;
for(long long i... | 0 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double PI = 3.1415926535897932;
/* a と b の最大公約数を返す関数 */
long long ... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
#include<deque>
#include<cstdio>
using namespace std;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
float D, T, S;
cin >> D >> T >> S;
if((D/S) <= T)
cout << "Yes\n";
else
cout << "No\n";
}
| #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cassert>
using namespace std;
string s,t;
int dp[310][310][310] = {};
int main(){
int i,j,l,n,k;
cin >> s >> k; n = s.size();
for(i=0;i<n;i++){
t.push_back(s[n - 1 - i]);
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
for(l=0;l<=k;l++){
if(s[... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
#define rint register int
#define gc() getchar()
inline int read(rint ans = 0, rint sgn = ' ', rint ch = gc())
{
for(; ch < '0' || ch > '9'; sgn = ch, ch = gc());
for(; ch >='0' && ch <='9';(ans*=10)... | 1 |
#include <bits/stdc++.h>
#define repp(i,l,r)for(long long i=(l);i<(r);i++)
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define per(i,n) for (long long i = (n); i >= 0; --i)
const int INF = 2147483647;//int max
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,i... | #include <bits/stdc++.h>
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FILL0(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
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) { ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | #include<bits/stdc++.h>
using namespace std;
#define re register
#define ll long long
#define int ll
#define get getchar()
#define in inline
in int read()
{
int t=0; char ch=get;
while(ch<'0' || ch>'9') ch=get;
while(ch<='9' && ch>='0') t=t*10+ch-'0', ch=get;
return t;
}
const int _=2e5+5;
int n,q,A,B,x[_];
ll lazy... | 0 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;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; }
lli n;
int main(void){
cin >> n;... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <functional>
using namespace std;
#define R... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<string>
long long INF=1000000000000000000;
long long mod=1000000007;
using namespace std;
long long stair(int N){
long long i=1;
for(int k=2;k<=N;k++){
i*=k;
if(i>mod){
i%=mod;
}
}
return i;
}
int main(){
int N;
ci... | #include <bits/stdc++.h>
using namespace std;
using i64 = std::int_fast64_t;
const int MOD = 1000000007;
template <typename T>
ostream &operator<<(ostream &os, const std::vector<T> &vec) {
for (const auto &e : vec) os << e << (&e == &vec.back() ? "\n" : " ");
return os;
}
int main() {
ios::sync_with_stdio(fal... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (ll i=0;i<(n);i++)
typedef long long ll;
ll modpow(ll a, ll n, ll mod){
ll res=1;
while(n>0){
if(n&1) res = res*a%mod;
a=a*a%mod;
n>>=1;
}
return res;
}
ll modinv(ll a, ll mod){
return modpow(a, mod-2, mod)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
int main()
{
int n = 1;
std::cin >> n;
while (n)
{
std::vector<int32_t> num_list{};
while (n--)
{
int tmp = 0;
std::cin >> tmp;
num_list.push_back(tmp);
}
std::vector<int32_t> comfarm_list{};
std::vector<int32_t> sum_list{};
fo... | #include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int n,i,j,d,m[11][11];
while(cin >> n) {
if (n==0) break;
memset(m,0,sizeof(m));
for (i=0;i<n;i++) for (j=0;j<n;j++) {
cin >> d;
m[i][j]=d; m[i][n]+=d; m[n][j]+=d; m[n][n]+=d;
}
for (i=0;i<=n;i++) {
for (j... | 0 |
#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1e18;
using Graph = vector<vector<int>>;
signed main() {
int N, T;
cin >> N >> T;
vector<pair<int, int>> dish(N);
for( int i = 0; i < N; i++ ){
int A, B;
cin >> A >... | #include<bits/stdc++.h>
using namespace std;
#define N 2005
int n,m,f[N][N],L[N],R[N],ans,stk[N];
bool a[N][N];
char s[N];
int main(){
scanf("%d%d",&n,&m);
for (int i=1;i<=n;++i){
scanf("%s",s+1);
for (int j=1;j<=m;++j) a[i][j]=s[j]=='.';
}
for (int i=n;i;--i){
for (int j=1;j<m;++j)
if ((a[i][j]^a[i][j... | 0 |
#include <iostream>
#include <vector>
#include<algorithm>
#include<iomanip>
#include<queue>
#include<map>
#include<bitset>
#include<math.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
typedef pair<int,int> pint;
typedef long long ll;
const int inf =... | #include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
using namespace std;
#define int long long
const int N = 3e5 + 5 , mod = 1e9 + 7;
//void add(int &x , int y){
// x += y;
// if(x >= mod)
// x -= mod;
//}
char s[N];
long long n , ans;
long long f[N][3][3];
void add(long long &a, long lo... | 1 |
#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 l, r;
cin >> l >> r;
if(r - l >= 2019) cout << 0 << endl;
else{
vector<int> n;
for(int i = l; i <= r; i++){
n.push_back(... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y);
const int INF = 1001001001;
int main() {
ll l, r;
cin >> l >> r;
r = min(l+2019, r);
ll ans = INF;
for (ll i = l; i <= r; i++)... | 1 |
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#include <iostream>
#include <string>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <cassert>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
#include <queue>
#include <rand... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll maxSubarrayXOR(ll a[], int n) {
int index = 0;
for(int i = 60; i >= 0; i--) {
int pos = index;
int f = 0;
for(int j = index; j < n; j++) {
if(a[j] & (1LL << i)) f = 1, pos = j;
}
if(!f) co... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a[26];
for (int i = 0; i < 26; i++) a[i] = 0;
bool occur = true;
cin >> s;
for (int i = 0; i < s.size(); i++)
{
a[s[i] - 97]++;
}
for (int i = 0; i < 26; i++)
{
if (a[i] == 0)
{
... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
string S;
cin >> S;
vector<bool> v(26);
for (int i = 0; i < S.size(); i++) {
char ch = S.at(i);
int n = (int)ch - 97;
v.at(n) = 1;
}
string ans = "None";
for (int i = 0; i < 26... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll=long long;
int main(){
int n,m;
cin>>n>>m;
string ans{};
rep(i,n) ans.push_back('a');
bool err=false;
rep(i,m){
int s;
char c;
cin>>s>>c;
s--;
if(ans[s]==... | #include<cmath>
#include<queue>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define INF 1000005
#define MAXN 500000
int read()
{
int f=1,x=0;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
while(s>='0'&&s<='9'){x=x*10+s-'0'... | 0 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
// Acknowledgement: Special thanks to kyomukyomupurin, who developed this
// template.
template <class T, class U>
std::os... | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
ll mod = 1000000007;
int main() {
ll h, w;
cin >>... | 1 |
#include <bits/stdc++.h>
#define rep(i,s,n) for (int i = (s); i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n+2, 0);
rep(i,1,n+1) cin >> a[i];
int k = 0;
rep(i,0,n+1) {
k += abs(a[i] - a[i+1]);
}
rep(i,1,n+1) {
int ans = k - abs(a[i-1] - a[i]) - abs(a[i] - a[i+1]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
int main(){
int n; cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
deque<int> d;
rep(j,n){
int i = lower_bound(d.begin(), d.end(), a[j]) - d.be... | 0 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef pair<int, int> P;
const int INF = 1 << 24;
int c[200][200];
int t[200][200];
int cost[200][200];
int tim[200][200];
int main(){
int n, m, K;
int p, q, r;
while(cin >> n >> m && (n || m)){
fill(&cost[0][0], &cost[199][199] + 1... | #include <iostream>
#include<algorithm>
#include <vector>
#include <functional>
#include <limits.h>
template<typename T, typename S>
struct LazySegTree{
int size;
std::vector<T> nod;
std::vector<S> monoid;
std::vector<bool> flag;
T t0;
S s0;
std::function<T(T,T)> operation;
std::functio... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;
int n;
string ans, newans;
int main() {
cin.tie(0), ios::sync_with_stdio(0);
cin >> n;
cout << "0\n";
cout.flush();
cin >> ans;
if(ans == "V... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
cin >> n;
cout << 0 << endl;
string s;
cin >> s;
int a;
if (s == "Male") {
a = 1;
} else if (s == "Female") {
a = 0;
}
int l = 0, r = n;
while (s != "Vacant") {
int c = (l + r) / 2;
cout << c << endl;
cin >> s;
if... | 1 |
#include <iostream>
using namespace std;
int main()
{
int d;
while (cin >> d)
{
cout << 72000000 - 180000 * d + 100 * d * d << endl;
}
return 0;
} | #include<stdio.h>
int main()
{
int a,b,c,d,s,s1;
scanf("%d%d%d%d",&a,&b,&c,&d);
if(a<b)
s=a;
else
s=b;
if(c<d)
s1=c;
else
s1=d;
printf("%d\n",(s+s1));
} | 0 |
#include<bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<long long> vl;
typedef pair<long long, long long> pl;
typedef vector<vector<long long>> matrix;
#define F first
#define S second
#define PB push_back
#define MP ... | 0 |
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
const int Mod=998244353;
int n,K;
#define Maxn 305
char S[Maxn];
int a[Maxn],cnt=0;
int dp[Maxn][Maxn][Maxn];
int main(){
scanf("%s",S+1);scanf("%d",&K);
n=strlen(S+1);
S[n+1]='0';
n++;
int lst=0;
for(int i=1;i<=n;++i)
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)x.size())
template<class T>bool chmax(T &a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,T b){if(a>b){a=b;return 1;... | 0 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define F first
#define S second
#define all(v) (v).begin(),v.end()
#define np next_permutation
using namespace std;
using vi=vector<int>;
#define rep(i,n) for(int i=0;i<n;i++)
#define reps(i,j,n) for(int i=j;i<=n;i++)
#define vii... | #include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const char* sol3[3]={"aab","c.b","cdd"};
const char* sol4[4]={"aacd","bbcd","efgg","efhh"};
const char* sol5[5]={"aabbc","dee.c","d..fg","h..fg","hiijj"};
const char* sol6[6]={"aabbc.","ddeec.",".f.g.h",".f.g.h","i.j.kk","i.j.ll"};
const char* sol7[... | #include <bits/stdc++.h>
#include <iostream>
#include <ctime>
using namespace std;
#define _LL long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vecrep(itr, v) for (auto itr = (v).begin(); itr != (v).end(); itr++)
#define MMAX (1000*1000)
pair<int, int> _next[MMAX];
int _in[MMAX];
int _day[MMAX];
... | 0 |
//In the name of GOD
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 2e5 + 100;
const ll maxm = 1e6 + 100;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("input.txt" , "r+" , stdin) ; freopen... | #include <bits/stdc++.h>
#define mod 1000000007
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define nyan "(=^･ω･^=)"
#define mkp make_pair
#define lP pair<ll, ll>
#define iP pair<int,int>
typedef long long ll;
using namespace std;
int N, M, K, A, B, C, D[100000], vis[100000];
map<int, ve... | 1 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define deb... | 1 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <map>
#include <cstdio>
using namespace std;
int main(){
int a[12];
while(scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d"
,&a[0],&a[1],&a[2],&a[3],&a[4],&a[5],&a[6],&a[7],&a[8],&a[9],&a[10],&a[... | #include <algorithm>
#include <cmath>
#include <iostream>
#define MAX_N 100000
using namespace std;
struct Test
{
long long score, upper, lower;
long long sum();
};
Test tests[MAX_N];
long long cum[MAX_N + 1];
long long N, X;
long long aokiScore;
bool cmp( Test u, Test v ) { return u.sum() > v.sum(); }
l... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
int sum = 1;
for(int i = 0; i < N; i++){
if((sum * 2) - (sum + K) > 0){
sum += K;
} else {
sum *= 2;
}
}
cout << sum << endl;
}
| 0 |
//#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const long long INF= 1e+18+1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll> >vvl;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> T;
const ll MOD=1000... | #include <stdio.h>
#include <iostream>
#include <string>
#include <algorithm>
#define rep(index,max) for(int index=0;index<max;index++)
using namespace std;
int main(){
string s1,s2;
int l1,l2;
cin>>s1>>s2;
l1=s1.length();
l2=s2.length();
int dp[1010][1010];
rep(i,l1+1) dp[i][0]=i;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define VI vector<int>
#define MOD 1000000007
typedef long long int ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } ... | // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_13_A&lang=ja
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
// 盤面の縦横サイズ
const int SZ = 8;
// クイーンが... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m; cin >> n >> m;
ll ansAC = 0;
ll ansWA = 0;
vector<bool> usedAC(n, false);
vector<int> cntWA(n, 0);
for (int i = 0; i < m; i++) {
int p; string s; cin >> p >> s;
--p;
if (s == "AC") {
if (usedAC[p]) {}
else {
... | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <ctime>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
... | 0 |
#include<iostream>
using namespace std;
int main(){
int n,cnt=0,num=0;
int base[4]={0};
cin>>n;
string s;
while(1){
cin>>s;
if(s=="HIT"){
base[3]+=base[2];
base[2]=base[1];
base[1]=base[0];
base[0]=1;
}
if(s=="HOMERUN"){
for(int i=0;i<3;i++){
base[3]+=base[i];
base[i]=0;
}
bas... | #include<stdio.h>
#include<string.h>
#include<math.h>
int main(void)
{
long long int g[1001],s[1001],d[1001],f[1001];
int j,i,k,a,h[1001];
while(1){
scanf("%d",&a);
if(a==0) break;
for(i=0;i<a;i++){
h[i]=0;
g[i]=0;
}
for(i=0;i<a;i++){
scanf("%lld %lld %lld",&s[i],&d[i],&f[i]);
if(d[i]*f[i]>=100... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
ll sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
string L;
string R;
rep(i, tx - sx)
{
L += 'L';
R += 'R';
}
string U;
string D;
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(){
cin.tie(0)->sync_with_stdio(false);
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
int dy = ty - sy;
int dx = tx - sx;
REP(i, dy) cout << 'U';
REP(i, dx) cout << 'R';
REP(i, dy) cout << 'D';
REP(i... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
ll n,m;
cin >> n >> m;
ll p[m];
string s[m];
rep(i,m) cin >> p[i] >> s[i];
ll acnum[n+1];
for(ll i = 0; i < m; i++){
if(s[i] == "AC"){
acnum[p[i]] = 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int N=4e5+5;
int n,m,ty,now,b[N],v[N],vi[N],nex[N],head[N];
void addedges(int x,int y){
nex[++now]=head[x];
head[x]=now,v[now]=y;
}
long long c,one,two;
void dfs(int x,int y){
vi[x]=y;
for(int i=head[x];i;i=nex[i])
if(!vi[v[i]]) dfs(v[i],y^1);
else if(vi[v[i]]=... | #include<bits/stdc++.h>
using namespace std;
const int md=1e9+7;
int n,m,f[33005][20],c[33005][20],d[20][20];
vector<pair<int,int> >g[20];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
int u,v,w;
scanf("%d%d%d",&u,&v,&w);u--;v--;
d[u][v]=d[v][u]=w;
}
for(int msk=0;msk<(1<<n);msk++)for(int i=0;i<n... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldouble = long double;
const ll inf = 1ll << 60;
const ll mod = (ll)1e9 + 7;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define print(s) cout << s;
#define println(s) cout << s << ... | #include <bits/stdc++.h>
using namespace std;
int main()
{int N, i{}; cin >> N;
while ((i + 1) * (i + 1) <= N) ++i;
cout << i * i;} | 1 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
int main(){
int n; cin >> n;
string s; cin >> s;
int open=0, ans=1;
for(int i=0;i<2*n;i++){
if((s[i]=='B' && (open&1)) || (s[i]=='W' && (!(open&1)))){
if(open<=0){
cout << 0 << endl;
return 0;
}
ans=(1ll*ans*open)%mod;
ope... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
// typedef pair<ll, ll> P;
typedef pair<string, string> P;
#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define R... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<string> vec = {"SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"};
int cnt = 0;
for (string x:vec) {
if (S == x) {
cout << 7 - cnt << endl;
} else {
cnt++;
}
}
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <stack>
#include <set>
#include <queue>
#include <iomanip>
#include <math.h>
#include <fstream>
using namespace std;
class pqComp
{
public:
bool operator()(pair<int, int> &a, pair<int, int> &b)
{
return a.second < b.sec... | 0 |
#include <stdio.h>
int main(){
int n;
int n1, n2, n3;
scanf("%d", &n);
n1 = n/100;
n2 = (n%100)/10;
n3 = n%10;
if (n1 == 7 || n2 == 7 || n3 == 7){
printf("Yes\n");
}
else {
printf("No\n");
}
return 0;
} | // God put a smile upon your face <3
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug p... | 1 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
char s[5000];
long long n,i,j,k,total=0,red[5000]={0},green[5000]={0},blue[5000]={0},r=0,g=0,b=0,x,y;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>s[i];
if(s[i]=='R')
{
r++;
red[i]=red[i-1]+1;
... | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
long long n, r = 0, b = 0, g = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++)
{
if (s[i] == 'R') r++;
else if (s[i] == 'B') b++;
else g++;
}
long long ans = r * g * b;
for (int ... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef pair<ll,ll> PLL;
#define REP(x,l,u) for(ll x = l; x < u; x++)
#define RREP(x,l,u) for(ll x = l; x >= u; x--)
#define all(x) x.begin(), x.end... | #include <vector>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 10;
const int MOD = (int)1e9 + 7;
int n, l;
int go[N][2];
int dp[2][N];
char s[300000 + 5];
void solve()
{
n = 8;
go[0][0] = 2;
go[0][1] = 3;
go[1][0] = 4;
go[1][1] ... | 0 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
vector<vector<int>> G;
vector<int> colors;
bool dfs(int v, int color = 0) {
colors[v] = color;
for(auto u : G[v]) {
if (colors[u] != -1) {
if (colors[u] == color) return false;
continue;
}
if(!dfs(u, 1 - color)) return f... |
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define LL long long
#define IT iterator
#define PB push_back
#define II(a,b) make_pair(a,b)
#define FIR first
#define SEC second
#define FREO freopen("check.out","w",stdout)
#define rep(a,b)... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int MAX = 2*1e5;
bool IsPrime(long long n){
if(n == 1) return false;
for(long long i = 2; i * i < n; i++){
if(n%i == 0) return false;
}
return true;
}
vector<pair<long long, long long>> PrimeFactorize(long long n){
vector<p... | #include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<vector<ll> > Graph;
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 ... | 0 |
#include<bits/stdc++.h>
using namespace std;
template<class T> void chmax(T&x, T y){if(x < y) x = y;}
int N, K;
vector<int> G[100010];
int ans;
int dfs(int v, int p){
int mx = 0;
for(auto u : G[v]){
chmax(mx, dfs(u, v));
}
if(mx == K - 1 && p > 1) mx = -1, ans++;
return mx + 1;
}
int main... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | 1 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
int main(){
int N;
cin >> N;
int sum = 0;
double ave = 0;
double mini = 100;
double aa = 0;
int ans = 0;
vector<int> a(N);
for(int i = 0;i < N;i++){
cin >> a.at(i);
sum += a.a... | 1 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long int
#define s(x) cin>>x... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N; cin >> N;
vector<int64_t> A(N);
int64_t MOD = 1e9 + 7;
for (int i = 0; i < N; i++) cin >> A.at(i);
int64_t sum = 0;
/* O(N^2)
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
if (i ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int64_t N, K;
cin >> N >> K;
vector<int> p(N);
vector<double> memo(N + 1);
memo.at(0) = 0;
for (int64_t i = 0; i < N; i++) {
cin >> p.at(i);
memo.at(i + 1) = (memo.at(i) + ((p.at(i) + 1) / 2.0));
}
double ans = 0;
for (int64_t i = 0... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#define _GLIBCXX_DEBUG
#include <iomanip>
using namespace std;
templa... | 0 |
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 2e5;
const int posp[4] = {3, 2, 1, 0}, negp[4] = {1, 0, 3, 2}, parp[4] = {2, 3, 0, 1};
const bool post[4] = {1, 1, 0, 0}, negt[4] = {0, 1, 1, 0}, part[4] = {1, 1, 0, 0};
int n, x[N + 1], y[N + 1], u[N + 1], id[256], ans = 0x7ff... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
const ll MOD = 1e9 + 7;
const ll limit = 100010;
using edge = struct { ll to; ll cost; };
V<edge> G[limit];
ll dis[limit];
void dfs(... | 0 |
#include <bits/stdc++.h>
using namespace std;
inline char Get(){
static char ch; ch = getchar();
while (ch != '\n' && ch != '0' && ch != '1' && ch != '?') ch = getchar();
if (ch == '\n') return '*';
return ch;
}
const int P = 1e9 + 7;
inline void upd(int &x,int v){ x = (x+v>=P)?(x+v-P):(x+v); }
int f[9],g[9],nxt[9]... | // This amazing code is by Eric Sunli Chen.
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using ... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(),(x).end()
using namespace std;
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 ... | #include <iostream>
#include <math.h>
using namespace std;
void Solve(int a)
{
const double pi = 3.14;
float ans;
ans = 2 * pi * a;
cout << ans;
}
int main()
{
int x;
cin >> x;
Solve(x);
return 0;
} | 0 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
string S;
cin >> S;
for (int i = 0; i < S.length() - 8; i++) {
cout << S[i];
}
cout << endl;
}
| #include <iostream>
#include <map>
int main(void){
char ans='0';
std::string S;
std::cin >> S;
std::map<char, int> mp;
for (int i=0; i<26; ++i){
mp[(char)('a' + i)] = 0;
}
for (char c: S) ++mp[c];
for (int i=0; i<26; ++i){
if (mp[(char)('a' + i)] == 0){
ans... | 0 |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <algorithm>
#include <iomanip>
#include <functional>
#include <numeric>
#define REP(i, n) for(int i = 0;i < (n); i++)
#define REP2(i, x, n) for(int i = (x); i < (n); i++)
#de... | #include <iostream>
using namespace std;
void reverseSequence()
{
char s[20];
cin >> s;
int i;
for (i = 0; i < 20; i++)
{
if (s[i] == '\0')
{
break;
}
}
for (int j = i - 1; j >= 0; j--)
{
cout << s[j];
}
cout << endl;
}
int main()
{
reverseSequence();
return 0;
} | 1 |
#include <iostream>
#include <vector>
int main()
{
long long N;
std::cin >> N;
long long n_r = 0, n_g = 0, n_b = 0;
std::vector<char> S(N);
for (long long i = 0; i < N; i++)
{
char c;
std::cin >> c;
S[i] = c;
if (c == 'R')
{
n_r++;
}
... | #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 (... | 0 |
///Bismillahir Rahmanir Rahim
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = (int)1e5 + 9;
co... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD=1e9+7;
int main(void){
int h,w;
cin>>h>>w;
vector<string> M(h);
rep(i,h) cin>>M[i];
queue<pair<int,int>> que;
vector<vector<int>> seen(h,vector<int>(w,-1));
rep(i,h) rep(j,w){
... | #include <bits/stdc++.h>
#include <numeric>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define per(i,n) for (int i = n - 1; i >= 0; --i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax... | 0 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long; using ull = unsigned long long;
#define int ll
using vb = vector<bool>; using vvb = vector<vb>;
using vi = vector<int>; using vvi = vector<vi>;
using vl = vector<ll>; using vvl = vector<vl>;
using pii = pair<int,int>; using pll = pair<ll,ll>;
#define F... | #include <iostream>
const int N = 7;
typedef struct {
int panels[N];
int upper;
int east;
int south;
} Dice;
void rotate_dice(int *x, int *y, int d) {
*x = *y;
*y = d;
}
int main(void) {
Dice dice;
for (int i = 1; i < N; i++) {
std::cin >> dice.panels[i];
}
dice.upper = 1;
dice.east = 3;... | 1 |
#include<iostream>
#include<string>
int main() {
int K;
std::string S;
std::cin >> K >> S;
if (S.size() <= K) std::cout << S << std::endl;
else {
std::string answer = S.substr(0, K);
answer += "...";
std::cout << answer << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<string.h>
using namespace std;
#define pb push_back
#define all(v) v. begin(),v. end()
#define rep(i,n,v) for(i=n;i<v;i++)
#define per(i,n,v) for(i=n;i>v;i--)
#define ff first
#define ss second
#define pp pair<l... | 1 |
#include <bits/stdc++.h>
using namespace std;
//Made with <3 by MinumCoklatPanas
typedef long long ll;
const ll INF = 1e9;
const ll INFF = 1e18;
const ll MAXN = 510;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
const double INFD = 1E9;
const double EPS = 1e-9;
ll mul(ll x,ll y)
{
return ((x % MOD) * (y %... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
constexpr const int mod = 1000000007;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
ll ans = 0, two_factor = 1;
rep(i, 60) {
ll ev... | 1 |
#include<stdio.h>
void devide(int x, int y, int z)
{
if((x == 100) || (y == 100) || (z == 100)) {
printf("A\n");
} else if ((x + y) >= 90*2) {
printf("A\n");
} else if ((x + y + z) >= 80*3) {
printf("A\n");
} else if ((x + y + z) >= 70*3) {
printf("B\n");
} else if (... | #define _USE_MATH_DEFINES
#define INF 10000000
#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
using namespace std;
typ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<long long> A(N), sumA(N+1, 0);
long long mod_ = 1000000007;
for (int i=0; i<N; i++){
cin >> A.at(i);
sumA.at(i+1) = sumA.at(i)+A.at(i);
if (sumA.at(i+1) >= mod_) sumA.at(i+1) %= mod_;
}
long long ans = 0;
l... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
int n;
string abc = "abcdefghijklmnopqrstuvwxyz";
string abcc = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string aa = abcc + abc + abcc + abc;
int sz = aa.size();
while (cin >> n) {
if (n == 0) {
break;
}
vector<int> k(n);
... | 0 |
#include <stdio.h>
#include <string.h>
int main(){
int a, b;
scanf("%d %d", &a, &b);
getchar();
char str[a+b+1];
scanf("%s", &str);
int length = strlen(str);
int flag = 0;
for(int i=0; i<length; i++)
{
if(str[i] >= '0' && str[i] <= '9')
{
continue; //kl ada yg bukan angka, di skip
}
else if ('0... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define REV(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define ts to_st... | 1 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
// a>b -> a==b;
template<class T> inline bool chmin(T& a... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin>>s;
reverse(s.begin(),s.end());
int n=s.size();
string t = s.substr(8,n-8);
reverse(t.begin(),t.end());
cout << t << endl;
} | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
typedef long long ll;
const int INF = 1e9+1;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
int div(int x) {
int cnt = 0;
for (int i = 1; i <= x;i++) {
if (x % i == 0)cnt++;
}
re... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int H, W;
int seen[10000][10000];
char S[10000][10000];
vector<pair<ll, ll>> prime_factorize(ll n) { //素因数分解と各素数の個数
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= n; i++)
{
if (n % i != 0)
{
continue;
... | 1 |
#include<iostream>
using namespace std;
typedef long long LL;
const int N = 1e5;
int a[N];
int info[N];
bool check_feasibility(int n)
{
for(int i = 2; i < n; i++)
a[i] = a[i-2]^a[i-1]^info[i-1];
if((a[n-2]^a[n-1]^a[0])!=info[n-1] || (a[n-1]^a[0]^a[1])!=info[0])
return false;
else
return true;
}
bool solve(int ... | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<l... | 1 |
#include<iostream>
using namespace std;
#include <cmath>
int main(){
int n;
cin >> n;
cout << (int)pow((int)sqrt(n),2) << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main()
{
int N;
cin >> N;
int a = N % 10;
int b = ((N-a) % 100) / 10;
int c = ((N-b*10) % 1000) / 100;
if (a == 7 | b == 7 | c == 7) {
cout << "Yes";
}
else {
cout << "No";
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void)
{
int N;
cin >> N;
vector<vector<int>> part(3, vector<int>(N));
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < N; j++)
{
cin >> part[i][j];
}
sort(part[i].begin(),part... | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
class Dice
{
private:
int surf[6];
public:
void set_surf(int* input);
void roll(char orient);
void disp_top();
};
void Dice::set_surf(int* input)
{
memcpy(surf, input, 6*sizeof(int));
}
void Dice::roll(char ... | 0 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef uns... | 1 |
#include <iostream>
#include <algorithm>
#include <string>
#include <set>
#include <vector>
using namespace std;
set<int> guest;
int n, m;
vector<int> people[501];
int main()
{
while((cin >> n >> m) && n && m)
{
int a, b;
int t;
for(int i=0;i<m;i++)
{
cin >> a >> b;
... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#inclu... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N), B(N);
for(int i=0; i<N; i++) cin >> A[i];
for(int i=0; i<N; i++) cin >> B[i];
reverse(B.begin(), B.end());
int dup = -1;
vector<int> dup_idx, avail_idx;
for(int i=0; i<N; i++) if(A[i] =... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n),b(n),asum(n+1,0),bsum(n+1,0);
rep(i,n){
cin >> a[i];
asum[a[i]]++;
}
rep(i,n){
cin >> b[i];
bsum[b[i]]++;
}
rep(i,n+1){
if(asum[i] ... | 1 |
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
vector< vector<int> > G(100002);
int n_v, n_e;
int prenum[100001], parent[100001], lowest[100001], n_child[100001];
bool is_cut[100001];
void dfs(int u, int f, int t_stamp){
prenum[u] = t_stamp;
parent[u] = f;
low... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
#define MOD 1000000007
/*
void dijkstra(vector<vector<pair<ll,int>>> &graph, vll &dist, int s){
priority_queue<pair<ll,int>> que;
dist[s]=0;
que.push({0,s});
... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
int main() {
std::vector<int> v;
std::vector<int> w;
int n;
std::cin >> n;
while (n-- > 0) {
int m;
std::cin >> m;
v.push_back(m);
}
std::cin >> n;
while (n-- > 0) {
int m;
std::cin >> m;
... | #include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <math.h> // sqrt
using namespace std;
typedef long long ll;
int main() {
int N, Q;
string S;
cin >> N >> Q... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 7;
int x[MAXN], st[MAXN][18];
int main()
{
int n; scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &x[i]);
int L, Q; scanf("%d%d", &L, &Q);
// memset(st, 0x3f3f3f3f, sizeof(st));
for (int i = 1; i <= n; i++)
st[i][0... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <string>
#include <cstring>
#include <set>
#include <vector>
#include <map>
using namespace std;
typedef long long LL;
const LL INF = 0x7ffffffff;
const LL NBDR = -2e7;
const LL BDR = 2e7;
const LL ... | 0 |
#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#d... | #include <bits/stdc++.h>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<end... | 0 |
#include <iostream>
using namespace std;
struct Dice
{
Dice(int d[6]){
for(int i = 0; i < 6; ++i)
n[i] = d[i];
}
void toN(){ shift( n[0], n[1], n[5], n[4] ); }
void toS(){ shift( n[0], n[4], n[5], n[1] ); }
void toW(){ shift( n[0], n[2], n[5], n[3] ); }
void toE(){ shift( n[0], n[3], n[5], n[2] ); }
void s... | #include<iostream>
using namespace std;
int main () {
long n, b, min, max;
long total = 0;
min = 1000000;
max = -1000000;
cin >> n;
for(int i=0; i < n; i++) {
cin >> b;
if (b < min) {
min = b;
}
if (b > max) {
max = b;
}
tot... | 0 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
vector<int> array;
cin >> n;
for(int i=0; i<n; i++){
int a;
cin >> a;
array.push_back(a);
}
for(int i=array.size()-1; i>=1; i--){
cout << array[i] << " ";
}cout << array[0] << endl;... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define reps(i,n) for(int i=1;i<=(int)n;i++)
#define all(v) ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
cout << a*b;
}
| #include<iostream>
#include<cstring>
using namespace std;
double eps = 1e-5;
int main() {
long long a;
double b;
string s;
cin >> a;
cin >> b;
cout << (long long)(a * (long long)(b*100 + eps * 100)) / 100;
// system("pause");
} | 1 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#define rep(i, n) for (int i = 0; ... | #include <cstdio>
int N, a[100001], ref[100001], _[3][100001], d[100001], T[100001], cover[100001];
void P(int x)
{
while (x <= N)
{
T[x]++;
x += x & -x;
}
}
int G(int x)
{
int r = 0;
while (x)
{
r += T[x];
x &= x - 1;
}
return r;
}
int main()
{
scanf("%d", &N);
for (int i = 0; i < 3; i++)
for (int ... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.