#156953 (Java21) No.491 10^9+1と回文

提出ソース

結果

問題	No.491 10^9+1と回文
ユーザー	threepipes_s
提出日時	2017-03-10 23:42:12
言語	Java21 (openjdk 21)
結果	AC
実行時間	292 ms / 1,000 ms
コード長	7,283 bytes
コンパイル時間	3,454 ms
コンパイル使用メモリ	96,396 KB
実行使用メモリ	60,832 KB
最終ジャッジ日時	2024-04-08 16:01:38
合計ジャッジ時間	14,530 ms
ジャッジサーバーID （参考情報）	judge14 / judge13

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	55 ms 54,112 KB
testcase_01	AC	55 ms 54,120 KB
testcase_02	AC	54 ms 54,120 KB
testcase_03	AC	161 ms 59,036 KB
testcase_04	AC	116 ms 58,332 KB
testcase_05	AC	114 ms 58,644 KB
testcase_06	AC	235 ms 60,424 KB
testcase_07	AC	80 ms 55,020 KB
testcase_08	AC	55 ms 54,124 KB
testcase_09	AC	54 ms 54,132 KB
testcase_10	AC	55 ms 54,124 KB
testcase_11	AC	55 ms 54,116 KB
testcase_12	AC	79 ms 54,788 KB
testcase_13	AC	55 ms 54,132 KB
testcase_14	AC	110 ms 58,452 KB
testcase_15	AC	60 ms 54,132 KB
testcase_16	AC	55 ms 54,144 KB
testcase_17	AC	54 ms 54,144 KB
testcase_18	AC	55 ms 54,136 KB
testcase_19	AC	81 ms 55,208 KB
testcase_20	AC	68 ms 54,240 KB
testcase_21	AC	67 ms 54,392 KB
testcase_22	AC	55 ms 54,120 KB
testcase_23	AC	97 ms 58,176 KB
testcase_24	AC	56 ms 54,124 KB
testcase_25	AC	56 ms 54,132 KB
testcase_26	AC	54 ms 54,164 KB
testcase_27	AC	55 ms 54,128 KB
testcase_28	AC	56 ms 54,248 KB
testcase_29	AC	56 ms 54,112 KB
testcase_30	AC	82 ms 55,140 KB
testcase_31	AC	56 ms 54,260 KB
testcase_32	AC	66 ms 54,508 KB
testcase_33	AC	55 ms 54,132 KB
testcase_34	AC	77 ms 54,404 KB
testcase_35	AC	79 ms 54,640 KB
testcase_36	AC	57 ms 54,136 KB
testcase_37	AC	55 ms 54,132 KB
testcase_38	AC	57 ms 54,112 KB
testcase_39	AC	59 ms 54,104 KB
testcase_40	AC	55 ms 54,124 KB
testcase_41	AC	66 ms 54,376 KB
testcase_42	AC	55 ms 54,112 KB
testcase_43	AC	57 ms 54,112 KB
testcase_44	AC	56 ms 54,108 KB
testcase_45	AC	55 ms 54,088 KB
testcase_46	AC	67 ms 54,368 KB
testcase_47	AC	55 ms 54,116 KB
testcase_48	AC	56 ms 54,136 KB
testcase_49	AC	54 ms 54,128 KB
testcase_50	AC	65 ms 54,228 KB
testcase_51	AC	80 ms 54,744 KB
testcase_52	AC	55 ms 54,120 KB
testcase_53	AC	54 ms 54,088 KB
testcase_54	AC	55 ms 54,108 KB
testcase_55	AC	54 ms 54,096 KB
testcase_56	AC	54 ms 54,124 KB
testcase_57	AC	73 ms 54,248 KB
testcase_58	AC	97 ms 58,076 KB
testcase_59	AC	59 ms 52,156 KB
testcase_60	AC	55 ms 54,120 KB
testcase_61	AC	56 ms 54,120 KB
testcase_62	AC	82 ms 54,876 KB
testcase_63	AC	85 ms 57,292 KB
testcase_64	AC	58 ms 54,120 KB
testcase_65	AC	58 ms 54,120 KB
testcase_66	AC	55 ms 54,132 KB
testcase_67	AC	233 ms 60,384 KB
testcase_68	AC	58 ms 54,116 KB
testcase_69	AC	55 ms 54,112 KB
testcase_70	AC	55 ms 54,080 KB
testcase_71	AC	68 ms 54,284 KB
testcase_72	AC	65 ms 54,380 KB
testcase_73	AC	81 ms 55,160 KB
testcase_74	AC	57 ms 54,124 KB
testcase_75	AC	54 ms 54,092 KB
testcase_76	AC	55 ms 54,120 KB
testcase_77	AC	55 ms 54,132 KB
testcase_78	AC	78 ms 54,508 KB
testcase_79	AC	82 ms 55,096 KB
testcase_80	AC	57 ms 54,124 KB
testcase_81	AC	56 ms 54,116 KB
testcase_82	AC	57 ms 54,128 KB
testcase_83	AC	80 ms 54,632 KB
testcase_84	AC	58 ms 54,108 KB
testcase_85	AC	71 ms 54,896 KB
testcase_86	AC	55 ms 54,112 KB
testcase_87	AC	57 ms 54,120 KB
testcase_88	AC	54 ms 54,116 KB
testcase_89	AC	63 ms 54,272 KB
testcase_90	AC	81 ms 55,112 KB
testcase_91	AC	82 ms 54,740 KB
testcase_92	AC	55 ms 54,092 KB
testcase_93	AC	79 ms 54,768 KB
testcase_94	AC	78 ms 54,648 KB
testcase_95	AC	55 ms 54,136 KB
testcase_96	AC	58 ms 54,124 KB
testcase_97	AC	137 ms 59,024 KB
testcase_98	AC	239 ms 60,432 KB
testcase_99	AC	210 ms 60,560 KB
testcase_100	AC	231 ms 60,580 KB
testcase_101	AC	216 ms 60,320 KB
testcase_102	AC	214 ms 60,408 KB
testcase_103	AC	242 ms 60,420 KB
testcase_104	AC	292 ms 60,832 KB
testcase_105	AC	230 ms 60,452 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Random;
import java.util.TreeMap;
 
