首页 > 其他分享 >AC200 FI/CO Financial Document Clearing

AC200 FI/CO Financial Document Clearing

时间:2022-10-30 17:33:26浏览次数:39  
标签:Financial AC200 process Clearing How FI CO Document

1: How to Post with Clearing

How to clearing during incoming payment

 

 

 输入过滤条件,点击process open items

 

 

 Select all -> activate item

 

 

 Double click EUR , simulate->post

 

 

 

 

 

 2: How to Display the Posting Keys for Clearing Open Items

 

 

 

 

 

 3: How to Clear an Account

3.1 clear

 

 

 输入account, 点击process open item

 

 

 选择要clear的document,选中 EUR gross,然后激活。可以激活多条

 

 

 最后document->simulate-> post

 

 

 3.2   Prepare automatic clearing

 

 

 4: practice: Clear an Account

4.1 FB70 创建invoice

标签:Financial,AC200,process,Clearing,How,FI,CO,Document
From: https://www.cnblogs.com/liyafei/p/16841752.html

相关文章

  • 003-DockerCompose部署积累
    运行MySQLversion:'3'services:mysql:container_name:mysqlrestart:alwaysimage:mysql:5.7ports:-"3306:3306"volumes:......
  • 674.longest-continuous-increasing-subsequence 最长连续递增序列
    问题描述674.最长连续递增序列解题思路dp[i]表示以nums[i-1]结尾的最长连续递增子序列长度;递推关系为:if(nums[i-1]>nums[i-2])dp[i]=dp[i-1]+1......
  • 解决command not found: tsc 或者nrm等手动更改npm默认路径
    情景sudonpmi-gtypescript或者sudonpmi-gnrm执行tsc-v或者nrmls会出现以下报错:commandnotfound:tsc或者commandnotfound:nrm其实就是npm默认路径......
  • [Typescript] 80. Medium - Construct Tuple
    Constructatuplewithagivenlength.Forexampletyperesult=ConstructTuple<2>//expecttobe[unknown,unkonwn] /*_____________YourCodeHere______......
  • LeeCode 317周赛复盘
    T1:可被3整数的偶数的平均值思路:数组遍历被3整数的偶数\(\Leftrightarrow\)被6整数的数publicintaverageValue(int[]nums){intsum=0;intcount=0;......
  • CDH重启换了Namenode节点后,提示Encountered exception loading fsimage
    报错代码如下:Encounteredexceptionloadingfsimagejava.io.IOException:NameNodeisnotformatted.atorg.apache.hadoop.hdfs.server.namenode.FSImage.recoverTra......
  • leetcode-989-easy
    AddtoArray-FormofIntegerThearray-formofanintegernumisanarrayrepresentingitsdigitsinlefttorightorder.Forexample,fornum=1321,thearr......
  • continue 练习
    importjava.util.Scanner;publicclassEext{ publicstaticvoidmain(String[]args){ladel1:for(intj=0;j<2;j++){ ladel2:......
  • leetcode 第90场双周赛
    6226.摧毁一系列目标题意:对于数组中每一个数nums[i],可以摧毁数组中值等于nums[i]+c*space的数(c为非负整数),求摧毁最大数量时的最小nums[i]思路:如果两个数x,y可以同时被摧......
  • Codeforces Round #828 (Div. 3)
    题目链接CodeforcesRound#828(Div.3)DivisibleNumbers(hardversion)题目描述给出四个整数\(a,b,c,d\),请你构造一对整数\((x,y)\),满足:\(a<x\leqc......