code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 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>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
vector<P> test[15];
... | #include <cstdio>
#include <vector>
using namespace std;
struct node{
int key;
int parent, left, right;
node(){ parent=-1; left=-1; right=-1; }
};
vector<node> tree;
int root=-1;
void print_pre(int id)
{
if(id==-1){ return; }
printf(" %d", tree[id].key);
print_pre(tree[id].left);
print_p... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
vector<int > p(2);
rep(i,2){cin >> p[i];}
cout << p[1] + (p[1]-p[0]) << endl;
} | //Radhe Radhe
#include<bits/stdc++.h>
#define godspeed ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define rep1(i,a,b) for(ll i=a; i<=b; i++)
#define repVect(i,n) for(ll i=0; i<sum.size(); i++)
#d... | 1 |
#include <iostream>
#include <math.h>
using namespace std;
void factor(int n,int arr[]){
for(int i=2;i<=n;i++){
if(n%i==0){
arr[i]+=1;
factor(n/i,arr);
break;
}
}
}
int main() {
int n;
cin>>n;
int arr[n+1]={0};
for(int i=1;i<=n;i++){
factor(i,arr);
}
long int result=1;
for(int i=0;i<=n;i++)... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define bitsz(x) int(__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define rall(... | 1 |
#include "bits/stdc++.h"
#define ll long long
#define lld long double
#define MOD 998244353
#define inf 1000000000
#define pii pair<int,int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(... | #include <stdio.h>
#include <string.h>
int main (){
char a[3][35];
int length [3];
for (int i = 0;i<3;i++){
scanf ("%s", a[i]);
length[i]=strlen(a[i]);
}
if(a[0][length[0]-1]== a[1][0] &&a[1][length[1]-1]==a[2][0]){
printf("YES");
}else{
printf("NO");
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
int N;
cin >> N;
map<int, int> mp;
bool is = true;
rep(i, N){
int a;
cin >> a;
if(mp.count(a) != 0){
is = false;
break;
... | #include <bits/stdc++.h>
#include <cstdlib>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> A(N);
string ans="YES";
map<int, int> hoge;
rep(i,N) {
cin >> A[i];
if(hoge[A[i]] == 1) ans="NO";
else hoge[A[i]] = 1;
}
... | 1 |
/*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(fa... | #include <bits/stdc++.h>
using namespace std;
//type
#define ll long long
typedef pair<int, int> P;
//定数
#define INF 1000000000000 //10^12:∞
#define MOD 1000000007 //10^9+7:合同式の法
#define MAXR 100000 //10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair //pairのコンストラクタ
#define F first //pa... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
... | #include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, q, l, r;
string s;
cin >> n >> q >> s;
vector<int> ac(n + 1, 0);
for (int i = 1; i < n; i++) {
if (s[i-1] == 'A' && s[i] == 'C') ac[i] = ac[i-1]... | 1 |
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
int main()
{
int n, q;
int count = 0;
int s[10000];
int t[500];
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> s[i];
}
cin >> q;
for (int i = 0; i < q; i++)
{
cin >> t[i];
}
for (int i =... | #include <cstdio>
int main(){
int n;
int a[3];
scanf("%d", &n);
for(int i = 0; i < n; i++) scanf("%d", &a[i]);
for(int i = 1; i <= 100000000; i++){
bool ok = true;
for(int j = 0; j < n; j++){
if(a[j]%i != 0) ok = false;
}
if(ok) printf("%d\n", i);
}
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int a,b; cin >> a >> b;
string s; cin >> s;
bool ok = true;
if(s.size()!=a+b+1) ok = false;
a--;b--;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string A, B, S;
cin >> A >> B >> S;
cout << ((regex_match(S, regex("\\d{" + A + "}-\\d{" + B + "}"))) ? "Yes" : "No") << "\n";
} | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(cons... | #include<iostream>
#include<vector>
using namespace std;
vector<long> dp;
vector<long> pre;
void rec(int i, vector<int>& nottaken, long scoresofar, int mask, int group)
{
if(i==nottaken.size())
{
dp[mask]=max(dp[mask],scoresofar+pre[group]);
return;
}
rec(i+1,nottaken,scoresofar,mask,group);
rec(i+1... | 0 |
#include <iostream>
using namespace std;
int main(){
int n,b[200],bb[200][200],a,c,min;
cin>>n;
for(int i=1;i<n;i++){
cin>>a>>c;
b[i]=a;
}
cin>>a>>c;
b[n]=a;
b[n+1]=c;
for(int i=1;i<=n;i++){
bb[i][i]=0;
if(i<n)bb[i+1][i]=b[i]*b[i+1]*b[i+2];
}
for(int i=2;i<=n-1;i++){
for(int j=1... | #include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
#define int long long
using namespace std;
int dp[111][111],n,L[111],R[111];
int dfs(int l,int r){
if(dp[l][r]!=-1)return dp[l][r];
if(l==r)return dp[l][r]=0;
int res=1e17;
for(int i=l;i<r;i++){
res=min(res,dfs(l,i)+dfs(i+1,r)+L[l]*R[i]*R[r]);
}
retu... | 1 |
#include <iostream>
#include <string>
#include <iomanip>
using namespace std;
int main()
{
int n;
while (cin>>n)
{
if (n == 0)break;
int data[11][11] = { 0 };
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
cin >> data[i][j];
}
}
for (int i = 0; i < n; i++) //????????... | #include <stdio.h>
#include <string.h>
#include <string>
#include <iostream>
#include <vector>
#include <sstream>
#include <memory>
#include <iomanip>
std::vector<int> parse_line(std::string const& line) {
using namespace std;
vector<int> result;
istringstream s(line);
string element;
while (getlin... | 1 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"N... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define repe(i,n) for(int i=0;i<n;i++)
#define repa(i,j,n) for(int i=j;i<n;i++)
//#define v.all() v.begin(),v.end()
#define repr(i,n) for(int i=n;i>=0;i--)
#define int long long int
#define vi vector<int>
#define vpi vector<pair<int,int>... | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
int main(){
long n;
cin >> n;
string ans = "";
while(n){
if(n%2==0){
ans.push_back('0');
}else{
ans.push_back('1');
n -= 1;
}
n /= (-2);
}
if(int(ans.size())==0)ans.pu... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | 1 |
#include <bits/stdc++.h>
#define debug(var) do{std::cerr << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cerr << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cerr << e << " "; } std::cerr << std::endl;}
template<typename T> void vi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e17;
const int N=2e5+10;
int a[N];
ll f[N],c1[N],c2[N];
int n;
int main() {
ll ans,cnt;
int i;
ans=-INF;
scanf("%d",&n);
for (i=1;i<=n;i++) {
scanf("%d",&a[i]);
if (i==1) c2[i]=a[i];
else if (i%2==0) c1[i]=c1[i-2]+a[i];
else ... | 1 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert>
#include <vector>
#include <ostream>
#include <istream>
#include <stack>... | #include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define N 305
using namespace std;
int n, k, dp[N][N][N];
char s[N];
int f(int bas, int son, int k){
if(bas == son)
return 1;
if(bas > son)
return 0;
int &r = dp[bas][son][k];
if(r != -1)
return r;
if(s[ba... | 0 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
// increment
#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... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (int i = (a), i##end = (b); i >= i##end; --i)
namespace IO {
#define gc getchar()
template <typename T>
inline void read(T& x) {
x = 0; bool f = 1; char ch;... | 0 |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
v... | #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<memory.h>
using namespace std;
typedef long long ll;
const int Max = 4e5 + 5;
int lst[Max];
int main()
{
int n, x;
cin >> n >> x;
for (int i = 1;i <= n;i++)
{
scanf("%d", &lst[i]);
}
ll sum = 0;
if (lst[1] > x)
{
sum = lst[1] -... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
vector<string> blue(N);
for(int i = 0; i < N; i++){
cin >> blue.at(i);
}
cin >> M;
vector<string> red(M);
for(int i = 0; i < M; i++){
cin >> red.at(i);
}
int ans = 0;
int maxans = ... | #include<stdio.h>
void fanc(int,int);
int map[13][13];
int main(void)
{
int i,j;
int c;
char s[13];
while(scanf("%s",s)!=EOF){
c=0;
for(i=0;i<12;i++){
map[0][i]=s[i]-'0';
}
for(i=1;i<12;i++){
scanf("%s",s);
for(j=0;j<12;j++){
map[i][j]=s[j]-'0';
}
}
/* for(i=0;i<12;i++){
for(j=0;j<1... | 0 |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstdlib>
using namespace std;
#define N 100050
int n,a[N],b[N],mp[N][3],l[2];
void gun() {
puts("No"); exit(0);
}
int main() {
scanf("%d",&n);
int i,x,y,z;
for(x=0;x<3;x++) for(i=1;i<=n;i++) scanf("%d",&mp[i][x]);
for(i=1;i<=n;i++) {
x=mp[i][0],... | #include<bits/stdc++.h>
using namespace std;
void gofail(){
cout<<"No\n";
exit(0);
}
const int N=100100;
int a[N],b[N],c[N],sum[3*N],sum1,sum2,n;
void add(int x){for(;x;x-=x&-x)sum[x]^=1;}
int qry(int x){int ans=0;for(;x<=3*n;x+=x&-x)ans^=sum[x];return ans;}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)... | 1 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> outp;
int icn;
int icd;
int g;
vector<int> ice;
for(g = 0;;g++){
vector<int> ice(10,0);
cin >> icn;
if(icn == 0){
break;
}else{
for(int a = 0;a< icn;a++){
cin >> icd;
ice[icd] += 1;
... | // #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <locale>
#include <cctype>
#include <sstream>
u... | 1 |
#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 (... | #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 <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | 1 |
#include<bits/stdc++.h>
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
#define ll long long
using namespace std;
const int N=50005;
int n,p[N],vis[N],cnt,now; ll a[505][505],v1[N],v2[N];
ll gcd(ll a,ll b){return !b?a:gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
vo... | #include <bits/stdc++.h>
using namespace std;
int main(){
int m;
cin >> m;
vector<int> nodes;
vector<pair<int, int>> child;
int n = 0;
for (int i = 0; i < m; i++){
string q;
cin >> q;
if (q == "insert"){
int k;
cin >> k;
if (n != 0){
int v = 0;
while (1){
... | 0 |
/*
** author:mahmoud magdy
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
inline int D()
{
int m ;
cin>>m;
return m ;
}
inline ll lD()
{
ll m ;
cin>>m;
return m ;
}
inline double dD()
{
double m;
cin>>m;
return m;
}
void fast()
{
ios_bas... | #include "bits/stdc++.h"
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);i++)
#define PI 3.141592653589793
//vector < vector<int>>a(0, vector<int>(0));二次元配列宣言
int main()
{
int n;
cin >> n;
vector<long int>f(n);
int i;
string s;
s = "YES";
for (i = 0; i < n; i++)
{
c... | 1 |
/* *******************Bismillahir Rahmanir Rahim************************
MD. ASFAKUL GHANI!
*ProMAGFAT*!
SECRET_warning :)->FAT CSE-25!
JAHANGIRNAGAR UNIVERSITY!
Dhaka,Bangladesh!
*/
#include <bits/stdc++.h>
... | #include <bits/stdc++.h>
#ifndef LOCAL_
#define fprintf if( false ) fprintf
#endif // LOCAL_
// #define dump() fprintf(stderr, "#%s.%d\n", __func__, __LINE__);
#define dumpl(x1) fprintf(stderr, "#%s.%d (%s) = (%ld)\n", __func__, __LINE__, #x1, x1);
#define dumpll(x1, x2) fprintf(stderr, "#%s.%d (%s, %s) = (%ld, %ld)\n... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int solve(int n, vector<int> & dims){
int dp[100][101] = {{0}};
for (int span = 2; span != n + 1; ++span){
for (int first = 0; first + span != n + 1; ++first){
for (int last = first + span; last != n + 1; ++last... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define EPS 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define x real()
#define ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
const ll mod = 1000000007;
const ll INF = 1e+14;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int N;
long long A[MAXN], B[MAXN];
int main(){
scanf("%d", &N);
for(int i = 0; i < N; i++){
scanf("%lld", &A[i]);
B[i] = A[i];
}
long long r1 = 0, r2 = 0;
for(int i = 59, k = 0; i >= 0; i--){
int ind = -1, p = 0;
for(int j = 0; ... | 0 |
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<sstream>
#include<stack>
#include<string>
#include<set>
#include<vector>
using namespace std;
#define PI acos(-1.0)
#define pppp cout<<endl;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1e9+7,INF=mod*mod*3;//M_PI
#define rep(i,N) for(ll i=0; i<(N); i++)
#define rep1(i,N) for(ll i=1; i<(N); i++)
#define pb push_back
ll N;
ll u,v;
ll ans;
vector<ll> vec[100005];
ll parent[100005];
bool leaf[100005]; ... | 0 |
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<iomanip>
#include<complex>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> V... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define mp make_pair
#define PI pair<int,int>
#define poly vector<ll>
#define mem(a) memset((a),0,sizeof(a))
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int... | 0 |
#include <iostream>
#define Free (-1)
#define NonFree (-2)
#define NoQ (-3)
using namespace std;
const int N = 8;
int row[N];
int col[N];
int dpos[15];
int dneg[15];
int inits[N];
void printBoard() {
for (int r = 0; r < N; ++r) {
for (int c = 0; c < N; ++c) {
if (row[r] != c) {
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
ll mod=1e9+7;
int main() {
ll m;
cin >> m;
ll n=0;
ll d=0;
for(ll i=0;i<m;i++) {
ll tc,td;
cin >> td >> tc;
n+=tc;
d+=td*tc;
}
cout << n-1+(d-1)/9 << endl;
} | 0 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <stdlib.h>
#include <vector>
#include <stack>
using namespace std;
int main(){
int n, p;
while(1){
cin >> n;
cin >> p;
if(n ==0 && p==0) break;
int sum[n];
int win=p;
int winner;
int flag = 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void) {
ll N, A, B;
cin >> N;
if(N == 1) {
cout << "Hello World" << endl;
} else {
cin >> A >> B;
cout << A + B << endl;
}
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
struct Graph{
Graph(int n):E(n),d(n){}
vector<vector<tuple<int,int,int>>>E;
vector<int>d;
void add_edge(int a,int b,int c,int d){
E[a].push_back(make_tuple(b,c,d));
}
void dijkstra(int s,int f){
priority_queue<P,vector<P>,greater<... | #include<iostream>
#include<algorithm>
using namespace std;
#define MAX 1000000
int main(){
int n, m, a, b, cost, ti, k, p, q, r, point = 0;
int cost_[101][101], time_[101][101];
while ( cin >> n >> m && (n != 0 && m != 0)){
for (int i = 0; i < m; i++)
for (int j = 0; j < m; j++) { cost_[i][j] = time_[i][j] = MA... | 1 |
#include<stdio.h>
#include<string.h>
int main(void) {
int a[10000],n,b=0,i,x,d=3;
char r[10000];
char s[10000];
scanf("%d", &n);
sprintf(s, "%d", d);
for(i = 1; i <= n; i++) {
sprintf(r,"%d", i);
if (i % 3 == 0) {
a[b] = i;
b++;
}
else if (strstr(r,s) != NULL) {
a[b] = i;
b++;
}
}
for (x =... | #include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
void call(int n) {
int i = 1;
int x;
bool flg = false;
while (1) {
// CHECK_NUM
x = i;
if ( x % 3 == 0 ){
cout << " " << i;
}
else {
while (1) {
// INCLUDE3
if ( x % 10 == 3 ){
cout << " " << i;
flg =... | 1 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
cout << 100 << " " << 100 << endl;
vector< vector<int> > grad(100, vector<int>(100));
for(int i=0; i<50; i+=2) {
f... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 2e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
int gcd(int a, int b) {
if (a == 0)
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, X, T;
cin >> N >> X >> T;
cout << (N + X - 1) / X * T << endl;
} | 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<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 1 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
int n, m;
unordered_map<string, int> mp;
int main(void){
cin >> n;
rep(i, n){
string s;
cin >> s;
mp[s]++;
}
cin >> m;
rep(i, m){
string t;
cin >> t;
mp[t]--;
}
int ans = -INT_MAX;
for(auto i ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <stack>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long int ll;
const ll modP = 1000000... | 0 |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef pair < int, int > pii;
const int N = 16;
const int M = (1 << N);
const int INF = 0x3f3f3f3f;
int dp[N][M], g[N][N], n, m, r... | #pragma GCC optmize(3)
#include <cstdio>
#include <iostream>
#include <cstring>
#include <ctime>
#define rus register unsigned short
#define rs register short
using namespace std;
const int N = 15;
int G[N][N], dp[N][1 << N], cost[N][1 << N];
int n, m;
inline void upd(int &x, int y) {
if (x == -1) x = y;
else x ... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], b[n], c[n], d[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < n; i++) {
cin >> c[i] >> d[i];
}
int blue_XtoY[205];
int red_XtoY[205];
memset(blue_XtoY, -1, sizeof(blue_XtoY));
memset(red_... | #include<bits/stdc++.h>
using namespace std;
int n,a[203],ans;
int main(){
cin>>n;
for(int i=0;i<2*n;i++)
cin>>a[i];
sort(a,a+2*n);
for(int i=0;i<2*n;i+=2)
ans+=a[i];
cout<<ans;
} | 0 |
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& op... | #include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
using vi = vector<int> ;
using vvi = vector<vector<int>> ;
using vl = vector<ll> ;
using vvl = vector<vector<ll>> ;
using vs = vector<stri... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char **argv) {
string s;
cin >> s;
bool ok = false;
for (int i = 0; i < s.length() - 1; ++i) {
ok |= s[i] == 'A' && s[i + 1] == 'C';
}
cout << (ok ? "Yes" : "No") << endl;
}
| #include<iostream>
#include<stdio.h>//printf("%.*f\n",*********);
#include<vector>//s.erase(n),vector
#include<algorithm>//next_permutation
#include<set>
#include<string>//char('a'=32+'A')
//to_string,string,substr
#include<sstream>
#include<complex>
#include<time.h>
#include<random>
#include<cmath>//mi... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
for (int i = 100; i > 0; i /= 10) {
if (N / i == 7) {
cout << "Yes" << endl;
return 0;
}
N %= i;
}
cout << "No" << endl;
} | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
//*********************************************DO IT NOW****************************************************************
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#... | 1 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h... | #include <iostream>
using namespace std;
int main() {
int A, B; cin >> A >> B;
printf("%d\n", max(A + B, max(A - B, A * B)));
} | 0 |
#include<bits/stdc++.h>
using namespace std;
const int inf=1<<30,maxn=2000005;
int i,j,k,n,v[100000005];
int f[maxn],prime[maxn],tot,e[100005];
long long ans[505][505],mx;
map<long long,int> p;
void shai()
{
tot=0;
for(int i=2;i<maxn;i++)
{
if(!f[i])
prime[tot++]=i;
for(int j=0;j... | #include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> P;
signed main(){
vector<int> v;
int t=3;
while(v.size()<1000){
bool f=1;
for(int i=2;i*i<=t;i++)if(t%i==0)f=0;
if(... | 1 |
#include <bits/stdc++.h> //万能头文件
using namespace std;
int main()
{
string a;
int pos=0; //记录位置
cin>>a;
a=a+"D"; //为防止最后一个字母是"A",添加一个不是"C"的字母
while(1)
{
pos=a.find("A",pos); //find()函数查找位置
if(pos<0) //如果没找到，返回-1
{
cout<<"No"<<endl; //endl养成好习惯
break; //跳出循环
}
if(a[pos+1]=='C') //判断"... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i = 0;i < n;i++)
#define repr(i, n) for(int i = n;i >= 0;i--)
#define For(i, s, e) for(int i = s;i <= e;i++)
#define Sort(v, n) sort(v, v+n);
#define VSort(v) sort(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define I... | 1 |
#include<bits/stdc++.h>
#define LL long long
#define MAXN 200005
using namespace std;
int N,M0,M1;
vector<int> adj[2][MAXN];
vector<int> s[2][MAXN];
int p[2][MAXN];
void dfs(int u, int x, int f){
p[f][u] = x;
s[f][x].push_back(u);
int v;
for(int k=0;k<adj[f][u].size();k++){
v = adj[f][u][k];
if(!p[f][v]) df... | #include<bits/stdc++.h>
using namespace std;
struct _IO{_IO(){ios::sync_with_stdio(0);cin.tie(0);}}_io;
typedef long long ll;
typedef long double db;
typedef unsigned long long ull;
typedef vector<int> vi; typedef vector<vi> vii;
typedef pair<int, int> pi;
typedef tuple<int, int, int> t3;
typedef map<int, int> mi;
#de... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ii pair<int,int>
#define fi first
#define se second
#define FOR(a,b,c) for(int a=b, __c=c; a<=__c; ++a)
const int N=2e5+5;
int n,a[N],b[N];
int cnt[N],d[N],ans[N];
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin>>n;
FO... | // ALDS1_6_B.cpp
// Sort II - Partition
#include <iostream>
#include <vector>
#include <cstdio>
using namespace std;
int Partition(vector<int>& A, int p, int r)
{
int tmp = A[r];
int i = p - 1;
for (int j = p; j < r; j++) {
if (A[j] <= tmp) {
i++;
swap(A[i], A[j]);
}
}
swap(A[++i], A[r]);
return i;
}
... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
#define mp make_pair
using ll=long long;
using ld=long double;
typedef pair<int,int> P... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K,X;cin>>K>>X;
for (int i = X-K+1; i <= X+K-1; i++)cout<<i<<" ";
cout<<endl;
} | 0 |
#include<cstdio>
#include<cstring>
#include<stack>
#include<algorithm>
using namespace std;
const long long MAXN=1000005;
int n,m;
char S[MAXN],T[MAXN];
stack<int> s[30];
pair<int,int> que[MAXN];
int hd,tl;
int main()
{
scanf("%d%s%s",&n,S+1,T+1);
for(int i=1;i<=n;i++)
s[S[i]-'a'].push(i);
hd=1;tl=0;
int now... | #define _DEBUG 1
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef _DEBUG
#define dump(x) cerr << #x << "=" << x << endl
#define dump2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define dump3(x, y, z) ... | 0 |
#include<stdio.h>
int main(void)
{
int a,s,d[2000],f,g,h,i,j;
scanf("%d %d",&a,&s);
while(a!=0&&s!=0){
for(i=1;i<=a;i++){
scanf("%d",&d[i]);
}
for(i=1;i<=a;i++){
for(j=i;j<=a;j++){
if(d[i]<d[j]){
f=d[i];
d[i]=d[j];
d[j]=f;
}
}
}
g=0;
h=0;
for(i=1;i<=a;i++){
if(g==s-1)... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, m;
long long p[1000];
while(1) {
cin >> n >> m;
if (n == 0 && m == 0) break;
long long ans = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
ans += p[i];
}
sort(p, p+n, std::greater<long long>()... | 1 |
#include <iostream>
#include <string>
using namespace std;
const string check = "Hoshino";
int main()
{
int n;
string str;
cin >> n;
getline(cin,str);
for(int loop=0;loop<n;loop++){
getline(cin,str);
for(unsigned i=0;i<str.size();i++){
bool flag = true;
for(unsigned j=0;j<check.size();j++){
if(i+j ... | #include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <func... | 1 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cstdio>
#include<cmath>
#include<deque>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<string>
#include<tuple>
#include<utility>
#include<vector>
using namespace std;
typedef lon... | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]=... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#de... | #include<iostream>
#include<algorithm>
using namespace std;
int main (void)
{
int n,m,p[100000],p2[100000],pp,w,a,i;
string s;
cin>>n>>m;
w=0;a=0;
for(i=0;i<n;i++){p[i]=0;p2[i]=0;}
for(i=0;i<m;i++)
{
cin>>pp>>s;
if(p2[pp-1]==0&&s=="WA"){p[pp-1]++;}
if(p2[pp-1]==0&&s=="AC"){a++;p2[pp-1]=1;}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
ll n, t;
cin >> n >> t;
ll ans=0;
ll pre=0;
ll push=0;
cin >> pre;
for(int i=0; i<n-1; i++){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
int main() {
ll N;
cin >> N;
vector<ll> A(N+2);
A[0] = 0;
for (int i = 1; i <= N; i++) cin >> A[i];
A[N+1] = 0;
ll sum = 0;
f... | 0 |
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long LL;
LL n,d;
LL col[2][500005] = {0};
LL v[4][500005],cnt[4] = {0};
LL id(LL x,LL y){ return x * n + y + 1; } // (x,y) -> id
LL getx(LL x){ return (x - 1) / n; } // id(x,y) -> x
LL gety... | // template version 1.8
// varibable settings {{{
using namespace std;
#include <iostream>
#include <bits/stdc++.h>
#define int long long
#define INF 1e18
// #define INF 2147483647
#define MOD 998244353
#define infile "../test/sample-1.in"
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
#define fi first
#define se se... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
int main(){
// sengen
LL n,a[5];
// nyuryoku
cin >> n >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
// keisan
LL ans = 4;
LL plus = 0;
if(n%a[0] == 0){
plus = n/a[0];
}else{
plus = n/a[0] + 1;
}
for(int i=1;i<5;i++){
if(n%a[i] == 0){
plus... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pll pair <ll , ll>
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define mp make_pair
#define X first
#define Y second
#define LB(x) ((x) & -(x))
#define BIT(a , b) (((a)>>(b)) ... | #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>;
using vc=vector<char>;
int dr[4]={-1,0,0,1};
int dc[4]={0,-1,1,0};
void bfs(const vector<vc> &field, vector<vi> &dist){
queue<pair<int,int>> que;
que.push({1,1}... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
const int MAXN = 100000;
typedef pair<int, int> ii;
typedef vector<ii> vii;
vii adjList[MAXN];
int dist[MAXN]; bitset<MAXN> inq;
queue<int> q;
int main(){
int N, E, S;
cin >> N >> E >> S;
for (int i=0; i<E; i++){
... | #include <bits/stdc++.h>
//{{{ graph.hpp
#ifndef INCLUDE_GRAPH_HPP
#define INCLUDE_GRAPH_HPP
#include <vector>
namespace orislib {
struct Edge {
typedef int weight_t;
int from, to;
weight_t w;
Edge(int from, int to, weight_t w) : from(from), to(to), w(w) {}
bool operator<(const Edge& e) const {
return w ... | 1 |
#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 <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | #include <iostream>
#include <cstring>
#include <stack>
using namespace std;
stack<char> stacky;
int solve(string X, int N, int ans) {
for(int i=0; i<N; i++) {
if(X[i] == 'S') stacky.push('S');
else { // encounter 't'
if(!stacky.empty()) stacky.pop();
... | 1 |
#include<stdio.h>
#include<algorithm>
using namespace std;
int a[200000];
int main()
{
int i,n,flag=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+n);
for(i=0;i<n-1;i++)
{
if(a[i]==a[i+1])
{
flag=1;
break;
}
}
if(flag==1)
{
printf("NO\n");
}
else
{
pri... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
map<ll, ll> mp;
for (int i = 0; i < n; i++) {
ll a; cin >> a;
mp[a]++;
}
ll cnt = 0;
for (auto u : mp) {
if (1 < u.second) cnt++;
}
string ans = "YES";
if (1 <= cnt) ans = "NO";
cout << ans << endl;
re... | 1 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 998244353
// x^n
ll mod_pow(ll x, ll n) {
if (n... | using namespace std;
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include<iostream>
#include<algorithm>
#include<ctime>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#i... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int lim = 4e4, Nmax = 505;
typedef long long ll;
int i, j;
ll a[Nmax][Nmax];
vector<int> primes;
bool used[lim+2];
void run_primes()
{
int i;
for(i=2; i<=lim; ++i)
if(!used[i])
{
primes.push_back(i);
for(j=i*i; j<=li... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
using namespace std;
int p = 998244353;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define rep(i,n) for(long long i=0;i<n;i++)
#define sor(v) sort(v.b... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a!=b) {
cout << max(a,b)*2-1 << endl;
}
else
cout << a*2 << endl;
} | #include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;... | 1 |
#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i=(j); i<=(k); i++)
#define FFOR(i, j, k) for(int i=(j); i<(k); i++)
#define DFOR(i, j, k) for(int i=(j); i>=(k); i--)
#define bug(x) cerr<<#x<<" = "<<(x)<<'\n'
#define pb push_back
#define mp make_pair
#define bit(s, i) (((s)>>(i))&1LL)
#define... | 1 |
#include <cstdio>
#include <cstring>
#define debug(...) fprintf(stderr,__VA_ARGS__)
using namespace std;
typedef long long ll;
const int maxN=200+5;
int T;
int N;
ll A[maxN];
ll base[64];
char S[maxN];
void ins(ll x) {
for(int i=62;~i;--i) if(x>>i&1) {
if(base[i]) x^=base[i];
else {
for(int j=i+1;j<63;++j) if(... | #include<bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define rep(i,n) for(int i = 0; i < n ; ++i)
#define REP(i,a,b) for(int i = a ; i <= b ; ++i)
#define filei freopen("input.txt", "r", stdin);
#define fileo freopen("output.txt", "w", stdout);
#... | 1 |
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
while(1){
int sina[1000],n,m,sum=0;
scanf("%d%d",&n,&m);
if(n==0&&m==0)return 0;
for(int i=0;i<n;i++){
scanf("%d",&sina[i]);
sum+=sina[i];
}
sort(sina,sina+n);
for(int i=n-m;i>=0;i-=m){
sum-=sina[i];
}
printf("%d\n",sum);
}
} | #include <iostream>
#include <string>
#include <algorithm>
#include <numeric>
#include <boost/tokenizer.hpp>
#include <boost/lexical_cast.hpp>
#include <vector>
#include <list>
using namespace std;
using namespace boost;
int main(int argc, char* argv[])
{
using sprtr = char_separator<char>;
using tknzr = tokenizer... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
unordered_set<int> s;
for(int i = 0; i < k; i++) {
int d;
cin >> d;
s.insert(d);
}
while(true) {
int temp = n;
bool ok = true;
while(temp) {
int digit = temp % 10;
if(s.count(digit)) {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Maxn = 6005;
const int Maxm = 2005;
int n, mod;
int dp[Maxn][Maxm];
int main()
{
scanf("%d %d", &n, &mod);
dp[0][0] = 1;
for (int i = 1; i <= 3 * n; i++)
for (int j = 0; j <= n; j++) {
dp[i][j] = (dp[i][j] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef long double LD;
const int MOD = 1e9 + 7;
const int MAXS = 1 << 16;
int main() {
int N, X, Y, Z;
cin >> N >> X >> Y >> Z;
int xyz = (1 << (X + Y + Z - 1)) | (1 << (Y + Z - 1)) | (1 << (Z - 1));
int mask = (1 << (X + Y + Z)) - 1;
int ... | 0 |
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<bitset>
#include<string>
#include<cstdio>
#include<cctype>
#include<cassert>
#include<cstdlib>
#include<cstring>
#include<sstream>
#include<iostream>
#include<algorithm>
#define For(i,x,y) for (int i=x;i<y;i++)
#define pb push_back
#define mp make_pa... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int n, pw10[19], nDig, ans;
bool ok(int a, int b, int mod) { return ( ( (a % mod) + mod) % mod) == ( ( (b % mod) + mod) % mod); }
int bt(int pos, int d) {
int ret = 0;
if(pos == nDig / 2 + 1) {
return (d == 0) * (nDig % 2 ? 10 : 1);... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
// #define DEBUGGING
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<int,ii> eg;
typedef vector<eg> el;
typedef vector<ii> vii;
typedef vector<vii> al;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
vvi g;
int cs[512][512][4];
const int MN = 17;
const int SH... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for(int i = 0; i < N; i++)
#define Reps(i, x, N) for(int i = x; i < N; i++)
const int LLINF = 1LL << 60;
signed main()
{
int N, P;
while(cin >> N >> P, N || P) {
int w = P;
int have[55] = {0};
int i = 0;
wh... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define dbg(x) cout<<#x"="<<x<<endl
t... | 1 |
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <li... | #include<iostream>
#include <string>
using namespace std;
int main(){
while(1){
int n,p;
int flag=0;
int have[50];
//読み込み
cin>>n>>p;
int cup = p;
if(n == 0 && cup==0){
return 0;
}
for(int i=0; i<n; i++){
have[i]=0;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long x;
cin >> x;
long long m = x % 11LL;
long long q = x / 11LL;
long long ans = 0LL;
if (1 < m)
ans++;
if (7 <= m)
ans++;
ans += 2 * q;
if (m == 1)
ans++;
cout << ans << endl;
return 0... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 1 |
#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
#define INF 1 << 30;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n;
cin >> n;
vector<ll> a(n);
vector<vector<ll>> dp(n+1, vector<ll>(2, 0));
dp[0][1] = -INF;
ll sum = 0;
for (int i = 0; i < n; i... | #include <iostream>
using namespace std;
using ll = long long;
int main() {
ll N, A, ans{}, s{}, m{1 << 30};
cin >> N;
for (int i = 0; i != N; ++i) {
cin >> A;
if (A < 0) A *= -1, ++s;
m = min(m, A);
ans += A;
}
cout << ans - (s % 2 ? 2 * m : 0) << endl;
}
| 1 |
#include <bits/stdc++.h>
#define REP(i, n) for(int (i)=0;(i)<(n);++(i))
#define REPV(iter, v) for(auto (iter)=(v).begin(); (iter)!=(v).end();++(iter))
#define ALL(v) (v).begin(),(v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main()
{
ll N;
cin >> N;
vector<ll> a(N), b(N... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int,int>> p(m);
for(int i=0;i<m;i++) cin >> p[i].first >> p[i].second;
for(int x=0;x<1000;x++) {
int keta = 1;
int nx = x/10;
vector<int> d(1,x%10);
while (nx) {
keta++;
d.push_back(nx%... | #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> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;
usin... | 0 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define drep(i,a,b) ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef long double ld;
typedef vector<ll>VI;
typedef pair<ll,ll>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
struct BIT {
int n;
vector<long long> d;
BIT(int n=0):n(n),d(n+1) {}
void add(int i, long long x=1) {
for (i++; i <= n; i += i&-i) {
d[i] += x;
}
}
long long sum(int i) {
... | 0 |
#include <memory.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <uti... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <cmath>
using namespace std;
bool is_balanced(int s, int e, vector<int>& v) {
int len = e - s + 1;
for (auto i: v) {
if (i > len / 2 && len >= 2) {
return true;
}
}
return... | 0 |
#include <string>
#include <math.h>
#include <iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
int aa = 0;
int bb = 0;
int cc = 0;
int dd = 0;
int ee = 0;
int ff = 0;
if (a == 1)
ee = 300000;
else if (a == 2)
aa = 200000;
else if (a == 3)
bb = 100000;
if (... | #include<iostream>
#include<cstdio>
#include<string>
#include<cstdlib>
#include<set>
#include<string.h>
#include<ctype.h>
using namespace std;
int arr[10];
int sub[10];
int n,k;
int now = 0;
int cont;
int c = 0;
set<int> visit2;
void saiki(int[],int);
int main()
{
for(;;)
{
visit2.clear();
int i;
c = 0;
... | 0 |
#include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tii;
#define rep(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
int main(){
ll A,B; cin >> A >> B;
if(A<B) swap(A,B);
ll y = gcd(A,B);
ll yy = y;
ll x = 2;
ll ans = 1;
while(x*x<=y&&yy!=1)... | 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... | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; ++i) // マクロ
using namespace std; // stdの省略
using pii = pair<int, int>; // pairの略記
using ll = long long; // long longの略記
int main(void) {
int r;
cin >> r;
cout << 2*r*M_PI << endl;
return 0;
} | 1 |
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <math.h>
#include <tuple>
#include <string.h>
#include <map>
#include <iomanip>
#include <time.h>
using namespace std;
typedef long long ll;
int n, m, id[100010];
bool vis[100010];
vector<int> G[100010], R[100010], po;
... | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define LOOP(i) while(i--)
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define all(V) V.begin(),V.end()
using ll = long long;
const ll MOD = 1000000007;
ll A[520][520];
int main() {
for (int i = 0;i < 520;i++) {
for (int j = 0;j < 520;j++) {
A[i][j] = -1;
}
}
set<ll> S;
priority_queue<ll> T;
bool w;
for (int i = 5;;i++) {
w = ... | #include <bits/stdc++.h>
using namespace std;
#define lor(a,b,c) for(register int a=b;a<=c;++a)
#define ror(a,b,c) for(register int a=c;a>=b;--a)
typedef long long ll;
const int MAXN=505,MAXD=7919;
const int movx[4]={-1,0,1,0},movy[4]={0,1,0,-1};
int n; ll a[MAXN][MAXN];
bool vis[MAXD]; ll prime[MAXN<<1];
inline ll ... | 1 |
#include <bits/stdc++.h>
using namespace std;
struct Node {
int k;
Node *p, *l, *r;
};
Node *NIL, *root;
void insert(int key) {
Node *parent = NIL;
Node *node = root;
Node *target = (Node *)malloc(sizeof(Node));
target->k = key;
target->l = NIL;
target->r = NIL;
while(node != NI... | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int n;
int t[12][12];
int main(void){
while(cin>>n,n){
memset(t,0,sizeof(t));
for(int i=0;i<=n;i++){
for(int j=0;j<n;j++){
if(i != n){
cin>>t[i][j];
t[n][j] += t[i][j];
}
t[i][n] += t[i][j];
}
}
for(int... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll t;
t = 1;
//cin t;
while (t--)
{
ll n, m;
cin >> n >> m;
int i = 1;
int j = n;
if (n % 2 != 0)
{
while (m--)
cout << i++ << " " << j-- ... | #include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll= long long;
using ld= long double;
using vl= vector<ll>;
using vd= vector<ld>;
using vs= vector<string>;
using vb= vector<bool>;
using vvl= vector<vector<ll>>;
using vvd= vector<vector<ld>>;
using vvs= vector<vector<s... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int k;
cin>>k;
bool arr[k];
// memset(arr,false,sizeof(arr));
int temp;
for(int i=0;i<10;i++)
arr[i] = false;
for(int i=0;i... | #include <iostream>
#include <cstdio>
#include <string>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <ctime>
using namespace std;
#define rep(i,a,... | 0 |
#include <iostream>
#include <cmath>
using namespace std;
struct Point
{
double x, y;
Point(double x=0, double y=0) : x(x), y(y) {}
double distance (const Point &o) const
{
return sqrt((x - o.x) * (x - o.x) + (y - o.y) * (y - o.y));
}
Point operator+(const Point &o) const
{
... |
#include<iostream>
#include<iomanip>
#include<cmath>
using namespace std;
int main(){
double x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
if (x1 == x2){
cout << setprecision(12) << fabs(y1 - y2) << endl;
}
else if (y1 == y2){
cout << setprecision(12) << fabs(x1 - x2) << endl;
}
else {
cout << setprec... | 1 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
int main()
{
ll N; cin>>N;
string S; cin>>S;
ll hitomi=0;
ll max_hitomi=0;
rep(i,N)
{
if(i==0) {continue;}
if(S.at(i)=='W') {hitomi++;}... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
string S;
int w;
cin >> S >> w;
for (int i = 0; i < S.size(); i+=w) {
cout << S.at(i);
}
cout << endl;
} | 0 |
#include <iostream>
#include <string.h>
using namespace std;
int main() {
int N;
int cnt = 0;
cin >> N;
int a[N];
int a_next[N];
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
a[i] = tmp;
}
do {
int flg = 0;
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int dmin = 100;
for (int i = 0; i < N; i++) {
int A, d = 0;
cin >> A;
while (A % 2 == 0) {
A /= 2;
d++;
}
dmin = min(dmin, d);
}
cout << dmin << endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll a,b,c;
cin>>a>>b>>c;
if(c>min(a,b) && c<max(a,b))
{
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
return 0;
}
| #include<iostream>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
cout << ((a-c)*(b-c)<0?"Yes":"No") << endl;
}
| 1 |
#include<iostream>
#include <climits>
#include<vector>
#include<numeric>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int m... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
for (auto &x: a) cin >> x;
for (auto &x: b) cin >> x;
for (auto &x: c) cin >> x;
sort(a.begin(), a.end());
sort(b.begin(), b.end());
sort(c.begin(), c.end());
vector<long lo... | 0 |
#include<bits/stdc++.h>
int main(){
using namespace std;
constexpr unsigned long MOD = 1000000007;
vector<unsigned long> tapi(1048576, 1), tapu(1048576), tape(1048576);
unsigned long ans{0}, t{500000004}, a{0}, z{0}, A;cin >> A;
while(cin >> A)if(a ^= A){
(tapu[a] += (tapi[a] += tapu[a] * (... | #include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(... | 0 |
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <iomanip>
#include <string.h>
#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()
typedef long long lint;
usi... | #include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin>>s;
string ans;
for (char c: s)
if (c == 'S') ans += c;
else if (ans.size() && ans.back() =='S') ans.pop_back();
else ans += c;
cout<<ans.size()<<endl;... | 1 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
#include <math.h>
using namespace std;
void func()
{
int64_t N, ai = 0;;
cin >> N;
for (int64_t i = 1; i <= N; ++i)
{
if (i % 3 == 0 || i % 5 == 0)
continue;
ai += i;
}
cout << ai << endl;
}
i... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(int (i) = (a);i < (n);i++)
int main()
{
int n = 0, i = 0, output = 0;
cin >> n;
vector<int> skewer(2 * n, 0);
for(i = 0;i < 2*n; i++)
{
int temp = 0;
cin >> temp;
skewer.push_back(te... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long ... | 1 |
#include <bits/stdc++.h>
using namespace std;
//type
#define ll long long
typedef pair<int, int> P;
//定数
#define INF 1000000000000 //10^12:∞
#define MOD 1000000007 //10^9+7:合同式の法
#define MAXR 100000 //10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair //pairのコンストラクタ
#define F first //pa... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main() {
vector<vector<string>> data(3);
string stra,strb,strc;
string next = "a";
cin >> stra;
cin >> strb;
cin >> strc;
int a = 0, b = 0, c = 0;
while (true) {
if (next == "a") {
if (a < stra.size())... | 0 |
#include <vector>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int n, m; cin >> n >> m;
vector<vector<int> > adj(n);
while (m--) {
int u, v; cin >> u >> v;
u--; v--;
adj[u].push_back(v);
adj[v].push_back(u);
}
long long a = 0, b = 0, c ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <li... | 0 |
#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <map>
#include <set>
#include <stack>
#include <queue>
using namespace std;
#define pb(n) push_back(n)... | #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#define f first
#define s second
#define mp make_pair
#define REP(i,n) for(int i=0; i<(int)(n); i+... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int d, t, s;
string result;
cin >> d >> t >> s;
if(d <= t*s){
result = "Yes";
}else{
result = "No";
}
cout << result << endl;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
void add_self(int& a, int b) {
a += b;
if(a >= mod) {
a -= mod;
}
}
int main(){
float d,t,s;
cin>>d>>t>>s;
if ((d/s)>t){
cout<<"No";
}
else{
cout<<"Yes";
}
} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.