public class Main {
	static ContestScanner in;static Writer out;static StringBuilder sb=new StringBuilder();
	public static void main(String[] args)
	{try{in=new ContestScanner();out=new Writer();Main solve=new Main();solve.solve();
	in.close();out.flush();out.close();}catch(IOException e){e.printStackTrace();}}
	static void dump(int[]a){sb.setLength(0);for(int i=0;i<a.length;i++)
	sb.append(a[i]).append("\t");out.println(sb.toString().trim());}
	static void dump(int[]a,int n){for(int i=0;i<a.length;i++)out.printf("%"+n+"d ",a[i]);out.println();}
	static void dump(long[]a){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();}
	static long pow(long a,int n){long r=1;while(n>0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;}
	static String itob(int a,int l){return String.format("%"+l+"s",Integer.toBinaryString(a)).replace(' ','0');}
	static void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);}
	static void sort(int[]a,int l){m_sort(a,0,l,new int[l]);}
	static void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);}
	static void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);}
	static void m_sort(int[]a,int s,int sz,int[]b)
	{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
	m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int x=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
	while(l<le&&r<re){if(a[l]>a[r])b[x++]=a[r++];else b[x++]=a[l++];}
	while(r<re)b[x++]=a[r++];while(l<le)b[x++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];
	} /* qsort(3.5s)<<msort(9.5s)<<<shuffle+qsort(17s)<Arrays.sort(Integer)(20s) */
	static void sort(long[]a){m_sort(a,0,a.length,new long[a.length]);}
	static void sort(long[]a,int l){m_sort(a,0,l,new long[l]);}
	static void sort(long[]a,int l,long[]buf){m_sort(a,0,l,buf);}
	static void sort(long[]a,int s,int l,long[]buf){m_sort(a,s,l,buf);}
	static void m_sort(long[]a,int s,int sz,long[]b)
	{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
	m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int x=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
	while(l<le&&r<re){if(a[l]>a[r])b[x++]=a[r++];else b[x++]=a[l++];}
	while(r<re)b[x++]=a[r++];while(l<le)b[x++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];}
	static void swap(long[]a,int i,int j){final long t=a[i];a[i]=a[j];a[j]=t;}
	static void swap(int[]a,int i,int j){final int t=a[i];a[i]=a[j];a[j]=t;}
	static int binarySearchSmallerMax(int[]a,int v)// get maximum index which a[idx]<=v
	{int l=-1,r=a.length-1,s=0;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
	static int binarySearchSmallerMax(int[]a,int v,int l,int r)
	{int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
	List<Integer>[]randomTree(int n,Random r){List<Integer>[]g=graph(n);
	for(int i=1;i<n;i++){int p=r.nextInt(i);g[p].add(i);g[i].add(p);}return g;}
	@SuppressWarnings("unchecked")
	static List<Integer>[]graph(int n){List<Integer>[]g=new List[n];
	for(int i=0;i<n;i++)g[i]=new ArrayList<>();return g;}
	void solve() throws NumberFormatException, IOException{
		long n = in.nextLong();
		if(n<1000000001){
			System.out.println(0);
			return;
		}
		long num = n/1000000001;
		int len = Long.toString(num).length();
		long sub = num;
		for(int i=0; i<(len-1)/2-1; i++){
			sub /= 10;
		}
		int cnt = 0;
		for(int i=1; i<=sub; i++){
			if(toRoll(i, true)<=n) cnt++; 
			if(toRoll(i, false)<=n) cnt++; 
		}
		System.out.println(cnt);
	}
	
	long toRoll(long a, boolean odd){
		String s = Long.toString(a);
		final int len = s.length();
		for(int i=len-1-(odd?1:0); i>=0; i--){
			a *= 10;
			a += s.charAt(i)-'0';
		}
		if(a>1000000000) return Long.MAX_VALUE;
		long ans =  a*1000000001;
		return ans;
	}
}

@SuppressWarnings("serial")
class MultiSet<T> extends HashMap<T, Integer>{
	@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
	public MultiSet<T> merge(MultiSet<T> set)
	{MultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
	for(Entry<T,Integer>e:s.entrySet())l.add(e.getKey(),e.getValue());return l;}
}
@SuppressWarnings("serial")
class OrderedMultiSet<T> extends TreeMap<T, Integer>{
	@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
	public OrderedMultiSet<T> merge(OrderedMultiSet<T> set)
	{OrderedMultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
	while(!s.isEmpty()){l.add(s.firstEntry().getKey(),s.pollFirstEntry().getValue());}return l;}
}
class Pair implements Comparable<Pair>{
	int a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;}
	public boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;}
	public int hashCode(){return hash;}
	public int compareTo(Pair o){if(a!=o.a)return a<o.a?-1:1;else if(b!=o.b)return b<o.b?-1:1;return 0;}
	@Override
	public String toString() {
		return String.format("(%d, %d)", a, b);
	}
}
class Timer{
	long time;public void set(){time=System.currentTimeMillis();}
	public long stop(){return time=System.currentTimeMillis()-time;}
	public void print(){System.out.println("Time: "+(System.currentTimeMillis()-time)+"ms");}
	@Override public String toString(){return"Time: "+time+"ms";}
}
class Writer extends PrintWriter{
	public Writer(String filename)throws IOException
	{super(new BufferedWriter(new FileWriter(filename)));}
	public Writer()throws IOException{super(System.out);}
}
class ContestScanner implements Closeable{
	private BufferedReader in;private int c=-2;
	public ContestScanner()throws IOException 
	{in=new BufferedReader(new InputStreamReader(System.in));}
	public ContestScanner(String filename)throws IOException
	{in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
	public String nextToken()throws IOException {
		StringBuilder sb=new StringBuilder();
		while((c=in.read())!=-1&&Character.isWhitespace(c));
		while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	public String readLine()throws IOException{
		StringBuilder sb=new StringBuilder();if(c==-2)c=in.read();
		while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	public long nextLong()throws IOException,NumberFormatException
	{return Long.parseLong(nextToken());}
	public int nextInt()throws NumberFormatException,IOException
	{return(int)nextLong();}
	public double nextDouble()throws NumberFormatException,IOException 
	{return Double.parseDouble(nextToken());}
	public void close() throws IOException {in.close();}
}

yukicoder

結果

テストケース

ソースコード