博客
关于我
磕代码:c/c++/java:输入年龄,输出活了多少秒
阅读量:86 次
发布时间:2019-02-26

本文共 1562 字,大约阅读时间需要 5 分钟。

C??????????????

??????????????????????????C???C++?Java?????????????????????????????

C????

?C??????long int????????long int????????????2^32-1????4GB???????C??????????

#include 
int main() { long int age; scanf("%ld", &age); long int b = 31560000; printf("%ld", age * b); // %ld????????????????????? // ????age??????????? // ?age????????????}

???

  • long int????int??????????????
  • %ld?????????long int??????%d?????2^31-1?2^63-1????

C++????

?C++????long long????????long long????2^63-1??long int??????C++????????

#include 
#include
using namespace std;int main() { long long age; cin >> age; cout << age * 31560000L; // ??`long long`??????????? // ??????????}

???

  • long long?C++??long int????????????????
  • 31560000L??????????????????????

Java????

?Java????long????????long????2^63-1??C++?long long??????Java????????

import java.io.*;public class Main {    public static void main(String[] args) throws IOException {        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));        String ageStr = br.readLine();        long age = Long.parseLong(ageStr);        System.out.println(age * 31560000L);        // ??`long`????????        // ??????????    }}

???

  • Java?long??????????????????
  • Long.parseLong()???????????long?????????????????

?????

???????????????????????????

  • C???long int???????????????????%ld????
  • C++?long long???????????????????
  • Java?long??????????????????????

??????????????????????????C++?Java?????????????C??????????????????????????

???????????????????????????????????

转载地址:http://fyrk.baihongyu.com/

你可能感兴趣的文章
POJ 1961 Period
查看>>
POJ 2019 Cornfields (二维RMQ)
查看>>
poj 2057 The Lost House 贪心思想在动态规划上的应用
查看>>
poj 2057 树形DP,数学期望
查看>>
poj 2112 最优挤奶方案
查看>>
Qt编写自定义控件12-进度仪表盘
查看>>
SpringBoot主启动原理在SpringApplication类《第六课》
查看>>
poj 2186 Popular Cows :求能被有多少点是能被所有点到达的点 tarjan O(E)
查看>>
POJ 2186:Popular Cows Tarjan模板题
查看>>
POJ 2229 Sumsets(递推,找规律)
查看>>
poj 2236
查看>>
POJ 2243 Knight Moves
查看>>
POJ 2262 Goldbach's Conjecture
查看>>
POJ 2362 Square DFS
查看>>
Qt笔记——解决添加Qt Designer Form Class时“allocation of incomplete type Ui::”
查看>>
poj 2386 Lake Counting(BFS解法)
查看>>
poj 2387 最短路模板题
查看>>
POJ 2391 多源多汇拆点最大流 +flody+二分答案
查看>>
POJ 2403
查看>>
poj 2406 还是KMP的简单应用
查看>>