提出 #45365159
ソースコード 拡げる
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <memory.h>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <ctime>
#include <iostream>
#include <functional>
#include <complex>
#include <stdlib.h>
#include <random>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#pragma comment(linker, "/STACK:836777216")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<pii, int> p3i;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<p3i> v3i;
typedef vector<vii> vvii;
typedef vector<p3i> vp3i;
typedef long double ld;
typedef vector<ld> vld;
#define pb push_back
#define mp make_pair
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define REPD(i, n) for (int (i) = (n) - 1; (i) >= 0; (i)--)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define FORD(i,a, b) for (int (i) = (a); (i) >= (b); (i)--)
#define sz(v) (int)(v).size()
#define all(v) (v).begin(), (v).end()
#define rv(v) reverse(all(v))
#define CL(v, val) memset((v), (val), sizeof((v)))
#define SORT(a) sort(all(a))
#define un(v) SORT(v), (v).resize(unique(all(v)) - (v).begin())
#define eps 1.0e-4
#define X first
#define Y second
#define bit(n) (1 << (n))
#define bit64(n) (ll(1) << (n))
#define sqr(x) ((x) * (x))
int main(void) {
string ans = "";
int n;
scanf("%d", &n);
REP(i, n + 1) {
bool ok = 0;
FOR(j, 1, 10) {
if (n % j == 0) {
if (i % (n / j) == 0) {
ok = 1;
ans += (char)(j + '0');
break;
}
}
}
if (!ok) {
ans += "-";
}
}
printf("%s\n", ans.c_str());
}
提出情報
| 提出日時 |
|
| 問題 |
B - Measure |
| ユーザ |
spiker |
| 言語 |
C++ 20 (gcc 12.2) |
| 得点 |
200 |
| コード長 |
1744 Byte |
| 結果 |
AC |
| 実行時間 |
1 ms |
| メモリ |
3728 KiB |
コンパイルエラー
Main.cpp:20: warning: ignoring ‘#pragma comment ’ [-Wunknown-pragmas]
20 | #pragma comment(linker, "/STACK:836777216")
|
Main.cpp: In function ‘int main()’:
Main.cpp:38:28: warning: unnecessary parentheses in declaration of ‘i’ [-Wparentheses]
38 | #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
| ^~~
Main.cpp:60:9: note: in expansion of macro ‘REP’
60 | REP(i, n + 1) {
| ^~~
Main.cpp:38:28: note: remove parentheses
38 | #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
| ^~~
Main.cpp:60:9: note: in expansion of macro ‘REP’
60 | REP(i, n + 1) {
| ^~~
Main.cpp:40:31: warning: unnecessary parentheses in declaration of ‘j’ [-Wparentheses]
40 | #define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
| ^~~
Main.cpp:62:17: note: in expansion of macro ‘FOR’
62 | FOR(j, 1, 10) {
| ^~~
Main.cpp:40:31: note: remove parentheses
40 | #define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
| ^~~
Main.cpp:62:17: note: in expansion of macro ‘FOR’
62 | FOR(j, 1, 10) {
| ^~~
Main.cpp:59:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
59 | scanf("%d", &n);
| ~~~~~^~~~~~~~~~
ジャッジ結果
| セット名 |
Sample |
All |
| 得点 / 配点 |
0 / 0 |
200 / 200 |
| 結果 |
|
|
| セット名 |
テストケース |
| Sample |
example0.txt, example1.txt, example2.txt |
| All |
000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, example0.txt, example1.txt, example2.txt |
| ケース名 |
結果 |
実行時間 |
メモリ |
| 000.txt |
AC |
1 ms |
3704 KiB |
| 001.txt |
AC |
1 ms |
3648 KiB |
| 002.txt |
AC |
1 ms |
3684 KiB |
| 003.txt |
AC |
1 ms |
3724 KiB |
| 004.txt |
AC |
1 ms |
3524 KiB |
| 005.txt |
AC |
1 ms |
3644 KiB |
| 006.txt |
AC |
1 ms |
3596 KiB |
| 007.txt |
AC |
1 ms |
3532 KiB |
| 008.txt |
AC |
1 ms |
3700 KiB |
| 009.txt |
AC |
1 ms |
3532 KiB |
| 010.txt |
AC |
1 ms |
3700 KiB |
| 011.txt |
AC |
1 ms |
3728 KiB |
| 012.txt |
AC |
1 ms |
3580 KiB |
| 013.txt |
AC |
1 ms |
3660 KiB |
| 014.txt |
AC |
1 ms |
3720 KiB |
| 015.txt |
AC |
1 ms |
3688 KiB |
| 016.txt |
AC |
1 ms |
3600 KiB |
| 017.txt |
AC |
1 ms |
3688 KiB |
| example0.txt |
AC |
1 ms |
3728 KiB |
| example1.txt |
AC |
1 ms |
3684 KiB |
| example2.txt |
AC |
1 ms |
3716 KiB |