結果

問題 No.1445 新入生プログラミング鯖
ユーザー Shibuyap
提出日時 2021-03-31 18:28:59
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 1,813 bytes
コンパイル時間 1,869 ms
コンパイル使用メモリ 191,528 KB
最終ジャッジ日時 2025-01-20 02:11:59
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 10
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005
int main() {
int n;
cin >> n;
if(n >= 1){
cout << "Hello! You're new here, right? It's nice to meet you." << endl;
}
if(n >= 2){
cout << "Hello! You're new here, right? It's nice to meet you." << endl;
}
if(n >= 3){
cout << "Hello! You're new here, right? It's nice to meet you." << endl;
}
if(n >= 4){
cout << "Hello! You're new here, right? It's nice to meet you." << endl;
}
if(n >= 5){
cout << "Hello! You're new here, right? It's nice to meet you." << endl;
}
if(n >= 6){
cout << "Hello! You're new here, right? It's nice to meet you." << endl;
}
if(n >= 7){
cout << "Hello! You're new here, right? It's nice to meet you." << endl;
}
if(n >= 8){
cout << "Hello! You're new here, right? It's nice to meet you." << endl;
}
if(n >= 9){
cout << "Hello! You're new here, right? It's nice to meet you." << endl;
}
if(n >= 10){
cout << "Hello! You're new here, right? It's nice to meet you." << endl;
}
if(n >= 11){
cout << "Hello! You're new here, right? It's nice to meet you." << endl;
}
if(n >= 12){
cout << "Hello! You're new here, right? It's nice to meet you." << endl;
}
if(n >= 13){
cout << "Hello! You're new here, right? It's nice to meet you." << endl;
}
if(n >= 14){
cout << "Hello! You're new here, right? It's nice to meet you." << endl;
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0