zoukankan      html  css  js  c++  java
  • CodeForces

    C. Divide by Three

    time limit per test: 1 second
    memory limit per test: 256 megabytes
    input: standard input
    output: standard output

    A positive integer number n is written on a blackboard. It consists of not more than 105 digits. You have to transform it into a beautiful number by erasing some of the digits, and you want to erase as few digits as possible.

    The number is called beautiful if it consists of at least one digit, doesn't have leading zeroes and is a multiple of 3. For example, 0, 99, 10110 are beautiful numbers, and 00, 03, 122 are not.

    Write a program which for the given n will find a beautiful number such that n can be transformed into this number by erasing as few digits as possible. You can erase an arbitraty set of digits. For example, they don't have to go one after another in the number n.

    If it's impossible to obtain a beautiful number, print -1. If there are multiple answers, print any of them.

    Input

    The first line of input contains n — a positive integer number without leading zeroes (1 ≤ n < 10100000).

    Output

    Print one number — any beautiful number obtained by erasing as few as possible digits. If there is no answer, print  - 1.

    Examples

    input
    1033
    output
    33
    input
    10
    output
    0
    input
    11
    output
    -1

    Note

    In the first example it is enough to erase only the first digit to obtain a multiple of 3. But if we erase the first digit, then we obtain a number with a leading zero. So the minimum number of digits to be erased is two.

    思路:咕咕咕。
    代码:

    #include<bits/stdc++.h>
    using namespace std;
    
    char num[100010];
    int dp[100010][3],f[100010][3];
    
    void dfs(int x,int temp){
    	if (x==0){
    		return;
    	}
    	else{
    		if (f[x][temp]==3){
    			dfs(x-1,temp);
    		}
    		else{
    			dfs(x-1,f[x][temp]);
    			printf("%c",num[x]);
    		}
    	}
    }
    
    int main(){
    	scanf("%s",num+1);
    	int ll=strlen(num+1);
    	
    	for (int i=0; i<=ll; i++)
    		for (int j=0; j<3; j++)
    			dp[i][j]=1e6;
    	dp[0][0]=0;
    	
    	int find0=0;
    	for (int i=1; i<=ll; i++){
    		int t=num[i]-'0';
    		if (t==0) find0=1;
    		
    		for (int j=0; j<3; j++){
    			if ( dp[i-1][j]+1 < dp[i][j] ){
    				dp[i][j]=dp[i-1][j]+1;
    				f[i][j]=3;
    			}
    			
    			if (dp[i-1][j]!=i-1 || t!=0)
    			if ( dp[i-1][j] < dp[i][(j+t)%3] ){
    				dp[i][(j+t)%3]=dp[i-1][j];
    				f[i][(j+t)%3]=j;
    			}
    		}	
    	}
    	
    	if (dp[ll][0]==ll) 
    		if (find0) printf("0");
    		else
    			printf("-1");
    	else
    		dfs(ll,0);
    	
    	return 0;
    }
    
  • 相关阅读:
    JS基本语法---while循环---练习
    JS基本语法---while循环
    JS基础语法---分支语句总结
    Python开发坦克大战
    基于Python的face_recognition库实现人脸识别
    10个Python 初学者必知编码小技巧
    论如何用python发qq消息轰炸虐狗好友
    Python + Selenium +Chrome 批量下载网页代码修改【新手必学】
    Python爬取mc皮肤【爬虫项目】
    Python 分发包中添加额外文件【新手必学】
  • 原文地址:https://www.cnblogs.com/fzulinxin/p/10415858.html
Copyright © 2011-2022 走看看