結果
| 問題 | No.280 歯車の問題(1) |
| コンテスト | |
| ユーザー |
buko106
|
| 提出日時 | 2015-10-10 10:53:20 |
| 言語 | C++11(廃止可能性あり) (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
AC
|
| 実行時間 | 1 ms / 1,000 ms |
| コード長 | 1,387 bytes |
| 記録 | |
| コンパイル時間 | 599 ms |
| コンパイル使用メモリ | 77,088 KB |
| 実行使用メモリ | 5,376 KB |
| 最終ジャッジ日時 | 2024-07-20 04:57:43 |
| 合計ジャッジ時間 | 2,836 ms |
|
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| other | AC * 31 |
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:55:12: warning: format ‘%ld’ expects argument of type ‘long int*’, but argument 2 has type ‘LL*’ {aka ‘long long int*’} [-Wformat=]
55 | scanf("%ld",&z1);
| ~~^ ~~~
| | |
| | LL* {aka long long int*}
| long int*
| %lld
main.cpp:56:22: warning: format ‘%ld’ expects argument of type ‘long int*’, but argument 2 has type ‘LL*’ {aka ‘long long int*’} [-Wformat=]
56 | rep(i,n-1)scanf("%ld",&zN);
| ~~^ ~~~
| | |
| | LL* {aka long long int*}
| long int*
| %lld
main.cpp:57:12: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘LL’ {aka ‘long long int’} [-Wformat=]
57 | printf("%d/%d\n",zN,z1);
| ~^ ~~
| | |
| int LL {aka long long int}
| %lld
main.cpp:57:15: warning: format ‘%d’ expects argument of type ‘int’, but argument 3 has type ‘LL’ {aka ‘long long int’} [-Wformat=]
57 | printf("%d/%d\n",zN,z1);
| ~^ ~~
| | |
| int LL {aka long long int}
| %lld
main.cpp:25:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
25 | #define readi(a) int a;scanf("%d",&a)
| ~~~~~^~~~~~~~~
main.cpp:54:3: note: in expansion of macro ‘readi’
54 | readi(n);
| ^~~~~
main.cpp:55:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
55 | scanf("%ld",&z1);
| ~~~~~^~~~~~~~~~~
main.cpp:56:18: warning: ignoring return value of ‘
ソースコード
#include<cstdio>
#include<cstring>
#include<cctype>
#include<cmath>
#include<climits>
#include<algorithm>
#include<vector>
#include<valarray>
#include<string>
#include<set>
#include<map>
#include<stack>
#include<queue>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define DREP(i,n) for(int i=n;i>0;i--)
#define Rep(i,m,n) for(int i=m;i<n;i++)
#define scani(a) scanf("%d",&a)
#define scand(a) scanf("%lf",&a)
#define scans(s) scanf("%s",s)
#define readi(a) int a;scanf("%d",&a)
#define printi(a) printf("%d",a)
#define prints(s) printf("%s",s)
#define even(n) (((n)+1)%2)
#define odd(n) ((n)%2)
#define sg(x) ((x)?1:0)
#define LF printf("\n")
#define SPACE printf(" ")
#define pb push_back
#define mp make_pair
#define bs binary_search
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
typedef long long LL;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef pair<double,double> pdd;
typedef pair<int,int> pii;
const double pi=acos(-1.0);
double rad(double t){return t*pi/180.0;}
double deg(double d){return d*180.0/pi;}
int GCD(int x,int y){if(x<y)swap(x,y);return x%y?GCD(y,x%y):y;}
int LCM(int x,int y){return x/GCD(x,y)*y;}
int main(){
LL z1,zN;
readi(n);
scanf("%ld",&z1);
rep(i,n-1)scanf("%ld",&zN);
printf("%d/%d\n",zN,z1);
return 0;
}
buko106