code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc045_b.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s[3];
cin >> s[0] >> s[1] >> s[2];
int tmp = 0;
int num[3] = {0,0,0};
while(num[tmp] < s[tmp].size()){
num[tmp]++;
tmp = s[tmp][num[tmp] - 1] - 'a';
}
cout << char('A' + tmp) << endl;
} | 1 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <cmath>
#include <fstream>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <iterator>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <stack>
#include <cli... | #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#i... | 0 |
//ツ単ツ渉δづ可嘉ーツつッツづ篠つ「ツつ「ツつセツつッツつセツつェ, ツ板?湘」ツ額ツつェintツづ可偲サツづ慊づァツづ按つ「ツ嘉つ能ツ青ォツつェツつ?づゥツづ個づ?陳債暗督つオツづ按つッツづェツづ篠づ按づァツづ按つ「
//ツ姪「ツ妥ィツ閉カツづ可渉堕つゥツづェツづ?つ「ツづゥツ「100ツ鳴?* 10ツ鳴慊」ツづ個湘ーツ個渉づ?づ? intツづ可偲サツづ慊づァツづ按つ「
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int... | #include <iostream>
#include <vector>
#include <utility>
#include <map>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0) break;
vector< pair<int, long long> > members;
for (int i = 0; i < n; i++) {
pair<int, long long> member;
int id;
... | 1 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(void)
{while(1)
{
int n=0;
scanf("%d",&n);
if(n==0){break;}
int c=0,m[11]={0};
for(int i=0;i<n;i++)
{
scanf("%d",&c);
for(int j=0;j<11;j++)
{
if(c==j){m[j]++;break;}
}
}
for(int i=0;i<10;i++)
{
if(m[i]==0){printf("-");}
else
{
... | #include <algorithm>
#include <iostream>
using namespace std;
int main(){
int a[128];
a[0]=a[1]=1;
for(int i=1 ; i<32 ; i++){
a[i]=a[i-1];
if(i>1) a[i]+=a[i-2];
if(i>2) a[i]+=a[i-3];
}
int n;
while(cin>> n){
if(n!=0){
int day = (a[n]-a[n]%10)/10 + 1;
int year =(day - day %365 )/365 + 1;
cout<<year... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll/*, vl, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, l... | #include <bits/stdc++.h>
#include <cassert>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ok() puts(ok?"Yes":"No");
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int, int>;
using vvi = v... | 1 |
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
using Weight=long long;
static const Weight INF=1LL<<57;
struct Edge {
size_t src, dst;
Weight weight;
Edge() {}
Edge(size_t src, size_t dst, Weight weight=1):
src(src), dst(dst), weight(weight)
{... | // Enjoy your stay.
#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin >> a >> b;
if (a <= 8 && b <= 8)
cout << "Yay!" << '\n';
else
cout << ":(" << '\n';
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int A;
int B;
cin >> A;
cin >> B;
int eatA = 0;
int eatB = 0;
for (int i = 0; i < 16; i++) {
if (i % 2 == 0) {
eatA++;
} else {
eatB++;
}
}
if (eatA >= A && eatB >= B) {
co... | 1 |
#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>
using namespace st... | #include<bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10, P = 998244353;
int n, m, ans, inv[N], fac[N];
int qp (int a, int b) { int c = 1; for (; b; b >>= 1, a = 1ll * a * a % P) if (b & 1) c = 1ll * c * a % P; return c; }
int main () {
scanf("%d%d", &n, &m); if (n < m) n ^= m ^= n ^= m;
inv[0] = inv[1] = ... | 1 |
#include <stdio.h>
int
main(void)
{
char line[80];
int d;
while (fgets(line, sizeof line, stdin)) {
if (sscanf(line, "%d", &d) == 1) {
int s = 0;
for (int i = 1; d*i <= 600 - d; i++) {
s += (d*i)*(d*i) * d;
}
printf("%d\n", s);
}
}
return 0;
} | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main()
{
string str;
while(cin>>str){
vector<int> Vec;
for(int i=0; i < str.size();i++){
if(str[i] == 'I'){
Vec.push_back(1);
}else if(str[i] == 'V'){
Vec.push_back(5);
}else if(str[i] == 'X'){
Vec.push_back(10... | 0 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | #include <iostream>
#include <ctime>
using namespace std;
int main()
{
string weeks[] = {"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"};
struct tm t;
t.tm_year = 2004 - 1900;
t.tm_hour = 0;
t.tm_min = 0;
t.tm_sec = 0;
t.tm_isdst = 0;
for (int mont... | 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 long double ld;
typedef unsigned ui;
typedef unsigned long long ul;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef pair<bool, bool> pbb;
typedef vector<int> vi;
#define pb push_back
#define fi first
#def... | 0 |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
static const int NIL = -1;
struct Vertex {
vector<int> link;
int parent = NIL;
int ord;
int lowlink;
bool is_visit = false;
};
class ArticulationPoint {
private:
int n;
vector<Vertex> graph;
int timer = 1;
publ... | #include <bits/stdc++.h>
using namespace std;
// Template Headers {{{
using pii = pair<int, int>; using vpii = vector<pii>;
using vi = vector<int>; using vvi = vector<vi>;
using ll = long long; using vll = vector<long long>;
template <class T> using min_queue = priority_queue<T, vector<T>, greater<T>>;
template <class... | 1 |
#include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); ++i)
#define repf(i, from, to) for (int i = (from); i < (to); ++i)
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
int ma... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | 1 |
// lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 1 |
#include <iostream>
using namespace std;
int main()
{
int pts[101] = {};
int n;
cin >> n;
int const rn = n * ( n - 1 ) / 2;
for( int i=0; i<rn; ++i ) {
int ca, cb, pa, pb;
cin >> ca >> cb >> pa >> pb;
if ( pa > pb ) {
pts[ca-1] += 3;
} else if ( pb > pa... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i, m,c1=0,c2=0;
cin >> n;
set <int> winner;
set <int>::iterator it1;
multiset <int> loser;
multiset <int>::iterator it2;
for(i=0; i<n; i++)
{
cin >> m;
winner.insert(m);
loser.insert(m);
}
i... | 0 |
#include <iostream>
using namespace std;
int main(){
int n,p,data[50],i,d,result;
while(1){
cin >> n >> p;
d=p;
if(n==0&&p==0) break;
for(i=0;i<n;i++) data[i]=0;
i=0;
while(1){
if(p>0){
p--;
data[i]++;
if(data[i]==d){
result=i;
break;
}
}else if(p==0){
p=... | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int m,n;
while(cin>>n>>m,n){
int plz[1050]={0},total=0,cnt=1;
for(int i=0;i<n;i++){
cin>>plz[i];
}
sort(plz,plz+n);
reverse(plz,plz+n);
for(int i=... | 0 |
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll N = 2e5 + 30, Mod = 1e9 + 7;
const ll SQ = 330;
ll n, m;
vector<ll> G[N], R[N];
ll id[N], ans[N], root... | #include <iostream>
using namespace std;
int main()
{
while (1)
{
int a = 0;
int x = 0;
int d = 0;
int aa[10001];
for (int i = 0; i < 10001; i++)
{
aa[i] = 0;
}
cin >> x;
cin >> a;
if (x == 0 && a == 0)
{
break;
}
int b[10000];
int c[10000];
for (int i = 0; i < a; i++)
{
cin >... | 0 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#de... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
class BinaryIndexedTree {
private:
int n;
vector<int64> xs;
public:
BinaryIndexedTree(int n) : n(n), xs(n) {}
// Adds x to the i-th element.
void Add(int i, int64 x) {
int cur = i;
while (cur < n) {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
int cnt = 0, min = 200001;
for (int i = 0; i < n; i++) {
cin >> p.at(i);
if (p.at(i) <= min) cnt++;
if (p.at(i) < min) min = p.at(i);
}
cout << cnt << endl;
return 0;... | /*
Ashraful Islam Paran
27-August-2020
19:56:18
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define f(n) for (int i = 0; i < n; i++)
#define fo(i, x, n) for (int i = x; i < n; i++)
#define fb(i, x, n) for (int i = n - 1; i <= 0; i--)
#define w(t) \
int t; \
cin >... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void)
{
int n1 , n2;
vector<int> val1 , val2 , ans;
int input;
cin >> n1 >> n2;
for (int i = 0; i < n1; i++)
{
cin >> input;
val1.push_back(input);
ans.push_back(0);
}
for (int i = 0; i < n2; i++)
{
cin >> ... | #pragma GCC optimize ("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
#define sz(x) (int)(x).size();
#define all(x) x.begin(), x.end()
#define trav(i,a) for(auto &i:a)
inline int in(){int x;scanf("%lld",&x);return x... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
string s; cin >> s;
if (s[0] == s[1] && s[1] == s[2] && s[0] == 'R') {
cout << 3 << endl;
}
else if (s[1] == 'R' && (s[0] == 'R' || s[2] == 'R')) {
cout << 2 << endl;
}... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin>>s;
int ans = 0;
int ma = INT_MIN;
for(int i=0;i<s.size();i++) {
if(s[i] == 'R') {
ans++;
}
else {
ma = max(ma, ans);
ans = 0;
}
}
... | 1 |
#pragma GCC optimize("Ofast")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>
const long long INF_L = 1e17+7;
const long long INF_I = 1e9+7;
const long long MOD = 1e9+7;
const double EPS = 1e-8;
const double P... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
#define inf 1e6+18
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define mod 1000000007
#define f1(i,n) for(i=1;i<=n;i++)
#define f0(i,n) for(i=0;i<n;i++)
#define w(x) while(x--)
const int maxn=500... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m, q;
cin >> n >> m >> q;
int d[509][509];
memset(d, 0, sizeof(d));
for(int i=0;i<m;i++){
int l, r;
cin >> l >> r;
d[l][r] += 1;
}
for(int i=1;i<=n-1;i++){
d[i][i+1] += d[i][i] + d[i+1][i+1];
}
for(int i=2;i<n;i++){
... | #include <bits/stdc++.h>
using namespace std;
using ll= long long;
using vi = vector<int>;
using vl= vector<ll>;
using vs=vector<string>;
ll gcd(ll a, ll b) { if (a == 0) return b; return gcd(b % a, a);}
ll max(ll a, ll b) {if (a > b) return a; else return b;}
ll min(ll a, ll b) {if (a < b) return a; else return b;}
l... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int N = 510;
int p[10010];
vector<int> primes;
int a[N * 2], b[N * 2];
void init() {
for (int i = 2; i < 10000; i++) {
if (!p[i]) {
for (int j = i + i; j < 10000; j += i) {
p[j] = 1;
}
primes.push_... | #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<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<int>v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
int result=0;
for(int i=0;i<n;i++)
{
if(i==0)
{
result+=abs(v[i]);
}
else
{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define eachdo... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int a,b,k; scanf("%d%d%d",&a,&b,&k);
rep(i,k){
if(i%2==0){
if(a%2==1) a--;
b+=a/2;
a/=2;
}
else{
if(b%2==1) b--;
a+=b/2;
b/=2;
}
}
printf("%d %d\n",a,b);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
vector<int> AB(2);
for (int i=0;i<2;++i) cin >> AB[i];
int K; cin >> K;
for (int i=0;i<K;++i){
if (AB[i&1]&1) --AB[i&1];
AB[(i&1)^1]+=AB[i&1]/2;
AB[i&... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int r,g;
cin>>r>>g;
cout<<g-r+g<<'\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
double late = 0.0 , wanna = 0.0;
cin >> late >> wanna;
cout << wanna * 2 - late;
} | 1 |
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=602,K=200020;
int n,m,a,b,i,j,d;
bool col[N][N];
void Col(int x){
d=0;
while(x%4==0)
x/=4,d++;
if(x&1){
for(i=0;i<m;i++)
for(j=0;j<m;j++)
if((i>>d&1)^(j>>d&1))
col[i][j]=1;
... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#define x first
#define y second
namespace QAQ
{
typedef std::pair<int,int> pii;
const int N=303;
int type[N*2][N*2];
int n,d0,d1;
bool vis[N*2][N*2];
std::vector<pii> mv;
void dfs(int nx,int ny,int val,int cur=0)
{
if(nx<0 || ny<0 ||... | 1 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> num(55556);
for(int i = 0; i < 55556; i++) num[i] = i;
num[0] = -1;
num[1] = -1;
for(int i = 2; i < 55556; i++){
if(num[i] == -1) continue;
int t = 2;
while(i * t <= 55... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
vector<int> p(60000,1);
vector<int> q;
for(int i=2;i<55556;i++){
if(p[i]){
for(int j=i*2;j<=55555;j+=i){
p[j]=0;
}
if(i%5==1){
q.push_back(i);
}
}
}
for(int i=0;i<N;i++){
cout<<q[... | 1 |
#include<bits/stdc++.h>
#define faster ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define ull unsigned long long
#define pb push_back
const double PI = acos(-1.0);
using namespace std;
int main()
{
faster
int n;
cin>>n;
n=2*n;
int a[2*n];
for(int i=0; i<n; i++)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
std:ios_base::sync_with_stdio(0);
cin.tie(0);
int N;
cin>>N;
vector<int> vi;
int L;
for(int i=0;i<2*N;++i){
cin>>L;
vi.push_back(L);
}
sort(vi.begin(), vi.end());
int sum=0;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int,int>;
const long long INFLL = 1LL << 60;
const int INFI = 1000000000;
pair<int,int> func(map<int,int> m){
int MAX = -1; int IDX;
for(auto i=m.begin();i!=m.end();i++){
if(MAX<i->second){IDX=i->first; MAX=i->secon... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 1 |
#include <iostream>
#include <stdio.h>
#include <math.h>
//I は1, V は5, X は10, L は50, C は100, D は500, M は1000,
#define I 1
#define V 5
#define X 10
#define L 50
#define C 100
#define D 500
#define M 1000
using namespace std;
int main(){
string str;
while(cin>>str){
int data[200];
int sum = 0;
//データの数値化
... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
vector<int> a;
vector<string> b(4);
string st;
bool dfs(int i, int sum, int n) {
if (i == 0) {
sum = sum + a[0];
i++;
}
if (i == n) {
if (sum == 7) {
for (int j = 0; j < n; j++) {
if (j == 0) {
cout << st[j];
con... | 0 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
typedef pair<int, char> P;
#define fs first
#define sc second
int main(){
i... | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <limits>
#include <queue>
#include <iomanip>
#include <set>
template<typename T> bool chmax(T &a,T b){
if(a<b){
a=b;
return true;
}
return false;
}
template<typename T> bool chmin(T &a,T... | 0 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <bitset>
typedef unsigned long long ULLONG;
typedef long long LLONG;
sta... | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
void solve() {
int n;
long long t1, t2, ans, t;
ans = 0;
cin >> n >> t;
cin >> t1;
t1 = t2 = 0;
for (int i=1;i<n; ++i) {
cin >> t1;
ans += min(t1 - t2, t);
t2 = t1;
}
ans += t;
cout << ans;
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | 1 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i... | #include <iostream>
#include <string>
int main(){
char s[10];
for (int i = 0; i < 10; i++){
std::cin >> s[i];
if (i == 3){
s[i] = '8';
}
}
for (int i = 0; i < 10; i++){
std::cout << s[i];
}
std::cout << std::endl;
return 0;
} | 0 |
#include <stdio.h>
const int N=110;
const int INF=1<<30;
int min(int a,int b){
return a>b?b:a;
}
int main(){
int n,dp[N][N],a[N];
scanf("%d%d%d",&n,&a[0],&a[1]);
for(int i=1;i<n;i++)scanf("%d%d",&a[i],&a[i+1]);
for(int k=1;k<n;k++){
for(int i=0;i<n-k;i++){
dp[i][i+k]=INF;
... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int main(){
int H, W, i, j, k;
cin >> H >> W;
vector<vector<char>> A(H, vector<char>(W));
vector<int> dx = {0, 1, 0, -1}, dy = {1, 0, -1, 0};
queue<P> nxs;
int cnt_sn = 0; //シャープの数
int cnt_fn = 0; //フェイズ内の要素の数
int cnt = 0; ... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define Mid ((l+r)/2)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define drep(i,a,b) for(int i=(a);i>=(b);--i)
#define file(a) freopen(#a".in","r",stdin),freopen(#a".out","w",stdout);
const int maxn=2e3+5,mod=1e9+7,inf=0x3f3f3f3f;
int n,m,Q,K,T;
int re... | #include<cstdio>
#include<cctype>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<algorithm>
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define id(a,b) (a*n-n+b)
#define reg register
typedef long long ll;
template<typename T>inline T read(){
reg T x=0;reg short f=1;reg char c=getchar();
... | 1 |
#include "bits/stdc++.h"
#define fio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define endl '\n'
#define all(V) (V).begin(), (V).end()
using namespace std;
typedef long long ll;
int main() {fio;
string s;
cin >> s;
vector <int> cnt(26, 0);
ll sm = 0, ans = 0;
for(int i = 0; i < 26; i++) {
cnt[i] = co... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long co[26] = { 0 };
int ma... | 1 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<cstring>
#define ll long long
using namespace std;
const int N=200005;
inline int read(){
int x=0; char ch=getchar();
for(;!isdigit(ch);ch=getchar());
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
return... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
policy_set;
#define trav(a, x... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { std::cout << #a << " = " << a << "\n"; }
template<class T1, cl... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <sstream>
#include <string>
#include <utility>
#include <map>
#include <memory>
#include <set>
#include <vector>
#inclu... | 0 |
#include<stdio.h>
#include<algorithm>
using namespace std;
int main(void)
{
int n,x[100][3],y[100],a,b,c,d,flg;
int i,k;
scanf("%d",&n);
for(i=0;i<n;i++){
x[i][0]=0; x[i][1]=0; x[i][2]=0; y[i]=i;
}
for(i=0;i<n*(n-1)/2;i++){
scanf("%d %d %d %d",&a,&b,&c,&d);
a--; b--;
if(c>d){
x[a][0]++; x[b][1]++;
}
... | #include <iostream>
using namespace std;
int main(){
int n,team1,team2,Point[101],po1,po2,cnt;
for( int i = 0 ; i < 101 ; i++ ) Point[i] = 0;
cin >> n;
for( int i = 0; i < n*(n-1)/2 ; i++ ){
cin >> team1 >> team2 >> po1 >> po2;
if( po1 > po2 ) Point[team1] += 3;
else if( po1 < po2 ) Point[... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K,sum;
sum = 0;
cin >> N >> K;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < K; i++){
sum += vec.at(N-1);
N --;
}
cout << sum << endl;
} | #include <iostream>
#include <stdio.h>
#include <vector>
#include <math.h>
using namespace std;
int main(void) {
double a,b; cin >> a >> b;
int sum = 0;
int i = 0;
while (i < 2) {
if (a > b) {
sum += a;
a--;
} else {
sum += b;
b--;
... | 0 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
const int MAX = 1000000;
int main() {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int f = 0;
cin >> N;
for (int d = 1; d <= N; d*=10){
f += N/d % 10;
}
if (N % f == 0){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | 0 |
#include<iostream>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b;
if(a >= 10){
cout << b << "\n";
}
else{
c = b + 100 * (10 - a);
cout << c << "\n";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int r;
int x;
cin >> n;
cin >> r;
x = 100*(10-n)+r;
if (n >= 10) {
cout << r;
} else {
cout << x;
}
return 0;
}
| 1 |
#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 all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e9
... | #include<bits/stdc++.h>
using namespace std;
int head[600100],cnt,n,m,lim,dis[600100];
struct Node{
int to,next,val;
}edge[4001000];
void ae(int u,int v,int w){
edge[cnt].next=head[u],edge[cnt].to=v,edge[cnt].val=w,head[u]=cnt++;
}
map<pair<int,int>,int>mp;
priority_queue<pair<int,int> >q;
bool vis[600100];
int dijks... | 0 |
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define inf LLONG_MAX>>2
#define MAX 1000000
#define mod 1000000007
#define pb push_back
#define f(i,a,n,x) for ((i)=(a);(i)<(n);(i)+=(x))
#define fd(i,a,n,x) for ((i)=(a);(i)>=(n);(i)-=(x))
#define fi first
#define se second
#define mk make_pair
#... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 1 |
/*#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")*/
#include<bits/stdc++.h>
#define ll long long
#define inf 1000000005
#define put putchar('\n')
#define F(i,a,b) for (int i=(a);i<=(b);i++)
#define D(i,a,b) for (int i=(a... | #include <bits/stdc++.h>
using namespace std;
int N, M;
vector<vector<int>> G;
vector<int> indeg; // 入次数
vector<bool> visited;
vector<int> ans; // トポロジカルソートの結果
void bfs(int s) {
queue<int> q;
q.push(s);
visited.at(s) = true;
while (!q.empty()) {
int cur = q.front();
q.pop();
for (int nx : G.at(c... | 0 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,n,m) for(int i=n;i<m;i++)
#define elif else if
#de... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll a;
cin>>a;
ll b;
cin>>b;
ll c=-100;
ll d=100;
ll e,f;
cin>>e>>f;
for(ll i=0; i<a;i++){
ll g;
cin>>g;
c=max(g,c);
}
for(ll i=0;i<b;i++){
ll h;
cin>>h;
d=min(h,d);
}
if(c+1>d){
cout<<"War... | 1 |
#include<iostream>
using namespace std;
int main(void) {
string N; cin >> N;
bool is7 = false;
for (int i = 0; i < N.size(); i++) {
if (N[i] == '7') {
is7 = true;
}
}
if (is7) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include<stdio.h>
int main(){
int n;
scanf("%d", &n);
int ratusan = 0, puluhan = 0, satuan= 0;
ratusan = n / 100;
puluhan = (n / 10) - (ratusan * 10); //misal n = 271, 271 - 2
satuan = n % 10;
if(ratusan == 7 || puluhan == 7 || satuan == 7){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | 1 |
#include <bits/stdc++.h>
#define enter putchar('\n')
#define space putchar(' ')
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
vector<pii> E[500005];
set<pii> s;
int n, m, ncnt, d[500005], id[500005][2];
struct EDGE {
int l, r, c;
} e[20000... | #include <bits/stdc++.h>
using namespace std;
int n, m;
int sol[100001];
vector <pair <int, int> > v[100001];
unordered_map <int, int> used[100001];
queue <int> q;
void dfs(int nod, int cul, int val){
if(nod == n){
printf("%d", sol[n]);
exit(0);
}
for(auto it : v[nod]){
if(it.se... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
main()
{
ll n,m,a=0,b=0,temp=0,prev,ans,i;
scanf("%lld %lld",&n,&m);
ll len[n],wid[m];
for(i=0;i<n;i++)
{
scanf("%lld",&len[i]);
}
sort(len,len+n);
for(i=0;i<m;i++)
{
scanf("%lld... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll,ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
#define M 1000000007
#define al... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
struct problem {
ll l, r;
problem() = default;
problem(ll a, ll b) { l = a, r = b; }
};
int N;
problem pr[100000 + 100];
ll a[100000 + 10] = {}, b[100000 + 10] = {};
int main() {
cin >> N;
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int>c(N, -1);
int s, t;
int ans = 0;
bool b = true;
for (int i = 0; i < M; i++) {
cin >> s;
if (c[s - 1] == -1){
cin >> c[s - 1];
}else{
cin >> t;
... | 0 |
#include <bits/stdc++.h>
typedef long long LL;
//container util
//------------------------------------------
#define PB push_back
#define MP make_pair
#define DECIM(digits) cout<<fixed<<setprecision(digits)
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())
//repetition
//--------------------... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string str, order, p;
int q, n1, n2;
cin >> str >> q;
for (int i = 0;i < q;i++) {
cin >> order >> n1 >> n2;
if (order == "print")
cout << str.substr(n1, n2-n1+1) << endl;
else if (order == "reverse") {
reverse(... | 0 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
struct point{int x;int y;};
int i,j,k,count1=0,count2=0;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(c>min(a,b)&&c<max(a,b))cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
int n, h, w;
int main() {
scanf("%d %d %d", &n, &h, &w);
printf("%d\n", (n - h + 1) * (n - w + 1));
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define pi 3.14159265359
#define all(i) i.begin(),i.end()
using namespace std;
const long long INF=1e9+7;
const string alp="abcdefghijklmnopqrstuvwxyz"; //26
const string ALP="ABCDEFG... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int M = N;
int i = 0;
int sum = 0;
while (M >= 1) {
sum += (M - (M / 10) * 10);
M = M / 10;
}
if (N % sum == 0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | 0 |
#include<iostream>
#include<math.h>
using namespace std;
int isPrime(int n){
if(n<2)return 0;
double sqrtn= sqrt(n);
for(int i=2;i<=sqrtn;i++){
if(n%i==0)return 0;
}
return 1;
}
int main(void){
int n=1;
while(n){
cin>>n;
for(int i=n;i>0;i--){
if(isPrime(i)... | #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... | 0 |
#include "bits/stdc++.h"
using namespace std;
void Main() {
long long N;
cin >> N;
map<long long, set<pair<long long, long long> > > tree;
for (long long i = 0; i < N - 1; ++i) {
long long a, b, c;
cin >> a >> b >> c;
if (tree.count(a) == 0) {
tree.insert(make_pair(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1LL << 60;
ll N, Q;
vector<tuple<ll, ll, ll>> v;
set<P> st;
int main() {
cin >> N >> Q;
v.resize(N);
rep(i, N) {
... | 0 |
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T, typename ...Ts>
vector<T> fusion(vector<T> bs,Ts... ts){
auto append=[&... | #include <stdio.h>
#include <algorithm>
using namespace std;
int main(){
int n,max_num = -1000001,min_num = 1000001,tmp;
long long int sum = 0;
scanf("%d",&n);
for(int i = 0; i < n; i++){
scanf("%d",&tmp);
sum += tmp;
max_num = max(max_num,tmp);
min_num = min(min_num,... | 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 <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
const double PI ... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
temp... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<l... | 0 |
#include <iostream>
#include <vector>
#include <queue>
#include <utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int V,E,r;
const int Inf = 10000*100000+100;
ll C[100010];
int main(){
while(cin >> V >> E >> r && V >0){
vector< vector< P > > v(V+10);
for(int i=0;i<E;i++){
ll s,t,d;
... | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef u... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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 all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000 //10^14
template <typename T>
bool chmax(T &a, const T& b) ... | #include<iostream>
#include<string>
using namespace std;
int conv(char str)
{
if(str=='I')
{
return 1;
}
else if(str=='V')
{
return 5;
}
else if(str=='X')
{
return 10;
}
else if(str=='L')
{
return 50;
}
else if(str=='C')
{
return 100;
}
else if(str=='D')
{
return 500;
}
else if(str=='M'... | 0 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
#define DEBUG 0
#if DEBUG
#define DLOG(...) fprintf(stderr, __VA_ARGS__)
#else
#define DLOG(...)
#endif
void debug(auto f) {
#if DEBUG
f();
#endif
}
ll mPrime = int(1e9) + 7;
ll bN, bX;
vector<ll> bS;
vector<ll> facts;
... | 1 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int n,m,i,p,cnt_p=0,cnt_a=0;
string s;
cin >> n >> m;
vector<int> pen(n);
vector<bool> done(n);
for(i=0;i<m;++i){
cin >> p >> s;
--p;
... | #include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
void solve() {
... | 1 |
#include<iostream>
#include<iomanip>
#include<cassert>
#include<stdexcept>
#include<utility>
#include<functional>
#include<numeric>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<array>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<complex>
#include<set>
#inc... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int Mod = 1e9 + 7;
int N, M, X, Y, Z, f[41][1 << 18];
int OK, ALL;
void pls(int &x, int y) { x += y; if (x >= Mod) x -= Mod; }
int main () {
cin >> N >> X >> Y >> Z; ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main()
{
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
int a, b,... | #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<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n, q;
string s;
cin >> n >> s >> q;
while (q--) {
int k;
cin >> k;
ll ans = 0, a = 0, b = 0, m = 0;
for (int i = 0; i < k; i++) {
if ... | #include <iostream>
#include <vector>
#include <algorithm>
class Baseball {
private:
int out;
int runner;
int score;
public:
//constructor
Baseball() {
out = 0;
runner = 0;
score = 0;
}
//getter
int getOut() { return out; }
int getRunner() { return runner; }
int getScore() { return score; }
//input... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string x; cin >> x;
int n = x.size();
vector<char> st;
REP(i, n) {
if (x[i] == 'S')
st.push_back('S');
else {
if (st.empty())
st.push_back('T');
else if (st.back() == 'S')
st.pop_back();
... | 1 |
#include <iostream>
#include <vector>
#include <queue>
#include <functional>
#include <string.h>
using namespace std;
static const int INF = 1e9;
static const int SIZE = 10001;
typedef pair<int, int> P;
struct edge
{
int to;
int cost;
};
bool isUsed[SIZE];
vector<edge> G[SIZE];
void solve()
{
int V, E;
cin >> V ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
class UnionFindDS{
private:
vector<int> p, h, sz; // parent, height (rank), size
int num;
public:
UnionFindDS(int N){
p.assign(N,0); for (int i=0; i<N; i++) p[i] = i;
h.assign(... | 1 |
#include<iostream>
#include<string>
#include<vector>
#include<numeric>
#include<math.h>
#include<algorithm>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
using namespace std;
int main() {
string S;
cin >> S;
string alp = "abcdefghijklmnopqrstuvwxyz";
if (S.length() < 26) {
for (int i = 0... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
const int MAXN = 3e5 + 10;
const int Mod = 1e9 + 7;
int N;
char S[MAXN];
int To[8][2] = {{3, 1}, {5, 2}, {2, 2}, {4, 7}, {3, 3}, {6, 1}, {5, 5}, {3, 1}};
ll f[MAXN][8];
int main() ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(int i = (n) - 1; i >= (e); i--)
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e3 + 5;
char mp[MAXN][MAXN];
int main() {
int a, b;
cin >> a >> b;
for (int i = 1; i <= 50; i++) {
for (int j = 1; j < 100; j++, j++) {
mp[i][j] = '.';
if (b > 1) {
mp[i][j... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using graph = vector<vector<int>>;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
int main() {
int n;
string s,t;
cin>>n>>s>>t;
string ans=s+t;
for(int i=n; i>=1; i--){
string s_=s.substr(n-i, i);
string t_=t.substr(0,i);
... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
int solve(string s, string t, int n){
// sの文字のうち, かぶっていない文字の数をiとする
// 全探索する
for (int i = 0; i < n; i++){
if (s.substr(i) == t.substr(0,n-i)) return n + i;
}
// n文字すべてかぶらない-> 2*n
return 2*n;
}
int main(){
int n;... | 1 |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for... | 1 |
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
template<class T>bool chmax(T &a, const T &b) { return (a<=... | //#define USE_CPP11
// #define USE_PRINTF
#include <iostream>
#include <iomanip>
#include <map>
#include <set>
#include <utility>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <list>
#include <queue>
#includ... | 1 |
#include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include<vector>
#include<iomanip>
#include<map>
#include <queue>
#include<cmath>
#include<cstdio>
#include<iomanip>
#include<set>
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define REP(i,n)... | #include <bits/stdc++.h>
#define sz(arr) (int)arr.size()
#define all(arr) arr.begin(), arr.end()
using namespace std;
void _cin() {}
template <class Head, class... Tail>
void _cin(Head&& head, Tail&&... tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
#define Cin(T, ...) \
T __VA_ARGS__; \
_cin(__VA_A... | 1 |
#include<iostream>
using namespace std;
int F[102][102];
void
DFS (int Y, int X, int A)
{
if (F[Y][X] != A)
return;
F[Y][X] = 7;
DFS (Y - 1, X, A);
DFS (Y, X + 1, A);
DFS (Y + 1, X, A);
DFS (Y, X - 1, A);
}
int
main ()
{
int w, h;
int xs, ys;
int xg, yg;
int n;
int c, d, x, y;
while (t... | #include<iostream>
#include<cstdio>
#include<vector>
#define INF 999999999
#define ll long long
using namespace std;
const int MAX_N = 100000;
const int MAX_M = 500000;
struct edge
{
int from; //?????????
int to; //??°??????
int cost; //??????
};
int d[MAX_N];
edge es[MAX_M];
bool flag; //??... | 0 |
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{... | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define All(X) X.begin(),X.end()
int main(){
int n;
cin >> n;
ll int tmp;
ll int sum,min,max;
max = -1000010;
... | 0 |
#include <iostream>
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
using namespace std;
int nextInt() { int d; cin >> d; return d; }
string nextString() { string str; cin >> str; return str; }
int main() {
while(true) {
int N = nextInt();
int Q = nextInt();
if (N + Q == 0) break;... | #include <iostream>
#include <map>
#include <algorithm>
using namespace std;
int main(){
int n, q;
while(cin >> n >> q, n != 0 && q != 0){
map<int,int> c;
for(int i=0; i<n; ++i){
int m;
cin >> m;
for(int j=0; j<m; ++j){
int tmp;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 40;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) {x = max(x, y); }
template <typename T> void chkmin(T &x, T y) {x = min(x, y); }
template <typename T> void read(T &x) {
x = 0; i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=55,mod=1e9+7,inf=2000000000;
int n,a[N];
char s[N];
unordered_map<ll,int>vis[20][20];
int main()
{
scanf("%d",&n);
scanf("%s",s+1);
int up=1<<n;
for(int i=0;i<up;i++)
{
ll sum1=0,sum2=0,a=__builtin_popcount(i),b=n... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long fact[3000005];
long long powmod(long long a, long long b){
long long x = 1;
long long y = a;
while(b){
if(b&1){ x = (x*y)%MOD; }
y = (y*y)%MOD;
b >>= 1;
}
return x;
}
inline long long... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) begin(x), end(x)
using namespace std;
typedef long long ll;
typedef pair <int,int> P;
const int MOD=998244353;
const int MAX=200005;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
fin... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
const int inf = 1000000000; //10^9
const ll inff = 1000000000000000000; //10^18
int main(){
string s;
ci... | #include<stdio.h>
int main()
{
int day,month,year;
scanf("%d/%d/%d",&year,&month,&day);
printf("%d/%.2d/%.2d",year+1,month,day);
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i... | #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
ce... | 1 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#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>;
int main() {
int n;
cin >> n;
vector<int> a(n);
... | #include<iostream>
#include<vector>
using namespace std;
int num_2(int a) {
int ret=0;
while (a % 2 == 0) {
ret++;
a /= 2;
}
return ret;
}
int even(vector<vector<int>> a) {
int ret = a.at(1).at(0);
for (int i = 0; i < a.at(0).size(); i++) {
if (ret > a.at(1).at(i))ret = a.at(1).at(i);
}
return ret;
}
int... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=2003,INF=10000;
int main(){
int N;cin>>N;
vector<pair<double,double>> S(N);
for(int i=0;i<N;i++){
cin>>S[i].first>>S[i].second;
}
for(int i=0;i<N;... | #include<bits/stdc++.h>
#define mems(a,x) memset(a,x,sizeof(a))
#define first fi
#define second se
using namespace std;
typedef long long ll;
const int mod=1e9+7,N=105;
const double eps=1e-8,pi=3.1415926535898;
ll inv(ll x){return x==1?x:(mod-mod/x)*inv(mod%x)%mod;}
ll inv(ll x,ll mod){return x==1?x:(mod-mod/x)*inv(mod... | 1 |
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
int main() {
vector<int> v;
int m, nmin, nmax, gap = -1, gapnum;
for (;;) {
cin >> m >> nmin >> nmax;
if (m == 0 && nmin == 0 && nmax == 0) break;
v.resize(m);
for (int i = 0; i < m; i++) cin >> v[i];
for (int i = nmin-1; i < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A);
vector<int> b(B);
for(int i = 0; i < A; i++) {
cin >> a.at(i);
}
for(int i = 0; i < B; i++) {
cin >> b.at(i);
}
int ans = 200000;
for(int i = 0; i < M; i++) {
int x, y, c;
ci... | 0 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll l,r;
scanf(" %lld %lld",&l,&r);
vector<int> modulos(2019,0);
for(int i = l, j = 0; i <= r && j <= 10000;++i,++j)
++modulos[i%(2019ll)];
int ans = 10000;
for(int i = 0; i < modulos.size();++i){
for(i... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b;
cin>>a>>b;
int mn = 2019;
if(b-a+1>=2019) cout<<0;
else{
for(int i=a; i<=b; i++){
for(int j=i+1; j<=b; j++){
mn = min(mn,( (i%2019)*(j%2019) )%2019);
}
}
cout<<mn;
}
} | 1 |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#define int long long
#define mod(int)(1000000007)
using namespace std;
int par[213456];//親
int de... | #include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for(int i=0;i<(n);++i)
#define per(i, n) for(int i=(n)-1;i>=0;--i)
#define repa(i, n) for(int i=1;i<(n);++i)
#define foreach(i, n) for(auto &i:(n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#defi... | 1 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n, q;
while(true){
cin >> n >> q;
if(n == 0)
break;
int m;
vector< vector<int> > sch(n, vector<int>(101, 0));
for(int i=0; i<n; i++){
cin >> m;
for(int j=0; j<m; j++){
int temp;
cin >> ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
int main() {
int n,q;
while( cin >> n >> q, n|q) {
map<int,int> mp;
int maxi = -1;
for(int i=0;i<n;++i) {
int m;
cin >> m;
for(int j=0;j<m;++j) {
int data;
cin >> data ;
++mp[data];
maxi = ... | 1 |
//https://atcoder.jp/contests/abc178/tasks/abc178_f
#include <bits/stdc++.h>
using namespace std;
const int MAXN=2e5+4;
long long a[MAXN];
long long b[MAXN];
int main() {
int n;
cin>>n;
for (int i=0; i<n; i++) {
cin>>a[i];
}
for (int i=0; i<n; i++) {
cin>>b[i];
}
reverse(... | #include <bits/stdc++.h>
using namespace std;
#define int long long // <-----!!!!!!!!!!!!!!!!!!!
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(int)(n); i++)
int main(){
int H, W, ans=1; cin >> H >> W; string A[H];
REP(i, H){ cin >> A[i]; }
int B[H][W]={}; vector< pair<int, int> > C;
REP(i, H){ REP(j, W){
if(A[i][j]=='#'){ B[i][j]=1; C.push_back(make_pair(i, j)); }
} }
REP(i, ... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
using namespace std;
void print_vec(vector<vector<int> > a, int H, int W){
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
cout << a.at(i).at(j);
}
cout << endl;
}
}
int find_max(vector<vector<int> > a,int H, int W... | 1 |
#include <iostream>
const int NUM = 10000;
const int INF = 1 << 20;
using namespace std;
int main() {
long long i, a[NUM];
long long max = -INF, min = INF, sum = 0;
cin >> i;
i = 0;
while (cin >> a[i]) {
if (max < a[i]) max = a[i];
if (min > a[i]) min = a[i];
sum += a[i++];... | #include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<numeric>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
vector<long>ar(n);
for(auto&e:ar){
scanf("%ld",&e);
}
long long sum1=0;
for(... | 1 |
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
int main()
{
string times;
int x=0;
int n;
vector <int> number;
getline(cin,times);
stringstream s(times);
while(s>>n)
number.push_back(n);
x=(60*(number[2]-number[0])+(number[3]-number[1]))-number[4];
cout<<x<<end... | //Now you are making me a boy with luvv...
//I don't want to do this but I'm being forced to ....pls help!!
#include <bits/stdc++.h>
using namespace std;
#define loop(x,n) for(int x = 0; x < n; ++x)
#define ed end()
#define bg begin()
# define ld long double
#define ll long long
#define ub(v,a) upper_bound(all(v),a)
... | 1 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int
main ()
{
string str;
cin >> str;
int n;
cin >> n;
for (int i = 0; i < n; i++){
string a = "";
int b = 0;
int c = 0;
string d = "";
cin >> a;
cin>>b>> c;
if (a == "r... | #include<iostream>
#include<string>
using namespace std;
int main() {
string str, cmd;
int a, b, q;
cin >> str >> q;
for (int i = 0; i < q; i++) {
cin >> cmd >> a >> b;
if (cmd == "print") {
for (int j = a; j <= b; j++)
cout << str[j]; cout << endl;
}
else if (cmd == "reverse") {
int fend = (b... | 1 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#define ll long long int... | #include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX
using Weight = long long;
using Weights = vector<Weight>;
using Matrix = vector<Weights>;
bool WF(const Matrix &g, Matrix &dist, vector<vector<int>> &prev) {
int V = g.size();
dist = g;
prev.assign(V, vector<int>(V, -1));
for (int k = 0; k < V; ++... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void){
ll n, x, cnt = 0;
cin >> n >> x;
vector<ll> a(n);
for (int i=0; i<n; i++) cin >> a[i];
sort(a.begin(), a.end());
for (int i=0; i<n; i++){
if ((i<n-1 && a[i]<=x) || (i==n-1 && a[i]==x)){
x -= ... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(){
int N;
long long x;
cin >> N >> x;
vector<long long> cost(N);
long long sum = 0;
for(int i=0; i<N; i++){
cin >> cost[i];
sum += cost[i];
}
if(sum == x){
cout << N << endl;
retur... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
int n, m, i, j;
while(cin >> n >> m) {
int vote[n] = {};
int cost[n] = {};
int req;
for(i = 0; i < n; i++) {
cin >> cost[i];
}
for(i = 0; i < m; i++) {
cin >> req;
for(j = 0; j ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <lim... | 1 |
#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 LL long long
#define OFFSET 200000
vector< vector<int> > pl_d(400001);
vector< vector<int> > pl_r(400001);
vector< vector<int> > pl_u(400001);
vector<... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 500010;
const int INF = 1000000010;
int n, m;
int cntNode;
int dist[MAXN];
vector<int> adj[MAXN];
vector<int> weight[MAXN];
deque<int> d;
map<int,int> indNode[MAXN];
void BFS01(int s)
{
for(int i = 1 ; i <= cntNode ; i++)
dist[i] = INF;
dist[s]... | 0 |
#include <bits/stdc++.h>
// #include <atcoder/all>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin()... | #include<bits/stdc++.h>
using namespace std;
#define fo(i,a,n) for(i=a;i<n;i++)
#define ll long long
#define ld long double
#define deb(x) cout << #x << "=" << x << endl
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
... | 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 dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
const ll INF=1e18;
int main() {
double n,x,t;
cin >> n >> x >> t;
x = ceil(n/x);
cout << int(x * t) << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
void Fast()
{
std::ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cerr.tie(0);
}
inline int D()
{
int t;
scanf("%d",&t);
return t;
}
inline ll llD()
{
ll t;
scanf("%lld",&t);
return t;
}
... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.